What is new?
Final exam is on May 13, 2013 from 8:00 - 10:30am.
Project # 3 is assigned and due on May 7, in the lab
Project # 2 is assigned and due on April 9, in the lab.
Project # 1 is assigned and due on Feb 26, in the lab.
Course Description:
In this course, algorithm complexity analysis, algorithm design technique (greedy methods, divide and conquer, dynamic programming) and efficient algorithms for various problems will be introduced. Advanced data structure such as Hash Table, Binary Search Tree and B-tree will be discussed. The notion of NP-completeness and NP-complete problems will also be covered.
References:
Introduction to Algorithms 3rd edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein by MIT Press
Data Structure and Algorithms with OO Design Patterns in C++ by Bruno R. Preiss
Data Abstraction and Problem Solving with C++ Walls and Mirrors by Frank M. Carrano
Grading:
Two midterms (25%) and Final (25%)
Quizzes (10%)
Projects (30%)
Labs (10%)
Your final letter grade will be based on the standard formula (0 <= F < 60, 60 <= D < 70, 70 <= C< 80, 80 <= B < 90, 90 <= A <= 100) AND THE FOLLOWING IMPORTANT RULES:
- You need to have a total grade above 90% and an above 90% average in projects to get an A in the course;
- You need to have a total grade above 80% and an above 80% average in projects to get an B in the course;
- You need to have a total grade above 70% and an above 70% average in projects to get an C in the course;
Cell phone policy:
ABSOLUTELY NO CELL PHONE USAGE ALLOWED IN CLASSROOM.
Lecture attendance policy:
Attendance is an extremely important part of this course. Poor attendance will be penalized by up to 5% of your final grade.
Make-up policy:
Make-up exams for lecture are only allowed in extreme circumstances and should be approved by the instructor prior to the actual exam date. This policy is not negotiable.
Late work policy:
Late work for both lecture and lab will be penalized 50%. Work handed in more than 5 days late will not be accepted and will be given a score of 0 points. This policy is not negotiable.
Last updated on Wednesday, 24 April 2013 10:07:25 AM by Xiaohong (Sophie) Wang