Department of Computer Science

The topics for the second examination include but are not necessarily limited to the following:

• 1. Linked Lists
  • a. Theory
  • b. Implementation
  • c. Single link
    • i. circular
    • ii. with header
  • d. Double link
    • i. double circular
    • ii. with header
  • e. Applications
• 2. Stacks (revisited)
• 3. Queues (revisited)
• 4. Double ended queues
• 5. Priority Queues
• 6. Trees
  • a. binary search trees
  • b. tree traversals
  • c. tree construction and implementation
  • d. tree linked representation
  • e. tree array representation
  • f. applications of trees: Huffman encoding
  • g. tree sorting
• 7. Recursion
• 8. Sorting
  • a. Bubble
  • b. Insert
  • c. Select (Max)
  • d. Tree
  • e. Quicksort

The main emphasis of the examination will be Chapters 3, 4, 5 and parts of chapter 6 of the text.

Questions will include programs and modules for you to write, programs and modules for you to read and debug, discussion questions, theory questions, and applications. For some questions C program code will be required, while for others pencil and paper descriptions of applications will be required.

Good Luck.