Sei sulla pagina 1di 2

30. a.i. Convertthegiven expressiontopostfixexpressionl

+(B*C-DlEtf;*5:;*fI

(8Marks)

ii. Evaluate the postfix expression given below and write the result 5,6,2,+,*,12,4,1-. (a Marks)

(oR)

b.i. Elaboratethe operations ofdouble ended queue.

ii. Explain the priority queue with example.

31. a. Suppose the following eight numbers are inserted into an empty binary search tree T.

50, 33, 44. 22,77,35,60, 40. Draw the tree. Write the procedure for all traversal

techniques and perform the same using the above values.

b.i.

(oR)

Show the step by step procedure for inserting 65 into AVL tree shown below

ii. Explain the various rotations on eW ffee with examples.

:'

(4 Marks)

(8 Marks)

i

32. a Construct the minimum spanning treb using Kruskal's algorithm for the following graph

(oR)

b.i. Consider a hashtable of size 10. Using quadratic probing,

81 and 101 into the table. Take Cr

:

1 and Cz:3.

ii. List the pros and cons of quadratic probing.

Page 4 of4

***,t

*

27,36, 24, 63,

(8 Mark9

(4 Marks)

06Jr3/415CS201J,

Reg. No.

Notel

(i)

(ii)

B.Tech. DEGREE EXAMINATION, JUNE 2017

Third / Fourth Semester

I5CS2OIJ - DATA STRUCTURES

Part - A should be answered in oMR sheet within first 45 minutes and oMR sheet should be handed

over to hall invigilator at the end of 45d minute.

Part - B and Part - C should be answered in answer booklet.

Mar. Marks: 100

1. Which of the

(A) Boolean

(C)

A:rays

PART-A(20x1:20Marks)

following is not a primitive data structure?

(B) Integer

(D) Character

2.

of a set of

Nrelements is an arrangernent

of the elements in a given order

(A) Combination

(B) permutation

3. The

complexity of linear search algorithm is

log n)

(A) 0(n)

(C)

0(n

(B) 0(nr)

(D) 0(log n)

4. An ADT is defined to be a mathematical

collections of all

(A) Cardinality

(C)

Primitive

model of a uscr defined

operations on that model

 (B) Assignment (D) Structure

5. Which of the following

(A) Name of the array

(C)

items are not part of array declaration?

'

(B) Datatype of the array

(D)

Length of the array

Index set of the array

be there in

(C)

(D) Priority queue

7.

Which pointer is associated with the availability list?

(A) First

@) Avail

(D) Rear

(C) Top

8. --

is a technique using which a computer periodically collects all the

list

(B) Garbage compaction

(D)

Free storage

onto the free storage

(A)

(C)

Garbage

collection

list

Page I of4

the

deleted space

06JT'3/415CS20lJ

9. Stacks may be represented in the computer usually by means of a one-way list or a

(A)

(C)

Queue

Linear list

(B)

(D)

Linear array

Recursion

10. Thepostfix form

for the expression (A+ B)*(C* D- E)* FIG is

(B)

AB+CD-Fx*Gl

(A) AB+CD*E-FGlt('F

(C)

AB+CD*E-xF*Gl

(D) AB+CDE*-*p*tr1

11. The

(A)
(C)

circular queue will be full only when

Front: max-l and rear: max -1

Front: 0 and rear:0

-

@) Front: ma>r-l and rear: 0

(D)

Front: 0 and rear: max. 1

12. a linear tist in which the elements can be added or removed at either end but not in

the middle

(A) Linear list

-is

(C) Enqueue

(B) Circular queue

(D) Dequeue

13. Degree of a leaf node is

(A)

(c)

I

3

(B)

2

(D)o

14. In a

one

(A)

(C)

the left and right subtrees fo1 any given node, differ in height by no more than

Balancedbinary.tree

Height balanced binary tree

(B)

(D)

Weight balanced binary tree

Binary search tree

15. When preorder traversal of a tree is ABDEFCGHJLK, then the postorder traversal will be

(A)

(C)

DFEBGLJKHCA

DFBELGJKCHA

(B)

DBFEAGCLIHIi

(D) DFEBLGHKCAJ

16. is a selfbalancing binary search tree with an additional property that recently accessed

elements can be re-accessed fast

(A)

AVL tree

(C) Splay tree

(B) Red black tree

@) Binary search tree

17. The

(A)

(C)

Path

Vertex

of a node is the number of edges containing that node

(B)

(D)

Degree

Loop

,:

18. The graph is said to be _

if each edges in the graph is assigned a non-negative numerical

value called the w6ight of length of the edge

(A)

(C)

Complete

Balanced

(B)

(D)

Weighted

Tree

19.

is a method used to store a graph

(41

_

stactr

(C) Diagraph

@)

@) List

20. The

(A)

(C)

Page 2 of4

process of examining memory location in a hash table is called

Hashing

Probing

(B) Collision

0GIr3/4l5CS20tJ

PART -B

(5 x 4:20 Marks)

ANY FM Questions

21. Brief about various types of data stmctures with example'

1',)

Describe the complexity of an algorithm and space-time tradeoff of algorithm.

23. Why we need sparse matrix? How the sparse matrices used efficiently in the computer's

memory?

24; Devise an algorithm for converting,infix expression to postfix expression with an example.

25. List the types of queues. Write a note on circular queue.

26. Find the preorder and postorder expression for the given infix expression

la + (b - c)\*l(d - e) / (f + s - h)\

27. Consider the below graph and find the adjacency matrix of G

28.

a.

b.i.

PART - C (5 x 12 :60 Marks)

Illustrate binary search technique with an algorithm. Mention the time complexity.

(oR)

ii Explain the various mathematical notations and functions used in analysis of algorithms.

29. a-

Describe the following operations of singly linked list with an example.

(i)

(iD

(iii)

Deleting a node at the beginning

Deleting

Deleting a node after a given node

a node at the end

(oR)

b. Discuss the following operations of doubly linked list with an example

(i)

(iD

(iii)

lnserting a node at the beginning

Deleting

Deleting a node after a given node.

a node atthe end

Page 3 of4

06rF3/415CS20lJ