You are on page 1of 2

What is circular queue? Give an algorithm to insert an item in a circular queue.

2+4

Write a recursive algorithm for binary search.


4

Write an algorithm for quick sort. What is the average and worst case time complexity?
6+2

What are linear and non-linear data structures?


2

What is the average number of comparisons needed in a sequential search to determine the
position of an element in an array of 100 elements, if the elements are ordered from largest to
smallest? 3

What is a user-defined data type? What does abstract data type means?
2+3

What is the data structures used to perform recursion? Explain using


example. 3+3

A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest
time to
execute? 2

What is the maximum total number of nodes in a tree that has N levels? Note that the root is
level (zero) 2

Write the programs for Linked List (Insertion and Deletion) operations
5

What are hash tables? What is collision? How can collision be resolved?
2+2+3

When should a Hash table be used and when should a BST?


3

Make some comparative study between open addressing and linear probing.
5

Explain the following hash function division method, folding method using example.
4

What is heap? How can a heap be represented in a array?


4

Write an algorithm for merge sort. What is the average and best case time complexity?
6+4

You might also like