CS 218: Design and Analysis of Algorithms

News

Overview

Basic information

Lectures

Homework

Quizzes/Exams

General course features and policies

• Academic dishonesty: Cheating will be strongly punished (typically with an F in the course). You can report cheating anonymously at: https://www.cs.ucr.edu/cheating/. Assignment submissions must represent your original work. Copying from any sources (web, other books, past or current students, etc.) is strictly prohibited. While discussing assignments together is encouraged, pooling common answers is not allowed. Be aware that a subset of exams may be photocopied, for comparison with exams submitted for regrades. Also, be aware that lying to an instructor in order to be able to makeup a missed exam or in other ways to obtain a better grade can be treated as academic dishonesty.
• Regrade policy: Regrade requests must be submitted in writing and within two weeks of the distribution of the graded material. The entire homework/test/assignment may be regraded, not just the problem in question, so the grade may go up or down. Thus, think your regrade requests through carefully. Recording errors should also be pointed out to the instructor before the last class.
• Final grades: Per university policy, changes to your final grade will be made only in the event of a clerical error. Asking your instructor how far you were from a cutoff and what extra work you can do to improve the grade is not appropriate.
• Communicating with the instructors : When sending electronic mail to the instructors or graders, please include your full name, student ID number, and UCR email address, so that we may properly identify you (remember, many students have similar names). Also, please try to be polite and use reasonable grammar and formatting.
• Cell phones: During lectures please turn off your cell phone. During exams, cell phones must not be visible (e.g., store them inside a backpack).
• Written Assignments: All assignments and solutions will be posted on the class homepage. Write your full name with upper-case LAST name, assignment number, student ID, login. Write legibly: what cannot be read will not be graded. Consider typing the assignment if you handwriting is hard to read. Written assignments have to be submitted before the beginning of the class on the due date on the instructor's desk. No late assignment will be accepted. Any problem with grading of a written assignment should be addressed at the latest two weeks after the assignment is returned to you.

Course email list

Tutorials

• Tao's tutorial on Recurrence Relations
• David's tutorial on Longest Common Subsequence
• David's tutorial on Graphs, graph representation, and traversal
• David's tutorial on Minimum Spanning Trees
• David's tutorial on Shortest Path
• Theoretical Computer Science Cheat Sheet [PDF format]

Algorithm Animations

• Union-Find Animation
• Data Structure Animation
• Splay trees animation
• Graph Algorithms Animation (Dijkstra, Prim, Kruskal, Ford-Fulkerson)
• Animated Algorithms (sorting, priority queues, Huffman, Matrix chain multiplication, MST, Dijkstra)
• JAWAA (DFS,BFS)
• String matching algorithm animation
• Another string matching algorithm animation
• Brute Force string matching animation
• KMP string matching animation
• Suffix tree applet