CS 251: Data Structures
Fall 1997
This course covers the specification, representation,
and manipulation of basic data structures:
linked lists, arrays, stacks, queues, trees, strings,
optimal search trees, priority queues, heaps, and
hash tables, symbol tables, Huffman codes. Fundamental concepts for the
analysis of algorithms are introduced.
Storage allocation, garbage collection, compaction, and
reference counts are covered as time allows.
Instructor
Professor S. E. Hambrusch
216 Computer Science Building
494-1831; seh@cs.purdue.edu
Office Hours: Tuesday, Wednesday, 2:00-3:30
Class Times
-
Division 1: Tuesday, Thursday, 10:30-11:45, UNIV 003
-
Division 2: Tuesday, Thursday, 12:00-1:15, UNIV 003
Teaching Assistants
-
Rachel Brahnmath
G72 Computer Science Building
494-7815, hesterrl@cs.purdue.edu
Office Hours: Wednesday 10:20-11:20, Thursday 10:30-11:30
-
Sowmya Krishnaswamy
407 Math Building
494-5007; krishnas@cs.purdue.edu
Office Hours: Tuesday 3:30-4:30, Friday 1:00-2:00
-
Lei Liu
G072 Computer Science Building
494-7810; lliu@cs.purdue.edu
P/S/O Times
- Division 1: Monday, 9:30-11:20, ENAD 138; TA: R. Brahnmath
- Division 2: Monday, 11:30-1:20, ENAD 138; TA: S. Krishnaswamy
- Division 3: Monday, 1:30-3:20, ENAD 138; TA: S. Krishnaswamy
- Division 4: Monday, 3:30-5:20, ENAD 138; TA: R. Brahnmath
Undergraduate P/S/O Assistant
- Dmitri Weiss, weissd@cs.purdue.edu
Text (required)
-
Data Structures, Algorithms, and Software Principles in C,
Thomas A. Standish,
Addison-Wesley, 1995.
The course focuses in chapters 6-12. Chapter 1-5 serve primarily
as review chapters.
Supplementary Texts
-
Data Structures and Algorithms, A. Aho, J. Hopcroft, and J. Ullman,
Addison-Wesley, 1983.
Used as the 251 text in previous years. Contains a good treatment
of data structures. Students often find parts hard to read and
dislike the use of Pascal.
-
R. Sedgewick, Algorithms 2nd edition/Algorithms in C/Algorithms in C++,
Addison Wesley, 1988/1990/1992.
A data structure as well as algorithms text. Data structures are
well explained and motivated. Chapter 26 contains material on range
searching covered in class.
-
Practical Algorithms for Programmers, A. Binstock and J. Rex,
Addison-Wesley, 1995.
A useful reference book on data
structures and algorithms. Covers some topics (e.g., string operations)
in detail, while other topics are omitted
(e.g., graph searching and graph algorithms).
Course work
-
4-5 Homework sets: 20%
-
4-5 Programming projects: 20%
-
1 Midterm exam: 30% (Thursday, October 9, 8:30-9:30pm, MATH 175)
-
Final exam: 30%
Graded course work will be returned in your lab session.
Your work needs to show your name, your course section, and
your lab section.
Course policies
-
No late homework sets will be accepted.
-
On programming projects,
the grade will be reduced by 10% for one day late,
20% for two days late, and 30%
for three days late.
Programming projects that are more
than three days late will not be accepted.
-
For a regrade on a homework or project contact your TA
within 10 days from the date when the assignment was officially returned.
No regrading after this period.
A regrade means that the enire homework or project undergoes a regrade.
-
Cheating directly affects the reputation of the Department
and the University and lowers the morale
of other students. Cheating will not be tolerated.
Cases of cheating will be sent directly to the Dean of
Students Office. An automatic grade of F will be assigned
to any student caught cheating.
Presenting another person's work as your own constitutes cheating.
Everything you turn in must be your own doing.
The following activities are specifically forbidden
on all graded course work:
-
Theft or possession of another student's solution
or partial solution in any form
(electronic, handwritten, or printed).
-
Giving a solution or partial solution to another student,
even with the explicit
understanding that it will not be copied.
-
Working together to develop a single solution and
then turning in copies of that solution
(or modifications) under multiple names.
Susanne E Hambrusch
Last modified: Tue Nov 4 10:05:41 EST 1997