Total No. of Questions : 8] SEAT No.

: OR

8
23

23
P-9671 [Total No. of Pages : 2 Q4) a) Write pseudocode to perform addition of two polynomials using doubly

ic-

ic-
linked lists into third list. Write time complexity of it. [9]
[6179]-241

tat

tat
b) Write and explain node structure of Circular Singly Linked List and Doubly

6s

6s
S.E. (Computer Engineering A.I & D.S.) Linked list. Write pseudocode for concatenation of two doubly linked

8:4

8:4
1

1
FUNDAMENTALS OF DATA STRUCTURES lists. [9]

9:3

9:3
2/2 309

2/2 309
(2019 Pattern) (Semester - III) (210242)

30

30
1

1
Q5) a) Write rules to convert given infix expression to postflx expression using
02

02
P0

P0
Time : 2½ Hours] [Max. Marks : 70 stack. Convert expression (P * Q – (L + M * N) ^ (X * Y / Z) stepwise
Instructions to the candidates: using above rules.
G

G
9/1

9/1
1) Answer to the questions (Q.No.1 or Q.No.2, Q.No.3 or Q.No.4, Q.No.5 or Q.No.6,
CE

CE
Where ^ is - exponential operator. [8]
82

82
8

8
Q.No.7 or Q.No.8).

23

23
.23

.23
b) Explain with example three different types of recursion. [9]

ic-

ic-
2) Assume suitable data, if necessary.
16

16
tat

tat
3) Draw neat labelled diagram wherever necessary. OR
8.2

8.2
6s

6s
4) Figures to the right indicate full marks. Q6) a) Explain procedure to convert infix expression to prefix expression and
.24

.24
8:4

8:4
postfix evaluation with suitable example. [8]
1

1
49

49
9:3

9:3
9

9
Q1) a) Sort the following numbers step by step using insertion sort : [9] b) Write pseudo-C/C++ code to implement stack using Singly linked list
30

30
30

30
55, 85, 45, 11, 34, 5, 89, 99, 67 with overflow and underfiow conditions. [9]
01

01
02

02
Comment on time complexity of Insertion sort
2/2

2/2
.23 GP

.23 GP
b) Explain in brief any three searching techniques. What is the time complexity
9/1

9/1
of these techniques? [9] Q7) a) Draw and explain Circular queue using array. Write pseudocode for Add,
CE

CE
82

82
8

8
OR Remove operations. [8]

-23

-23
Q2) a) Explain Fibonacci Search algorithm with suitable example. What is it’s tic b) What is Doubly Ended Queue? Draw Dragram with labelling four basic

tic
16

16
time complexity? [9] operations at appropriate places. Which two data structures are combined
sta

sta
8.2

8.2
b) Given numbers 29, 57, 47, 39, 36, 20, 55, 28, 31, 39. Sort stepwise using in it and how? [9]
:46

:46
.24

.24
radix sort. When it is appropriate to use radix sort? Write time Complexity.
91

91
:38

:38
[9] OR
49

49
09

09
0

0
Q8) a) Write short note on : [8]
9/1 13

9/1 13
23

23
Q3) a) Write pseudo code for following function using Singly Linked List
20

20
i) Comparison of Circular Queue with Linear queue
0

0
of students (roll_number and name stored in every node) [9]
GP

GP
2/

2/
i) Search given roll no and delete that record. Draw diagram of ii) Priority Queue
operation.
CE

CE
82

82
ii) Add given number after specified number in the list. Draw b) Draw and explain implementation of Linear Queue using Singly Linked
.23

.23
diagram of operation. List. Explain Add, Remove, Queue Full and Queue Empty operations.[9]
16

16
b) Write and explain use of Generalized linked list for representation
8.2

8.2
of multivariable polynomial with suitable example. Explain node

.24

.24
structure. [9]
49

49
P.T.O. [6179]-241 2
Total No. of Questions : 8] SEAT No. : Q5) a) Write an algorithm for postfix evaluation with suitable example. [8]

8
23

23
PA-1234 [Total No. of Pages : 2 b) What is concept of recursion? Explain the use of stack in recursion with

ic-

ic-
[5925]-256 example. [9]

tat

tat
S.E. (Computer /AI&DS) OR

2s

2s
FUNDAMENTALS OF DATA STRUCTURES

7:0

7:0
Q6) a) What is need to convert the infix expression into postfix; convert the

1
(2019 Pattern) (Semester - III) (210242)

3:3

3:3
following expression into postfix expression (a+b) * d + e/(f + a*d) + c.

2/2 309

2/2 309
[8]

31

31
Time : 2½ Hours] 1 [Max. Marks : 70

1
Instructions to the candidates:
02

02
b) What is backtracking algorithm design strategy? How stack is useful in
P0

P0
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
2) Figures to the right indicate full marks.
backtracking [9]
G

G
6/0

6/0
3) Neat diagrams must be drawn wherever necessary.
CE

CE
4) Make suitable assumption whenever necessary.
80

80
8

8
Q7) a) Write pseudo C++ code to represent dequeue and perform the following

23

23
.23

.23
ic-

ic-
operations on dequeue: [8]
Q1) a) Write pseudo ‘Python’ algorithm (recursive) for binary search. Apply
16

16
tat

tat
your algorithm on the following numbers stored in array from A[0] to i) Create
8.2

8.2
2s

2s
A[10] 9, 17, 23,38,45,50,57,76,90,100 to search numbers 10 & 100.[9]
.24

.24
ii) Insert
7:0

7:0
1

1
b) Explain the quick sort algorithm. Show the contents of array after every
49

49
3:3

3:3
9

9
iii) Delete
itertion of your algorithm start from following status of array.-
30

30
31

31
27, 76, 17, 9, 57, 90, 45, 100, 79. [9] iv) Display
01

01
02

02
OR b) What is circular queue? Explain the advantages of circular queue area
2/2

2/2
.23 GP

.23 GP
linear queue. [9]
Q2) a) Explain in brief the different searching techniques. What is the time
6/0

6/0
CE

CE
complexity of each of them? [9] OR
80

80
8

8
-23

-23
b) Write an algorithm of selection sort and sort the following numbers using Q8) a) Define queue as an ADT. Write pseudo C++ code to represent queue.[8]
tic

tic
selection sort and show the contents of an array after every pass:-
16

16
b) Explain Array implementation of priority queue with all basic operations.
sta

sta
81, 5, 27, –6, 61, 93, 4, 8, 104, 15
8.2

8.2
[9] [9]
:02

:02
.24

.24
91

91
:37

:37
49

49
Q3) a) What is linked list? Write a pseudo C++ code to sort the elements. [9]
13

13
0

0
b) What is doubly linked list? Explain the process of deletion of an element
6/0 13

6/0 13
23

23
from doubly linked list with example. [9] 
20

20
0

0
OR
GP

GP
2/

2/
Q4) a) Explain Generalized Linked List with example. [9]
CE

CE
80

80
b) Write Pseudo C++ code for addition of two polynomials using singly
.23

.23
linked list. [9]
16

16
8.2

8.2
.24

.24
P.T.O.
49

49
[5925]-256 1 [5925]-256 2
Total No. of Questions : 8] SEAT No. : Q4) a) Write pseudocode to perform merging of two sorted singly linked lists

8
23

23
of integers into third list. Write complexity of it. [9]
PB3634 [Total No. of Pages : 2

ic-

ic-
[6261]-41 b) Write and explain node structure of Generalized linked list for representing

tat

tat
S.E. (Computer Engineering) (Artificial Intelligence & Data Science) multiple variable polynomial. Represent given polynomial graphically using

6s

6s
FUNDAMENTALS OF DATA STRUCTURES Generalized Linked List: 5x7 + 7xy6 + 11xz. [9]

3:0

3:0
1

1
(2019 Pattern) (Semester-III) (210242)

4:2

4:2
5/2 309

5/2 309
41

41
Time : 2½ Hours] [Max. Marks : 70 Q5) a) Write rules to convert given infix expression to postfix expression using
stack. Convert expression (A* B – (C + D * E) ˆ (F * G / H)) stepwise
1

1
Instructions to the candidates:
02

02
P0

P0
1) Attempt question Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8. using above rules.
2) Figures to the right indicate full marks.
G

G
Where ˆ is - exponential operator. [8]
7/0

7/0
3) Assume suitable data if necessary.
CE

CE
81

81
4) Neat diagrams must be drawn wherever necessary. b) Explain with example three different types of recursion. [9]

8
23

23
.23

.23
ic-

ic-
Q1) a) Sort given array by using bubble sort method: 64, 34, 25, 12, 22, 11, 90. OR
16

16
tat

tat
Show step by step execution for all the passes highlighting “swap” and
8.2

8.2
Q6) a) What is infix, prefix and postfix expression? Give example of each.

6s

6s
“No Swap” situations. How many passes are required to sort an array of Explain evaluation of postfix expression with suitable example expression
.24

.24
3:0

3:0
N elements using bubble sort? [9]
1

1
and assume values for variables used to solve it. [8]
49

49
4:2

4:2
b) Write an algorithm to search an element in array A using binary search
9

9
b) Write pseudo-C/C++ code to implement stack using array with overflow
30

30
technique. Show stepwise search of Key 10 in 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
41

41
11. Is there any pre-processing of data required before starting binary and underflow conditions. [9]
01

01
02

02
search or what is its precursor requirement? [9]
5/2

5/2
.23 GP

.23 GP
OR Q7) a) What are advantages of Circular Queue over Linear Queue using static
7/0

7/0
Q2) a) Enlist different searching methods. Write short note on [9] memory allocation? Write pseudocode to add and remove element from
CE

CE
81

81
i) Fibonacci Search

8
Circular Queue along with Queue Full and Empty condition. [8]

-23

-23
ii) Index Sequential Search
tic b) Draw and explain implementation of Linear Queue using Singly Linked

tic
b) Sort given array by using selection sort method 50, 23, 03, 18, 9, 01, 70,
16

16
List. Explain Add, Remove, Queue Full and Queue Empty operations.
sta

sta
21, 20, 6, 40, 04. Show step by step execution of all passes. What is the
8.2

8.2
best and worst case time complexity of selection sort? [9] [9]
:06

:06
.24

.24
OR
91

91
:23

:23
49

49
Q3) a) Write pseudo code for following function using Doubly Linked List of Q8) a) What is Doubly Ended Queue? Draw Diagram with labelling four basic
14

14
0

0
integer numbers [9] operations at appropriate places. Which two data structures are combined
7/0 13

7/0 13
24

24
i) Insert given value as last value in the list. Draw diagram of operation. in it and how? [6]
20

20
0

0
ii) Delete first node from the list. Draw diagram of operation.
GP

GP
b) Draw and explain Priority Queue? State any real life application. [6]
5/

5/
iii) Delete last node from the list. Draw diagram of operation.
b) Write and explain node structure of [9] c) Write pseudocode for Linear Queue Implementation using array. [5]
CE

CE
81

81
i) Generalized linked list.
.23

.23
ii) Circularly Singly Linked List.
Draw and explain insertion of value in Circularly Singly Linked List with eeee
16

16
example.
8.2

8.2
OR
.24

.24
49

49
[6261]-41 2
P.T.O.
Total No. of Questions : 8] SEAT No. :

8
23

23
P1527 [Total No. of Pages : 2 b) What are the variants of recursion. Explain with example. [9]
[6002]-156

ic-

ic-
tat

tat
S.E. ( Computer / AI & DS) OR

0s

0s
FUNDAMENTALS OF DATA STRUCTURE Q6) a) Write algorithm for posfix expression evalution. Explain with suitable

8:4

8:4
(2019 Pattern) (Semester - III) (210242) example. [8]

1
0:2

0:2
6/2 309

6/2 309
Time : 2½ Hours] [Max. Marks : 70 b) Explain the linked implementation of stack with suitable example. [9]

31

31
Instructions to the candidates:
1

1
02

02
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8. Q7) a) Write pseudo code to implement circular queue using array. Explain it’s
P0

P0
2) Figures to the right indicate full marks.
3) Neat diagrams must be drawn whenever necessary.
basic operation. [9]
G

G
4/0

4/0
4) Make suitable assumption whenever necessary.
CE

CE
b) Explain array implementation of priority queue with all basic operation.
81

81
8

8
23

23
Q1) a) Write a pseudo code for binary search apply you algorithm on the [8]
.23

.23
ic-

ic-
following no.s stored in an array to search no:23 & 100. [9]
16

16
tat

tat
9,17,23,40,45,52,58,80,85,95,100 OR
8.2

8.2
0s

0s
Q8) a) Explain linked implementation of queue with suitable example. [9]
.24

.24
b) Explain the selection sort with algorithm sort the following no.s using
8:4

8:4
1

1
selection sort & show the content of array after every pass. [9]
49

49
b) Write pseudo code for insertion operation of input restricted & output
0:2

0:2
9

9
27, 76, 17, 9, 45, 58, 90, 79, 100. restricted double ended queue. [8]
30

30
31

31
01

01
02

02
6/2

6/2
OR
.23 GP

.23 GP
Q2) a) Explain quick sort algorithm with suitable example. What is time
4/0

4/0
… … …
[9]
CE

CE
complexity of quick sort algorithm.
81

81
8

8
-23

-23
b) Write a short note on sentinel search & Index sequential search with tic

tic
16

16
suitable example. [9]
sta

sta
8.2

8.2
:40

:40
.24

.24
91

91
:28

:28
Q3) a) Write a pseudo code to insert new node in to singly link list. [9]
49

49
10

10
0

0
4/0 13

4/0 13
b) Explain the representation of polynomial using GLL. [9]
23

23
20

20
0

0
OR
GP

GP
6/

6/
Q4) a) What is doubly linkedlist. Explain the process of deletion of element
CE

CE
from doubly linked list with example. [9]
81

81
.23

.23
b) What is dynamic data structure. Explain with circular linked list with it’s
16

16
basic operation. [9]
8.2

8.2
.24

.24
Q5) a) Write a pseudo code for basic operation of stack. [8]
P.T.O.
49

49
[6002]-156 1 [6002]-156 2
Total No. of Questions : 8] SEAT No. : Q3) a) Show that the following graphs are isomorphic [7]

8
23

23
PB3633 [6261]-40
[Total No. of Pages :4

ic-

ic-
tat

tat
S.E. (Computer Engg.) (Artificial Intelligence & Data Science Engg.)

1s

1s
(Computer Science & Design Engg.)

4:2

4:2
DISCRETE MATHEMATICS

1
3:5

3:5
5/2 309

5/2 309
(2019 Pattern) (Semester - III) (210241)

41

41
Time : 2½ Hours] [Max. Marks : 70
1

1
02

02
Instructions to the candidates: b) List and explain the necessary and sufficient conditions for Hamiltonian
P0

P0
1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8. and eulerian path with suitable examples. [5]
2) Neat diagrams must be drawn whenever necessary.
G

G
5/0

5/0
3) Figures to the right indicates full marks. c) Define the graph Kn and Kmn [5]
CE

CE
81

81
8

8
4) Assume suitable data if necessary.

23

23
.23

.23
OR

ic-

ic-
Q1) a) From a group of 7 men and 6 women, five persons are to be selected to
16

16
tat

tat
from a committee so that at least 3 men are there on the committee. In
8.2

8.2
Q4) a) Use dijkstras algorithm to find the shortes path between A and Z in

1s

1s
how many ways can it be done? [6] figure. [7]
.24

.24
4:2

4:2
1

1
49

49
3:5

3:5
b) How many 3-digit numbers can be formed from the digits 2,3,5,6,7 and
9

9
30

30
9, which are divisible by 5 and none of the digits is repeated? [6]
41

41
01

01
02

02
c) How many 6-digit odd numbers greater than 6,00,000 can be formed
5/2

5/2
from the digits 5,6,7,8,9, and 0 [6]
.23 GP

.23 GP
5/0

5/0
i) If repetition is allowed.
CE

CE
81

81
8

8
-23

-23
ii) If repitition is not allowed b) Draw a complete bipartite graph on 2 and 4 vertices K2,4 and 2 and 3
tic vertices K2,3. [5]

tic
16

16
OR
sta

sta
8.2

8.2
c) Under What condition Km,n will have eulerian circuit [5]
:21

:21
Q2) a) In how many different ways can the letters of the word ‘OPTICAL’ be
.24

.24
91

91
arranged so that the vowels always come together [6]
:54

:54
49

49
13

13
0

0
b) If a committee has eight members. [6]
5/0 13

5/0 13
24

24
Q5) a) Define following terms [6]
i) How many way can the committee members be seated in a row?
20

20
0

0
GP

GP
5/

5/
ii) How many way can the committee select a president, vice-precident i) Level of a tree
and secretary
CE

CE
81

81
ii) Height of a tree
.23

.23
c) In a certain country, the car number plate is formed by 4 digits from the
digits 1,2,3,4,5,6,7,8 and 9 followed by 3 letters from the alphabet. How iii) Fundamental circuit
16

16
many number plates can be formed if neither the digits nor the letters are
8.2

8.2
repeated? [6]
.24

.24
P.T.O.
49

49
[6261]-40 1 [6261]-40 2
 b) Use labeling procedure to find a maximum flow in the transport network Q7) a) Define: [6]

8
23

23
given in the following figure. Determine the corresponding minimum cut.[6]
i) Cyclic group

ic-

ic-
tat

tat
ii) Abelian group

1s

1s
4:2

4:2
iii) Cosets

1
3:5

3:5
5/2 309

5/2 309
b) Let Z n  0,1,2,....n  1 . Constract the multiplication table for n=6. Is

41

41
 Z n ,*
an abelian group. Where* is a binary operation on Zn such that
1

1
02

02
c) Construct Minimal spanning tree for the following graphs using prims
P0

P0
a*b = remainder of a*b divided by n [6]
algorithm [6]
G

G
5/0

5/0
c) Let (A,*) be a group, show that (A,*) is an abelian group iff
CE

CE
81

81
a2 * b2 = (a*b)2

8
[5]

23

23
.23

.23
ic-

ic-
OR
16

16
tat

tat
8.2

8.2
Q8) a) Define: [6]

1s

1s
.24

.24
4:2

4:2
i) Group codes
1

1
49

49
3:5

3:5
9

9
OR
30

30
ii) Subgroup
41

41
01

01
02

02
Q6) a) Define following terms [6] iii) Integral domain
5/2

5/2
.23 GP

.23 GP
i) Forest b) Let (A,*) be an algebraic system where * is a binary operation such that
5/0

5/0
for any a,b, belongs to A, a*b=a [6]
CE

CE
81

81
ii) Fundamental cutsets

8
-23

-23
i) Show that * is an associated operation
iii) Game tree tic

tic
16

16
ii) Can * ever be a communtative operation?
sta

sta
8.2

8.2
b) Construct Minimal spanning tree of the following graphs using kruskals
:21

:21
c) Prove that the set Z of all integers with binary operation * defined by
.24

.24
algorithm [6]
a* b = a+b+1 such that for all a,b belonging to Z is an abelian group[5]
91

91
:54

:54
49

49
13

13
0

0
5/0 13

5/0 13
24

24

20

20
0

0
GP

GP
5/

5/
CE

CE
81

81
.23

.23
16

16
c) Construct an optimal tree for 10,11,14,21,16,18 using Huffman conding
8.2

8.2
[6]
.24

.24
49

49
[6261]-40 3 [6261]-40 4
Total No. of Questions : 8] SEAT No. : Q3) a) Find the shortest path between a - z for the given graph using Dijkstra’s

8
23

23
P1526 [Total No. of Pages : 4 algorithm [6]

ic-

ic-
[6002]-155

tat

tat
S.E. (Computer/A.I.& D.S./C.S & D.E.)

8s

8s
5:0

5:0
DISCRETE MATHEMATICS

1
0:4

0:4
(2019 Pattern) (Semester-III)(210241)

7/2 309

7/2 309
31

31
Time : 2½ Hours] [Max. Marks : 70
1

1
02

02
P0

P0
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
G

G
5/0

5/0
2) Neat diagram must be drawn whenever necessary.
CE

CE
3) Figures to the right indicate full marks.
80

80
8

8
4) Assume suitable data if necessary.

23

23
b) Explain the terms adjacency matrix and incidence matrix. [5]
.23

.23
ic-

ic-
c) Define the following terms with suitable example. [6]
16

16
Q1) a) From a group of 7 men and 6 women, five persons are to be selected to

tat

tat
8.2

8.2
form a committee so that at least 3 men are there on the committee. In i) Factor of graph

8s

8s
.24

.24
5:0

5:0
how many ways can it be done? [6] ii) Weighted Graph
1

1
49

49
0:4

0:4
b) Suppose repetitions are permitted: [6]
9

9
iii) Bipartite graph
30

30
31

31
i) How many ways three-digit no. can be formed from six digits
OR
01

01
02

02
2,3,4,5,7 and 9?
Q4) a) Draw all isomorphic graphs on vertices 2 and 3, also draw all non-iso-
7/2

7/2
.23 GP

.23 GP
ii) How many are multiple of 10?
morphic graphs on 2,3 and 4 vertices. [6]
5/0

5/0
iii How many are even?
CE

CE
80

80
b) Explain Edge connectivity and Vertex Connectivity with suitable example.

8
c) What is the coefficient of x09 in the expansion of (2–x)19? [6]

-23

-23
[5]
OR tic

tic
16

16
c) Is it possible to construct a graph with 12 nodes such that 2 of the nodes
sta

sta
Q2) a) Five pencils and 5 pens are to be arranged in a row. In how many ways
8.2

8.2
have degree 3 and the remaining have degree 4. [6]
they can be arranged if [6]
:08

:08
.24

.24
91

91
:45

:45
i) All pencils must be arranged together
49

49
Q5) a) Construct a binary tree from given inorder and preorder traversals:
10

10
ii) No two pencils should be kept together and
0

0
5/0 13

5/0 13
23

23
iii) One pen and one pencil must be arranged together? Inorder : b d f h k m p t v m
20

20
0

0
b) Find the number of permutations that can be made out of the letters [6] Preorder : b f d k h v w t m [6]
GP

GP
7/

7/
i) Mississippi
b) Define following terms [6]
CE

CE
80

80
ii) Assassination
i) Forest
.23

.23
c) How many automobile license plates can be made if each plate contains
ii) Fundamental cutsets
16

16
two different letters followed by three different digits. Solve the problem
8.2

8.2
if the first digit can not be zero. [6] iii) Game tree
.24

.24
P.T.O.
49

49
[6002]-155 1 [6002]-155 2
 c) Use Kruskal’s algorithm to find the minimum spanning tree for the con- Q7) a) Define with examples: [10]

8
23

23
nected weighted graph G as shown in fig. below [6] i) Groupoid

ic-

ic-
tat

tat
ii) Semigroup

8s

8s
iii) Monoid

5:0

5:0
1

1
iv) Abelian group.

0:4

0:4
7/2 309

7/2 309
31

31
1 v) Subgroup

1
02

02
b) Let (A,x) be monoid such that for every x∈ A, x * x = e wheree is the
P0

P0
identity element. Show that (A,*) is an abelian group. [7]
G

G
5/0

5/0
CE

CE
80

80
8

8
23

23
OR
.23

.23
ic-

ic-
Q8) a) Define with examples: [10]
16

16
OR

tat

tat
8.2

8.2
8s

8s
i) Properties of binary operation
Q6) a) Find maximum flow in the transport network using labeling procedure.
.24

.24
5:0

5:0
Determine the corresponding min-cut. [6] ii) Ring with unity
1

1
49

49
0:4

0:4
9

9
iii) Fields.
30

30
31

31
iv) Integral Domain
01

01
02

02
7/2

7/2
b) Find the number of codes generated by the given check matric H. Also
.23 GP

.23 GP
5/0

5/0
find all code words. [7]
CE

CE
80

80
8

8
1 1 0 1 0 0

-23

-23
tic 0 1 1 0 1 0

tic
16

16
sta

sta
1 0 1 0 0 1
8.2

8.2
:08

:08
.24

.24
91

91
:45

:45
49

49

10

10
0

0
5/0 13

5/0 13
23

23
b) Construct an optimal binary tree for the set of weights as
20

20
0

0
{8,9,10,11,13,15,22}. Find the weight of an optimal tree. Also assign the
GP

GP
7/

7/
prefix codes and write the code words. [6]
CE

CE
80

80
c) What is Minimum Spanning tree? Explain briefly steps involved in finding
.23

.23
MST in Prim’s Algorithm? [6]
16

16
8.2

8.2
.24

.24
49

49
[6002]-155 3 [6002]-155 4
Total No. of Questions : 8] SEAT No. : Q4) a) List and Explain different Mode bits used in open () function, while

8
23

23
P9116 [Total No. of Pages : 2 opening a file. (Any five). [5]

ic-

ic-
[6179]-242 b) Define a class Person that has three attributes viz name, gender and age.

tat

tat
S.E. (Computer / Computer Science & Design Engg./A.I&D.S.) Write a C++ Program that writes an object to a file and reads an object

6s

6s
from a file. [6]
OBJECT ORIENTED PROGRAMMING

8:2

8:2
c) Explain what is fstream, ifstream and ofstream with help of example?

1
Provide the hierarchy of stream classes in C++. [7]

9:3

9:3
1/2 309

1/2 309
(2019 Pattern) (Semester-III) (210243)

40

40
Q5) a) Discuss exception handling mechanism in C++ with syntax. [5]
1

1
02

02
b) Write a program to handle exception using class type exception. [6]
P0

P0
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
c) Demonstrate function template with suitable code in C++. [6]
G

G
1/0

1/0
1) Answer Q.No.1 or Q.No.2, Q.No.3 or Q.No.4, Q.No.5 or Q.No.6, Q.No.7 or Q.No.8. OR
CE

CE
80

80
Q6) a) Explain exception handling in constructor, destructor. [5]

8
2) Neat diagrams must be drawn wherever necessary.

23

23
b) Write a program to demonstrate class template with example. [6]
.23

.23
3) Assume suitable data if necessary.

ic-

ic-
4) Use of Calculator is allowed. c) Demonstrate overloading function template with suitable code in C++.[6]
16

16
tat

tat
8.2

8.2
6s

6s
Q1) a) Differentiate between compile time polymorphism and run time Q7) a) What is an iterator? Explain how to use an iterator in C++ program with
.24

.24
8:2

8:2
polymorphism. [5] example. [5]
1

1
49

49
b) How do you declare and define a pure virtual function in C++? Explain
9:3

9:3
9

9
b) What is an algorithm in STL? Enlist algorithms and explain any algorithm
30

30
with help of a program. [6] in detail. [6]
40

40
c) Write a C++ program for unary increment (++) and decrement (--) c) What is a Map ? Write a program to implement map in C++. [7]
01

01
02

02
operator overloading. [6] OR
1/2

1/2
.23 GP

.23 GP
OR Q8) a) What is STL? Enlist and explain in short major components of STL. [5]
1/0

1/0
Q2) a) What is operator overloading and why it is useful? Which Operators b) What is iterator and algorithm? Explain each of them with example. [6]
CE

CE
80

80
cannot be overloaded. [5]

8
c) What is a vector? Enlist and explain any 5 functions of vector by using a

-23

-23
b) How virtual functions are implemented in C++? Explain with help of a C++ program. [7]
tic

tic
program. [6]
16

16
sta

sta
c) Write a program to binary (+) and binary (-) operator in C++. [6]
8.2

8.2
  
:26

:26
.24

.24
Q3) a) Explain the use of command line arguments. If we want to pass
91

91
:38

:38
49

49
command line arguments what will be prototype of main function and
09

09
0

0
explain its arguments along with example. [5]
1/0 13

1/0 13
24

24
b) Explain the following file handling functions (solve any three). [6]
20

20
0

0
i) seekg ( )
GP

GP
1/

1/
ii) tellg ( )
iii) seekp ( )
CE

CE
80

80
iv) tellp ( )
.23

.23
c) Write a program Using the C++ file input and output class with open(),
get(), put(),close() methods for opening, reading from and writing to a
16

16
file. Use append mode while opening the file for writing. [7]
8.2

8.2
OR
.24

.24
P.T.O. [6179]-242
49

49
2
Total No. of Questions : 8] SEAT No. :

8
23

23
P1528 [Total No. of Pages : 2 Q5) a) What is the power of templates in C++? Explain along with one example.

ic-

ic-
[6002]-157 [5]

tat

tat
S.E. (Computer Engineering) (Artificial Intelligence & Data Science) b) Explain exception handling mechanism in C++? Write a program in C++

2s

2s
(Computer Science & Design Engineering) to handle “divide by zero” exception. [6]

4:4

4:4
OBJECT ORIENTED PROGRAMMING (OOP) c) Write a short note on typename and export keyword in C++. [6]

1
0:4

0:4
6/2 309

6/2 309
(2019 Pattern) (Semester - III) (Theory) (210243) OR

31

31
1 Q6) a) What is mean by user defined exception? Give one example. [5]

1
02

02
b) Explain class template using multiple parameters. Write a program in C++.
P0

P0
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates: [6]
G

G
6/0

6/0
1) Endsem exam based on 3, 4, 5, 6. c) How multiple catching is implemented in exception handling? [6]
2) Draw Neat and clean Diagram.
CE

CE
81

81
8

8
3) Assume suitable data if necessary.

23

23
.23

.23
Q7) a) Explain the concept of the Standard Template Library (STL) in C++.

ic-

ic-
What are its key components? [7]
16

16
tat

tat
Q1) a) What is runtime polymorphism? How it is achieved in C++. Explain it
8.2

8.2
b) Differentiate between sequence containers and associative containers in

2s

2s
along with example. [5]
the STL. Provide examples of each. [7]
.24

.24
4:4

4:4
b) Explain virtual base class and virtual function with example. [6]
1

1
c) Discuss the advantages of using container adapters in the STL. Provide
49

49
0:4

0:4
9

9
c) Explain need of operator overloading. Write C++ program to
examples of container adapters. [4]
30

30
31

31
demonstrate use of unary operator overloading. [6]
OR
01

01
OR
02

02
Q2) a) Explain polymorphism and types of polymorphism in C++. [5] Q8) a) How can vectors and lists be used as sequence containers in the STL?
6/2

6/2
.23 GP

.23 GP
Explain with a appropriate example. [7]
b) Explain what is type casting, Explain Implicit and explicit type of
6/0

6/0
conversion with example. [6] b) Explain the concept of iterators in the STL. Differentiate between iterator
CE

CE
81

81
8

8
and pointers. [7]

-23

-23
c) Write a program to overload insertion (<<) and extraction (>>) operator
in C++. [6] tic c) Describe the process of using the STL algorithms for Quick sort. [4]

tic
16

16
sta

sta
8.2

8.2
Q3) a) What are various functions which are used to manipulate file pointers?   
:42

:42
.24

.24
Explain using example. [7]
91

91
:44

:44
49

49
b) Explain command line arguments in C++? Write program to explain the
10

10
0

0
same. [7]
6/0 13

6/0 13
23

23
c) What are different file opening mode? [4]
20

20
0

0
OR
GP

GP
6/

6/
Q4) a) Explain formatted and unformatted input and output functions used in
C++ with example. [7]
CE

CE
81

81
b) What are stream classes and their use? Provide the hierarchy of stream
.23

.23
classes in C++. [7]
16

16
c) Explain the use of command line arguments. If we want to pass
8.2

8.2
command line arguments what will be prototype of main function and
explain its arguments along with example. [4]
.24

.24
P.T.O.
49

49
[6002]-157 2
Total No. of Questions : 8] SEAT No. : Q4) a) Write short note on Painters Algorithm [6]

8
23

23
P1529 [Total No. of Pages : 2 b) Explain Halftone shading [5]

ic-

ic-
[6002]-158

tat

tat
S.E. (Computer Engineering) (Artificial Intelligence & c) Explain the following terms with examples. [6]

0s

0s
Data Science) (Computer Science & Design Engg.) i) Colour gamut

3:0

3:0
1

1
COMPUTER GRAPHICS

0:3

0:3
ii) Specular Reflection

6/2 309

6/2 309
(2019 Pattern) (Semester-III) (210244)

31

31
1 iii) Diffuse reflection

1
02

02
P0

P0
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates: Q5) a) Write a short note on interpolation and approximation. [4]
G

G
9/0

9/0
1) Attempt Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
CE

CE
81

81
b) Explain Blending function for B-spline curve. [7]

8
2) Figures to the right indicate full marks.

23

23
.23

.23
3) Neat diagrams must be drawn wherever necessary. [7]

ic-

ic-
c) What are fractals? Explain Triadic Koch in detail.
16

16
4) Assume Suitable data if necesary.

tat

tat
OR
8.2

8.2
0s

0s
Q1) a) Differentiate between Orthographic Projection and Isometric Projection.
.24

.24
Q6) a) Explain the Bezier curve. Enlist its properties. [4]
3:0

3:0
[5]
1

1
49

49
0:3

0:3
9

9
b) What is transformation and wirte transformation matrix for : [5] b) Draw and explain Hilbert’s curve with an example [7]
30

30
31

31
i) 3D translation using homogenous coordinate system c) With suitable example write short note on the fractal lines. [7]
01

01
02

02
ii) 3-D rotation about X-axis.
6/2

6/2
.23 GP

.23 GP
c) Consider the square A (1, 0), B(0, 0), C(0, 1), D (1, 1). Rotate the square
9/0

9/0
Q7) a) Explain deletion of segment with suitable example. [7]
ABCD by 45º anticlockwise about point A (1,0) [8]
CE

CE
81

81
8

8
OR b) What is Morphing and write the applications of Morphing. [3]

-23

-23
Q2) a) What are the types of projection and write in brief about each type of tic c) Draw block diagram of NVIDIA workstation and explain it in brief. [7]

tic
16

16
projections. [5]
sta

sta
OR
8.2

8.2
b) Derive 3D transformation matrix for rotation about a principal axis. [5]
:00

:00
.24

.24
Q8) a) Write a short note on motion specification method based on. [7]
2 4 4
91

91
:33

:33
49

49
c) A triangle is defined by   Find transformed coordinates after i) Geometric and kinematics information.
2 2 4
10

10
0

0
9/0 13

9/0 13
the following transformation. [8] ii) Animation languages
23

23
20

20
0

0
i) 90º rotation about the origin. b) Write any three important features of NVIDIA gaming platform [3]
GP

GP
6/

6/
ii) Reflection about line X=Y
c) Explain renaming of a segment with suitable example. [7]
CE

CE
81

81
Q3) a) Whta is Backface? Explain Backface Detection and removal. [6]
.23

.23
b) Explain and compare point source and diffuse illumination. [5] 
16

16
c) Compare RGB and HSV color model [6]
8.2

8.2
OR
.24

.24
49

49
P.T.O. [6002]-158 2
Total No. of Questions : 8] SEAT No. : Q3) a) Write short note on Warnock’s Algorithm [6]

8
23

23
PB-3636 b) Explain Halftone shading [5]

ic-

ic-
[Total No. of Pages : 2

tat

tat
c) Compare Gauraud shading and Phong Shading [6]
[6261]-43

7s

7s
OR

8:4

8:4
S.E. (Computer Engineering) (AI & DS) (Computer Science

1
& Design Engg.) Q4) a) Explain Backface Detection and removal. [6]

3:3

3:3
5/2 309

5/2 309
41

41
Computer Graphics
1 b) Explain and compare point source and diffuse illumination. [5]

1
02

02
(2019 Pattern) (Semester - III) (210244) c) Explain the following terms with examples: [6]
P0

P0
Time : 2½ Hours] [Max. Marks : 70 i) Color gamut
G

G
4/0

4/0
Instructions to the candidates: ii) Specular Reflection
CE

CE
82

82
8

8
1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.

23

23
iii) Diffuse reflection
.23

.23
ic-

ic-
2) Neat diagram must be drawn wherever necessary
Q5) a) Explain, the Bezier curve. List its properties. [4]
16

16
tat

tat
2) Figures to the right indicate full marks.
8.2

8.2
7s

7s
b) Explain Blending function for B-spline curve [7]
3) Assume suitable data if necessary.
.24

.24
8:4

8:4
Q1) a) Differentiate between Parallel projection and Perspective Projection [4]
1

1
c) What are fractals? Explain Triadic Koch in detail [7]
49

49
3:3

3:3
9

9
b) What is transformation and write transformation matrix for : [4]
30

30
OR
41

41
01

01
i) 2-D reflection with respect to line Y=X Q6) a) Write a short note on interpolation and approximation [4]
02

02
5/2

5/2
.23 GP

.23 GP
ii) 3-D rotation about Y-axis. b) Explain Hilbert’s curve with an example. [7]
4/0

4/0
2 4 4 c) With suitable example write short note on the fractal line [7]
CE

CE
82

82
8

8
c) A triangle is defined by  2 2 4  Find transformed coordinates after the

-23

-23
  Q7) a) Explain deletion of segment with suitable example [7]
tic

tic
following transformation [8]
16

16
b) Define Morphing and write the applications of Morphing [3]
sta

sta
8.2

8.2
i) 90° rotation about the origin.
c) Explain renaming of a segment with suitable example [7]
:47

:47
.24

.24
ii) Reflection about line X = Y
91

91
:38

:38
OR
49

49
OR
13

13
0

0
Q8) a) Write a short note on motion specification methods based on [7]
4/0 13

4/0 13
24

24
Q2) a) What are the types of projection and write in brief about each type of
i) Geometric and kinematics information.
20

20
projections
0

0
[4]
GP

GP
5/

5/
ii) Specification methods based on physical information
b) Derive 3D transformation matrix for rotation about a principal axis. [4]
b) Write any three important features of NVIDIA gaming platform [3]
CE

CE
82

82
c) Perform 45° rotation of a triangle A(0, 0), B(1, 1) and C(5, 2). Find
transformed coordinates after rotation, (i) About origin, (ii) About c) Explain architecture of 1860 [7]
.23

.23
P(–. 1, 1). [8]
16

16
  
8.2

8.2
P.T.O.
.24

.24
[6261]-43 2
49

49
Total No. of Questions : 8] SEAT No. : OR

8
23

23
P-9117 [Total No. of Pages : 2 Q4) a) Explain the CIE chromaticity diagram. [6]

ic-

ic-
[6179]-243

tat

tat
b) Explain Painter’s algorithm. [6]

1s

1s
S.E. (Computer Engineering) (AI & DS) (Computer Science

6:3

6:3
c) Explain Gouraud Shading method. [6]
& Design Engineering)

1
9:3

9:3
1/2 309

1/2 309
COMPUTER GRAPHICS

40

40
(2019 Pattern) (Semester - III) (210244) Q5) a) What are various applications of Fractals? [5]
1

1
02

02
P0

P0
b) Explain Hilbert’s curve with an example. [6]
Time : 2½ Hours] [Max. Marks : 70
G

G
3/0

3/0
Instructions to the candidates: c) Write a short note on Interpolation. [6]
CE

CE
80

80
8

8
23

23
1) Attempt Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
.23

.23
OR

ic-

ic-
2) Figures to the right side indicates full mark.
16

16
tat

tat
3) Draw neat diagram wherever necessary. Q6) a) Explain B-spline curve. [5]
8.2

8.2
1s

1s
4) Assume suitable data, if necessary. b) Explain the Bezier curve. List its properties.
.24

.24
[6]
6:3

6:3
1

1
49

49
9:3

9:3
9

9
Q1) a) Find transformation of a triangle A(1, 0) B(0, 1) C(1, 1) by performing c) What are fractals? Explain Triadic Koch in detail. [6]
30

30
40

40
translation by one unit in x and y directions and then rotating 45° about
01

01
the origin. [6]
02

02
1/2

1/2
b) What are the types of Projection and write in brief about any one type of Q7) a) Compare Conventional and Computer based Animation. [5]
.23 GP

.23 GP
projection. [6]
3/0

3/0
b) Discuss NVIDIA as a gaming platform in detail. [6]
CE

CE
c) Write transformation matrix for (i) 2-D Rotation clockwise direction
80

80
8

8
-23

-23
(ii) 2-D Scaling (iii) 2-D translation (iv) 2-D reflection about X-axis. [6] c) Explain the structure of a segment table with example. [6]
tic

tic
OR
16

16
OR
sta

sta
8.2

8.2
Q2) a) Explain Perspective projections with example. [6]
:31

:31
Q8) a) Write short note on Motion Specifications. [5]
.24

.24
b) Given a circle C with radius 5 and center coordinates (1, 4). Apply the
91

91
:36

:36
translation with distance 5 towards X axis and 1 towards Y axis. Obtain
49

49
b) Explain architecture of i860. [6]
the new coordinates of C without changing its radius.
09

09
[6]
0

0
3/0 13

3/0 13
c) Explain creation and renaming of segment. [6]
24

24
c) Given a line segment with starting point as (0, 0) and ending point as
20

20
(4, 4). Apply 30 degree rotation anticlockwise direction on the line segment
0

0
GP

GP
1/

1/
and find out the new coordinates of the line. [6]

CE

CE
80

80
Q3) a) Write a short note on : [6]
.23

.23
i) CMY color model ii) Properties of light
16

16
b) Explain Back-face Removal algorithm. [6]
8.2

8.2
c) Explain ambient light and diffuse reflection with examples. [6]
.24

.24
49

49
P.T.O. [6179]-243 2
Total No. of Questions : 8] SEAT No. : Q4) a) What is an ASM Chart? Design the ASM chart for a 2-bit binary counter

8
23

23
having one enable line E such that when: [6]
PA-1237 [Total No. of Pages : 2

ic-

ic-
[5925]-259 E = 1 (count enabled) and

tat

tat
E = 0 (counting is disabled).
S.E. (Computer Engineering)

2s

2s
b) Implement 3 bit binary to gray code converter using PLA. [6]
DIGITAL ELECTRONICS AND LOGIC DESIGN

6:4

6:4
c) A combinational Circuit is defined by the following function: [5]

1
3:3

3:3
(2019 Pattern) (Semester - III) (210245)

2/2 309

2/2 309
F1( A,B,C ) =  m ( 0,1,3,7 )

31

31
F2 ( A,B,C ) =  m (1,2,5,6 )
1

1
02

02
Time : 2½ Hours] [Max. Marks : 70
P0

P0
Instructions to the candidates:
Implement this circuit with PLA.
G

G
1) Attempt Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
1/0

1/0
CE

CE
2) Neat diagrams must be drawn wherever necessary.
80

80
8

8
Q5) a) Explain the operation of TTL NAND gate. [6]

23

23
3) Assume suitable data, if necessary.
.23

.23
b) Compare TTL and CMOS families and also draw CMOS-NOR Gate.[6]

ic-

ic-
16

16
tat

tat
c) Define the following terms and mention the standard values for TTL
8.2

8.2
logic Family: [6]

2s

2s
Q1) a) What are sequential circuits? Explain excitation table of JK flipflop. [6]
.24

.24
6:4

6:4
b) Convert Following Flipflops: [6] i) Noise Margin
1

1
49

49
ii) Power Dissipation
3:3

3:3
9

9
i) SR to JK
30

30
iii) Propagation Delay
31

31
ii) JK to D
OR
01

01
02

02
c) What is MOD counter? Design MOD - 24 counter using 7490. [6]
2/2

2/2
Q6) a) Explain TTL open collector. [6]
.23 GP

.23 GP
OR b) Draw and explain the circuit diagram of the CMOS Inverter. [6]
1/0

1/0
CE

CE
c) Draw two input standard TTL NAND gate circuit and explain their
80

80
Q2) a) What are sequential circuits? Explain SR flipflop using a suitable example.[6]

8
-23

-23
operation. [6]
b) Convert Following Flipflops: [6]
tic

tic
16

16
i) JK to T
sta

sta
Q7) a) What is Microprocessor? Explain the system bus in brief. [6]
8.2

8.2
:42

:42
ii) SR to D b) Which are various functional units of microprocessors? Explain ALU in
.24

.24
brief. [6]
91

91
:36

:36
c) Design sequence detector using MS JK flipflop for sequence 1101. [6]
49

49
c) How Basic Arithmetic operations are performed using ALU IC 74181?[5]
13

13
0

0
OR
1/0 13

1/0 13
23

23
Q3) a) Draw ASM chart for 2-bit UP counter using multiplexer controller method.[6] Q8) a) What is Microprocessor? Explain various operations of the
20

20
0

0
microprocessor. [6]
GP

GP
b) Draw a block diagram of the PLA device and explain. [6]
2/

2/
c) Implement following Boolean function using PAL. [5] b) Explain the Memory organization of the microprocessor. [6]
CE

CE
80

80
c) Explain the 4-bit Multiplier circuit using ALU and shift registers in brief.[5]
F1 =  m ( 0,2,3,4,5,6,7,8,10,11,15 )
.23

.23
F2 =  m (1,2,8,12,13)
16

16

8.2

8.2
OR
.24

.24
[5925]-259
49

49
P.T.O. 2
Total No. of Questions : 8] SEAT No. : Q4) a) What is an ASM Chart? Name the elements of an ASM chart and

8
23

23
define each of them. [6]
P-9701 [Total No. of Pages : 2

ic-

ic-
b) Implement BCD to Ex-3 code converter using PAL. [6]
[6179]-244A

tat

tat
c) What is the difference between PAL and PLA. [5]

4s

4s
S.E. (Computer Engineering)

3:3

3:3
1

1
DIGITAL ELECTRONICS AND LOGIC DESIGN Q5) a) With the help of a neat diagram, explain the working of two - input

1:4

1:4
1/2 309

1/2 309
(2019 Pattern) (Semester - III) (210245) TTL NAND gate. [6]

41

41
b) Define the following terms and mention the standard values for TTL
1

1
02

02
logic Family. [6]
P0

P0
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates : i) Power dissipation
G

G
5/0

5/0
1) Solve Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8. ii) Noise margin
CE

CE
80

80
8

8
2) Neat diagrams must be drawn wherever necessary.

23

23
iii) Propagation Delay
.23

.23
3) Assume suitable data, if necessary.

ic-

ic-
c) Draw and explain the circuit diagram of CMOS inverter. [6]
16

16
tat

tat
OR
8.2

8.2
4s

4s
Q1) a) What are the advantages of M S JK flip flop? Explain the working of
.24

.24
Q6) a) Compare TTL and CMOS logic family. [6]
3:3

3:3
1

1
MS J-K flip flop in detail. [6]
49

49
b) What is logic family? Give the classification of logic family and also
1:4

1:4
9

9
b) State different types of shift registers. Give its applications. [6]
30

30
write important characteristics of CMOS. [6]
41

41
c) Draw and explain 3-bit asynchronous down counter using JK flip c) Explain the wired logic output of TTL with neat diagram. [6]
01

01
02

02
flop. Also draw the necessary timing diagram. [6]
1/2

1/2
.23 GP

.23 GP
Q7) a) What is system bus? Draw microprocessor bus structure and explain in
5/0

5/0
OR
CE

CE
brief. [6]
80

80
8

8
Q2) a) Compare synchronous and Asynchronous counter. [6]

-23

-23
b) Write a short note on following with respect to microprocessor. [6]
b) Explain how JK flip is converted into. [6]
tic

tic
i) Address Bus
16

16
sta

sta
i) D FF
8.2

8.2
ii) Data Bus
:34

:34
ii) T FF
.24

.24
iii) Control Bus
91

91
:43

:43
49

49
c) Write short note on Ring counter. [6] c) Explain the Memory organization of the microprocessor. [5]
11

11
0

0
OR
5/0 13

5/0 13
24

24
Q3) a) Draw and explain the general structure of PLA. [6] Q8) a) What is microprocessor? List different applications of microprocessor.
20

20
0

0
[6]
GP

GP
1/

1/
b) Implement following Boolean function using PAL [6]
b) Write a short note on ALU IC 74181. [6]
F(A, B, C, D) = m(0, 1, 3, 15)
CE

CE
80

80
c) With the help of a block diagram explain the fundamental units of a
c) Draw the state diagram, state table, and ASM chart for a 2-bit binary microprocessor. [5]
.23

.23
counter having one enable line E such that E = l counting enabled and
16

16
E = 0 counting disabled. [5]
8.2

8.2

OR
.24

.24
49

49
P.T.O. [6179]-244A 2