(Please write your Exam Roll No.

) Exam Roll No,

END TERM ExAMINATION

THIRD SEMESTER B.TECH] JANUARY 2024
Paper Code: ICT-201 Subject: Foundations of Computer Sclence
Time: 3 Hours Maximum Marks: 75
Note: Attempt flve questions tn att including e. No.1 which is
compulsory. Select one question from each untt.

(3x5=15)
Attempt any five:
t¥ Define well ordering principle and strong induction.
(b) Define pigeonhole principle.
LE) What is a POSET and Lattice? 2an-2 With ao=2
What is the solution of the recurrence relation an = an-1 +
and aj=7?
MEj Prove that in a group, inverse and identity elements are unique.
() Prove that a cyclic group is always abelian
t State and prove Euler's formula for plane graph. connected
)Briefly explain the algorithm (Kosarju) to comnpute strongly
Component (SCC)

UNIT-I
Q2
Define Transitive closure. Prove that the complexity of Warshall's algorithm
to compute transitive closure is O(n3). (15)

Define Modus ponens and Modus tollens. Check the validity of the following
argument: if Rohit has completed B.Tech or MBA, then he is assured of a
good job. If Rohit is assured of a good job, he is ahppy. Rohit is not happy.
So Rohit has not completed MBA. (15)

UNIT-I
State Master's theorem (Without proof). Find the solution of following
both.
recurrence relation by recursion tree method and Master's theorem,
T(n) =2 T(n/2) + cn. (15)

What is the generating function of the infinite series; 1,1,1, 1, ...? solve the
recurrence an = 2an-1 + 4an-2 with ao = 1, and a1 3 using generating
function. (15)

UNIT-III
t1s}.find
State and prove Lagrange's theorem. Let H =(0,5,10} and G = Z15,
all Left cosets of H in Z15. (15)
intersection of
Q7 Define Normal subgroup and Quotient Group. Prove that the (15)
two normal subgroups of a group G is normal in G.

UNIT-IV
Q8 Define Euler and Hamiltonian circuit (Give examples). Prove that If Gis a
group with p >= 3vertices such that for all non adjacent vertices u and v,
deg u + deg v >= p, then G is hamiltonian. (15)

Define Minimal spanning tree (MST. Analyse the complexity of Kruskals

(15)
algorithm to compute MST.
****&ttttk*
 (3)(2) fourmultiplexer
(10) vertical (8) menory
(3)be onecomputer to the
value
decimal)? Booth (-12).
2's (8)menory hit-ratio
be (4}100ns a with(5)
(3) (5)(5)from
made (4)
for 12-bits must
willwith within computer
system is be usingnumbers of cache different
service
routine?
in
organized branch
expression a bus
cach conputer stored instruction(in
should using multiplied provide time
and address time.
Busof process access
The
it a
sizeuse. is The binary is of
What signed to access
1000ns.
stack instruction Howdiagram
a the horizontal type 750. is needed
of an
will
Construct aritnetic (+14) lines cycle
and
interrupt
500.the in multiplication with mapping.
Language? Specify hold memory? memory Processor?
you a format. decimal value
accumulator are of
of
decimal mnany memory block
multiplexers ana when time
UNIT-II type address
(-2-1 bus?Multiplexers.following instruction ficld UNIT-IV that chips How cache
avcrage
Counter? between format to of access the
Transfer algorithm input-Output
branch
cquivalent
to address RAM bytes
registers cache DrawQutput
input-
processor
conputer relative step
equivalent bytes? set-associative
an the interrupt
of
microprogramming.
the instruction
X=
A-B+C*(D*E-F) 8 2048mermory
complement
format.
Programnumber
Register using address X a Determine processor?
mode relative by

a
using

is is is registers
the
how
Differentiate
evaluated
Explain zero
address
relativeaddress
the
Determinestep
5-bit 128
multiplication
2048 has

of
many
access
computer
main an an
o0 )
What address the Assume capacityto is is
Explain
WhatWhat an Show 0.9. WhatDMA
and with How uscd aand What
an
A at of A is

a b} a) b) c)
Q7 Q9

Design (2)(2)(2)(2) micro (5)(2)(4) (4)

Maximum
Marks:
75
compulsory.
(2)(2)(2)mode?
(1) fourinput (12) an (3)
Tabulation
using andeach
parallel
parallel
(5)counter (5) using
the(5)removed (5)with(5)(5) P.T.0.
and of
END
Exam
Roll
No.
TERM
EXAMINATION
Computer any.
and
addressingthe gates
subtractors
and
in
needed
transition Flop register
a of K-maps down be
if in Code? inputs
data, cycle? OR
complement can T-Flipshift
is sequencer transfer
to
and
ripple
and which triggering.
Gray is
data it
2024 missing indircctfour
instruction
using
d(A,B,C,D)=(0,2,5)
Function registeredge how to bidirectional
decoder half counter.
Logtc Nol
JANUARY to A Function serial binary
serial negative Flop
with2's two and
1101
microprogram =
Q. Assume register XORO of
Digital including PLA? edge the 3X8 a convert 4-bit Flip-Flops D-Flip
circuit using
14,15)
10,11, type
F(w,x,y,z)=(0,1,2,8,
Boolean down
B.TECH] an
number between on 4-bit
and generates Boolean
using method UNIT-II
unit.
and of by UNIT-I andA Subtractor What a trigger Flip-Flop?Master-Slave
usinga
counter? steps/phascs 1,15), a synchronous
Subject: PAL level understand
combinational to of procedure.
logic
sequential
convert
Laws. prograImmed
control
unit
binary in of
SEMESTER
alleach
function A' adder
followingfollowing how diagramcondition diagram
difference
between
between output 1= Mckluskey)
1F(A,B,C,D)-X(1,3,7, serial. that
in Johnson
from
questions Morgan's XORFull Explain
nRol
No.) 4-bit
number
binary
Full
to logic Flip-Flops you
Answer
the
following: logicbit
question Differentiate the thetheyou
Differerntiate outputs.
The A a the the
THIRD Implement a the data race will load.
parallel
Paper
Code:
ICT-205 a that - Construct a3-
five De a is Convert aredo Simplify Reduce
(Quinne Gate. is transfer?
OR the the
is Design Prove parallel is Explain
one State What What What What What case? Drawusing
clock.
What Draw Design
Attempt
Time:
3Hours
Select
a) C) d) a)
Note: a b) C
Q1 Q2 ~04 Q5
 iostream
the(7.5) diferent
(7.5) 75)75)harding
C+ (7.5)
(7.5)
List in
usei
and error. are string
istream, What libraries
from
different
manipulators?
different
Explain tempiate
classes.
Explaínexamples.
streams?
is
2-] it rom standard standard
handling
How UNIT-IVv
C++
different C++? appropriate
exoeption?
exception ofC+'
by C++.
in in types
manipulators
C++.
mean are various
strings
different
of
in of allocators help
youused
an advantages the
are the
do classes
is Explain methods.
Explain
What What How What with

a) b a
b)
Q7

C++
Ustng
75
Marks: (5x3-15)
Maximum and
object-oriented
object-oriented integers(7.5)operators
function. (7.5) be (7.5) (7.5) Also,
function 100.(7.5) (7.5) of (7.5)
conversion and(7.5) members? a (7.5) P.T.O.
more(7.5)
which
scompulsory. to
implications of
classes operator area
rules C++.and examples. be polymorphism.
reference.
Explain. two will the
a of
Roll
Bxam
No. Programning to the and in 1betweenof
destructors. unary
private
of swaparguments
types Destructor calculate
derivation
END
TERM
EXAMINATIONand of working objx);? are types the
by overriding
function
contrast suitableand
2024 to different What are a
untt. programming
applications
return program numbersdifferent overloading derivation.
Whatfunction? protected to run-time
JANUARY-Q.Nol the and passing identifiers. and private prograrn
Object each
Oriented and with
tnchuding
from
and
demonstrates
x,
obj aWite
vaue of
Eplain constructors
primeExplain
Constructor
functions? Ilustrate thepublicusing TCT-&
SNESTERBTECH.] the
procedural between between
virtual betweena
UNIT-II
method and
examples. UNIT-I
queston by
UNIT-I C++? display whichWrite triange
Explain call reference? conversion? to
keywords, pure operator?
virtualdifferences compared
polynorphism?
questions
Subject: detal.
in difference reference
programmming
that between in identifiers?
for
foloed between of diference
in
use
between
one questions. program
operators
C++ith
utiedn to a
function situationand
00P? by appropriate
program need rectangle,
N Select tokens.
and Type
examples.
with binary as
ne prOgammine. Diferentiate
any call by Differentiate
overioeding. the
Roll THIRD Difierentiate we the appropriate
Bm
CT209
Code:
Paper the is call are Cormpare makinga
are a
ng there is using
a objects Defne a is do a is Discuss is circie,
all What Wite What What What Why What
Make
WIIte of What What
Attempt Is that
3Time
Hours Attempt
yo
wrtte
b) a b)
Note:
Plecse
 (Please writeyour Exam RollNo.)
Exam Roll No. ...

END TERM EXAMINATION

THIRD SEMESTER (B.TECH]JANUARY 2024
Paper Code: ICT-203 Subject: Operating System
Time: 3 Hours
Maximum Marks: 75
Note: Attempt five questions in all tncluding Q.No1 whtch is compulsou.
Select one question from each untt. Assume mdssing ata, f any.
sn. Attempt the all (5x3 = 16)
Write the difference between a process anda thread. Why a thread is called
light weight process?
5) If a system is using 16 bits for virtual address and 12 bits for physical
address. Find the number of logical and physical pages if size of a page is 1
KB and memory is byte addressable.
Write necessary and sufficient conditions for a deadlocked systern.
Write Peterson's solution for critical section problem.
Write any three differences between a tree and a graph directory structure

UNIT-I

Q2. (2x7.5 = 15)

a) What is the difference between user and kernel mode of an operating system?
How an operating system does switches between these two modes? How does
a monolithic kernel differ froma micro lithickernel?
b) Explain multiprogramming, tÉme sharing and multiprocessing systems. Write
the difference among them in a tabular fashion.

OR

(2x7.5 = 15)
palExplain different states of a process' using process state transition diagram.
Comment on the statement
"Process switching is an overhead though it is
unavoidable.
bY What is multithreading and multicore system? How does
multithreading over
multicore systerm support concurrency and parallelism? Explain with suitable
example.
UNIT I

(2x7.5 = 15)
a) Compute the CPUutilization, average waiting and
turnaround time of each
process in the following case using round robin and preemptive SJF
CPU
scheduling algorithms. Assume duration of time quantum and process
switching overhead time is 2time units each.
P.T.O.
 scheduling 15)
Therequest {in SSTP (15) tages (3z5
1s) in
(3 it.
pagjng 4999. distance
using advan for
is users?
previous
order used
disk
their
demand to requests
0000 FIFO total its methods
a
the withof for
numberedin the performance UNIX
of andrequests these along two
performance
2150 356
compute
used. in any
2. 1618, process rnethods trolled
pending
RAIDcylinders explain
cylinder themethod
544, position,
to con
the & that
allocation nethods?
1RAID at the2800, move allocation are and
(-3-] affect 5000 algorithm.>ass3
and
C-SCAN Justify
request
of UNIT-IV managerment
operations
head
will
has queue
2296, access
0,
page RAID fileFurther,OR
arm
drivea The current variousfile
a serving1212, disk fileaccess
of disk 1805. by
of affected space
various
features disadvantages.
size 2069,thethe
currently detail,
memory?
vtual a cylinder file free
the that that
from
the in is are does
cylinders) algorithm is
does
o Suppose
Explain is at Starting Explain What
HowWhat
How drivewas and
a) b) c)
a) t
Q9.

semaphore then granted in thenanoseconds.

the no Chance P.T.0.
(3x5 heldisframe
=15)
(2x7.5
=15) if is of
synchronized Whattime methods.
milliseconds
be
executed. is 2nd
free
table
request access
time. 7 and
using
a
pageif
100 replacementLRU
units) be the memory 7
not thewill
fault is
solution the 20 of for
(tÉme are processes pageandtime 70%
can and
effective
faults
Time
processes access page
its Available
condition. 0), memory modified modified
system
- ABCD a
Arrival
1332
2, these service global page
Write mermoryan string
two 0,
pagednot is for versus3 of
-2-] 2 problem? racethe (0,
which to replaced number OR
reference
if rate
units) thatof of ABCD 2 5252
421 2316
424366
5
for UNIT-III milliseconds
is
demandpageMain fault local
algorithms.
snapshot
possibility arrives
OR
example Max in
order
nanoseconds? the
(time 1 be page
modified. page2
buffer replaced of
to find
burst following P4 the a
have page
cons
acceptable followingreplacement
suitable
the process 8 1 paging,
bounded write takes the and
CPU to Allocation we theis
leadthe ABCD 2001 2103
3121 1312
1432 page 200pros 3
3 5 with yes, that It or that the dernand
from than
maximum
Processes is variables. maybConsider
Explain 1f registers.
available
replaced
Assume Assume theConsider page
immediately? moreWrite 2 LRU
What they request
Pl For
PI P2P3 PO P2 P3 P4
7
b) a a b) c
a Q6.
If