CSC 311 - Algorithms

Lectures:  MW 1:00 - 2:15, Computer Lab - 228 College Center.

Text:  The Design and Analysis of Algorithms by Anany Levitin, Addison Wesley.  Third Edition

Goals:  Algorithms is a natural successor to Data Structures, and as such, represents the core of what computer science is all about.  Algorithms are fundamental.  Every other area of computer science relates in some way to algorithms.  An algorithm is a step by step solution to a problem that can be implemented on a computer.  Computer architecture motivates parallel algorithms, networks motivate distributed algorithms.  Algorithms are used in computer graphics, database theory, AI, compilers, as well as software engineering of all kinds.  Theory of computation helps us determine which problems have and do not have efficient algorithms.  Sometimes a seemingly small change in the problem affects whether or not there is an efficient algorithm.  Surprisingly perhaps, some very important problems have no algorithms at all!

The goal in this class is to understand the fundamental significance of designing and analyzing algorithms in computer science.  We study the design of algorithms according to methodology and application.  Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms,  geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexity of an algorithm and the underlying data structures. NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms.

Exams:  There will 6 quizzes (25%), the lowest grade will be dropped, and one final examination (35%). The final will be Wednesday, May 10, 1:30 PM, in the lab.

Assignments:  Homework assignments are worth 40% of your grade.  You may do homework with a partner (max 2 people per group) , as long as you stick with that same partner the whole semester. When you are asked to write, design or describe an algorithm, you may use a computer language or pseudo-code, or a careful English description.  When you are asked to write a program or code, you must actually write the program using whatever tool you like.  Read our department's academic integrity guidelines before you hand in any programs.

Grading:  You can guarantee an A with 90% a B with 80%  etc.  I may curve these numbers in your favor, if I feel it is needed.

Special Dates: April 12 is Passover and I will not be in class. I will announce in class what will happen in place of lecture - most likely an in-class quiz.

Through the prerequisites for this course, you should already know the mathematical material in:

Appendices A and B, Chapter 2,  as well as the data structures in Chapter 1, Section 4.