|
|
Course Announcements:
Important announcements relating to the course will be made here. Please
look at this area of the web page periodically. Announcements will include
(but are not limited to) release of assignments, erratas, and grades.
Please read this policy before starting as I intend on enforcing it
strictly.
Assignment 4 is available now. This is more involved than your
previous assignments -- please start right away.
And here are some sample midterms one
two, and
three.
Course Contents:
This course deals with design and implementation of basic techniques
for organizing data to facilitate a variety of operations. Using
asymptotic analysis, it quantifies the performance of these organizations.
Implementation, in the context of selected problems, is used to
ground these principles in actual applications. The major topics
covered in class include:
-
Software Development Principles
-
Abstract Data Types
-
Pointers and Dynamic Arrays
-
Linked Lists
-
Stacks
-
Queues
-
Recursion
-
Trees
-
Searching
-
Sorting
-
Graphs.
|