Q4 Q1 Time:3 (Please

Q3 Q2 HoursPaper

(a) {b) (iii) What(i)is (i) P5, The (a) Explain

(b) the(a) (e) (d) (c) (b) Answer
(a) urtte
Note: Code:
system
been
has resource
instances.
resource
ConsiderCompare burst
Consider CompareInternal
time DiscussPragmentation.
Differentiate Whatsystem.What
operating
Explain
(over
time
all
which
algorithms? Round
processes four all
priority Gantt
Draw
processes your
at AttemptAIDS30
time thecompu
is Bxam
of Robin
(time isthe EXAMINATIOI TERMEND
typetypesPreemptive
a (a tcontiguous
he following an
Suppose
system average
the the using 0.are giveninthe Fragmentation? lsory. Ave
FrTH
larger performance various between various 1/AIML-301 Roll
P P: P P P Bhas processes). following
Process Operating
taken: A, algorithms assumed
questlons 8EMESTER
B.TECH]
JANUARY No.)
Allocation that, B,
with priority the milliseconds: Select
five and quantum 2) charts types states in
002 211 302 200 010 A and and
logical
BC waiting following
timefor set brlef:
instances, at UNIT-I five Non to scheduling
criteriaof System?
C. results oflinked
UNIT-I ofa one
time number have Burat
Time of
Preemptive that 8 1
operating
OR addressCompare tn
433 222 902 322 753 A
processes
Resource processes, process question all
Max allocation
BC TO, schedulingillustratearrived
in Explain tncluding
and
the the implies and
Available systems External with
332 BC A resource type Scheduling
PO from
following minimum these each of in Priority with physicalof
Operattng
Subject:
Systems
the suitable the Rxam
Roll
No.
through algorithms: the
A a
algorithms.
the in
disk. each Q. 2024
has higher order main
execution detail.Fragmentation
address. MaximumNo. 75
Marks:
snapshottheof type length untt. 1
withaverage diagram.
ten P4 P1, functions
Chas examples. priority), whlch
instances, and scheduling FCFS, P2, of
P.T.0. of
waiting P3, the ls
seven three
these
(8) and SJF, P4, (8.5) CPU (7.5) of
(4) (5) (5) (5) (5) and (5) (3) an (25)

Q9 Q8 07 Q6 Q5

(b) (a) (b) (a) (b) (a) (b) (a) (b) (a) (b) (i) Using {i)
Explain
Explain What What
algorithmswith Swapping
diagrarms. (iü) Explain
Demand
paging Write
(contiguous
i) mnemory What
ExplainSemaphores (i) Explain
Critical
section Write
(1) Briefly
FindWIrat
is short do
various the is a short ifnker's
Disk file?
FIFO you Producerexplain the are
various noteson: the
mean notes system
Discuss and algorithm,
file Deadlock contents
scheduling?
LRU on
access
directory by Consumer
the is
various page Paging? in
p-e methods. UNIT-IV UNIT-III following: recovery. safe
answer
need
of
structures OR replacement OR
Explain file allocation. Problem. OR state.
Compare
matrix? the
operations.
following
If
in any
it
algorithm Paging is,
detail.
find
three questions:
and the
s
disk Segmentation.
with safe

examples. sequence.
scheduling

(7.5) (7.5)
(5) (5 (7.5) (4.5)
(5(7.5)
) (5(7.8)
) (8)
 Q2 Q1 Hours
Tine: 3 Paper (Please
Q3 compulsory.
Note:
ia Code: artte
a (b) a
Attempt our
73,28,54,68)
numbeTs:
IHustrate
best-cse algorithm
Dijkstra's
23,75,16,20,52,10,69] numbers
(48,Analyze 3.
step-by-step indicated
2.Teprescnting
1.Solve What indicated
3. 2.Tn) 1.SoBve Compare Explain
Differentiate
CompareP
Distinguish AIDS/AIML/
drewbacks.
Compare TËn)=4T{n/2)
Tin)=
T{nj=2T(n/3) T{n)=2Tn/2)
Tin)= Select EXAMINATION
TERM
END Rram
tbe is the fve
17
T{n/3)
the asymptotic 2T(n/2)3T(n/4)cn? + the the FIFTH
casescenarios. the Dijkstra following following Backtracking one Roll
Find ConvexBig-oh{O) questlons
Merge analysistimne the Greedy SEMESTER
+++ +3n², + Problems andNP question TOT-303 No.)
T(2n/3) n³ cn growth n²logn
out and complexity
recurrence analysis? recurrence
Sort
10 Hull
Approach
Bellman-Fordthe (Insertion T(1)=11 & and
+ rate Approach in
algorithm shortest
UNIT-I
n Branch
UNIT-I Little-oh any.from (B.TECH)
of of all
relations Discuss
functions. rclations with tncluding
Insertion
(Recurrence&
(Substitution
Method) TreeMethod)
(Master's
Method) (Iteration
Method)
(Recurrence
(Master's
Method)
Method)
Tree examnples.
and with each
Perlorm Selection with Subject:
and path
Algorithms Dynamic
techniques.
(o)
Bound notation.
JANUARY-2024
the an unit
analyze using using
on Sort& Cxample.
Merge
sort)
asymptotic question
Assume Algorlthm
the an an Programming. Design
with Selection Maximum
Marks:75 BramNo.
sort its following on appropriate appropriate
time their the
on notations mtssing no. &
complexity
the advantages
following
Sort. (3+3+3=9)
1 Analysls
graph (3+3+3=9) which
following method method
.0. (7) (8) Perform
(6) set
used data
using (6) (3) (3) (3 (3(3) is of
in & of as for as f

AIm/arDs
Q9 Q8 Q6 Q5

(b) (a) (b) (a) (b) (a (b (a (b) (a)

Discuss applications
Explain Illustratecomplexity.
Discuss timeits
Discuss 2 the Programming
Explain with
Approach.
Dynamic is as:
What Weights:
profits
Consider Discuss Kruskal'sWhat
followingalgorithm &8.Findoutthe
Cook's the is is
NP-complete several the Floyd
backtracking? {3, the Strassen's
&Prim'sMST?
16
Graph of traveling
1
4,
theorem graph graph
Warshall's following
6,
Graph example.
Also, 5} Consider
coloring using total and
traversal
and salesman
Matrix 13
Algorithm.9
and traversal
NP-hard UNIT IV Inprofit
Profits:problem
problem the
algorithm. UNIT-IM 20
its reference multiplication the (-2-1
applications. techniques. Floyd-Warshall
Also,given
techniques.
problem timeits earned (2,
discuss
problems for
with 3,
Find to 0/1 calculate
by1,
graph
the with this 4}. and
out thKnapsack
e The
algorithm with
Also, an algorithm. all explain analyze the and
examples. examnple. complexity.
pairs' 0/1
capacity weight fnd
discuss Knapsack
using thhaving
and N-Queen's its
shortest out
of time of
example. the
Also, thweights
e MST. the
complexit
(8) real-life
(7(8) analyz
(7) path knapsae MST
(8) Proble:
(7) (8) (7) (3
(Please wrtte your Bxam Roll No.) Exam Roll No.

END TERM EXAMINATION

FIFTH SEMESTER (B.TECH) JANUARY-2024
Paper Code: AIDS/AIML/ IOT-303 Subject: Design & Analysis of
Algorlthm
Time:3 Hours Maximum Marks :75
Note: Attempt fve questions in allincluding question no.1 which ts
compulsory. Select one question from each unit. Assume missing data f
any.
Q1 (a)Distinguish Big-oh(0) and Little-oh (o) notation. (3)
(b)Compare the Greedy Approach with Dymamic Programming. (3)
(c)Differentiate P and NP Problems with examples. (3)
(d) Explain the Convex Hull Approach with an example. (3)
(e) Compare Backtracking & Branch and
Bound techniques. (3)
UNIT-I
Q2 (a) Solve the following recurrence relations using an appropriate method as
indicated. (3+3+3-9)
1. T(n) = 3T(n/4) t cn2 (Recurrence Tree Method)
2. T(n)=2T(n/2) + nlogn
3. T(n)= 2T(n/2) +3n2,T(1)=11 (Master's Method)
(Iteration Method)
(b) What is asymptotic analysis? Discuss the asymptotic
representing the growth rate of functions. notations used for
(6)
Q3 (a) Solve the following recurrence relations using an
indicated. appropriate method as
1. T(n)=2T(n/3) + cn (3+3+3=9)
2. T(n)=4T(n/2) + n³ (Substitution Method)
3. T(n)= T(n/3) + T(2n/3) + n (Master's Method)
(b) (Recurrence Tree Method)
Analyze the time complexity of Insertion Sort&
step-by-step analysis (Insertion & Selection sort) Selection Sort. Perform
on the following set of
numbers (48, 23,75, 16,20,52,10,69]
(6)
UNIT-II
Q4 (a) Compare Dijkstra and Bellman-Ford Algorithms with their
drawbacks. Find out the shortest path on the following advantages &
Dijkstra's algorithm. graph using
(8)
9
B

12
10

(b) Ilustrate the Merge Sort algorithm and analyze its

best-case andworst-casescenarios. Perform Merge time complexity in
numbers: (37,15,94,73,28,54,68] sort on the following
(7)

P.T.0.
 using
(-2-1
the MST(8)
graph and find out
Consider the given weight of MST.
(a)
What is MST? Algorithm. Also, calculate the
05 Kruskal's &Prim's
9

I3

20

and analyze its time complex1ty.

Discuss Strassen's Matrix multiplication (7)
(b)
UNIT-II
and
for 0/1 Knapsack having weights
following problem
(a) Consider the knapsack
Q6 proffts as:
Profits: (2, 3, 1, 4). The capacity of the using the
Knapsack
Weights: (3, 4, 6, 5) and profit earned by the O/1 (8)
is out the total
8.FindProgramming Problem
Dynamic Approach. N-Queen's
backtracking? In reference to this explain (7)
(b What is discuss its time complexity.
example. Also,
with algorithm & shortest path for
algorithm. Find out all pairs' (8)
Explain Floyd Warshall's algorithm.
Q7 (a the Floyd-Warshall
the following graph using
5

2 2

analyze
problem with an example. Also,
(b Discuss the traveling salesman (7)
its time complexity.
UNIT IV

techniques. Also, discuss the real-life

Q8 (a) Illustrate several Graph traversal (8)
applications of graph traversal techniques. (7)
(b) Discuss NP-complete and NP-hard problems with examples.
example.
Q9 (a) Explain the Graph coloring problem with the algorithm and (8)
(b Discuss Cook's theorem and its applications. (7)
tttttttttttht
 (7) How unsupervised
th (8)concise of discuss cons
ofDBSCAN (6) cleaning.
{8)clustering
k-Means (8)agglomerative
noise, (7)
andusing BBN. examnpies
a2-dime diagram.
k=3 a a and outliers,
constitute
classProvide data
If Explain.suitable,
10) Provide
neat and
in 10)(1,2),(3,4),(5,6),(7,8),(9,
predicted foras and
points and
(BBN)?
that a used
such clustering
with supervised
works? approach. over
most
mining. pros
components
following
the process is issues
techniques
Network DBSCAN
classification the
calculate leaming
(-2-] data witheachState
partitioning
address
UNIT-III between
the classification UNIT-IV data?
key OR
Belief of of of various
algorithm, OR
with (4,5)(4,5),
the associated advantages
type
context techniques
the
(9, Bayesian
difference
(7,8), Bayesian
explain inon hierarchical
clustering.
dataset each explain
data inconsistencies
note
(1,2),(3,4),(5,6),
is KNN
algorithm. thewhere DBSCAN
Naive
a point and the the challenges the these
a in and short
Consider is definition scenarios are
algorithm?
Space: theExplain
Describe learning method.
queryWhat Explain do a
Identify
does What Write
the HowAnd

a b) a) b) b) a)
a) b)
Q6
Q7 Q8 O9

Subfect:
Data
Mining
Maximum
Marks:
75 compulsory.
(3x3=13)
it ways an if
passenger
or data
determine
does withethical
(8)process.
(7) canstudent
(8)the(7) context
selecting
classification
removal
noise
two P.T.0.
(8) of Min(8)impact
(7)X={7,12,5,8,
any. Provide
predictiveassociated How Explain
beneficial.
different set
No.
ll
END
TERM
EXAMINATION How
regression. and A by
ñ analyze
mining education. the data potential
data, objectives. of responsible for data
ts mnining.
which the is to faces (KDD)? in techniques
and considerations to selection
X: ofthe
Exa 2024 missing clusteringa data attribute analysis
are linear wants its
techniques?
thethis descriptive
of used Databases Normalize
1 data and
JANUARYNo. primaryWhat this, ensurethe field any
Assume Explain Is step. be subset predictive
Q. station
where different X? dataset
lncluding
in
transformation? dodatabase. in thetechniques one13,3,4,5,13,8,7,6}
organizations
each set X Discuss
{115,233,484,543}.
its clustering
To ethical involved process. only for 1.0).
B.TECH regression?
analysis application Define in in feature
unlt. mining Discovery
data
deviation a -30
AT
explain screening
not. UNIT-I techniques?
illustrate UNIT-II
two includes for in
and OR the (0.0,
all each or
a evaluation?
steps classification
KDD of Discuss technique
OR
outcomes.
noise
8zMESTER data in of median? (range:
and of criminals challenges data significance
tn
from question Linear data
oftransformation?
data Justify.
task?
prediction
kept
real-world can to mean standard of
analysis
No.) questlonns concept
traditional security main the
Knowledge 12,
Mining mining
How exampleof data?
performance concept
role in
mining. 12,thethe A= normalization
Regression
Rol FrTH question useneed and
pattern involved subsets.
feature
12,19,7,the mining
|Paper
Code:
AIDS-305 ffve are the
mining. or given:
Bxam Data we we the a airport
the data an the the for is is the
fAve
Attempt
Note: scanned
passengers clustering What
What Find
any from of Discuss Describe is set techniques.
do
do example
Describe mining? of
ProvideExplore Explain
data Describe
data
your 3Hoursone
Time: DefineWhere is data stages
What data
5,9,13, is
Define
Attempt
differ Why What use data
wrlte of A max
Select An are ii) iii) on
i)
a) b) c) d) e)
Pleass n a) b) b)
a) a) b)
Q1 a) b)
Q2 Q3 Q4 Q5
 (Please wrtte your Bxam Roll No.) Exam Roll No.

END TERM EXAMINATION

FIFTH SEME8TER (B.TECH) JANAURY-2024
Paper Code: AIDS/AIML/ IOT/307 Subject: Computer Organization &
Architecture

Time: 3 Hours Maximum Marks :75

Note: Attempt flve questlons in all including. Q.no. 1which is
compulsory. Select one question from each untt.
Q1 (a) Explain timing and control diagram with exarmple. (2.5x6-15)
(b) Explain RISCpipeline.
(c) What are computer registers? How information is transfer from one
register to another?
(d) Differentiate between multiprocessors and
(e) What is grain size and latency in computer multicomputer.
(f Subtract 24 from 15 using 2's compliment. architecture?
Unit - I
Q2 (a) Explain Instruction Cycle with phases in detail with diagram.
(b) (7)
Explain the various levels of programming languages. (8)
Q3 (a) Explain bus architecture using multiplexer.
(b) Explain various micro-operations. (7)
(8)
Uait-II
Q4 Write short notes on following
(a) Instruction format.
(b) (7)
Addressing modes. (8)
Q5 (a) Explain with diagram, the memory hierarchy in a computer system.
(b) Explain Set associative cache mapping in detail. (7)
(8)
Unit-III

Q6 (a) Differentiate between program partitioning andscheduling.

(b) How parallel processing enhances (7)
the system performance, explain.
Q7 (a) What are the conditions of parallelism in computer (8)
(b) What is the classification of parallel architecture? (7)
computers? (8)
Unit -IV

Q8 (a) Explain the Flynn's classification of computer.

(b) Explain Instruction Cycle with phases in detail with diagram. (7)
(8)
Q9 (a) Explain the hardware implementation of division arithmetic
operation.
(b) Explain CPU performance and its factors. (7)
(8)
LND TERM EXAMINATION

yThánge

(6xo-15)

(7)
(8)

(7)
(8)

(7)
(8)

(7)
(8)

(7)
(8)

(7)
(8)
USIT IY
(5)
(10)

(5)

(10)
 (Please wrtte your Rxam Roll
No.) Exam Roll No.

END TERM EXAMINATION

PTH SEMESTER [B.TECH] DECEMBER 2023- JANUARY 2024
Paper Code: AIDS/AIML-309 Subject: Introduction to Internet
Time: 3 Hours of Things
Note: Attempt flve questlons tn all includtng Q. Maximum Marks: 75
No. 1 whlch ts
compulsory. Select one question from each unt.
Q1 Attempt all questions:
(a) What is IOT. (5x3=15)
Explain main components of lOT.
(b) Compare IPV4 and IPV6.
(c) Write short note on IOT
(d) Discuss 10T Challenges impact on real world.
and benefits of 10T.
(e) Explain eHealth IOT
applications.
UNIT-I
Q2 (a) Explain physical design of 1OT.
(b) Explain Architecture Reference (7)
model of IOT. (8)
Q3 (a) Define sensors in IOT, Explain different types of
sensors and draw
hardware circuit for sensor. (7)
(b)Explain IOT architecture based on application. (8)
UNIT-II
Q4 (a) Explain Arduino code to communicate the microcontroller with
actuators.
(b) Explain following Access (7)
1)Zigbee 2) RFID
Technologies: (8)
3) Cellular
Q5 (a) What are I0T software platform. Explain with example.
(b) Discuss IOT design methodology steps. (7)
(8)
UNIT-III
Q6 (a) Explain physical layer, MAC layer and topology of IEEE 802.154 (7)
(b) Explain IPv6 overlow power WPAN. (8)
Q7 (a) Explain COAP & HQTT protocol. (7)
(b) Describe Architecture of wireless sensor network (WSN).
(8)
UNIT-IV
Q8 (a) Role of big data in IOT. (5)
(b) Explain smart irrigation system with diagram. (10)
Q9 (a) Explain cloud computing. (5)
(b) Analyze case study of IOT with one example and find out the solutions
of various deployment issues. (10)

AIDs/ArL 309