https://www.rgpvonline.

com

Total No. of Questions : 8] [1] [Total No. of Printed Pages : 2

Roll No ..................................
CS-3004-CBGS
B.E., III Semester
Examination, June 2020
Choice Based Grading System (CBGS)
Data Structures - II
Time : Three Hours
Maximum Marks : 70
Note: i) Attempt any five questions.
ii) All questions carry equal marks.
iii) Assume data suitably.
1. a) What do you understand by Asymptotic notation? Explain
each notation with example and diagram. 7
b) Explain different non primitive data structure and the
operation associated with them. 7

2. a) Explain various algorithm used in data structure. 7

b) Provide the solution for the following recurrences: 7

 n
T ( n ) = 2T   + n log n
 2

3. Explain the AVL tree insert method and explain. Why its
insertion time complexity is still of the same order as binary
tree? 14

4. a) Construct an AVL search tree by inserting the following

element in order of their occurrence 7
64, 1, 44, 26, 13, 110, 98, 85
b) Explain analysis of Heap operation with example. 7
CS-3004-CBGS PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[2]

5. a) What is a stable sorting algorithm? Also prove counting

sort is stable. 7
b) Explain outline and offline algorithm. 7

6. Suppose the elements in the array are A = < 2, 13, 5, 18, 14,
20 > Does this array can be represent in INSERTION
SORTING justify your answer with all the steps. 14

7. a) What do you understand by data structure maintenance?

Explain. 7
b) Explain Augmentation strategy with example. 7

8. a) Write short note on Internal trees. Explain with example.

7
b) Explain retrieving an element with a given rank. 7

******

CS-3004-CBGS PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

Total No. of Questions : 8] [1] [Total No. of Printed Pages : 4

Roll No ..................................
CS/CT/CO-303-CBGS
B.Tech., III Semester
Examination, June 2020
Choice Based Grading System (CBGS)
Data Structures
Time : Three Hours
Maximum Marks : 70
Note: i) Attempt any five questions.
{H$Ýht nm±M àíZm| H$mo hb H$s{OE&
ii) All questions carry equal marks.
g^r àíZm| Ho$ g_mZ A§H$ h¢&
iii) In case of any doubt or dispute the English version
question should be treated as final.
{H$gr ^r àH$ma Ho$ g§Xho AWdm {ddmX H$s pñW{V ‘| A§JO
o« r ^mfm
Ho$ àíZ H$mo A§{V‘ ‘mZm Om¶oJm&

1. a) Discuss various classifications of data structures with an

example.
EH$ CXmhaU Ho$ gmW S>Qo >m g§aMZmAm| Ho$ {d{^Þ dJuH$aUm| na MMm©
H$a|&
b) Write an algorithm for traversing nodes in a single linked
list? Explain with an example.
EH$ EH$b qbH$ H$s JB© gyMr ‘| ZmoS²>g H$mo hQ>mZo Ho$ {bE EH$
EëJmo[aÏ‘ {bI|& EH$ CXmhaU Ho$ gmW g‘PmBE&

CS/CT/CO-303-CBGS PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[2]

2. a) Define :
n[a^m{fV H$a|:
i) Data and information
ii) Abstract Data Types
iii) Polynomials
b) What are circular linked list? What operations you can
perform on circular linked lists?
gH©$w ba qb³S> {bñQ> ³¶m h¢? gHw$© ba qb³S> {bñQ> na Amn H$m¡Z-go
Am°naoeZ H$a gH$Vo h¡§?

3. a) Write an algorithm for insertion and deletion in Priority

Queues.
Priority Queues ‘| g{å‘bZ Am¡a {dbmonZ Ho$ {bE EH$ EëJmo[aÏ‘
{bI|&
b) Write an algorithm which reverses the order of elements
of stack using one additional stack and some additional
variables?
EH$ EëJmo[aÏ‘ {bI| Omo EH$ A{V[a³V ñQ>¡H$ Am¡a Hw$N> A{V[a³V
Ma H$m Cn¶moJ H$aHo$ ñQ>¡H$ na VËdm| Ho$ H«$‘ H$mo CbQ> XoVm h¡?

4. a) How can you convert an infix expression to postfix

expression using stack? Give one example.
Stack H$m Cn¶moJ H$aHo$ Amn EH$ infix E³gàoeZ H$mo nmoñQ>{’$³g
E³gàoeZ ‘| H¡$go ~Xb gH$Vo h¡§? EH$ CXmhaU X|&
b) Write functions to implement recursive versions of
preorder, inorder and postorder traversals of a binary tree.
~mBZar Q´>r Ho$ àrAm°S>©a, BZAm°S>©a Am¡a nmoñQ>Am°S>©a Q´>¡dg©ëg Ho$
nwZamdVu g§ñH$aUm| H$mo bmJy H$aZo Ho$ {bE ’§$³eZ {bI|&

CS/CT/CO-303-CBGS Contd...
PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[3]

5. a) What is a binary search tree? Write down its properties.

Suggest an example.
~mBZar gM© Q´>r ³¶m h¡? BgHo$ JwUm| H$mo {b{IE& EH$ CXmhaU X|&
b) Explain briefly.
g§jon ‘| ~VmBE&
i) B Trees
ii) Red Black Trees

6. a) Differentiate between Depth first search and Breadth first

search algorithm?
Depth first search Am¡a Breadth first search EëJmo[aÏ‘ Ho$
~rM A§Va&
b) Write an algorithm which counts the number of connected
components in a graph.
EH$ EëJmo[aÏ‘ {bI| Omo EH$ J«m’$ ‘| OwS‹ >o KQ>H$m| H$s g§»¶m H$mo {JZm
OmE&

7. a) Explain briefly.
g§jon ‘| ~VmBE&
i) Minimum Spanning Tree
ii) Applications of a graph
b) Explain Dijkastra’s algorithm for finding shortest path with
an example.
CXmhaU Ho$ gmW g~go N>moQ>m amñVm ImoOZo Ho$ {bE Dijkastra’s
EëJmo[aÏ‘ H$s ì¶m»¶m H$a|&

CS/CT/CO-303-CBGS PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[4]

8. a) Explain Quick sort? Sort the following elements using

Quick sort:
{¹$H$ gm°Q>© ~VmBE& {¹$H$ gm°Q>© àH$ma H$m Cn¶moJ H$aVo hþE {ZåZ{b{IV
VËdm| H$mo H«$‘~Õ H$a|:
32, 23, 56, 78, 12, 66, 37, 93, 29, 80
b) Write short notes.
g§{jßV ZmoQ> {bI|&
i) Comparison of indexing and hashing
ii) Radix sort
iii) Insertion sort

******

CS/CT/CO-303-CBGS PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

Total No. of Questions : 8] [1] [Total No. of Printed Pages : 2

Roll No ..................................
CS/IT-305 (GS)
B.E. III Semester Examination, June 2020
Grading System (GS)
CS-305: Data Structures
IT-305: Data Structure and Algorithm
Time : Three Hours
Maximum Marks : 70
Note: i) Attempt any five questions.
ii) All questions carry equal marks.
l. Define the term array. How are two-dimensional arrays represented in memory? Explain how address
of an element is calculated in a two-dimensional array.

2. Write an algorithm to implement depth-first search. How is depth-first search different from
Breadth-first search? Also write any two application of complete graph.

3. Explain the following:

i) Sparse matrices
ii) Backtracking

4. Write short notes on:

i) AVL Tree
ii) Minimum Cost Spanning Tree
iii) Sparse Matrix and its implementation

5. Define Huffman code? Explain using suitable example how Huffman codes are evaluated.

6. What are B-trees? Construct a B-Tree of order 3 for the following set of input data:
69, 19, 43, 16, 25, 40, 132, 100, 145, 7, 15, 18.
OR
Write an algorithm for postfix to infix conversion. Consider the following arithmetic expression
P, written in postfix notation:
P : 12, 7, 3, -, /, 2, 1, 5, +, *, +. Translate P into infix expression using stack operations.

7. Find the minimum cost spanning tree for the following weighted graph.
A
13 1
8
5
B C d
15
4 5

e 2
F
CS/IT-305 (GS) PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[2]

OR
Define the term Recursion? Give a recursive algorithm to find nth term of a Fibonacci series?

8. Answer any two of the following:

a) Write an algorithms to find the largest of given n numbers. Derive its time complexity using
asymptotic notations.
b) What is Generalized linked list?
c) Define internal and external sorting.
d) Explain adjacency matrices graph representation.

******

CS/IT-305 (GS) PTO

https://www.rgpvonline.com