4 52 06 A1 5C 2C 80 4 A 82 DA F4 82

4 452 706 A1 5C 42C 80 64 EA 682 DA F4 882 2B

4 452 706 A1 5C 42C 80 64 EA 682 DA F4 882 2B 445
44 4527 706 A1 5C4 42C 806 64E EA6 682D DA F48 882 2B4 445 270
4 52 06 A1 5C 2C 80 4 A 82 A F4 82 2B 45 27 6A
4 452 706 A1 5C 42C 80 64 EA 682 DA F4 882 2B 445 27 06A 15
44 4527 706 A1 5C4 42C 806 64E EA6 682D DA F48 882 2B4 445 270 06A 15C C42
44 527 06 A1 5C4 2C 806 4E A6 82D A F48 82 2B4 45 270 6A 15C 42 C8
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06
70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E
6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
15 C4 C8 06 4EA 68 2D AF 488 22 B4 452 706 A1 5C 42C 80 64 EA 682
C4 2C 06 4E 6 2D A 48 22 B4 45 70 A 5C 42 8 64 EA 68 D
2C 80 4E A6 82 A F48 82 B4 45 270 6A 15 42 C8 064 EA 68 2D AF
80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22
EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82 B
68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B 445

i) Insert A
2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B 44 27

will be run?
AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B 44 527 06
48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B 44 527 06 A1

array A and B.
82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22 44 52 06 A1 5C
2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B4 52 70 A 5C 42

Max Marks: 60
44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B4 45 70 6A 15C 42 C8
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06
70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E
6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
15 C4 C8 06 4EA 68 2D AF 488 22 B4 452 706 A1 5C 42C 80 64 EA 682

ii) Delete
C4 2C 06 4E 6 2D A 48 22 B4 45 70 A 5C 42 8 64 EA 68 D
2C 80 4E A6 82 A F48 82 B4 45 270 6A 15 42 C8 064 EA 68 2D AF
80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22

1. Solve ALL questions.

Instructions to the Students:

non-primitive data structures.

EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82 B
68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B 445
2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B 44 27

Q. 3 Solve Any Two of the following.

Q.2 Solve Any Two of the following.
AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B 44 527 06
Subject Name: Data Structures

Q. 1 Solve Any Three of the following.

48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B 44 527 06 A1

ITEM occurs in the singly linked list.

82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22 44 52 06 A1 5C
2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B4 52 70 A 5C 42
44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B4 45 70 6A 15C 42 C8
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06
70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E

iii) Insert B
6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
Course: B. Tech in Computer Engineering

15 C4 C8 06 4EA 68 2D AF 488 22 B4 452 706 A1 5C 42C 80 64 EA 682

C4 2C 06 4E 6 2D A 48 22 B4 45 70 A 5C 42 8 64 EA 68 D
2C 80 4E A6 82 A F48 82 B4 45 270 6A 15 42 C8 064 EA 68 2D AF

computer science in which data structure is used.

80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
Date: 5/12/2018

front and rear value after the following operations.

64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22
EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82 B
68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B 445
2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B 44 27
AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B 44 527 06
48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B 44 527 06 A1
82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22 44 52 06 A1 5C
2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B4 52 70 A 5C 42

iv) Delete
44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B4 45 70 6A 15C 42 C8
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06

4452706A15C42C8064EA682DAF48822B
70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E

B) Consider the stack of size 6 memory cells. Suppose initially stack

open addressing with linear probing is used to deal with collision.
6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
3. Use of non-programmable scientific calculators is allowed.

15 C4 C8 06 4EA 68 2D AF 488 22 B4 452 706 A1 5C 42C 80 64 EA 682

C4 2C 06 4E 6 2D A 48 22 B4 45 70 A 5C 42 8 64 EA 68 D
End Semester Examination – Winter 2018
Sem: III

2C 80 4E A6 82 A F48 82 B4 45 270 6A 15 42 C8 064 EA 68 2D AF

and also show the worst case time complexity of selection sort is O (n2).
80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
4. Assume suitable data wherever necessary and mention it clearly.
which the question is based is mentioned in front of the question.

64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22
EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82 B

A) What is circular queue? Let the following circular queue can accommodate
A) What is data structure? Why to study data structure? Enlist the five areas of

68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B 445

maximum six elements with the following data, front = 2, rear = 4 and initial

C) Let the keys: 46, 34, 42, 23, 52, 33 are inserted into an empty hash tableusing
queue content is queue = ----, L, M, N, –---, –-- Show the queue content with
D) What is primitive data structure? Enlist the differences between primitive and
2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B 44 27

A) What is selection sort? Sort the number following numbers in ascending order
C) Suppose multidimensional arrays A and B are declared using A (0:5, -2:7) and

B) What is singly linked list? Write algorithm to find the number of times a given
B (0:5, -1:4). Find the length of each dimension and the number of elements in

function h (key) = key mod 10. Give hash table content after every insertion, if
AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B 44 527 06
B) What is garbage collection? Who will run garbage collection program? When it

contains a, b, c, d, e (Top of stack). Then the following operations are executed

Duration: 3 Hrs.

48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B 44 527 06 A1

82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22 44 52 06 A1 5C
2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B4 52 70 A 5C 42
44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B4 45 70 6A 15C 42 C8
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06
70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E
2. The level question/expected answer as per OBE or the Course Outcome (CO) on

6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
15 C4 C8 06 4EA 68 2D AF 488 22 B4 452 706 A1 5C 42C 80 64 EA 682
DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Subject Code: BTCOC303

Apply
Apply

44 C4 2C 06 4E 6 2D A 48 22 B4 45 70 A 5C 42 8 64 EA 68 D

Creating
Creating
44 527 2C 80 4E A6 82 A F48 82 B4 45 270 6A 15 42 C8 064 EA 68 2D AF

Analyzing

Evaluating
5
Understand
Understand
Understand
(Level/CO)

44 27 06 80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
44 527 06 A1 64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22
EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82
44 527 06 A1 5C4
5 0
44 27 6 1 C4 C A 5 2 68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B
A 5 2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B

6
6
6
6
6
4
4
4
4

5
44 27 06 1 C4 2C 806 AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B
Marks

44 527 06 A1 5C4 2C 806 4E 48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B

http://www.batuonline.com
44 527 06 A1 5C4 2C 806 4E A6 82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22
44 527 06 A1 5C4 2C 806 4E A6 82D 2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B
5
44 527 06 A1 C4 2C 806 4E A6 82D A 44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B
44 527 06 A1 5C4 2C 806 4E A6 82D A F48 70 A 5C 42 8 64 A 68 DA F4 88 2B
44 527 06 A1 5C4 2C 806 4E A6 82D A F48 82 6A 15 42 C8 06 EA 68 2D F 88 22
5 A 5
44 27 06 1 C4 2C 806 4E A6 2D A 48 82 B4 8 F 2 15 C4 C8 06 4EA 68 2D AF 488 22 B
44 527 06 A1 5C4 2C 806 4E A6 82D A F48 82 2B4 45 C4 2C 06 4E 6 2D A 48 22 B
44 527 06 A1 5C4 2C 806 4E A6 82D A F48 82 2B4 45 270 2C 80 4E A6 82 A F48 82 B
5 0 A 5 8 A
44 27 6 1 C4 2C 06 4E 6 2D A 48 2 B4 45 70 A 8 F 8 2 2 6 80 64E A6 82 DA F4 82 2B
A 5
44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B4 45 270 6A 15C F 2 64 A 82 DA F4 88 2B
EA 68 D F 88 22
4 52 06 A1 5C 2C 80 4 A 82 A F4 82 2B 45 27 6A 15 4 68 2D AF 488 22 B
44 4527 706 A1 5C4 42C 806 64E EA6 682D DA F48 882 2B4 445 270 06A 15C C42 2C8 2D AF 48 22 B
Q

Q.

52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06 AF 48 822 B
Q.4
C)

70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E 48 822 B
6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
4 4 E 6 82 B
C A 4 B
15 4 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 4 A 82 7 4 6 2B
2
C4 C 06 4E 6 2D A 48 22 B4 5 70 A 5C 42 8 64 A 68 D 4 E
F 2
2C 80 4E A6 82 A 48 82 B4 45 70 6A 15 42 C8 064 EA 68 2D F A
time.

80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22
B) Assum

b
o

EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82 B
A) What are

68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B 445

node iss 0.
Q 5 Solve the

2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B 44 27
Solve Any

i) red black
binary tree.
given order.

AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B 44 527 06

the opeeration.

48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B 44 527 06 A1

82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22 44 52 06 A1 5C
2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B4 52 70 A 5C 42
height of the tree.

44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B4 45 70 6A 15C 42 C8

b

t followin

52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06
A) What is graph? Fin
disadvaantages each
neitherr stack overfl

me, the follow

Explainn how to imp

J, B, D,

70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E
ng.

v) sparrse matrix vi)

6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
15 C4 C8 06 4EA 68 2D AF 488 22 B4 452 706 A1 5C 42C 80 64 EA 682
C) What is threaded binary

C4 2C 06 4E 6 2D A 48 22 B4 45 70 A 5C 42 8 64 EA 68 D
2C 80 4E A6 82 A F48 82 B4 45 270 6A 15 42 C8 064 EA 68 2D AF
80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22
EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82 B
v AVL treee

68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B 445

D F, N, K, O.

2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B 44 27
wing letters are

B) Explainn the in brieff the followiing

A Two off the following.

AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B 44 527 06

48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B 44 527 06 A1
82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22 44 52 06 A1 5C
2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B4 52 70 A 5C 42
44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B4 45 70 6A 15C 42 C8
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06
70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E
a

i
flow unless thhe total num
o

6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
15 C4 C8 06 4EA 68 2D AF 488 22 B4 452 706 A1 5C 42C 80 64 EA 682
a inserted into

C4 2C 06 4E 6 2D A 48 22 B4 45 70 A 5C 42 8 64 EA 68 D
2C 80 4E A6 82 A F48 82 B4 45 270 6A 15 42 C8 064 EA 68 2D AF
80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
h of the linkeed list over another.

64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22
EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82 B
togetheer is N. Notee that, Push()) and Pop() operations

**** End ***

68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B 445

2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B 44 27
AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B 44 527 06
48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B 44 527 06 A1
82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22 44 52 06 A1 5C
tree ii)) m-way seaarch tree iii) b tree iv) b+ tree

2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B4 52 70 A 5C 42
44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B4 45 70 6A 15C 42 C8
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06
4452706A15C42C8064EA682DAF48822B

70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E
6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
a the differrent types off the linked list? Give addvantages andd

15 C4 C8 06 4EA 68 2D AF 488 22 B4 452 706 A1 5C 42C 80 64 EA 682

C4 2C 06 4E 6 2D A 48 22 B4 45 70 A 5C 42 8 64 EA 68 D
O Construct binary searcch tree and also

2C 80 4E A6 82 A F48 82 B4 45 270 6A 15 42 C8 064 EA 68 2D AF

i) Pushh(f) ii) Pop(ttop) iii) Pussh(g) iv) Pussh(h) v) Popp(top) vi) Puush(i)

80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22
a give

EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82 B
shhould be runn in O (1)

68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B 445

mber of elements in both the stacks

trees? Give the thrreaded binarry tree of thee following

an emptty binary seaarch tree in

2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B 44 27
in ordeer. Show the stack top annd any other situation raiised while dooing each off

plement twoo stacks in onne array A[11 . . N] in succh a way thaat

AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B 44 527 06

nd the shorteest path usingg Dijkstra allgorithm. Asssume startinng

48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B 44 527 06 A1

82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22 44 52 06 A1 5C
2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B4 52 70 A 5C 42
44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B4 45 70 6A 15C 42 C8
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B 45 27 6A 15 4 C 06
70 A 5C 42 8 64 A 68 DA F4 88 2B 44 27 06 1 C4 2C 80 4E
6A 15 42 C8 06 EA 68 2D F 88 22 4 52 06 A1 5C 2C 80 64 A
15 C4 C8 06 4EA 68 2D AF 488 22 B4 452 706 A1 5C 42C 80 64 EA 682
Remem

Applyy
Applyy
Applyy

C4 2C 06 4E 6 2D A 48 22 B4 45 70 A 5C 42 8 64 EA 68 D
2C 80 4E A6 82 A F48 82 B4 45 270 6A 15 42 C8 064 EA 68 2D AF
Evaluatting
mber

Understtand

80 64E A6 82 DA F4 82 2B 45 27 6A 15 C4 C8 06 EA 68 2D AF 488
64 A 82 DA F4 88 2B 44 27 06 15 C4 2C 06 4E 6 2D A 48 22
EA 68 D F 88 22 44 52 06 A1 C 2C 80 4E A6 82 A F4 82
68 2D AF 488 22 B44 52 706 A1 5C 42C 80 64E A6 82 DA F4 882 2B
2D AF 48 22 B4 52 70 A 5C 42 80 64 A 82 DA F4 88 2B
6
6
6
6
6
6

AF 48 822 B4 452 70 6A 15C 42 C8 64 EA 682 DA F4 88 22B

48 822 B4 452 70 6A 15C 42 C8 064 EA 68 DA F4 88 22B
http://www.batuonline.com

82 B 45 70 6A 15 42 C8 06 EA 68 2D F 88 22
2B 44 27 6A 15 C4 C 06 4E 6 2D AF 48 22 B
44 527 06 1 C4 2C 806 4E A6 82D A 48 82 B
52 06 A1 5C 2C 80 4E A 82 A F4 82 2B
70 A 5C 42 8 64 A 68 DA F4 88 2B
6 1 C 0 E 6 2 8 2
 6 5 2
EE E76 137 7CD DEF FD5 5C5 70E E52 75E E11
1 C 7 7 5
E7 7613 37C CDE EFD D5C 570 0E5 5275 5E1 115 F8A
6 7 D F 5 5 E 2 E 1 F
76 137 CD EF D5 C5 70E 52 75E 11 5F8 8A8 8CA
1 C E D C 70 5 7 1 5 A C E
13 37C DE FD 5C5 570 E52 275 5E11 15F F8A 8C AE E76
D F 5 E A E
37 7CD EF D5 C57 70E 527 75E E115 5F8 8A8 8CA EE 761 137
CD EF D5 C5 0E 52 5E 11 F A8 CA EE 76 37 CD
CD EF D5 C5 70E 52 75E 11 5F 8A8 CA EE 76 137 CD EF
7 7 5 8 1

B)
DE EFD D5C C57 0E5 527 5E1 115 F8A A8C CAE EE7 761 37C CDE EFD D5C
5 0 5 F 6 3 5
EF FD5 5C5 70E E52 275E E11 15F8 8A8 8CA AEE E76 137 7CD DEF FD5 5C5 70E
D C 7 0 5 7 5 1 5 F A C E 7 1 3 C E D C 7
FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C DE FD 5C 570 0E5 527
5 57 0E 27 5E 15 F8 8 A E 61 37 D F 5C 57 E 27 5E

Max Marks:60
5C C57 0E5 527 5E1 115 F8A A8C CAE EE7 761 37C CDE EFD D5C 570 0E5 527 5E1 115

(GCD).
57 0E5 27 5E 15 F8A 8C A E7 61 37C DE FD 5C 57 E5 27 5E1 15 F8A
0E 27 5E 11 F8 8 A EE 61 37 D F 5 57 0E 27 5E 15 F8 8
52 5E 11 5F8 A8 CA EE 76 37 CD EF D5 C5 0E 52 5E 11 F8 A8 CA
75 11 5F A C E 76 13 CD E D C5 70 52 75 11 5F A C E

for
for
for
for
E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5 75 E1 5F 8A 8C AE E7
15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61
F8 8 A E 61 37 D F 5C 57 0E 27 5E 15 F8 8 A E 61 37
A8 CA EE 76 37 CD EF D5 5 0E 52 5E 11 F8 A8 CA EE 76 37 CD
CA EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF

Q. 3 Solve the following.

Q.2 Solve the following.
EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5
76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5 C5
Subject Name: Data Structures

13 C E D C5 70 52 75 11 5F A C E 76 13 CD E D C5 70
7C DE FD 5C 70 E5 75 E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5
DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27

x = x + 1;
FD 5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 0E5 27 5E1
Instructions to the Students:

5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 E5 27 5E1 15

i : = 1 to n
j : = i + 1 to n

l : = k + 1 to
57 0E5 27 5E 15 F8A 8C A E7 61 37C DE FD 5C 57 E5 27 5E1 15 F8A

k : = j + 1 to n
0E 27 5E 11 F8 8 A EE 61 37 D F 5 57 0E 27 5E 15 F8 8

new item (k,e) in the skip list S.

Q. 1 Solve Any Two of the following.
52 5E 11 5F8 A8 CA EE 76 37 CD EF D5 C5 0E 52 5E 11 F8 A8 CA
Course: B. Tech in Computer Engineering

75 11 5F A C E 76 13 CD E D C5 70 52 75 11 5F A C E

n
E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5 75 E1 5F 8A 8C AE E7
15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61
F8 8 A E 61 37 D F 5C 57 0E 27 5E 15 F8 8 A E 61 37

Elements are 28, 55,71,67,11,10,90,44.

A8 CA EE 76 37 CD EF D5 5 0E 52 5E 11 F8 A8 CA EE 76 37 CD
CA EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF
EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5
76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5 C5
13 C E D C5 70 52 75 11 5F A C E 76 13 CD E D C5 70
7C DE FD 5C 70 E5 75 E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5
Date: 30/05/2019

DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27
undefined

FD 5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 0E5 27 5E1

5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 E5 27 5E1 15
57 0E5 27 5E 15 F8A 8C A E7 61 37C DE FD 5C 57 E5 27 5E1 15 F8A
0E 27 5E 11 F8 8 A EE 61 37 D F 5 57 0E 27 5E 15 F8 8
1. Solve ANY FIVE questions out of the following.

52 5E 11 5F8 A8 CA EE 76 37 CD EF D5 C5 0E 52 5E 11 F8 A8 CA
75 11 5F A C E 76 13 CD E D C5 70 52 75 11 5F A C E
E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5 75 E1 5F 8A 8C AE E7
What is time complexity? Compute the frequency count for :

15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61
F8 8 A E 61 37 D F 5C 57 0E 27 5E 15 F8 8 A E 61 37
A8 CA EE 76 37 CD EF D5 5 0E 52 5E 11 F8 A8 CA EE 76 37 CD

15F8A8CAEE76137CDEFD5C570E5275E1
CA EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF
3. Use of non-programmable scientific calculators is allowed.

EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5

A) Explain sequential search. Write an algorithm for sequential search.

End Semester Examination – Summer 2019

76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5 C5

13 C E D C5 70 52 75 11 5F A C E 76 13 CD E D C5 70
7C DE FD 5C 70 E5 75 E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5

B) Using linear probing insert the following values in hash table of size 10.
4. Assume suitable data wherever necessary and mention it clearly.

DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27

B) What is skip list? Give its representation .Write an algorithm to insert

FD 5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 0E5 27 5E1 C) What is an algorithm? Write an algorithm to find Greatest common divisor
A) What is Data Structure? Explain the various characteristics of an algorithm

A) Write a “C” code to find the transpose of a sparse matrix stored in this way.
5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 E5 27 5E1 15
57 0E5 27 5E 15 F8A 8C A E7 61 37C DE FD 5C 57 E5 27 5E1 15 F8A
which the question is based is mentioned in ( ) in front of the question.

0E 27 5E 11 F8 8 A EE 61 37 D F 5 57 0E 27 5E 15 F8 8
52 5E 11 5F8 A8 CA EE 76 37 CD EF D5 C5 0E 52 5E 11 F8 A8 CA
75 11 5F A C E 76 13 CD E D C5 70 52 75 11 5F A C E
E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5 75 E1 5F 8A 8C AE E
15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27 E1 15 8A 8C AE E7
F8 8 A E 61 37 D F 5C 57 0E 27 5E 15 F8 8 A E 6
A8 CA EE 76 37 CD EF D5 5 0E 52 5E 11 F8 A8 CA EE 76
CA EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 1
2. The level question/expected answer as per OBE or the Course Outcome (CO) on
DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137

76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137
13 C E D C5 70 52 75 11 5F A C E 76 13 C
7C DE FD 5C 70 E5 75 E1 5F 8A 8C AE E7 13 7C
DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C D
FD 5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE
Duration: 3 Hr.
Sem: III

5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE

Subject Code: BTCOC303

8
4
6
6
6
6
6
(Level/CO) Marks

57 0E5 27 5E 15 F8A 8C A E7 61 37C DE F

0E 27 5E 11 F8 8 A EE 61 37 D F
52 5E 11 5F8 A8 CA EE 76 37 CD EF D5
75 11 5F A C E 76 13 CD E D
E1 5F 8A 8C AE E7 13 7C E FD 5C
15 8A 8C AE E7 61 7C DE FD 5C
F8 8 A E 61 37 D F 5C 57
A C E 7 3 C E D
 6 5 2
EE E76 137 7CD DEF FD5 5C5 70E E52 75E E11
1 C 7 7 5
E7 7613 37C CDE EFD D5C 570 0E5 5275 5E1 115 F8A
6 7 D F 5 5 E 2 E 1 F
76 137 CD EF D5 C5 70E 52 75E 11 5F8 8A8 8CA
1 C E D C 70 5 7 1 5 A C E
13 37C DE FD 5C5 570 E52 275 5E11 15F F8A 8C AE E76
D F 5 E A E
37 7CD EF D5 C57 70E 527 75E E115 5F8 8A8 8CA EE 761 137
CD EF D5 C5 0E 52 5E 11 F A8 CA EE 76 37 CD
CD EF D5 C5 70E 52 75E 11 5F 8A8 CA EE 76 137 CD EF
7 7 5 8 1
DE EFD D5C C57 0E5 527 5E1 115 F8A A8C CAE EE7 761 37C CDE EFD D5C
5 0 5 F 6 3 5
EF FD5 5C5 70E E52 275E E11 15F8 8A8 8CA AEE E76 137 7CD DEF FD5 5C5 70E
D C 7 0 5 7 5 1 5 F A C E 7 1 3 C E D C 7
FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C DE FD 5C 570 0E5 527
5 57 0E 27 5E 15 F8 8 A E 61 37 D F 5C 57 E 27 5E
5C C57 0E5 527 5E1 115 F8A A8C CAE EE7 761 37C CDE EFD D5C 570 0E5 527 5E1 115

example
57 0E5 27 5E 15 F8A 8C A E7 61 37C DE FD 5C 57 E5 27 5E1 15 F8A
0E 27 5E 11 F8 8 A EE 61 37 D F 5 57 0E 27 5E 15 F8 8
52 5E 11 5F8 A8 CA EE 76 37 CD EF D5 C5 0E 52 5E 11 F8 A8 CA
75 11 5F A C E 76 13 CD E D C5 70 52 75 11 5F A C E
E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5 75 E1 5F 8A 8C AE E7
15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61
F8 8 A E 61 37 D F 5C 57 0E 27 5E 15 F8 8 A E 61 37
A8 CA EE 76 37 CD EF D5 5 0E 52 5E 11 F8 A8 CA EE 76 37 CD
CA EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF

Q.6 Solve the following.

Q. 5 Solve the following.
Q.4 Solve the following.

EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5

76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5 C5
13 C E D C5 70 52 75 11 5F A C E 76 13 CD E D C5 70
7C DE FD 5C 70 E5 75 E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5
DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27
FD 5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 0E5 27 5E1
5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 E5 27 5E1 15
57 0E5 27 5E 15 F8A 8C A E7 61 37C DE FD 5C 57 E5 27 5E1 15 F8A
0E 27 5E 11 F8 8 A EE 61 37 D F 5 57 0E 27 5E 15 F8 8
52 5E 11 5F8 A8 CA EE 76 37 CD EF D5 C5 0E 52 5E 11 F8 A8 CA
75 11 5F A C E 76 13 CD E D C5 70 52 75 11 5F A C E
E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5 75 E1 5F 8A 8C AE E7
15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61

.
F8 8 A E 61 37 D F 5C 57 0E 27 5E 15 F8 8 A E 61 37
A8 CA EE 76 37 CD EF D5 5 0E 52 5E 11 F8 A8 CA EE 76 37 CD
CA EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF
EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5
76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5 C5
13 C E D C5 70 52 75 11 5F A C E 76 13 CD E D C5 70
7C DE FD 5C 70 E5 75 E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5
Dequeue and traverse operation of circular queue

DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27
undefined

FD 5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 0E5 27 5E1

*** End ***

5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 E5 27 5E1 15
57 0E5 27 5E 15 F8A 8C A E7 61 37C DE FD 5C 57 E5 27 5E1 15 F8A
0E 27 5E 11 F8 8 A EE 61 37 D F 5 57 0E 27 5E 15 F8 8
52 5E 11 5F8 A8 CA EE 76 37 CD EF D5 C5 0E 52 5E 11 F8 A8 CA
75 11 5F A C E 76 13 CD E D C5 70 52 75 11 5F A C E
B) Convert the A*B+C/D expression into postfix using stack
CREATE AT END2) DELETE AT START3) TRAVERSE

E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5 75 E1 5F 8A 8C AE E7
15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61
A) Explain breadth first search technique for graph traversal.

F8 8 A E 61 37 D F 5C 57 0E 27 5E 15 F8 8 A E 61 37
A8 CA EE 76 37 CD EF D5 5 0E 52 5E 11 F8 A8 CA EE 76 37 CD

15F8A8CAEE76137CDEFD5C570E5275E1
operations I) Insert into list II)Search for data III)Delete from list

CA EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF

EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5
76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137 CD EF D5 C5
B) What is a Binary Tree.Explain inorder and postorder traversals with

13 C E D C5 70 52 75 11 5F A C E 76 13 CD E D C5 70
7C DE FD 5C 70 E5 75 E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5
B) Construct algorithm for following operations on a Doubly Linked List1)

DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27
FD 5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 0E5 27 5E1
5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE FD 5C 570 E5 27 5E1 15
A) With the help of suitable example, explain following operation, Enqueue and
A) Write a program in C to create a singly linked list and perform the following

57 0E5 27 5E 15 F8A 8C A E7 61 37C DE FD 5C 57 E5 27 5E1 15 F8A

0E 27 5E 11 F8 8 A EE 61 37 D F 5 57 0E 27 5E 15 F8 8
52 5E 11 5F8 A8 CA EE 76 37 CD EF D5 C5 0E 52 5E 11 F8 A8 CA
75 11 5F A C E 76 13 CD E D C5 70 52 75 11 5F A C E
E1 5F 8A 8C AE E7 13 7C E FD 5C 70 E5 75 E1 5F 8A 8C AE E
15 8A 8C AE E7 61 7C DE FD 5C 57 E5 27 E1 15 8A 8C AE E7
F8 8 A E 61 37 D F 5C 57 0E 27 5E 15 F8 8 A E 6
A8 CA EE 76 37 CD EF D5 5 0E 52 5E 11 F8 A8 CA EE 76
CA EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 1
EE 76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137
76 137 CD EF D5 C5 70E 52 75E 11 5F8 A8 CA EE 76 137
13 C E D C5 70 52 75 11 5F A C E 76 13 C
7C DE FD 5C 70 E5 75 E1 5F 8A 8C AE E7 13 7C
DE FD 5C 57 E5 27 E1 15 8A 8C AE E7 61 7C D
FD 5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE
5C 57 0E5 27 5E1 15 F8A 8C AE E7 61 37C DE
6
6
6
6
6
6

57 0E5 27 5E 15 F8A 8C A E7 61 37C DE F

0E 27 5E 11 F8 8 A EE 61 37 D F
52 5E 11 5F8 A8 CA EE 76 37 CD EF D5
75 11 5F A C E 76 13 CD E D
E1 5F 8A 8C AE E7 13 7C E FD 5C
15 8A 8C AE E7 61 7C DE FD 5C
F8 8 A E 61 37 D F 5C 57
A C E 7 3 C E D
 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Winter Examination – 2022
Course: B. Tech. Branch :Computer Engineering Semester :III
Subject Code & Name: BTCOC303 Data Structures
Max Marks: 60 Date: Duration: 3 Hr.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Write proper Syntax, example and program wherever necessary.
4. Assume suitable data wherever necessary and mention it clearly.
(Level/CO) Marks
Q. 1 Solve Any Two of the following. 12
A) What is a data structure? Why do we need data structures? Differentiate Remember 6
linear and non-linear data structure.
B) Explain the concept of sparse matrices. Understanding 6
C) Explain double hashing in data structure with its advantages and Understanding 6
disadvantages.

Q.2 Solve Any Two of the following. 12

A) What is Queue ADT? Explain representation and implementation of queue Synthesis 6
using sequential operations.
B) Explain applications of stack for Expression Evaluation. Understanding 6
C) What is priority queue ? Explain operations of priority queue. Analysis 6

Q. 3 Solve Any Two of the following. 12

A) Explain circular linked list data structure with its insertion and deletion Analysis 6
operations.
B) Write a C Program to implement following any two operations of doubly Apply 6
linked list.
1.insertion 2.deletion 3.display 4.search
C) Justify a linked list is a data structure that is based on dynamic memory Understanding 6
allocation. and List the application of Linked List Dynamic Memory
Allocation.

Q.4 Solve Any Two of the following. 12

A) What is Binary Search Tree? Write an algorithm to search an element in Remember 6
Binary search tree.
 B) Explain Adjacency matrix for an undirected graph and what will be the Synthesis 6
adjacency matrix for the below directed weighted graph?

Fig. Directed weighted graph

C) Explain Threaded Binary Tree and its types? State its advantages and Understanding 6
disadvantages.

Q. 5 Solve Any Two of the following. 12

A) What is a skip list? Write algorithm for basic skip list operations. Remember 6
B) Explain binary search algorithm by suitable example. Discuss the Analysis 6
complexity of Binary search algorithm.
C) Explain Insertion sort algorithm with suitable example. Discuss the Understanding 6
complexity of insertion sort.
*** End ***
The grid and the borders of the table will be hidden before final printing.
 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Supplementary Examination – Summer 2022
Course: B. Tech. SE Branch : CSE Semester :III
Subject Code & Name: Data Structure (BTCOC303)
Max Marks: 60 Date: Duration: 3 Hr.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Use of non-programmable scientific calculators is allowed.
4. Assume suitable data wherever necessary and mention it clearly.
(Level/CO) Marks
Q. 1 Solve Any Two of the following. (This is just a sample instruction)
A) Define array and show the representation of one-dimensional array is 06
memory.
B) Explain Abstract data types. 06
C) Write a c code to accomplish the following Stack Operations: i] insert 06
ii]delete iii]display iv]peek

Q.2 Solve Any Two of the following. (This is just a sample instruction)
A) Write an algorithm to convert infix expression to postfix expression 06
using stack.
B) Explain array and linked list representation of Binary tree. 06
C) What is queue and explain types of queue. 06

Q. 3 Solve Any One of the following. (This is just a sample instruction)

A) Explain representation of graph : A] adjacency matrix representation 06
B] adjacency list representation
B) Explain different file organization in detail. 06
C) Define and explain the following terms with an example: 06
1]Path and Cycle 2]Connected , Unconnected graph
3]Complete graph and weighted graph

Q.4 Solve Any Two of the following. (This is just a sample instruction)
A) What is Depth First Traversal ? Write an algorithm for Depth First 06
Traversals.
 B) Write an algorithm for binary search tree . Construct binary search 06
tree for the following list of numbers: 18,17,3,5,9,21,26,15,61,6,8,11.
C) What is Hashing and explain construction of a hash table. 06

Q. 5 Solve Any One of the following. (This is just a sample instruction)

A) Explain different file operations. 06
B) Explain Indexed sequential file in detail. 06
C) What is graph ? Explain matrix and linked list representation of a 06
graph.
*** End ***
The grid and the borders of the table will be hidden before final printing.
 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Supplementary Semester Examination – 2023
Course: B. Tech. Branch : Computer Engineering and Allied Semester : III
Subject Code & Name: Data Structures [BTCOC303]
Max Marks: 60 Date: 14/08/2023 Duration: 03:00 Hrs.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Use of non-programmable scientific calculators is allowed.
4. Assume suitable data wherever necessary and mention it clearly.
(Level/CO) Marks
Q. 1 Solve Any Two of the following. [12]
A) Define the following terms: Remember
i) Classification of Data Structure ii) Abstract Data Types
iii) Transpose of Matrix
B) What is the Sparse Matrix. Write a C program to convert a sparse matrix, an Understand
input provided by a user into its triplet representation.
C) Consider the following 4-digit employee numbers: 3205 and 7148. Find 2-digit Application
hash address of each number using a) division method (m = 97); b) midsquare
method; c) folding method without reversing.

Q.2 Attempt the following questions. [12]

A) Define Queue. Write an algorithm to perform an Enqueue and Dequeue Understand
operations on the Queue.
B) Write an algorithm to convert Infix expression to Postfix expression. Consider Application
the following Infix expression Q and translate Q into its equivalent Postfix

Q: A + ( B * C – ( D / E ↑ F ) * G ) * H
expression P.

Q. 3 Solve Any Two of the following. [12]

A) Explain the following concepts: Understand
a) Garbage Collection b) Dynamic Memory Allocation
B) Write a pseudo code for the performing following operations in the Single Link Understand
List:
a) Insert the elements at the end
b) Delete the element from the beginning
C) Write a pseudo code for the performing following operations in the Circular Link Understand
List:
a) Insert the elements at the beginning
b) Delete the element from the end
Q.4 Attempt the following questions. [12]

A) Consider the following weighted graph G. Find the shortest path between the Application
nodes using Warshall’s Algorithm.

B) Define the the following terms: Application

i) Siblings ii) Leaf Node iii) Ancestor of Node

Following numbers are inserted into an empty binary search tree. Find the final
tree T.
25, 20, 10, 36, 22, 5, 1, 8, 30, 12, 15, 40, 28, 38, 48, 45, 50

Q. 5 Attempt the following questions. [12]

A) Write a pseudo code for Linear Searching. Understand

B) Consider the following array consisting of 8 elements. Use insertion sort to Application
arrange the elements in the Ascending order.
77, 33, 44, 11, 88, 22, 66, 55
*** End ***
 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Regular & Supplementary Winter Examination-2023
Course: B. Tech. Branch : Computer Engineering / Computer Science
Engineering / Computer Science & Engineering (Artificial Intelligence) / Computer
Science & Design / Computer Science & Engineering (Artificial Intelligence &
Machine Learning) Semester : III

Subject Code & Name: Data Structure (BTCOC303)

Max Marks: 60 Date:06-01-24 Duration: 3 Hr.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Use of non-programmable scientific calculators is allowed.
4. Assume suitable data wherever necessary and mention it clearly.
(Level/CO) Marks
Q. 1 Solve Any Two of the following. 12
A) What is Data Structure? Explain the various characteristics of an algorithm. Understand 6
B) What is sparse matrix? Explain the representation of it. Understand 6
C) What is primitive data structure? Enlist the differences between primitive Analyze 6
and non-primitive data structures.

Q.2 Solve Any Two of the following. 12

A) Explain various stack operations with example. Understand 6
B) Write Algorithms for enqueue and dequeue operations on queue with Evaluate 6
example.

C) Convert the following infix expression to postfix expression. Create 6

A / B ^ C +D * E – A * C

Q. 3 Solve Any Two of the following. 12

A) What are advantages and disadvantages of linked list? Understand 6
B) Write differences between array and linked list. Analyze 6
C) Describe doubly link list (DLL) operations. Evaluate 6

Q.4 Solve Any Two of the following. 12

A) What are the properties of binary search tree? Knowledge 6
B) Illustrate the binary tree traversal with example. Analyze 6
C) Explain Heap in binary tree with basic operations on binary heap. Understand 6
Q. 5 Solve Any Two of the following. 12
A) What is skip list? Explain the representation of it in detail. Understand 6
B) What is radix sort? Explain in detail with example. Analyze 6
C) Apply the insertion sort on following list. Create 6

25 79 41 9 34 60

*** End ***