Review Text Chapters and Topics

1
Review Text Chapters and Topics

• 4.1 4.3
• 6.1 6.6
• 7.1- 7.5
• 10.1 10.3
• 11.1 11.2

• Pointer-based lists
• SLLs, DLLs
• Circular lists
• Stacks
• Array-based and list-based
• Expression evaluation postfix notation
• Queues
• Circular arrays and circular pointer-based lists
• Simulation
• Deques
• Trees
• Binary trees and Binary Search Trees
• Heaps
• Max heaps and min heaps

2
Review Slide Sets

• http//www.cse.unt.edu/bbuckles/Teaching/DLLs.ppt
  
• http//www.cse.unt.edu/bbuckles/Teaching/queues.p
  pt
• http//www.cse.unt.edu/bbuckles/Teaching/deque.pp
  t
• http//www.cse.unt.edu/bbuckles/Teaching/CS200Ch1
  0_Trees.ppt
• http//www.cse.unt.edu/bbuckles/Teaching/mytrees.
  ppt
• http//www.cse.unt.edu/bbuckles/Teaching/review.p
  pt

3
Exam 2 Review 1

• Lists
• Stacks
• Queues
• Deques
• Simulation

4
Exam 2 Review 2 - Lists

• The ADT
• Constructors
• Destructors
• SLLs
• DLLs
• Circular
• Operators -gt, new, delete
• Linear data structure

5
Exam 2 Review 3 - Stacks

• The ADT
• LIFO
• Implementation
• as an array
• as a list
• Infix to Postfix translation
• Postfix evaluation

6
Exam 2 Review 4 - Queues

• The ADT
• FIFO
• Implementation as
• an array
• circular array
• tests for empty and full
• a list
• SLLs
• DLLs

7
Exam 2 Review 5 - Deques

• The ADT
• Stack as a Deque
• Queue as a Deque

8
Exam 2 Review 6 - Simulation

• Terminology
• Queue entry actions
• Queue departure actions
• Statistics computed
• The event list