:2 30
Marks:
Max. (6]
l78
ste 110:3804 /203
141
following example.
5| 16] PTO.
n(n+1)/2
staic- 16/0 2 3 9.178
Pages 10}
135 CE G PO 1
Computer
of
78 9,
an
0: 8
No. 7, of =
5, with .n
[Total 1 16}B={1,3, each
SEAT
No.
and (210241) 24, write tatble 1+2+3+..
2461
DS Engineering)
DISCRETE
MATHEMATICS happy" ruth
) in that
& -
necessary. 8, Contradiction
AI (Semester 6, is
"Mark show
(5931|-30
and
Design
Engineering marks.
wherever
4,
(2,
=
78 be
happy
happyhappy OR
induction
n.
of
A
full necessary. g happynor and values
Pattern) 10}, and or not
Rich" but rich rich and Tautology mathematical
& drawn
Q4. indicate
Science or .... neither number
Q3 be suitable
data,
if
in p0or
is form
symbolic
either Rich
(Computer(2018 candidates:
right
02, must 3,
2, (AU
B)' (An "Mark
4] B) (B-A)'
iv) is is is is terms natural
:
Questions or the diagrams {1, (B)'
i) Mark Mark Mark Mark using
Q1 to = be Explain
FiguresAssumeU Find:
the Answer p for
all
S.E. Time:
1Hourlto Ler Let i) iv) By
Neat i) i) i) i)
of Instructions
No. PA-20 a) b) c)
1) 2) 3) 4) a)
Total Q1) 02)
b) Explain following terms with 8example. 14|
1 0 : 3s t:a0t4
ic?
i) Symmetric difference betweert set
i) Union of set
i) Intersection of Set
iv) Subset of a Set
c) Acollege Revordsgives following infornation :119 students enrolled in
Introductory computer science, 96 of them took data structures, 53 took
foundatiois, 39.100k assembly language. 31 took both foundation and
Assembiy language, 32 took both data structures and Assembly language,
38 took data structures and foundations and 22 took aiof three courses
is this information correct? Why? [5|
Q3) a) What isEquivalence relation? Explain properties of binary relations. [5|
b) Let A={1,2,3.4} and R={(1, 2), (2 4). (1,3): (3, 2)). Find transitive
Sclosure of relation Rusing Warshal!'s algorithm. 15]
c) LetA = {1,2, 3, 4,12)-B, and iet aRb ifa divides b,Write arelation and
draw it's Hasse diagram. [5|
OR
178
Q4) a) Let ()-2x+3.g)-3N44, h64r find gof, fog, foh. goh static
b) A = {1, 2, 3, 4, 5, 6} = B
10:38:04
R={0) |i-j =25 CECPO1
1351
Findwhether Ris equivalence relation or not 15]
c) 16/01/2023
e8
a) b)
Find whether above posets are lattices or no? [5|
|5931]-30 2
04) 03) 02) Instructions
1Hour]
Time: PA-24 Total
Q1)
b) a) b) a) b) a) b) a) 3) 2) No.
)
diagram. digit
Explain Design
F(A,B,C,D) Y(A.B,C,D)
minimization
Express technique. method.
K-mapthe method.
K-mapthe Assume Nea
Atenmpt of
How Implement Simplify Simplify Simplify to Questions
DIGITALELECTRONICS
the
BCD diagras
wil 4 seitable cndidaes
Q.I (2019
bit the the the :6|
you adder the
rules the orQ.2,
implementful binary = the function - expressionexpression
}m
following following must Engineering)
(Computer
S.E.
using for data Pattern)
0.3 :
BCD to
(2,4,5,7, 01,3,7,8,9,11,15). m
YAB+ACD if be
IC gray necessary.drawn or
addition
7483. code
Boolean logic F(A,B,CD)F(A,B,C,D) Q.4., (Semester |5931|- 34
halfadder?
adder
using OR OR
0, 1 wherever Q.5
converter 14). function
with function or AND
in Q.6.
suitable canonical nMO,1,4,5,6,8,9, = necessary.
circuit using LOGIC
I)-
using (210245)
64,5,7,9, m SEAT
No.:
example the
using
:Lmultiplexer 8 sum DESIGN
Quine-McCluskey [Total
49.248.35
Explain
circuit
with
and logic product
of
2,13, 13,14,15)
1
[Max.
No.
Design Marks
PLO.
gates.
3 form. 14)
using using
atic-178 Pages
of
|8| :
51one |5| 15| |5| 30 :2
180311-34
06) 05)
b) a) b) a)
hardware
Minimize
Y-SusiL213159) parity
evenbit What K-map
Simplify
the theExplain
do
you look
thetollowing
49248 39.i78 20dt0: method.
meathby expression Ahead
paity?
carry
expression F(A.BCDygenerator
OR
IDesign
using in
bit 3 Lmdetail
the parity
(1,3,7,11,15)+d(0,2.5)
K-map generator
with
4921839.178 CEGP2O011 35 203 1052:13
circuit
minimum
2830h CEG2P0O1210I335
10-5213 staic I78 staic178 15]
using
51
using
I78
Total No. of Questions :6| SEAT No. :
PA-23 |Total No. of Pages :2
|5931-33
S.E. (Computer/Artificial Intelligence& Data Science/Computer
Scieñee & Design Engineering)
COMPUTER GRAPHICS
(2019 Pattern) (Semester - I) (210244)
Time : 1 Hour] /Max. Marks : 30
Instructions to the c¥ndidates: tatic-178
) Answer 0.lor D2 and Q.3 or Q.4 and Q.5 or Q.6.
2) Nedt diugram must be drawn wherever necessary.
3) Figures to the right indicate full marks.
4) Assume Suitable data, if necessary.
Q1) a) Define the terms:color depth, scan conversiob refresh rate. pixel. 14|
b) Differentiate betvween Raster Scan
1 /and
20 Random
23 Scan. 14|
02) a) Define the terms: resoluion, aspect ratio, frame buffer, refresh rate. 14|
b) Compare DDA line drawing Algorithm with Bresenhams Line drawing
algorithm. 14|
a 19/01/2023
36:2
03) a) Write short note on tHandling Keyboard inputs with GLUT"
CEGPO1
b) Explain significance oferrorterm in Bresenhanm's circle drawingalgorithm.
Explain its mathematical derivations. |6|
OR
04) a) Describe OpenGL architecture with block diagram in detail. |6|
49.248
b) Explain Bresenham's circle drawing algorithm in detail. |6|
PT.
Q5) a) Write and explain with example Sutherland-Hodgeman clipping algorithm.
b) Let ABCD be the rectangular window with A(20, 20), B(90, 20),
PO113
C(90, 70), and' %
9 D(20,
,/
12070).Find
0:2
% 3 region codes for endpoints and use the
Cohen-Sutherland algorithm to clip the lines: (i) Pl P2 with Pl (10, 30),
P 2(80, 90). 51
OR
06) a) Explaín yith an exampleBoundary fillAlgorithm. 5|
b) Clipthe line PQ having coordinates P(4, 1) ands tQ(6/4} against the clip
49.2487 ati
window having vertices A(3, 2), B(7, 2) C(7, 6) D(3, 6). Use
cohent-sutherland algo. 10:36:24
CEGPO113
19/01/2023
78 L78
49.248.39.1 static-
10:36:24
CEGPO11351
19/01/2023
49.248.39.178
|5931|-33 2
Total No., of Questions :4| SEAT No. :
PA-21 (Total No. of Pages:2
[5931|-31
S.E. (Electronics &Computer/Artificial Intellegence &Data Science)
FUNDAMENTALS OF DATASTRUCTURES
(2019 Pattern) (Semester -) (210242)
Time: IHour) Max. Marks: 30
Instructions to the candidates:
1) Answer Q.I or Q.2, Q.3 orQ.4. static-178
2) Neat diagrams must be drawn wherever necessary.
3) Figures tothe rightindicate full marks.
4) Assume suitable data if necessary.
CEGPOL
13%5
17/01/2023
10:35.
Q1) a) Define the following terms with suitable example. 4|
Data Structure
Abstract Data Type
ii) Algorithm
iv) Flowchart
b) What is frequency count? Why is frequency count important in the
analysis of algorithm. 5|
201135
c) Write an algorithm to compute the sum of the digits of the given oumber.
023
Justify that your algorithm satisfies all the characteristics 10:
of an algorithm.
[6|
OR
02) a) Give complete classification of data structures with one example of each.
b) Explain divide & conquer Strategy and Greedy strategy with suitable
example. [5|
c) Draw flowchart to check whether a given number is a perfect square of
an integer. What is the time complexity of your algorithm. (6|
P.
Q3) a) What are advantages &disadvantages of sequential organization of data
structure? 14|
b) Explain row major &column major representation of arrays in computer
memory.
c) WriteGPOT
an7algorithim
801/202 to perform polynomial addition state the time
16|
complexity of the algorithm.
OR
Q4) a) Write ashoft note on storage representation of an array. 4|
b) Write pseudocode to reverse the in numbers in one dimensional array.
CERO1135%
(5]
e 010:3
23
c) Write an algorithm to perform sparse matrix addition & state its time
complexity. [6|
49.248
391
1778R
178
static-
10:35:06
CEGPOL1351
17/012023
39178
49248
|5931|-31 2
Total No. of Questions :4] SEAT No. :
PA-22 [Total No. of Pages :1
|5931|-32
(Electronics &Computer /A.I.&D.S/ Computer Science &
Design Engineering)
OBJECT ORIENTED PROGRAMMING
(2019 Pattern) (Semester-) (210243)
Time : 1Hour) [Max. Marks: 30
Instructions to the candidautes:
I) Answer Q.l'or Q.2, 0.3 or Q.4.
2) Assume suitable data, if necessary.
Q1) a) What is the use of this' pointer. Explain with Example 14]
b) Whatare the different ways to de fine member functions of aclass? Give
Examples of Each 14]
c) Define inline function. Write a C+tprograrn for finding the area of a
uiangle using inline functions. 171
OR
02) a) Compare Procedure oriented progtamming Vs Object oriented
programming (4|
b) What is difference betweeD pointer and references? [4|
c) Write C++ code that defines aclass and declares and array of objects to o
that class
8/01/20230:36:35
GpGPOI35}
Q3) a) Discuss the role of access specifiers in inheritance and show their yisibility
when they are inherited as public, private and protectd. 4|
b) Explain the voidand nullpointer with exampleS 4|
c) Write a Ctt program to demonstrate pointers to bàse and derived classes
OR
Q4) a) Explain friend function with example. 14|
b) Howare arrays represented using Pointers. Explain with example 14]
c) Explain hybrid inheritance with aC+t exaniple. I7]
