TR 3:30 PM
This course is designed to follow the usual course in Data Structures and Algorithms taken as an undergraduate. The course will emphasize computational complexity of algorithms found in Divide and Conquer, Dynamic Programming, Greedy, Backtracking and Branch and Bound algorithms.
There will be three exams and a final. The three exams will be 40 % and the final is 20 %. Projects, quizzes and homework will be 40 %. Depending on how many exercises are given the homework/Quizes may represent as much as 10% leaving 25 % for the projects.
This course is project intensive and expect up to 4 or 5 programs to be given during the course. Each project is to be turned in within an envelope with your name and project number printed on the outside. Include a printout of your source and associated output, if appropriate, together with a CD or Jump drive containing the programs .exe, .cpp and other necessary files such as data or necessary libraries. Make sure that your program runs off the media before turning it in.
Projects will be accepted late up to one week after the due date with a penalty of 10%. Homework will not be accepted late.
This course will cover a lot of material that you will have never seen. It is very important to attend every class. Attendance every day is therefore required! If you miss a day you must come by my office when you get back and ask for your makeup work.