SYLLABUS

Schedule: TR 09:30 - 10:50AM, via zoom.

Instructor: Marek Chrobak, Bourns A 159C, email: marek. Office hours (via zoom): Monday 1-2PM, Monday 4-5PM.

Textbook: S. Dasgupta, C. Papadimitriou, U. Vazirani, "Algorithms", McGraw Hill 2008.

Prerequisites by topic:

• Mathematics: Asymptotic notation, basic summation formulas, sets (operations on sets, relations, functions), counting (permutations, sets, combinations, binomial coefficients), recurrence relations (linear and divide-and-conquer), basic probability (independence, random variable, expected value), basic number theory (primality, factorization, greatest common divisor, modular arithmetic), basic linear algebra (vectors, matrices, and operations on them, solving linear systems), complex numbers and arithmetic, basic graph theory (connectivity, trees, planarity).
• Data structures: linked list, queues, stacks, binary search trees, balanced binary search trees, hashing, priority queues (heaps).
• Algorithms: Sorting algorithms (selection, insertion, bubblesort, shellsort, quicksort, mergesort, heapsort, radix-sort, bucket-sort), lower bound for comparison sorting, graph searching (DFS, BFS), connected components, strongly connected components, transitive closure, topological sorting, shortest paths (single source and all-pairs), minimum spanning trees.

Topics:

• Data Structures:
  • Priority queues (heaps).
  • Dictionaries. Hashing, universal hashing. Amortized analysis and splay trees.
  • Union-Find.
• Algorithm Design Techniques:
  • Greedy algorithms.
  • Divide and conquer.
  • Dynamic programming.
• Combinatorial Optimization Algorithms:
  • Minimum spanning trees.
  • Maximum flow.
  • Matching.
• Other optional topics (if time suffices): approximation algorithms, linear programming, parallel algorithms.

Homeworks: Five homework assignments, due every second Thursday (except last homework), starting April 16. Homework assignments can be done individually or in pairs. Each assignment will have two versions (1-person and 2-person).

Homework papers need to be formatted with LaTeX. For your convenience, a LaTeX template for homework assignments will be available. You are allowed to do your own formatting, if you prefer so, as long as you follow the required guidelines. Homework assignments will be collected via gradescope.

Quizzes: Five quizzes, every second Tuesday, 25 minutes each. The first quiz on Tuesday, April 7, will cover the prerequisite topics. In general, quizzes will cover the material covered in class in the last two weeks and the assigned reading material. Sample quizzes will be provided.

Final exam: Tuesday, June 9, 8:00AM - 11AM (tentative). The final test is comprehensive. Sample final tests will be provided.

Grading: Quizzes 40%, Final 40%, Homeworks 20%. Course grades are expected to be determined as follows: 82-100% = A, 74-81% = B, 66-73% = C. Minor adjustments to these rules could be made by the end of the quarter.

Academic integrity: In CS218, the rules of academic integrity are strictly enforced. You are required to print, read, and sign the academic integrity statement, and turn it in no later than Tuesday, April 7. Your homework assignments will not be graded if you don't submit this form.

Piazza discussion group: We will use piazza for discussions related to the class material. All students are required to sign up. If you have any questions or information that may be of interest to other students, please post it there.

Class materials: All class materials (syllabuses for tests, lecture notes, sample problems, etc.) will be available in ilearn.

Access to zoom meetings: Links to class meetings over zoom will be distributed via ilearn. Students who do not have access to ilearn, for some reason, need to contact the instructor by email.

LECTURES (very tentative)