3B

4F

5
48

F
Paper / Subject Code: 49373 / Data Structure

3A
FF

5F

EA
FE

3B
88
5A

A5

AF
F4
1T01873 - S.E. Computer Science & Engineering (Artificial Intelligence & Machine Learning

E4

5F
78

B3
AF
) (R-2019) SEMESTER - III / 49373 - Data Structure

5E
4F

88
15

F3
85
QP CODE: 10027655 DATE: 30/05/2023.

3A
E4
FF
EA

85
57

3B
4F
5A
78

48
A1
(3 Hours) Total Marks: 80

FF

5F
78
9D

FE
8E

88
5A
15
BC

F4

F3
D7

E4
N.B: (1) Question No. 1 is compulsory

EA

78

AF

85
AF

C9

4F
15
(2) Attempt any three questions out of the remaining five questions

78

48
85
5E

FF
FB

EA
9D

FE
57
3A

5A
EA

78
BC

F4
A1
3B

78
Q.1 (a)

9D
A5
Explain various types of data structures with example.

AF
5

AF

8E

15
5F

BC

F4
B3

85
D7
(b)

5E

EA
Define Graph and explainvarious graph representationtechniques. 5

88

AF
57
AF
F3

3A

C9
E4

78
I Convert the following expression to postfix.

A1
85

85
5E
5

FB
3B
4F

9D
(f-g) * ((a+b) * (c-d))/e

48

57
8E
3A
FF

5F

EA

BC
(d)
FE

A1
D7
Differentiate between B tree and B+ tree. 5

3B
88
5A

A5

AF
F4

8E
C9
E4

5F
78

A1
B3
AF

D7
5E

FB
4F

88
15

F3

8E
Q.2 (a) Apply linear probing and quadratic probing hash functions to insert values in the
85

3A

C9
E4
FF

EA
EA

85

D7
57

Hash table of size 10. Show number of collisions occurs in each technique. 10

FB
3B
4F
5A

A5
78

48
A1

27, 72, 63, 42, 36, 18, 29,101

C9
FF

5F

EA
78
9D

FE

B3
8E

(b) Construct B+ tree of order 3 for the following dataset

FB
88
5A
15

A5
10
BC

F4

F3
D7

90, 27, 7, 9, 18, 21, 3, 4, 16, 11, 1, 72

E4

EA
EA

78

B3
AF

85
AF

C9

4F
15

A5
78

48

F3
85
5E

FF
FB

EA
9D

FE

B3
Q.3 (a) Write BFS algorithm. Show BFS traversal for the following graph with all the

85
57
3A

5A
EA

78
BC

48
F4

F3
steps.
A1
3B

78
9D

FE
A5

AF

85
AF

8E

15
5F

BC

48
F4
B3

85
D7
5E

EA
88

FE
AF
57
AF
F3

3A

C9

10
E4

78

F4
A1
85

85
5E

FB
3B
4F

9D

AF
48

57
8E
3A
FF

5F

EA

BC
FE

A1

85
D7
3B
88
5A

A5

57
AF
F4

8E
C9
E4

5F
78

A1
B3
AF

D7
5E

FB
4F

88
15

(b)
F3

8E

Write a C program to implement linear queue using array. 10

85

3A

C9
E4
FF

EA
EA

85

D7
57

FB
3B
4F
5A

A5
78

48
A1

C9
FF

Q.4 (a) Write a program to perform the following operations on the Singly linked list:
5F

EA
78
9D

FE

B3
8E

FB
88
5A

i. Insert a node at the end

15

A5
F4

F3
D7

E4

EA
EA

ii. Delete a node from the beginning 10

78

B3
AF

85
C9

4F

iii. Search for a given element in the list

15

A5
78

48

F3
85

FF
FB

EA

iv. Display the list

9D

FE

B3
85
57

5A
EA

(b) Write a C program to implement Stack using Linked List

78
BC

48
F4

F3
A1

10
78
9D

FE
A5

AF

85
AF

8E

15
BC

48
F4
85
D7
5E

EA

FE
AF
57
AF
3A

Q.5 (a)
C9

Write a program to evaluate postfix expression using stack data structure 10

78

F4
A1

85
5E

FB
3B

9D

AF

(b) Construct AVL for following elements

57
8E
3A

10
5F

EA

BC

A1

50, 25, 10, 5, 7, 3, 30, 20, 8, 15

85
D7
3B
88

A5

57
AF

8E
C9
5F

A1
B3

D7
5E

FB
88

Q.6 (a) Construct Binary Tree from following traversal.

F3

8E
3A

C9
E4

EA

In–order Traversal: D B H E I A F J C G 10
85

D7
FB
3B
4F

A5

Post order Traversal: D H I E B J F G C A

48

C9
FF

5F

EA

(b)
FE

B3

Write a C program for polynomial addition using a Linked-list. 10

FB
88
5A

A5
F4

F3
E4

______________________________
EA
B3
AF

85
4F

A5
48

F3
85

FF

FE

B3
85
57

5A

27655 Page 1 of 1
48
F4

F3
A1

78

FE
AF

85
8E

15

48
F4
85
EA

FE
AF
57

9D78EA15785AFF4FE4885F3B3A5EAFBC
78

F4
A1

85