CISC 220 Latest Info
CISC 220 Data Structures, Spring, 2004
Info links and log of course activity (in reverse chronological order)
Some useful links:
The Course example files.
The Syllabus
The Textbook's web page.
Slides for chapters 1-9.
The STL Documentation at SGI.
The STL Tutorial.
Hardware specs (strauss, mahler).
This page contains a brief summary of each class topic and the
associated reading and homework assignments.
This page morphs frequently, being updated at least weekly.
Reload page to avoid being shown a stale version from your browser cache.
Most recent items are at the top.
Last updated May 11.
Future:
Thu, May 27 Final exam 3:30PM-5:30PM in Gore 103
Next:
Tue, May 18
- Summary on associative containers
- searching and data lookup
- review for final
Past:
Thu, May 13
Reading: Chapter 16, Maps
- quiz return
- map implementation inherits from set
- operator[], find(), and erase() have new signature in map
Tue, May 11
Reading: Chapter 16, Maps
Homework 5 assignment is due May 20.
- maps
- multimaps
- using index notation in maps
Thu, May 6
Reading: Chapter 13, Trees
- Binary trees
- Complete binary trees
- Quiz on deques and sets
Tue, May 4
Reading: Chapter 12.4, Sets
- Yet another deque implementation strategy.
- Set interface, uses
- Set implementation
Thu, Apr 29
Reading: Chapter 11, Deques, and Chapter 12.4 Sets
- Template specialization to adapt singly linked list to stack or queue.
- Use of deque, stack, queue in search.
- breadth first, depth first, mix first
Tue, Apr 27
- singly and doubly linked lists, implementation issues and tradeoffs.
-
Quiz on stacks and queues (first of several, replacing second midterm exam)
Thu, Apr 22
Reading: Chapter 11, Deques
Homework 4 assignment is due May 6.
- homework discussion
- Deque implementation
Tue, Apr 20
Reading: Chapter 10, stacks
- queues and stacks as adaptors (note correction to text)
- stack uses
- stack implementations
Thu, Apr 15 Homework 3 due
- fast size() and semi-fast indexing operator, L[i].
- performance at a cost.
Tue, Apr 13
Reading: Chapter 10, queues
- reprise of list implementation with bounds checking
- Add an indexing operator, L[i]?
Thu, Apr 8
Reading: finish with Chapters 8, 9, vectors and lists.
- list and vector implementation.
- embedded classes (link and interators).
- discussion of operator[] and of hello world.
Tue, Apr 6
Reading: continue Chapter 9, lists.
Homework 3 assignment is due April 15 (as changed).
files.
Thu, Apr 1
Reading: continue Chapter 9, lists.
- Examples of list use.
- Nontrivial iterators and input iterators.
- List implementation. Alternatives: circular and singly linked lists.
Tue, Mar 30
Reading: Chapter 9, lists.
- Divide and conquer approximate string matching. See chromosome2.cc in
gene/modelsolution/.
- Linked structures and flexible size.
- list basic member functions.
Thu, Mar 18, Homework 2 is due by paper received this day and email dated this day.
[For homework 2, start by copying the gene directory
and find the key instructions in chromosome.cc.]
- Exam return. Answer key.
- generic sorting: merge sort and selection sort.
- vector implementation.
Tue, Mar 16 midterm 1
Thu, Mar 11
Reading: STL Introduction
Tue, Mar 9
Reading: chapter 8.
Thu, Mar 4, Homework 1b is due by email dated this day.
Reading: chapter 8.
- example: maxmin.cc
- vector's best, most useful functions
- string class as extension of vector
Tue, Mar 2,
Reading: chapter 7.
- String class member function implementation
ch07slide.ps,
ch07slide.pdf.
- such as resize(), remove()
- generic functions use iterators: search(), find()
Thu, Feb 26,
Reading: chapter 7, 8.
Homework 1a is due by email dated this day.
- Palindrome functions: a cleaner organization, use of , tolower().
- unix tar command: making one file out of many.
- Enums, chars, and ints
Tue, Feb 24,
Reading: chapter 7.
Thu, Feb 19,
Reading: chapters 6, 7
HW #1 assignment sheet, due dates are Feb 24 and Mar 1.
Tue, Feb 17,
Reading: chapter 2 again, Scan ch 3,4,5, just enough to know the kind
of info in those chapters. We will skip them now, but refer back as needed.
- Multiple file programs. Card game
files.
- Multiple file compilation with make
About_make.txt.
- Multiple file program using a template function: printprimes, isprime.h.
files.
Thu Feb 12,
Reading: chapter 2,
Budd chapter 2 slides:
ch02slide.ps,
ch02slide.pdf.
- Points about C++ programming from the card game example.
- Classes Card, Deck, Player.
- Deck depends on Card, Player depends on Deck and Card,
main() depends on all three.
Tue Feb 10, 3:30-4:45, in Gore 303,
Reading: chapter 1,
Budd chapter 1 slides:
ch01slide.ps,
ch01slide.pdf.
- course organization
- control structures and data structures: history and status,
- example: word counting and word frequency using map data structure.
Source code:
http://udel.edu/~saunders/220/words
saunders@cis.udel.edu