Next:

• Summary on associative containers
• searching and data lookup
• review for final

• quiz return
• map implementation inherits from set
• operator[], find(), and erase() have new signature in map

• maps
• multimaps
• using index notation in maps

• Binary trees
• Complete binary trees
• Quiz on deques and sets

• Yet another deque implementation strategy.
• Set interface, uses
• Set implementation

• Template specialization to adapt singly linked list to stack or queue.
• Use of deque, stack, queue in search.
• breadth first, depth first, mix first

• singly and doubly linked lists, implementation issues and tradeoffs.
• Quiz on stacks and queues (first of several, replacing second midterm exam)

• homework discussion
• Deque implementation

• queues and stacks as adaptors (note correction to text)
• stack uses
• stack implementations

• fast size() and semi-fast indexing operator, L[i].
• performance at a cost.

• reprise of list implementation with bounds checking
• Add an indexing operator, L[i]?

• list and vector implementation.
• embedded classes (link and interators).
• discussion of operator[] and of hello world.

• Budd's slides on lists ch09slide.ps, ch09slide.pdf.
• merge: inplace or not
• Homework 3 discussion

• Examples of list use.
• Nontrivial iterators and input iterators.
• List implementation. Alternatives: circular and singly linked lists.

• Divide and conquer approximate string matching. See chromosome2.cc in gene/modelsolution/.
• Linked structures and flexible size.
• list basic member functions.

• Exam return. Answer key.
• generic sorting: merge sort and selection sort.
• vector implementation.

• Templates for implementation of containers, iterators, algorithms
• Review for midterm.

• stringy: the string class as extension of vector
• vectors ch08slide.ps, ch08slide.pdf.
• Sieve of Eristosthenes.

• example: maxmin.cc
• vector's best, most useful functions
• string class as extension of vector

• String class member function implementation ch07slide.ps, ch07slide.pdf.
• such as resize(), remove()
• generic functions use iterators: search(), find()

• Palindrome functions: a cleaner organization, use of , tolower().
• unix tar command: making one file out of many.
• Enums, chars, and ints

• Characters words/chartypes.cc, and its output.
• Strings ch07slide.ps, ch07slide.pdf.
• Palindrome functions: directory of palindrome code files.

• review on Multiple file programs. Multifile_programs.txt.
• Container classes and Iterators ch06slide.ps, ch06slide.pdf.

• 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.

• 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.

• 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