Guru Nanak Dev University 2009 B.Sc Information Technology Data structures - exam 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. (a) describe Data structure. discuss the major operations on a data structure.10
(b) Write an algorithm for binary search with example.10

2. (a) Difference ranging from linear array and multidimensional array with example.10
(b) How multidimensional array is represented in memory?10

3. How an ITEM is to be searched in a linked list? When list is unsorted and sorted. discuss.20

4. discuss how a node can be deleted with a provided item of info.20

5. describe stack and provide array and linked represntation of stack in memory.20

6. (a) Write an algorithm of quick sort.10
(b) discuss how to transform to INFIX expression.10

7. (a) Write an algorithm to inser or delete an element from the queue.10
(b) describe priority queues and discuss different ways of representing them in memory.10

8. (a) describe Binary tree with example.5
(b) What is a complete binary tree? provide different ways of represnting a binary tree in memory.15

Earning:   Approval pending.