1.a. What are the disadvantages of an array?

1.b. Explain how to find the performance of an algorithm.

1.c. What are the disadvantages of queue which is implemented using array and how to overcome it?

1.d. Differentiate between doubly and circular linked lists.

1.e. Explain how binary tree is represented using an array and linked list

1.f. Explain the threaded binary tree with suitable example

1.g. Define Hash Clashing.

1.h. Compare Selection sort and Quick sort with an example.

1.i. Write an algorithm to insert an element into the binary search tree.

1.j. Explain the properties of Red-Black tree:

2.a. Write a program to concatenate singly linked lists.

2.b. How two dimensional arrays are represented in memory? Also obtain the formula for calculating the address of any element stored in the array, in case of column major order.

3.a. Write a program to implement a sparse matrix.

3.b. How can we represent a polynomial in a linked list?

4.a. Explain the Towers of Hanoi problem with an example.

4.b. Write a program to implement the operations of Queue.

5.a. Write a recursive procedure to compute the $\mathrm{n}^{\text { th }}$ Fibonacci number.

5.b. What are the applications of queue?

6.a. Write an algorithm to find the components of a graph.

6.b. Define Priority Queue? Explain with an example.

7.a. Differentiate between BFS and DFS.

7.b. Define Binary tree. Explain the Binary tree representations with an example.

8.a. Write an algorithm of Linear Search.

8.b. Sort the following list of elements by using İnsertion Sort".

$15,28,46,10,35,54,5,17$

9.a. Insert the following list of elements into the hash table by using Linear Probing (size of the hash table is 10$)$ 36,48, 66, 27,23,87,10, 12 \lt/div\gt \ltspan class='paper-ques-marks'\gt(5 marks)\lt/span\gt \ltspan class='paper-page-id'\gt00\lt/span\gt \lt/div\gt \ltDIV class='paper-question'\gt \ltDIV class='paper-ques-desc'\gt \ltb\gt9.b.\lt/b\gt Explain the Radix sort with an example." \lt/div\gt \ltspan class='paper-ques-marks'\gt(5 marks)\lt/span\gt \ltspan class='paper-page-id'\gt00\lt/span\gt \lt/div\gt \ltDIV class='paper-question'\gt \ltDIV class='paper-ques-desc'\gt \ltb\gt10.a.\lt/b\gt Construct the AVL tree of the following data $20,40,25,18,15,5,10,46,60$

10.b. Draw the flow chart of splaying operations of splay tree.

11.a. Consider the string = "GCATCGCAGAGAGTATACAGTACG" and search strinig is "AGTATACA" by using the KMP algorithm

11.b. What is trie? Explain the compressed trie with an example.