Q:1 Answer the following. 1. Define Abstract data types. 2. Give classification of data structures. 3. What is a sparse matrix?

4. Give difference between array and linked list. 5. List applications of stack. 6. What is the complexity of insertion sort? 7. What is input restricted deque? 8. Compare binary search and linear search. 9. What is priority queue? Q: 2 Write algorithms for the following. 1. POP operation on a stack using linked list. 2. To sort an array using selection sort technique. 3. Insert at last in doubly linked list. SECTION-2 Q: 3 Answer the following. 1. The memory address of the first element of an array is called A. Floor address C. First address B. Function address D. Base address 2. Which of the following data structure is non linear data structure? A. Trees B. Stack C. Arrays 3. The situation when in a linked list HEADER=NULL is A. Underflow B. Overflow C. House full 4. Which of the following data structure can't store the non-homogeneous data elements? A. Arrays B. Records C. Pointers

15

D. None D. saturated D. None

5. The linear search is not suitable when

A. Small no. of elements in the series C. Average no. of elements in the series B. Large no. of elements in the series D. None of these above 6. Which algorithm uses the divide and conquer algorithmic paradigm? A. Bubble sort B. Insertion sort C. Quick sort D. All of above 7. Formula for finding memory allocation in row major order is A. A[i] [j]= Base + [(j - 1 ) * N + (i-1)] * W C. A[i] [j]= Base + [(i - 1 ) + N * (j-1)] * W B. A[i] [j]= Base + [(j - 1 ) + N * (i-1)] * W D. A[i] [j]= Base + [(i - 1 ) * N + (j-1)] * W 8. If top >=N then A. Stack is empty C. Both (A) and (B) B. Stack is full D. None of the above 9. In a queue during deletion, If Front==Rear then A. Front=0 C. Both (A) and (B) B. Rear=0 D. None of the above 10. An algorithm that calls itself directly or indirectly is known as A. Sub algorithm C. Polish notation B. Recursion D. Traversal algorithm 11. Which among the following is a LIFO data structure? A. Queues B. Linked lists C. Stack D. Graphs 12. The postfix notation of ( X * ( Y- Z ) + A ) / B ) is A. XYZ-*AB+/ C. XYZ-*A+B/ B. XYZ-*+AB/ D. None of the above 13. Find the value of the postfix expression : ABCD ^*- (IF A = 150, B=10, C=2 D=3) A. 70 B. 80 C. 150 D. 1500 14. Stacks cant be used to A. Evaluate an arithmetic expression in postfix form B. Implement recursion C. Convert a given arithmetic expression in infix form to its equivalent postfix form D. Allocate resources (like CPU) by the operating system 15. Identify the overflow condition for a circular queue. A. Rear=N B. Front=Rear C. Rear=0 D. None of these