WWW - Manaresults.Co - In: I B. Tech. II Semester Regular Examinations, April/May - 2017 Data Structures
WWW - Manaresults.Co - In: I B. Tech. II Semester Regular Examinations, April/May - 2017 Data Structures
PART –A
1. a) Define polynomial ADT. (2M)
b) List the application of stacks. (2M)
c) Define queue full condition. (2M)
d) Define path in a tree. (2M)
e) What is the degree of a graph? (2M)
f) What is planer graph? (2M)
g) Give the time complexity of quick sort. (2M)
PART –B
2. a) Define data structure. Discuss different types of data structure their (7M)
implementations applications.
b) What is an array? Discuss different types of array with examples. (7M)
5. a) Define binary search tree. Show how to insert and delete an element from binary (7M)
search tree.
b) Write algorithm to insert and delete an element from binary search tree. (7M)
1 of 1
WWW.MANARESULTS.CO.IN
|''|'''||''||'''||||
Code No: R161213 R16 SET - 2
I B. Tech. II Semester Regular Examinations, April/May - 2017
DATA STRUCTURES
(Com. to ECE, EIE, ECC)
Time: 3 hours Max. Marks: 70
Note: 1. Question Paper consists of two parts (Part-A and Part-B)
2. Answering the question in Part-A is Compulsory
3. Answer any FOUR Questions from Part-B
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
PART –A
PART –B
2. a) Explain how to implement polynomial ADT using array. Discuss its Advantages (7M)
and Disadvantages.
b) Explain polynomial addition using arrays. (7M)
6. a) What are connected components of graph? Is there a method to find out all the (7M)
connected components of graph? Explain.
b) Explain Prim’s algorithm with an example. (7M)
1 of 1
WWW.MANARESULTS.CO.IN
|''|'''||''||'''||||
Code No: R161213 R16 SET - 3
I B. Tech. II Semester Regular Examinations, April/May - 2017
DATA STRUCTURES
(Com. to ECE, EIE, ECC)
Time: 3 hours Max. Marks: 70
Note: 1. Question Paper consists of two parts (Part-A and Part-B)
2. Answering the question in Part-A is Compulsory
3. Answer any FOUR Questions from Part-B
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
PART –A
PART –B
3. a) Explain the evaluation of prefix expression. Find the equivalent prefix of :8 6 3 + (7M)
* 1 2 3 -/-
b) Explain basic operations of queue. List the steps to implement queue using stack. (7M)
4. a) Write an algorithm to delete an element anywhere from doubly linked list. (7M)
b) Write applications of single linked list to represent polynomial expressions. (7M)
1 of 1
WWW.MANARESULTS.CO.IN
|''|'''||''||'''||||
Code No: R161213 R16 SET - 4
PART –A
PART –B
2. a) Explain sparse matrix representation using array with an example. Discuss the (7M)
advantage and disadvantages of this method.
b) Discuss matrix multiplication with an example. (7M)
3. a) Write an algorithm to insert and delete a key from circular queue. (7M)
b) Explain the procedure to convert infix expression to postfix expression with the (7M)
following expression: ((A –(B+C) * D) / (E+F))
4. a) List various operations of linked list and explain how to insert a node anywhere in (7M)
the list.
b) Show how to reverse a single linked list. (7M)
6. a) Explain Warshall’s algorithm to find transitive closure of a graph with a sutable (7M)
example.
b) Write Prim’s algorithm. (7M)
1 of 1
WWW.MANARESULTS.CO.IN
|''|'''||''||'''||||