Overview of Homework 1X

The problem is to play that children’s game of word substution.

Interesting parts of the textbook to read

  Linked list (pp. 684-692)
    malloc (p. 685)
    example program (LISTING 17.2 -- pp 687-688)
    traversing the list (pp. 689-690)
    creating the list (pp. 690-691)
    deleting the list (pp. 691)
  Abstract Data Type (pp. 692-708)
    operators (pp. 693-694)
    creating the interface (pp. 694-699)
    using the ADT (pp. 699-700)
    implementing the ADT (pp. 701-708)
  Array-like ADT (pp. 708-720)
  Linked list vs. Array (pp. 726-730)
  Binary search tree (pp. 730-756)

ADT’s for the program

The WordLoop
- operations
  - WordLoop CreateWL(const char * word)
  - int AddWordWL(WordLoop wl, const char * word)
  - const char * NextWordWL(WordLoop wl)
  - void AdvanceWL(WordLoop wl)
  - void DestroyWL(WordLoop wl)
- implementation
  - A linked list of words
  - A dynamically sized array
    - with number of elements?
    - terminated with NULL pointer?
    - with room for growth?
    - with index for next element?
- Driver (workbench) for testing?
The WordMap
- operations
  - WordMap CreateWM (void) ;
  - int InsertWM(WordMap wm, const char *key, const void *value) ;
  - void * LookupWM(WordMap wm, const char *key) ;
  - void DestroyWM (WordMap wm) ;
- implementation
  - Binary search tree
  - Hash table
- void * is used as an opaque pointer
The WordGameInterface
- Note really an ADT
  - Just a convenient interface to WordLoop and WordMap
- operations
  - void *CreateWGI(void) ;
  - int InsertKeyValueWGI(void * wgi, const char * key, const char * word) ;
  - const char * LookupKeyWGI(void * wgi, const char * key) ;
- implementation is pretty small
- void * is used as an opaque pointer

Three parts of the assignment

Implement and test WordLoop
- Pages 681 to 720
- Due Dec 1
Implement and test WordMap
- Pages 732 to 755
- Due Dec 2
Implement the application
- Parsing routines will be provided for you
- Due Dec 3