No 
Task 
Exercise No 
Description 
Students FN 
0 
Complete the implementation
of class LinkedBinaryTree
taking into account error conditions. 
P6.1  &6.4.2  F33105 F26730 F28365 F27720 
1 
Complete the implementation
of class LinkedBinaryTree
and apply algorithms, given in Code Fragments 6.2, 6.4, and 6.6. 
 
&6.4.2 &6.2.2 
F27391 
2 
Complete the implementation of class LinkedBinaryTree and write functions (for binary tree), given in Code Fragments 6.9, 6.10, and 6.12.   
&6.2.3,4 &6.4.2 
F32477 F32987 
3 
Complete the implementation of class LinkedBinaryTree and write functions, given in Code Fragments 6.18 and 6.20.   
&6.3.4,5 &6.4.2 
F27933 F26568 F29283 
4 
Implement the binary ADT using a vector. 
P6.2 
&6.4.1 

5 
Implement the binary ADT using a linked structure.  P6.3  &6.4.2  F28145 F26840 F26750 F30515 F28085 
6 
Write a program that takes, as input, a fully parenthesized, arithmetic expression and convert it to a binary expression tree. Your program should display the tree in some way and also print the value associated with the root. 
P6.9* 

F27546 F26451 
7 
Complete the program for
comparator class using Code Fragments 7.3 and 7.4. 
 
&7.1.4 
F26692 F24127 F26542 
8 
Give a C++ implementation of a priority queue based on an unsorted sequence.  P7.2  &7.2.1  F26543 
9 
Give a C++ implementation
of a priority queue based on a sorted sequence using Code Fragments 7.5
and 7.6. 
 
&7.2.2 

10 
Develop a C++
implementation of a priority queue that is based on a heap. 
P7.4*  &7.3.3 
F27550 
11 
Implement an unordered
dictionary ADT (log file) with unsorted sequence implementation. 
 
&8.1.2 
F28826 
12 
Implement the dictionary
ADT with a hash table that handles collisions with separate chaining. 
P8.2  &8.2.5 
F28017 
13 
Implement the dictionary
ADT with a hash table that handles collisions with quadratic probing. 
 
&8.2.5  F33118 F28408 
14 
Implement the dictionary ADT with a hash table that handles collisions with double hashing.   
&8.2.5  F26654 