D106/P142/CMP528/EE/20170108

Time : 3 Hours Marks : 80

Instructions :
1. All Questions are Compulsory.
2. Each Sub-question carry 5 marks.
3. Each Sub-question should be answered between 75 to 100 words. Write every questions
answer on separate page.
4. Question paper of 80 Marks, it will be converted in to your programme structure marks.

1. Solve any four sub-questions.

a) Define data structures. 5

b) What is a non primitive data structure? Give an example. 5

c) Differentiate between linear and non linear data structures. 5

d) State any two differences between static and dynamic memory allocation. 5

e) What do you mean by Stack Overflow? 5

2. Solve any four sub-questions.

a) Give any two comparison of linked and sequential storage representation. 5

b) What is Linear Search? What is the average number of comparisons in a Linear search?
5

c) What is Searching? Write an algorithm for binary search with an example. 5

d) Convert the expression (P+Q)* C into postfix and show the contents of stack after
every step in tabular form. 5

e) Explain about the singly linked list. 5

KA17-1040 D106/P142/CMP528/EE/20170108 : 1 (P.T.O.)

3. Solve any four sub-questions.

a) List down any four applications of data structure. 5

b) What are the four major parts in an iterative process? 5

c) What is a Stack? Explain its types? 5

d) How do you test for an empty queue? 5

e) Explain the algorithm for Insertion sort and sort the following array.

77, 33, 44, 11, 88, 22, 66, 55. 5

4. Solve any four sub-questions.

a) Construct the binary tree for the following.

Inorder : 3 5 6 8 12 15 18 19

Preorder : 12 5 3 6 8 18 15 19

Postorder : 3 8 6 5 15 19 18 12 5

b) What is a Queue? Explain its operation with example. 5

c) Explain Representing lists as Binary tree. Write algorithm for finding K th element
and deleting an element. 5

d) Explain Binary search tree representation. 5

e) What is a Graph? Explain DFS and BFS. 5

sssssss

KA17-1040 D106/P142/CMP528/EE/20170108 : 2