Q1. Illustrate the condition which a circular queue is full if the queue is implemented by using arrays?
Q2. Describe the boundary tag method.
Q3. Describe the algorithm for deletion of a node containing two children from binary search tree.
Q4. An array is defined as A[2:8, -4:1, 6:10] needs 4 words per memory cell. Find out the location of [5, -1, 8] if the array is implemented in the row major order. The base address is as 200.
Q5. Define the term B tree and B+ Tree. Among the two which one is better and describe why?
Q6. Illustrate the meaning of complete threaded binary tree? describe how null pointers are replaced in it?
Q7. Describe heap sorting algorithm.