CS 315 Data Structures
Spring 2008
Summary of topics covered Week of April 1, 2008
Review of heap operations
o Insert
o Deletemin
Other heap operations
o DecreaseKey
o IncreaseKey
o Delete remove the key at a given position
o BuildHeap
Applications of hea
CS 315 Data Structures
Spring 2008
Mid-semester test # 2 solutions
1) Let A be a heap of size 4 with keys A[0] = 3, A[1] = 6, A[2] = 4, A[3] = 11. What is the result of
inserting 2 into the heap? Exhibit the result of performing deleteMin on the resulting
CS 315 Data Structures Practice Questions for mid-semester # 2
(Date of the test: April 24, duration: 75 minutes)
1) Exercises5.1,5.2
3) Consider an open hashing table. Suppose the hash table currently contains the keys 23, 8, 41,
33, 34, 19, 12. Assume a
CS 315 Week 8 (March 18 and 20) summary and review questions
Topics covered
Priority queue as a ADT
Binary heap definition
Insert and Deletemin algorithms
SUMMARY:
ADT priority queue supports Insert, Deletemin as main operations.
Other operations merge, i
CS 315 Weeks 5 and 6 (March 11 and 13) summary and review questions
Topics covered
Hashing (completed)
Application of hashing : LZW compression algorithm
SUMMARY:
Some of the following topics on hashing were reviewed:
Hashing: goal is to perform each of S
CS 315 Weeks 5 and 6 (Feb 26, Feb 28 and March 4) summary and review
questions
Topics covered
Queue as ADT, operations: insert, delete, isEmpty, isFull
Queue implementation using a circular array
Application of queue in recognizing connected sets of foreg