Guru Nanak Dev University 2010 B.Sc Information Technology Data structures - Question Paper

2120
B.sc.IT part-2
DATA STRUCTURES
PAPER 6
Time:3 Hrs Minimum Marks:100

Note:- Attempt any 5 questions, every carry equal marks.

1. What do you mean by arrays? How to represent an array in memory? discuss Binary search technique with algorithm.20

2. Explain:
(a) Time space trade off
(b) Algorithm complexity20

3. (a) Write an algorithm to insert an item in sorted linked list.10
(b) Algorithm on linear search.10

4. What do you mean by BST? Explainin detail. How we can insert an item in BST when location is not given?20

5. Write Algorithm on:
(a) Bubble sort
(b) Insert and delete element in queue.20

6. What is Heap Tree? Write an algorithm to sort elements by using Heapsort method and its complexity.

7. (a) Write an algorithm on quicksort technique.
(b) Write an algorithm to convert Arithmetic expression from infix notation to reverse polish notation.20

8. (a) discuss Priority and dequeues.
(b) Overflow an underflow conditions.20

Earning:   Approval pending.