Course Description

• Summary of Content: Introduction to data structures and algorithms. Topics may include ADTs, restricted lists (stacks and queues), generalized lists, trees, searching, sorting, hashing, graphs, algorithm design, complexity analysis, recursion. Prerequisites: CPS 209, CPS 393.
• Teaching Method: 3 hr lecture; 1 hr lab.
• Educational Objectives: enable students to learn some of the fundamental ideas in algorithm analysis and design, to know and understand the basic mathematical properties of algorithms, to be able to apply standard formal techniques to algorithms and data structures, to implement algorithms, to evaluate available algorithms and data structures, and select those that are fit for purpose within a given application domain.
• Text Book: 
  • Data Structures & Program Design in C, by Kruse, Tondo and Leung, ISBN: 0-13-288366-X, 671 pp, Second Edition, publisher: Prentice Hall, 1997 ($123). Please bring your text to class. You will need it when you do the work that counts as your participation. (Note: you will be participating in groups of 3-5, so if you already know who you want to work with, you will only need 1 text among you.)
• Refs and recommended books:
  • UNIX Shell Programming, 4th Edition, by Lowell Jay Arthur and Ted Burns, ISBN: 0-471-16894-7, paperback, 528 pages, 1997, publisher: Wiley
  • Data Structures: A Pseudocode Approach with C, by Richard Gilberg and Behrouz Forouzan, Second Edition, ISBN: 0-534-39080-3, 2005, 672 pages, publisher: Course Technology (a division of Thomson Learning, Inc).
  • C Programming: A Modern Approach by K. N. King, ISBN 0-393-96945-2, 661 pages, 1996 (a new edition will be published in 2006), publisher: W.W. Norton & Company.
  • Data Structures, Algorithms, and Software Principles in C, by Thomas Standish, ISBN: 0-201-59118-9, 1995, 748 pp, publisher: Addison-Wesley.
• Synopsis of Academic Focus and Scope: The course will present both a theoretical and practical treatment of introductory-level data structures and associated algorithms as treated in the course text, using the C programming language and the Unix/Linux Operating System.
• Learning Outcomes: The student will be able to identify, create, implement, employ, manipulate, and reason about the data structures and algorithms studied, within the context of the procedural paradigm, and specifically, the C language and Unix/Linux Operating System. The student will be able to solve the problems from the text, from class and labs, and other similar problems, and those that build upon the former.

Course Policies

• Examinations: The quizzes, midterm test, and the final exam may include problem solving, short essay questions, yes/no questions, as well as programming questions. The duration of these examinations will be 15 min, 1h30min, and 2 hours, respectively. To pass this course you must get a grade of 40% or better on your final exam. Course material covered on tests and final are cumulative, i.e., final may include material from midterm. There will be no supplemental examination. Brief quizzes may be given without notice (marks will contribute to class participation). Students must submit their quizzes by the end of class.


• Assignments should be submitted on or before the deadline specified in the assignment (you are encouraged to submit assignments earlier). Late submissions of assignments are not accepted. Students may be asked to work in groups for assignments, labs, class participation work.
• Lab Marks: are given for participation and for submission of specific lab questions, as specified by T.A. The lab mark will be given only if
  1. the student attends the entire lab, and
  2. the T.A. observed the student actively working on the lab (and if finished, on questions from text), and
  3. the T.A. has recorded the student's attendance, and
  4. the student was present when attendance was taken, which may be at any point during the lab.
  5. The lab mark will be given primarily for effort, and less for solution correctness.
• Class Participation: during any class, students may be asked to work on various problems, and the student solutions will be collected by the instructor. A mark for this class participation will be given to a student only if (1) s/he attends the entire class for which the participation occurs, and (2) the instructor observed the student actively participating, and (3) the student signs the participation sheet. The participation mark will be given primarily for effort, and less for solution correctness.
• Handouts and assignments will be made available on the Web only. You are responsible for visiting the course Web pages periodically and reading assignments and tests related information that is provided or linked from these Web pages. Before sending your questions by e-mail to the instructor, check these Web pages whether similar questions have been already answered. Grades for tests and assignments will be posted on the Grades Web page no later than two weeks after the due date (test date).

Tentative Course Calendar (all changes of dates will be announced)

Course Work	Due Date	Grade Value (%)
Assignment  1	October 4, Tuesday	10
Midterm	Friday October 14, 4-6pm	25
Assignment 2	November 29, Tuesday	10
Lab participation	In assigned lab time	10
Class participation & quizzes	In assigned class time	5
Final Exam	Exam period	40
		100