Roll No.:0701.C..A.zIn.a..

rustions 05
Tolal. DECEMBER, 2016
EXAMINATION
B.E.THIRDSEMESTER UECU (CBCSIGING)
(Branch:ComputerSclenco&Englnoering)
EC3141 DIGITAL CIRCUITS &
3YSTEM3
Cs3002 DIGITAL ELECTRONIcSMaxlinum Marka GO/7o/100

Min. Pass Marks 18/22/36

Time hree Hours
Note: Attempt any two parts from each questlon.
mtthml 3,3
perform thc substralio
{a) Explain the architecture operation rules excess threc code and
for the following in XS-3 code
$7.6 27.8
(b) () Reduce the given expression by Boolean rules.
ABC + B + BD + ABD +AC
AOI logic
) Reduce the given expression by K-mapand realize with
Im0,2,3,4,5,6) mcthod (decimal
C)Obtain the minimal expression by using (uine McCluskey
representation) for thc given function)
IDGRDA I 15)
the EX-OR gate 4,2
universal gatcs, Also realize
Show that NAND and NOR gates arc
2a)
using NAND gates only. 2,2,2
and NAND gates.
Explain the full
subsuractor circuit in terms of truth table, AOI logic
6
Look-ahead carry generator.
(c) Explain
muitivibrator with output waveforins.
the monostable
3(a) Explain totem-pole output.
TTL circuit with 3,3
(b)Explain the
NMOS logic circuit.
POMS and
(c) Explain

Gray code
converter logic circuit.
the Binary to
( g ) Design adder by using
Realize the full 1) MUX
b) and (ii) (8 x

(i) (4x 1) MUX mode).

6
shift register (Shitt right
(c) Explain parallel in parallel output
of them.
24
converters and explain onc

5(a) Give the

list of analog to digital to analog converter and give the main 5,
resister type digital
b) Explain weight:d
disadvantages of this type DAC.
and hold circuits.
)Explain the sample

Seanned by CanSemm
plsl No. ofQuastion 10
B.E. THIRD SEMESTER UECU Ro! No. 9701...
(NGI G)EXAMINATION
(Branch: Computer Science &
Engineering}DECEMBER 2011
GS-3002 DIGITAL ELECTRONICS
Time Three Hours
Maxinra Mar 100/70
Note empt ail qiiesu0ns, each qLestion rPasS Matks 35/22
cany equal ma:ks
U Simplity the given expression usjng
K-map
b)
2L,3.7,11,15)+ d{0.2.5)
Simplity the given logic expression with Boolean
Fules
=*yz+*y? ryz xyz +yz tX y xy: lr y}i xy.z
+ t +

OR
2a) Simplity the given furetion with the help of Quine-ie Cluskey method.
F ,i,3,7,8.9,1,15)
b) Explain the fotiowing ) Redundant terms (ii) Don't care conditions
Avantaces : )INUI gate using L
(a) Give the performance comparison baiwen:
i) Parallel and serial adder (ii) Muitiplexer and Demulipiexer
(b)Explain the working pYinciple of 4 bit BCD adder with Truth tabie.
OR
4(a)Implement a fuil adder using (i) 8:1 multuplexer
(ii) 4:i multiplexer
bWhat are the advantages of multiplexers? Aiso give the applications cr the same.
--

S(a) Giva the comparison of combinational and sequencial circuits. Explain ihe orkirg
I atcl.
operation, Truth tabie, race around condition and characteristic equation of ^R
(h Give the cifierence between leve! and edge triggering. What is the race aroun
cditiun in iK flip-flop? Explain any one metthud for elimination of racing.
OR

and ive the excitation table for dit+erent Nip-11op.

6(a) Expi2in
. tbExplain the converter for S-R lip-flop to )-K Nip-flop.

Give thè applications of the same. Define modulus

W h a t do you meai y shift register?
o t counrer.

Explain d!!ierence berween various types ofimuitivibrators

OR
Aiso expian abeut ircTy iLe
3 t e the salient ieaturesof semiconductor ne:nory,
afd drawback of Dynamic RAM.
code converter.
(b)Design the circuit for gray to binary
families in terms of propagation deiay, power
9(ayGive the cornparison of different logic
dissipation, noise inmmunity, far1 outand logicvoltage swing
one oi them.
.UY Enlist the types of digital to analog converter and explain
OR
1C(a) What is iDTL? Explain DTL logic
family in detail.
(b) Write a short note on Sample and iHold circuit

Seannei iby Cu1Sc

 Roll No.:0701. 2. ..
05
Total No. of Questions DECEMBER, 2019
EXAMINATION
B.TECHJB.E. THIRD SEMESTER
(Branch: Computer Science &Engineering)
CS 3302 DIGITAL SYSTEM
Maximum Marks 70
22
Min. Pass Marks
Tme Three Hours
internal choice
Note Attempt all questions as per given
Perform the following 06
Give the arithmetic rules
for Excess-3 code.
code.
1(a) Explain gray
Excess-3 code 267- 175
subtractionin OR
AOI logic circuit to
AND gate. Convert the given
Draw & explain the two-input transistor
NOR logic.
06

08
and implement it in universal logic.
(b) Reduce the given expression by using K-map
f= 2m 1,5, 6, 12, 13, 14) + 2(2,4)
OR
the code. Also
the advantages and disadvantages of
same R
Explain BCD code. Also give
expand A (B A)B to maxterms and minterms. 06
adder using NAND gates,
adder in of truth table, output expression, full
2a) Explain full terms
full adder using two half adders and one or gate.
OR
06
the Look-ahead cary adder in terms of logic
circuit and output expressions.
Expiain
08
(b) Design and impiement a 4-bit binary to gray converter.
OR
08
full adder by using (i) (4 z 1) Mux (ii) ( 8 1) Mux.
Design the
06
3(2) Explain 4-bit serial-in,
serial-out shift register
OR
cell? List the drawbacks and 06
How does a static RAM cell differ from a dynamic RAM
advantages of dynamic RAM vis-à-vis the static RAM.

How it be eliminated by edge triggered J-K 08

(b) What is the racing problem in J-K flip-flop? can

flip-flop? Explain.
OR
08
Design and implement a mod-6 asynchronous counter using T-flip-flops.
main drawback. 06
4a) Explain the weighted-resistor type digital to analog converters with
OR
06
Explain the astable multivibrator using 555 timer.
inverter 08
by Explain the monostable multivibrator by using (i) NOR gate and an
ii) NAND gates (ii) 555 timer and (iv) Applications of monostable multivibrator
OR
Explain the sucecessive-approximation type analog to digital converter. An 8-bit SAC has a 08
reshution of 30 mV. What will its digital output be for an analog input of 2.86 V?

P.T.O.
 Si:01S 08
Roll N .:0701..
.FOURIH SEMESTEN
UECU CS) EXAMINATION DE
(Branch: Computer(CBCS) EXAMINATION DE CEMBER,.2017
CS 4105
Science And Engineerin
Three Hours DiSCRETE STRUCTURE
te
Attempt any five questions. Ali Maximunt Marks 60
questions carry equal marks lin. Pass Marks 19
1(a) What is
Powerset? Write the
powerset of the set A and O elements of the set
(b) What is denotes P(P(P(O))) where P( ) denotes
is reflexive, symmetric and uanthe empty set the
reilexive and transitive sitive
relation? Give
but not sy an
example of
mmerie. a rel Uion that
a Explain the
possible equivalence relation and p.nial order
that is
(b) equivalenee and partial order set Arelation.
Check whether ((P
IHow many relau
that coniainon a n isare
Q)R)P ))(PR)) is a elemes n

tautology.
aExplain suinigroup, monotd and abelian
(6) Consider the group G group witlh the help of exanmple,
every element of group G. {2.3,4.5,6} under
multiplicativn modulo 7. Find inv of

4 a e f(x) 2x+3, =

gix) 3x+4 and n(x) =

=*
4x for x
Find gof. tog, foh & goh. R where R is set of real numbers.
b Prove A-(B-C)
(A-BJU(ANB C) using
=

venn
diagram.
5(a) Design Finite State Automata for the
(b) Determire whezher
following regular expression ((a+b)*aa(bte)*)*.
1iumber and
algebraic system (Q,+) is a
group where is the set
+ is an addition
operation. of all rational
6(a) Prove that the sum of
the degrees of the vertices of a graph is
edges. Does the theorem liold for a equal to twice the number of
(b) Define an Euler graph? Find an multigraph? Justily your answer with example?
example of eulerian graph 'vhich is not
Hamiltonian?
7(a) Define the follwing:
(a) Ordered Set (h) Well Ordered Set
(b) What is Lattice? Explain Complete Lattice, bounded (c) Isomorphie Ordered Set
with the help of example. latlice and complemented lattice

8(a) What is the solution of the recurrence relation:

S(n) 10f n-1) -25f(n-2) .f(0) = 3.f(1) = 17
(b) Find the shortest path îrom vl to vó
of the following graph using Dijkstra Algorithm
 Total No.
of
Questions: 05
DECEMBER, 2019
Roll No. : 0701.S.19.3.Da

B.TECH.
H . THIRD SEMESTER EXAMINATION
Science Engineering) &
(Branch: Computer
DISCRETE STRUCTURE
Time c s 3303
Maximum Marks 70
Three Hours
Note Min. Pass Marks 22
Atempt all
all qestions
que as per gnen internal choice. Assume suitable data wherever

necessan.
eine cquivaence relation. Let A-{1.2,3,4) and R={(a.a).(b.a),(b,b),.(c.c),(d.d).cd,.c)}. 06
Delermine whether the relation R on A is an equivalence rclation or not.
OR
Let A, B and C be subsets of U. Check if (AUB) n (B UC) C A n B is True or 06
not.

(6) Prove by Mathematical Induction that

6" +
74 is divisible by 43 for each positive 08
integer n.
OR
Write Pigeonhole principle .Show that any set of six
must contain a subset whose sum is three.
positive integers whose sum is 13 08

2(a) Write properties of Group, Semi

Group and Monoid 06
OR
Define Cyclic Group and show that
isomorphic. any two Cyclic Groups of the same order are 06

2(b) What is an Abelisan

Group? Show that set G {1, -1, I, -i} =

Group with respect to multiplication as a where i= v-1 is an abelian 08

binary operation.
CR
If (G,*) is a Group and H G, then (H, *) is a
(i) a, b EH a*beH subset of (G, *) if and only if 08
(ii) a EH>a' ¬H
3(a) Construct Truth Table of the
following:
I(pV9)^(~r)]+ 06
OR
By the method of contradiction, prove that
if x*- 4 =0 then x #0. 06
3b) Obtain Conjunctive Normal Form and Disjunctive Normal Form
P(PV9) of the following: 08
OR
What is meant by Finite State Machine? Construct a Moore Machine M that will
exactly string 001 from input and strings of "0's "l's.={0,1} and
accept 08
L(M)={0,0,1}
4(a) Define the terms multigraph, weighted graph and pseduograph.
06
OR
Explain various representations Graph with suitable examples.
of
06
4(b) Prove that there is no Hamiltonian cycle in the following graphs: 08

i) a b i)

OR
T.LO
 2,3

I/2/1

Show that a simple connected Planner Graph with 8 Vertices and 13

edges cannot be 2- 08
colored.

5(a) Describe in brief about lsomorphic Ordered Sets and Well Ordered Sets. 06
OR
Find thc cocfficient ofx" in (x*+ x+x+x 4x 06

Solve the Recurrence Relation

08
S(b) n 2 2
an-7an-1t+ 10an.2 0 for
OR
08
Solve the Recurrence
Relation
=
0, yi =
1.
2yn+2-Syn+1t2yn=0 subject to the conditions yo
 ******************

RollNo.:0701..
Tctal No. of Questions 05 DECEMBER,
2018
E X A M I N A T I O N

B.E. FOURTH SEMESTER UECU (GICBCS) Engineering)

&
branch ComputerScience S T R U C T U R E

70/60
D I S C R E T E Maxmum Marks
4005 cs 4105
Min Pass Warrs 22/19
Assume
available
are
Time Three Hous internal
choices

i ithun rac part

NcE All Drucstic
S C snsarare
e compuiso
cessan
campuison

E05
Suitable data wher ever
ne

hcip of examples
with the
Lxplain
unconditional
statements?
and
what are conditional
and truth tabi:
OR
Laws
Morgan's
Write and explain De
tab.e: Since it rains
using ti Jth
following argument at home.
Justify the validity of the is cold then
I shall stay
1(b) it wili be cold; If it
I f it rains then
at home."
therefore I shall stay OR
Normal forms.
Express
and Disjunctive
Conjunctive Normal Form.
Write in brief about > in Conjunctive
(p^g)
(pvq)
06/05
Universal set t then show that
the subsets of
2(a) IfA and B are

(A -B) B =3. OR 6/05

by all natural numbers n.
that 2.7-3.5"-5 is divisible
mathematical
induction prove
B who are &/07
there are two
Prove that among 1,00,000 people
hoie principle.
2b) Explair pigeon
same time.
born at tme OR 0/07
and Music; 36
Computer Science
i0 have taken English, and Music; 18
have
of 191 students, 20 have taken English
n a group and Computer
Science;
Science and 63
have taken
have taken English 76 have taken Compüier
Science and Music;
taken Computer Science.
the following: Computer
and Music but
not
Answer
Music.
have taken English Music but not English.
(i) How many of them have taken Computer
Science and
Music nor English
How many of
tnem Science but neither
(i1) taken Cumputer
How many of them have of the tnree subjects.
(iii) have taken none

How many ofthem 06/05

(iv) examples of
set? Expiuin by giving
detined on a
can be
s of relations
many tyr
3(a) How
each. OR example.
06/05
with suitable
Relation? Expla1n
Partial Order
What do you
mean by I is an equivalene
08/07
of integers
the set
d e t i n e d on

=y
(mod 5)
relation x
Show that the
3(b)
relation.
OR
lefined
and only if ' for
by xRy ifa n t i - s y T m e t r i c . Iranes
=
08/07
natural
nurnber lefi
relation in the Tor
re!i2.:v¬,
Symmetric,

be a
Let R the above relation
Examin P.T.O.
x.yEN.
a n d partial order.
 /2/1

4 y Define the following 06/05

Paraltel edge (ii Multi Gaph Gi Bipertite Giraph
OR
What is graph isomorphism? Give suitable cxample to
explain
44b) Find the shortest path for the following graph using Dijkstra's Al orithm. 08/07
2

OR
G is planer graph with vertices each of which has atmost degree 5 and 0B07
Suppose a n
atieast one vertex of degree 4. Proveth G is 4 colorable.

Sa) Wht ise: atgebraic system? List its common properties. D6/05
oR
Define Hor omorphism on a semi group. Lspain when Homomorphism becomes 9605
Isomorphisn.

Kb) Shov that G {1, a, o') is a cyclic group under multiphication, where o is the cube 8197
root of unity.
0R
R. 08/07
then prove thaxt R is commutative for all x, y ¬
ifR is a ting and (r+y)-x+2xy+y

umaid ILdu cHot

 Total No. of Questions: 05 RollNo.:0701..pa
B.TECH. THIRD SEMESTER EXAMINATION DECEMBER, 2019
(Branch:Computer Science &Engineering)
CS 3304 OBJECT ORIENTED PRoGRAMMING USING JAVA
Time Three Hours Maximum Marks 70
Min. Pass Marks 22
Note Atempt all questions as per given inlernal choice.

1(a) What are the features of java? Explain the 0OPS concept bricfly.(At Least 3) 06
OR
Write a short note on : JVM. JRE. JDK. 06

16) What is constructor and how to call constructor? Explain Different types of Constructor. 08
OR
What is Overloading? Diferentiate between method and Constructor Overloading with 08
Example.
20a) Write short note on :Class and Object. 06
OR
Explain different type of variables in java with an example. 06

2(b) List the primitive data types of java. Explain each of them in detail. 08
OR
Create a class named °Employee' with String variable ename' ,integer variable 'eid' to 08
storeunique identification of employee, integer variable 'salary' to store salary.
Assign the value of eid as 1001' and that of ename as John' with salary 35000 by
creating an object of the class Employee.

3(a) Describe Inheritance and its types with suitable

example.
OR
What is a
Package? E>xplain how to create User defined package with example. 06

3(b) WAP in java to declare class Vehicle as an

Abstract class, have one method
Give definition of engine() method in class Car. Execute engine(). 08
engine method.
OR
Write short note on: (i) super (i) final
08
4(a) Define an Exception. Explain Exception Handling Mechanism in
java with programs. 06
OR
What is thread? Explain thread life cycle. 06
4(b) Write a
program to create two
threads, one thread will check
prime or not and second thread will print prime numbers betweenwhether
0 to
given number is 08
100.
OR
What is multithreading? How the priorities can be assigned to threads? Explain with 08
example
5(a) What is applet? Explain the life cycle of an applet.
OR 06
What is Stream? Explain Output Stream class and Input Stream
class. 06
5(b) Write a java program that
computes its factorial ValueDevelop applet that receives an integer in one text
an
and returns it in another field, and 08
"Compute" is clicked. text field, when the
button named
Define an event. Give OR
examples of events. Define event handler.
How it handles
events? 08
 Roll No.0701.*********e************
Total No. of Questions 05
B.TECH. THIRD SEMESTER EXAMINATION DECEMBER, 2019
& Engineering)
(Branch: Computer Science
STRUCTURE

CS 3301 DATA Maximum Marks 70

Time Three Hours Min. Pass Marks 22

OEAllempt allquestions as ner given internal COe 06

terms.
for 'n'
1(a) Fibonacci series
Write an algorithm to computetthe
06
OR
of elements in a single
deletions
insertion and
State& explain
linked
inked list with
the algorithm to perform
and example. 08.
1(b) linked list?
1hat are the advantages and disadvantagest
2. State the difference between array and link
OR 08
detail.
Structure in
What is Data Structure? Explain Various types of Data 06
2(a) Distinguish between stack and queue.
OR 06
Convert the infix (a+b)*(c+d)/f into DOstfix & prefix expresso
TOP and 08
POP,
it is known I.JF02 Write algorithm of PUSH,
a Is
Stack? Why as
SIZE operation on Stack.
OR 08
the
60,25,75,15,50,66,33,44.Trace
Draw a Binary search following input list
tree for the
algorithm to insert the above nodes and to delete the nodes 25,75,44 from the tree.
06
data structure.
3(a) pefine node, degree, siblings, depth, height and level in a tree

OR
06
search with the help of example.
What do you mean by Searching? Explain Sequential
08
and deletions in AVL Trees with an example.
3(b) Explain in detail insertions OR

Preorder traversals Inorder sequence: DBEAFF

08
Construct Tree from given Inorder and
DECCF
CPreorder sequence: A B
matrix and linked list representation of a graph. Also give the 06
4(a) What is Graph? Explain
application of Graph.
OR
06
Explain the various applications of Depth First Scarch
4(b) Define the following 08
() Graph Ci) Directed Graph (i) Loop (iv) Out degree of a graph
OR
Write the algorithm for Breadth-First traversal of a graph with example 08

5a)Discuss general idea of hashing and what is the use of hashing function? 06
OR
State & explain the algorithm to perform Merge Sort with an example. 06

5(b)Explain Collision Resolution Techniques in Hashing. 08

OR
Discuss the different types of Hash functions with examples. 08