Part - || [DS] CS205 DATA STRUCTURES KTU B TECH QUESTIONS FOR SECOND YEAR [S3] STUDENTS | QUESTION BANK


APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

[DS] CS205 DATA STRUCTURES KTU B TECH QUESTIONS FOR SECOND YEAR [S3] STUDENTS | QUESTION BANK,data Structures ktu questions,data Structures questions ktu,data Structures questions,data Structures questions,data Structures questions ktu,ktu data Structures questions,data Structures questions,data Structures questions ktu,ktu data Structures questions,ktu CS questions,Cs questions,Computer Science questions,ds,data Structures ktu important,Previous questions,ds,data Structures important,Previous questions ktu,ds,data Structures important,Previous questions,ds,data Structures important,Previous questions,ds,data Structures important,Previous questions ktu,ktuds,data Structures ,ds important,Previous questions,ds,data Structures  important,Previous questions,ds,data Structures important,Previous questions ktu,ktu ds,data Structures important,Previous questions,ktu CS  important,Previous questions,Cs  important,Previous questions,Computer Science  important,Previous questions


DATA STRUCTURES QUESTION PAPERS

PART D

(Answer Any Two Questions)

1. Consider the expression 5 * ( 6 + 2 ) – ( 12 / 4 )

a) Convert infix expression to post fix and prefix (4)

b) Evaluate resulting postfix expression using stack (3)

c) Explain about Multiple queues (2)

2. a) Construct a binary tree from following traversal

preorder: 20 , 10, 5, 15, 30, 25, 35

postorder: 5, 15, 10, 25, 35, 30, 20 (2)

b) Write an algorithm to rearrange the elements of resulting tree in ascending order (2)

c) Write the procedure for deleting ‘30’ from resultant tree and construct the tree after the removal of ‘30’ (5)

3. a) Write an algorithm to implement memory allocation and deallocation using linked list (4)

b) Explain different allocation scheme (3)

c) Explain about DEQUEUE

PART E


(Answer Any Four Questions)


2. a) What do you mean by the term sorting? List different types of sorting techniques. (2)

b) Explain detail of simple sorting methods. (5)

c) Give a chart to show time and space complexity of various simple sorting methods (3)

3. a) What is heap. (2)

b) Construct a max heap from following data 20, 14, 17, 8, 6, 9, 4, 1 (3)

c).Write a procedure to sort the above heap and justify your answer. (5)

4. a) Compare the performance of different searching algorithm with example. (4)

b) Explain Hashing (6)

5. a) Find the hash value for the key “ramesh” using hash function as division where size of hash table is 97. (3)

b) Explain hash function in detail. (3)

c) Consider insertion of keys 10, 22, 31, 4, 15, 28, 17, 88 and 59 into hash table of length 11 using chaining (4)

6. Consider the insertion of keys 76, 26, 37, 59, 21, and 65 into hash table of size 11.

a) Illustrate the operation using linear probing. (3)

b) Identify the drawback of linear probing and resolve it. (4)

c) Consider an open address hash table with uniform hashing. 

Give upper bound on expected number of probes in an unsuccessful search and on the expected number of probes in a successful search when load factor is 3/4 and when it is 7/8.(3)


No comments:

Powered by Blogger.