GN-R-12

G. Narayanamma Institute of Technology & Science

Autonomous under JNTUH

(for Women)

Shaikpet, Hyderabad- 500 008

I-B.Tech, II Semester Regular Examinations, June 2013

DATA STRUCTURES
(Common to ALL)
Max. Marks: 75

Time: 03 Hours

1. Question paper comprises of Part A and Part B.

2. Part A (for 15 marks) is compulsory and must be answered at one place in the answer book.
3. Answer any 05 full questions out of 08 from Part B (for 60 marks) in the answer book.
PART-A
(Question 1 comprises of 1 mark bits and Question 2 comprises of 2 mark bits)
Q.1

a) If the sequence of operations - push(5), push(6), pop, push(5), push(6), pop, pop, [1x5=5]
pop, push(6), pop are performed on a stack, the sequence of popped out values are
________.
i) 6, 6, 5, 5, 6
ii) 6, 6, 5, 6, 6
iii) 6, 5, 6, 6, 5
iv) 6, 5, 6, 6, 6
b) Which algorithm is most similar to the way many people would sort a hand of
cards? ________.
i) insertion sort ii) bubble sort iii) selection sort iv) Shell sort v) Quick sort
c) Deleting a node from a linked list normally involves _______.
i) Changing the data value in the node.
ii) Changing the value of the node's next reference
iii) Changing the link in another node so as not to point to the deleted node
iv) Changing the link in another node to point to the deleted node
d) The depth of a complete binary tree is given by______.
i) n log2n ii)n log2n+1 iii) log2n iv) log2n+1
e) If every node u in G is adjacent to every other node v in G, A graph is said to be
___________ graph.
i) isolated ii) complete iii) finite iv)strongly connected

Q.2

a) Mention any two sorting algorithms whose time complexity in Big-O notation is [2x5= 10]
not the same.
b) Evaluate the following postfix expression:
6 5 2 3 + 8 * + 3 + *
c) How might you append one linked list L1, to another linked list L2?
d) Differentiate between complete binary tree and fully binary tree.
e) Describe any two graph storage structures.
END OF PART A

GN-R-12

Q.3(a)
(b)

Q.4(a)
(b)

Q.5(a)
(b)
Q.6(a)
(b)

PART-B
(Answer any 05 full questions. Each question carries 12 marks)
Write an algorithm for the merge sort technique and discuss its time complexity.

[06]

Compare the Best case and worst case running times for searching unsorted arrays, and
sorted arrays.

[06]

Discuss basic operations on circular queues with an example.

[06]

Explain the steps to convert an infix expression into postfix expression with suitable
example.

[06]

Write pseudo code for deleting a node from the doubly linked list.

[08]

Give the merits and demerits of linked lists.

[04]

Discuss tree traversal techniques with suitable examples.

[06]

Illustrate the steps to construct the binary search tree for the following keys:

[06]

50, 22, 78, 110, 5, 56, 45, 12, 48, 50, 88

Q.7(a)
(b)
Q.8(a)
(b)
Q.9(a)
(b)

Discuss implementation of Depth First Search algorithm in detail.

[06]

Explain minimum cost spanning tree algorithms with examples.

[06]

What is Dequeue? How it works? Explain.

[04]

Illustrate radix sort algorithm with an example.

[08]

Explain insertion operation on singly linked list with example.

[06]

Describe stack applications with examples.

[06]

Q.10(a) Discuss graph traversal techniques in detail.

(b)

Explain insertion and deletion operation on binary search trees with examples.
END OF PART B
END OF THE QUESTION PAPER

[06]
[06]