Home Lectures Assignments Links Announcements
Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. Time and space complexity of algorithms are covered, including Big-O, Theta and Omega notations.
The tentative examination schedule is as follows:
• Midterm exam: Thursday, October 22, 2009 (in class)
• Final exam*: Monday, December 21, 2009, 11:30am - 2:30pm,
Dion 101
*: See Final exam schedule at http://www.umassd.edu/calendar/finals/welcome.cfm
Your numerical scores will be based upon the following contributions:
• 05% Class attendance
• 35% Assignments and quizzes
• 25% Midterm exam
• 35% Final exam
The letter grades will be assigned using the following approximate scale: (A+,A,A-)[100-90], (B+, B, B-)[90-80], (C+,C,C-)[80-70], (D+,D,D-)[70-60], and F[60-0]. Academic dishonesty will be "rewarded" with a grade of "F". "Sharing" of solutions to homework problems is strictly prohibited.
Due to the nature of the course and the frequency of assignments, attendance
is mandatory. You are responsible for all announcements and for all
material presented in the lecture sessions. Come prepared for class
and read the assigned material in advance of lectures. After the lecture, re-read
the material.
There are 5 homework assignments. Each homework set may contain questions
that require written answers, and program assignments using Java language.
Each assignment will have a deadline (date and hour). Late assignments will
not be considered unless explictly specified in class.
There will be no make-up quizzes, midterms and final exam. If you have a conflict
with the midterms or final exam, contact the instructor in advance, so that
your situation can be evaluated and a solution can be found. Of course, only
serious conflicts will be considered.
Any requests for regrading your assignments or exams must be submitted in writing, along with the exam and/or assignment within one week from the day it was returned. Your request must detail what you think was incorrect about the grading and must be submitted during regular office hours or immediately after a class.
You are encouraged to discuss assigned problems with other people, but you must individually design and write your own solutions/code for all assignments, unless group work is explicitly allowed. If you do work on the assigned problems with anybody, you must list the names of the people you discussed it with on the report you turn in. If you look at any web sites to help you with the assignments, you must list the URLs of each page you looked at.
Using work or ideas without citation is plagiarism. The penalty
for plagiarism will range from an "F" in the course to expulsion from
the university.