# CSE101_template

## CSE 101 - Design and Analysis of Algorithms

## Summer 2013

### People

**Professor:** Ramamohan Paturi

**Room**: CSE 4246

**Email:** paturi@cs.ucsd.edu

**Teaching Assistant:** Stefan Schneider

**Email:** stschnei@cs.ucsd.edu

### Syllabus, evaluation, and hours

Evaluation

Class, discussion and office hours

### Weekly Activity

### Homework Assignments

For each homework, solve the listed problems. Consult the style guide for writing solutions. Each problem is worth 10 points.

Homework I , Due July 8, 2013, 8:00 AM, in class Solution

Homework II , Due July 15, 2013, 8:00 AM, in class Solution

Homework III , Due July 22, 2013, 8:00 AM, in class Solution

Homework IV , Due July 31, 2013, 8:00 AM, in class Solution

### Academic Honesy

Each student is expected to work by herself/himself to complete homeworks, quizzes and other exams. The authorized materials for this course include the course text book, lecture notes, solutions and other handouts provided by the instructor or TA, and textbooks and lecture notes from the prerequisite UCSD courses. Use of any other materials requires an explicit approval from the instructor. Here is the detailed policy on Integrity of Scholarship Agreement.

### Resources

Problems and solutions

Series, functions, and recurrence relations: Exercises and problems, sample solutions

Divide and conquer technique: Exercises and problems, sample solutions

Sorting and order statistics: Exercises and problems, sample solutions

Graph algorithm: Exercises and problems, sample solutions

Shortest paths: Exercises and problems, sample solutions

Greedy Algorithms: Exercises and problems, sample solutions

Dynamic Programming: Exercises and problems, sample solutions

Sample tests

Sample Quiz I

Sample mid-term questions

Additional sample mid-term questions

Final exam --- sample 1

Final exam --- sample 2

Notes

Correctness proof for Dijkstra's shortest-path algorithm