HOFSTRA CSC120 Algorithms and Data Structures
Dr. Gerda Kamberova
Phone: (516) 463-5775
E-mail: cscglk@husun3.hofstra.edu
Office hours: Tue 5-6
Lectures: TuTh, 2:20-3:45pm, 11 Adams Hall


Course Information



The objective of the course is the study of techniques for designing algorithms, of fundamental algorithms and data structures and their effective use, and of methods for analyzing and comparing algorithms. Design techniques include brute force and divide-and-conquer. Fundamental data structures include trees, heaps, hash tables, and graphs. Special algorithms include sorting on linear data structures, hashing for tables, breath-first and depth-first traversals of trees and graphs, shortest-path and minimum spanning three algorithms, topological sort,connected components for graphs, and closet pair of points for a set of points. We analyze algorithms through the worst-case and average-case asymptotic complexity.
The course consists of several components: lectures, assignments (labs and homeworks), quizzes, a midterm exam, and a final exam. A lab is a programming assignment for which part of the code will be provided for you. There is no laboratory class.
This is not a programming course. In class we will study the data structures and algorithms, in labs you will implement in C++ some of them. The textbook has programming examples. You are expected to work independently with the textbook and other references to farther develop and improve your programming skills. In class, we will focus on the design and analysis of the algorithms, and will use most of the time a pseudo-code to express these algorithms.

Required Text

Final Grade:

You are expected to do all work, no grades will be dropped! No late homeworks!
You might submit at most one lab late (at most a week late).
No makeups on quizzes and exams. Taking the midterm on an alternative date is to the discretion of the instructor, and only if arrangements had been made prior to the original exam date.
Any complaints regarding grading must be submitted within a week after the paper (exam, quiz, assignment, lab) has been returned. The programs will be graded 90% on correctness and 10% on style (general structure, documentation, comments, etc.)
Make sure your programs compile and run on the Suns in the school lab.

Be familiar with the Academic Honesty Code. For your information the policy for handling violations of the academic honesty is in the Hofstra Pride Guide student handbook. Cheating shall not be tolerated!

Hofstra University, Department of Computer Science
Last Update: 1/26/02