CSE100 Algorithm Design and Analysis (Spring 2018)

All course materials can be found in catcourses.

Staff and office hours

Instructor: Sungjin Im

TAs: Ramin Raziperchikolaei: rraziperchikolaei@ucmerced.edu. Wei-Chih Hung: whung8@ucmerced.edu

Class time and location

Lectures: Tuesdays/Thursdays 4:30-5:45pm (COB2 130)

Lab class: Monday 1:30-4:20pm (section 02L), 7:30-10:20pm (section 03L), and Wed 10:30am-1:20pm (section 04L). Linux Lab, SE100

Course description

Introduction to the design and analysis of computer algorithms. Topics include analysis and implementation of algorithms, concepts of algorithm complexity, and various algorithmic design patterns. Course will also cover major algorithms and data structures for searching and sorting, graphs, and some optimization techniques.

Prerequisites: CSE 15 and CSE31; proficient level of programming skills in C or C++ and elementary data structures; basic math and probability knowledge.


Required textbook (get the errata):

The companion site for the book has additional materials (partial solutions, etc.).

Other books recommended as additional reading:

Syllabus and required textbook reading


Topics: Asymptotic notation. Divide-and-conquer. Recurrent equations and the master theorem. Space and time complexity. Loop invariants. Linear and binary search. Sorting algorithms: insertion sort, selection sort, mergesort, quicksort, heapsort. Sorting lower bounds. Heaps. Binary search trees. Hash tables with chaining and open addressing. Dynamic programming and greedy algorithms. Graphs: definition and relevant problems (path search, flow, minimum spanning trees).

The course will follow parts I, II, III, IV and VI of the textbook (skipping occasional topics).

Textbook reading (table of contents):

If there is time, we will also do one of the following chapters:

* Acknowledgements: The instructor thanks Prof. Carreira-Perpiñán for allowing me to borrow the course format including this webpage itself.