Student Corner:
[Submit Sec5]
[Submit Sec6]

[
Lecture Notes]
[Discussion Board]

Course Info:
[Topics/Outcomes]
[Outcomes Matrix]
[Class Protocols]
[HW/Quiz Info]
[Exam Info]
[Honesty]
[Announcements]

HW Assignments:
[Hw1]  [Hw2]  [Hw3]
[Hw4]  [Hw5]  [Quizzes]

Practice Exams:
[Midterm]  [Final]

```
```

Data Structures and Algorithms

 Instructor: Chris Pollett Office: MH 214 Phone Number: (408) 924 5145 Email: chris@pollett.org Office Hours: MW 5-6pm Class Meets: Sec5 MW 6:00pm-7:15pm in MH225 Sec6 MW 7:30pm-8:45pm in MH225

Prerequisites

To take this class you must have taken: Math 30 , Math 42 , and CS49J , and CS46B with a grade of C- or better.

 Required Texts: Introduction to Algorithms, 3rd Ed.. by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein Online References and Other Links: Java 7 SDK Download. Java SE 7 Class API Documentation.

Topics and Outcomes

Implementations of advanced tree structures, priority queues, heaps, directed and undirected graphs. Advanced searching and sorting techniques (radix sort, heapsort, mergesort, and quicksort). Design and analysis of data structures and algorithms. Divide-and-conquer, greedy, and dynamic programming algorithm design techniques. By the end of this course, a student should be able to: (1) Implement lists, stacks, queues, search trees, heaps, union-find ADT, and graphs and use these data structures in programs they design. (2) Prove basic properties of trees and graphs. (3) Perform breadth-first search and depth-first search on directed as well as undirected graphs. (4) Use advanced sorting techniques (radix sort, heapsort, mergesort, quicksort). (5) Determine the running time of an algorithm in terms of asymptotic notation. (6) Solve recurrence relations representing the running time of an algorithm designed using a divide-and-conquer strategy. (7) Comprehend the basic concept of NP-completeness and realize that they may not be able to efficiently solve all problems they encounter in their careers. (8) Comprehend algorithms designed using greedy, divide-and-conquer, and dynamic programming techniques.

Below is a tentative time table for when we'll do things this quarter:

 HWs and Quizzes 50% Midterm 20% Final 30% Total 100%

Grades will be calculated in the following manner: The person or persons with the highest aggregate score will receive an A+. A score of 55 will be the cut-off for a C-. The region between this high and low score will be divided into eight equal-sized regions. From the top region to the low region, a score falling within a region receives the grade: A, A-, B+, B, B-, C+, C, C-. If the boundary between an A and an A- is 85, then the score 85 counts as an A-. Scores below 55 but above 50 receive the grade D. Those below 50 receive the grade F.

If you do better than an A- in this class and want me to write you a letter of recommendation, I will generally be willing provided you ask me within two years of taking my course. Be advised that I write better letters if I know you to some degree.

Course Requirements, Homework and Quiz Info

This semester we will have five homeworks and weekly quizzes. Every Monday this semester, except the first day of class, the Midterm Review Day, and holidays, there will be a quiz on the previous week's material. The answer to the quiz will either be multiple choice, true-false, or a simple numeric answer that does not require a calculator. Each quiz is worth a maximum of 1pt with no partial credit being given. Out of the total of twelve quizzes this semester, I will keep your ten best scores.

Links to the current list of homeworks and quizzes can be found on the left hand frame of the class homepage. After an assignment has been returned, a link to its solution (based on the best student solutions) will be placed off the assignment page. Material from assignments may appear on midterms and finals. The homeworks you turn in for this class should be your own individual work. You may discuss problems at a high level with your class mates, but you should not share code or use code from the web as your own.

Homeworks for this class will be submitted and returned completely electronically. To submit an assignment click on the submit homework link for your section on the left hand side of the homepage and filling out the on-line form. Hardcopies or e-mail versions of your assignments will be rejected and not receive credit. Homeworks will always be due by the start of class on the day their due. Late homeworks will not be accepted and missed quizzes cannot be made up; however, your lowest score amongst the five homeworks and your quiz total will be dropped.

When doing the programming part of an assignment please make sure to adhere to the specification given as closely as possible. Names of files should be as given, etc. Failure to follow the specification may result in your homework not being graded and you receiving a zero for your work.

Exams

The midterm will be during class time on: Mar 19.

The final will be: Monday, May 19 from 5:15pm-7:30pm (Sec5), 7:45-10:00pm (Sec6).

All exams are closed book, closed notes and in this classroom. You will be allowed only the test and your pen or pencil on your desk during these exams. The final will cover material from the whole semester although there will be an emphasis on material after the last midterm. No make ups will be given. The final exam may be scaled to replace a midterm grade if it was missed under provably legitimate circumstances. These exams will test whether or not you have mastered the material both presented in class or assigned as homework during the quarter. My exams usually consist of a series of essay style questions. I try to avoid making tricky problems. The week before each exam I will give out a list of problems representative of the level of difficulty of problems the student will be expected to answer on the exam. Any disputes concerning grades on exams should be directed to me, Professor Pollett.