Semester: 4

Qn. Set Code-7 (SOT) Programme: B. Tech

Branch: CSE, CSCE

SPRINGEND SEMESTER EXAMINATION-2024

4h Semester B.Tech
OBJECT ORIENTED PROGRAMMING USING JAVA
CS20004
(For 2022 & Previous Admitted Batches)
Time: 2 Hours 30 Minutes Full Marks: 50
Answer any FIVE questions.
Question paper consists of two SECTIONS L.e. A and B.
Section A is compusory.
Attempt any Four question from Sections B.
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words as far as practicable
and all parts ofaquestion should be answered at one place only.

SECTION-A
1. Answer the following questions: [lx 10]
(a) Find the output / error for the below code with brief explanation.
class Test{
public static void main(String[]args) {
for(int i= 0; 1; it+) {
System.out.printIn("Hello");
break;
}}}
(b) Find the output / error for the below code with brief
explanation.
class Point {
protected int x, y;
public Point(int_x, int y)

X= X;
y=y;

KIIT-DU2024/SOTSpring End Semester Examination-2024 (1)

 On. SetC

below code with brief

}} (c) Find the output/error for the
public class Main { explanation.
public static void main(String args[)) class STRING {
public static void main(String args[ ]){
Point p = new Point(); String s="DATA";
System.out.println("x="+ p.x +", y="+ p.y);
s.concat("SCIENCE");
}} System.out.printIn(s);
(c) Find output/Error for the below code with brief s=s.concat("ANALYTICS");
explanation. System.out.println(s);
import java.io.*; StringBuffer x = new StringBuffer("KALINGA");
class Parent{ System.out.printin ("The capacity before append is:"tx.capacity());
void msgOthrows Exception { X.append("ODISHA");
System.out.println("parent class method"); System.out.printIn("The capacity after append is:"+x.capacityO):
} } }}
class TestExceptionChild extends Parent{ () Find the output/error for the below code with brief
void msg0throws ArithmeticException { explanation.
System.out.printIn("child fclass method"); class Exception_Demo
{public static void main(String args(1)
public static void main(String args[]){ {try{
Parent p = new TestExceptionChild4(0; throw new ArraylndexOutOfBoundsException("AIOBE"); }
try { catch(ArithmeticException e){
p.msg); System.out.printin("Exception Caught with first catch block"): }
}catch(Exception e) {} catch(Exception e)
System.out.println("Exception Caught with second catch
}} block");}}}
(d) Find the output / error for the below code with brief (g) Write any two differences between abstract class and
explanation. interface.
class Test { (h) With suitable example, explain the difference betwveen equals
public static void main(String args[ |]) { ()and = operation on String objects.
System.out.println(10 + 20 + "KIIT"): (i) What is the purpose of using sleep() method and join()
System.out.printin("KIIT" + 10+ 20); method with Java threads? Give syntax.
() Which swing component is used to display images and which
method is used to add an action listener to a button in Java
Swing? Give syntax.
KIIT-DU 2024 SO7TSprug End Semesser
KIT-DU 2024 SOT Sprng tnd SemesterExamination-2024 (2) Examination-2024 (3)
 SECTION-B
resolution while implementing multiple inheritance
architecture
2. (a) Draw and explain the components of javabyte code in using interfaces with suitable example.
in detail. What is the significance of
(b) State the differences between String and StringBuffer [5]
achieving portability? class. Write a program in java to perform the following
(b) Write a program in java to implement Queue data operations on string objects.
structure. 1. To reverse two strings without using any third
variable.
Create a class Queue having data members Max Size,
an integer array, front, rear and size. Initialize default 2. To check if two strings are anagrams of each other
values for data members in default constructor. The or not. (Two strings are said to be anagram of each
functions enqueue)., dequeue), isEmpty(), isFull), other if they contain the same characters but in
size) and display() of Queue class has to be different orders: e.g. state & taste)
implemented and tested to make your Queue class
follows First In First Out principle. The queue must
check for overflow and underflow conditions, and (a) What are the different ways to create a user defined [5]
handle it as a user defined exceptions. thread? Write a program in Java to create two user
defined threads which performs the following task
respectively:
V3. (a) Draw the thread life cycle and explain the different (5] 1. Prints all possible substrings of agiven string starting
states of a thread. What are the different techniques
available in Java for achieving synchronization of from the first character of the string. After printing each
threads? Discuss with suitable examples. substring, it sleeps for 500 milliseconds (Task-1)
(b) What are the differences between function overriding [S]
N.B.: Ifthe string is KIIT, it will print K, KI, and KI.
and function overloading? Write a java program to 2. Prints the reverse of each strings present in the string
create an abstract class Bank having an abstract method array. After printing reverse of each string in the array,
geRateoflnterest). Derive three classes SBI, ICICI and it sleeps for 1000 milliseconds (Task-2).
HDFC from Bank class. Now use dynamic method N.B.: Input: (KIUT, SCE, CSE, IT, CSSE, CSCE}
dispatch concept and function overriding concept to Output: /TIIK, ECS, ESC, TI, ESSC, ECSC}
override getRateoflnterest) of bank class with derived
class methods to display rate of interest of different
banks. (b) Draw the Throwable class hierarchy. State the
differences between checked and unchecked
4. (a) Draw picture of multiple exceptions. Write a Java Program to create an user
Explain with exampleinheritance through interface. defined exception called llegalArgsException and
program throw the exception if we pass the negative timeout
inheritance is supported in java throughhow multiple value in Thread.sleep() method otherwise sleep for
not by classes. Explain the interfaces and given time and display "KIIT University" five times.
rules for ambiguity
KIT-DU 2024 SOT Spring End Semester DU2024 SOTSprng Fnd Semester
Eamutkn-2024 (5)
Examination-2024 (4)
 6.
(a)
rulesare An components
Component totregistration
List: toregistration
he and The Create
3. 2. Validation
1.Rule: 8. 7. 6. 5. 4. 3. 2. 1. corresponding carry
relevant
exception
The than6.0 The to
8.
The CHANGE color textboxes.
from
the
RESET SUBMIT CSSE)
and Email Branch: CGPAName(Label Roll a
@<string><string>
satisfied.
not out swing
CGPA length display No data. page
Email from Id(Label different
must (Label present on
be application
(Button): (Label
GREEN(default) (Button): Dropdown Buttons entities to
can' t of COLOR the textbox
be ID the participate
thrown data &
& & &
operations. have
be Roll To Text
Text Text Text
must in
must in To frame
are:the must
greater No (Button): clear the Box):String
Box): to Java
if submit Box): Menu Box): be be in
any be must frame placed be
to all Float The displayed a to
than (CSE, Integer available Universitycreate
of in be PINK Toentered datathe ontheString
details on
the 10.0 in the data
the the change IT, the on a
validation to student's
and range labels.
entered CSCE, of a
format frame enterlabelevent.
less the th e
7

DU
024 (b)
g th
two wicalculator
shouldresult buttons
text
operationsavailableBriefly
any
End be of(ADD
ter displayed boxes
additionbackground in discuss
addition in
4
swing.
swing
and and about
inand SUB).
*** *
third press color, and Write
irame
java the
subtraction subtraction.
(7) text ADD When three components a
box. to
program
oryou text perform
ofSUB Design
two
placeboxes and
button, designto
numbers values arithmetic the containers
and
frame
the in two
a
 Semester: 4fh
On. Set Code-7 (SOT) Programme: B. Tech
Branch: CSE

SPRING END SEMESTER EXAMINATION-2024

4th Semester B.Tech

SCIENTIFIC & TECHNICAL WRITING

EX20003
(For 2022 & Previous Admitted Batches)
Time: 2 Hours 30 Minutes Full Marks: 50

Answer any FIVE questions.

Question paper consists of two SECTIONS L.e. A and B.
Section A is compulsory.
Atempt any Four question from Sections B.
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words as far as practicable
and all parts of aquestionshould be answered at one place only.

SECTION-A
1. Answer the following questions: [lx 10]
(a) Which of the following topics is most likely to be
written about in a technical style?
A sunset/ the cuisine of a country/ electronic circuitry/ a
dentist's office/ a classroom environment
(b) Nominalize both verbs in the following sentence:
Can you please evaluate what the student demonstrated?
(c) Should a shopping list be written as a numbered list or a
bulleted list? Give one reason for your answer.
(d) Identify two transition elements in the following sentence:
Contrary to homepages and other web pages, a landing
page is a standalone page. It is disconnected from the
website's navigation, focused on the sole purpose of
convincing avisitor to sign up for a free trial or buy a
product.
(e) What does a cover page of a thesis contain?

KIIT-DU2024 SOT Spring End Semester xum1natuon-2024

024USOi
2.
(b) (a) (i) (i) (h) (g) (f)
ing before ATM'Correct
Potassum
24omg
Calcium
260ng
ang Proteln
IronVtamtn
2meg D 39 ChelStenoi
OarbohyreteSoum
16omg
Total
379 Omg technical
technicalStudy mentioned
unavoidable
Explain conditions: Correct research a
Cash. Notsare Tetal 8
FatOg Servng
size
DuebelowFrameDuring Find What
i)
iv) i ) i ) document?
Dietary
Sugers
Total
12gFber4g
Calorles
Saurated
Trans
FatOg servings
ster
End24 tndudes Nutrition
Facts
Please
You to The The The The the is
the the a the the
F
the torquetorque correct
torque the
10g at per writing
writing suitable torque
leavethefollowing 10
following difference mixed last
following
make Added in purpose
ontainer
smart fiv e is is is isone:
Taking Gugre (56o)
cup2/3 in it
Sure traffic titledays, 2525 25 25
it: is.
SECTION-B
information. city of
Vee
Gey Nnm. n.m. n
ATM. paragraph:
230 Point between usingsentence: m. m.
your 20% 10% 20% Bhubaneswar. the
Conflict-of-Interest
Debit 45
conditions,
given out temperature
capitalization
creator
card's, four
Mention
the
characteristics and
Correctplease accidents rose
what author. rule Statement
by
change pay kind for 4°C.
are the in
In of of
[1+4=5]

-D0 S. J4,

2024
(b) (a) (b) (a) (b) (a)
SOT meets on
analyzing evaluation
minimize
for methodology considering
ontraffic
approach.
routeenhance
Figue 00 400 600 1400
1000conferenceFollowingoverallprovide
1200references Write
This sequential
paragraph.
following pattern,
avoidpattern?
ListCompose
800 Should
praag
individualspredefined these
1: 1057 study
End Sossion-wse 2018
Fall the plagiarism."
520 travelpractical conditions. a the
ester 437 criteria. travel Give or a
Total possible travelprocess. Theexplores suitableorder
sections
proceedings for any established brief
a projecta
Students' 1107 expcrience criteria. Persuasion
24 Applications Spring
2019 a involves obiective
efficiency reasons
749
standard and and
book, insights and factorssuchas
Process title,
Apphcaion routes. time
Dotential and (150 proposal
the
transportation explain of
Accepted
1009 and the for
2019
Fall optimization words)
641 reference
and a and criteria.
jourmal into and safetv.
identifvingoptimal is bv abstract
your
apattern pattern,
Stats evaluating to be
Rejected material efficiency. selecting routes emploving research
them
identify developed
answer.
V34
route This maximize
Spring
2020 Through and
paper,style,
svstems distance.
travel briefly. paragraph or
464 route are of
on planning
research the keywords a
cach the route the manuscript
Cause-and-Effect
the write route assessed a in
book a is a most
Web. safetv. multi-criteria a
to destination.
route selected
svstematic selection on
chapter,
strategiesaims that
details improve
suitable "How
Description
based based time. for
best The in
of to to to the
a to
(1+4=5]
[S] [5] [S] [5]
 Represent the data of Figure i in an appropriate Tabular
format and Label the Table with appropriate caption.

6. (a) In conducting your research, you have received [S]

assistance from others in the form of materials, funding,
methodologies, fellowships, collaborative discussions,
and manuscript revisions. Write acknowledgments in
the required sequence mentioning the above points.
(b) Draw a logic flowchart to depict the following process
of a student considering engineering as one of his
career options.
The process begins with a student considering
engineering as their field of study. The student decides
to pursue engineering through cntrance exam or direct
admission.
Entrance Exam: If the student qualifies the entrance
exam, then they procecd to choose an engineering
college. Then they apply for admission, and if their
entrance cxam score meets the cut-off set by the
college, they attend counseling, select a specialization,
complete the admission process, and ultimately join the
college.
Direct Admission: Alternatively, the student might seek
direct admission by meeting the eligibility criteria set
by certain colleges. If they meet the criteria, then they
procced to choose an engineering college, apply for
admission, provide their academic record and test
scores. If they meet the admission criteria, then they
proceed with the admission process, pay fees, and join
the college.
The process concludes cither when the student
successfully joins a college or decides not to pursue
engineering at that time.
T-
4.
DU f. 5.
024 (b) (a) (b) (a) (b) (a) (b)
SOT
ing W2(B) if
S: andIllustrate
candidate B->D,Given example.suitable
Explain Describe
algebra. examples. Explain >BD}. minimal F
Describe set schema. C.
participation decompose th
ifwiDefine the
relations
normalization. Describe
RI(A), T3the ={ the of Convert
End decomposition
set
ster
followingis D->B} the A->BC, given FDs
conflict Illustrate the cover BCNF.
of
the keys relation different the canonical RI(W, lossless
F={W->XY,
24 R2(A),
R3(A), rules it FDs the
for of shortcomingconstraintstypes into
B->C, for relation
schedule
serializable Consider
F-{{A, Consider
X,
of the FDs.
R(A,B,C,D) types on relation BCNF. is above
conflict above the or decomposition
lossless Y)
****¢ R
Determine of of A->B,minimal B} andY->} a
S need in satisfies the ER
relation. outer of mapping R(A,B,C,D) relation
Wi(B), or
with
serializability. ER AB->C, or
R2(Y,
not. and of
inner relation
{C, lossy. is diagram
joinouter model cover. decomposed
transactions the the BCNF. D}, Z). R(W, in
join C->D,
W2(A), super set operation join constraints with R the
Determine ’C(A, Check X, into
F in with If
Investigate keys = operation. A->D, set not, B}. B,
context
Y,
{AB->C, relational whether into Z)relational
R3(B), T1, with suitable of Justify C,
T2, and and FDs then two with
B the D) of
a

[S] [S]

1.
Time:
IIT:DU Candidates
(g) () (e) (a)(d) (c) (b) 2
2024
Hours SPRING
SOT a
transaction.databases.
DH->BC,Consider with design. List
FDs Compare DiscussAnswer
Define
independence.
pring
Distinguish
Outline and are
CS20006/|
the 30
T20006/ICC20006/CM20006/CS-2004 all
suitable
F={A->BC,examples. required Question MANAGEMENT
DATABASE
(For SYSTEM
End parts Minutes
Semester
data problems self the The END
the AEG->G}. the and paper 2022
following of
figuresto
Attempt
independence.
significance between relation join a
give Answer Qn.
on-2024 contrast with question Section
consists &SEMESTER
CD->E, that their inany B.Tech 4 Set
SECTION-A the any
Previous Semester
Is questions:
suitable should
answers Four
R(A.B,C,D,E,F,G.H) can margin A of Code-7
centralized
of BCD->HE->C, aggregation isthwoFIVE
List arise compulsory.
question
beinSECTIONS Admitted
D' example. answeredindicate
their questions.EXAMINATION-2024 (SOT)
different in a
A D->AEH, due from
valid own full
CID and and to atSections
words Le. Batches)
FD? bad one marks.
composition A
typesproperties place as and Programme: Tech B.
Branch:Semester:
distributedABH->BD, and database B. far B.
of set only as CSCE,
CSE,IT,
Marks:
Full 50
data of practicable
of
[l10]x
CSSE
KIIT-DU

2024
(b) (a)
SOT
(i) (i) (h)
Spring Catalog Suppliers
Parts Consider Explain
manager D. C. onlyIl
B.
onlyA.
Time-stamp
orderingdeadlock?
I2-phase
locking examples.
suitable
I . 1.ensureWhich of How
List mapattributesto-many.
(iv) for
and (iii)many. Q,(ii)diagram (i)
Neither Both
End (pid, this
set Relationships S.Let where Let S, Let
Semester (sid, I both many where which
the the and theory
scenario RI P,
pname, (sid,components I of R3 single-valued
comprising
nor the RI Q
tion-024 pid, following I! conflict minimum their and and and
sname, role R3 has
II following based is R2
cost) color) into own.
is R4
one-to-many only S
of R1, be be
in
SECTION-B serializability relational many-to-one
be
rating)
schema: DBMS query relational R2, two one three
concurrency
control number two multi-valued
R3 relationships different
processor relationships
and
environment. algebramodel? of while
R4 while
and tables entities
do R2attributes,
freedom operations R4 between attribute.
and required not is
between
is in
protocols have a many-to
storage except that
from many P
with any and ER
to Q

(S]

KI!-DU 3.
2024 (a)
SOTpartial attributes database.
BANK
B. A. Consider 'motherboard.
PO3*. supplics IV
V.only supplies
II. 'P*PO1' 4.
OS'.orI . thanAlgebra.
Sprong I. Write
Is List Display Display Display Display Display
End key, there BANK
Name
Semester the RED'
the
in the
the USTOMERRone
and any strong Add the the the the
following
ation-2024 ER the
identifying weak given supplier supplier colorname details details
ACCOUNT diagram
entity BRANCHES
entity ER of ofqueries
part. and
diagram. details the the
relationship.type? types as details rating
shown supplier supplier using
who
If along ARANCH
BANK
for of
LONN below
so, LC do the the who with SQL
give with not
for suppliersuppliers supplies rating or
supply Relational
its their part
name, greater
key of part who who part
a

(5]
 Qn. Set Code-7 (SOT) Semester: 4
Programme: B. Tech
Branch: CSE, IT, CSCE, CSSE, E&CSc

SPRING END SEMESTER EXAMINATION-2024

4th Semester B.Tech
DISCRETE MATHEMATICS
MA21002 / MA 2013
(For 2022 & Previous Admitted Batches)
Time: 2 Hours 30 Minutes Full Marks: 50
Answer any FIVE questions.
Questionpaper consists of two SECTIONS Le. Aand B.
Section Ais compulsory.
Attempt any Four question from Sections B.
Thefigures in the margin indicate full marks.
Candidates are required to give their answers in their own words as far as practicable
and all parts of aquestion shouldbe answered at one place only.

SECTION-A

1. Answer the following questions: [1x 10]

(a) Find the inverse and converse of the following
statement:

"Good foods are not cheap

(b) Determine the truth value of cach of the following
statements if the domain consists of all integers.
() Vn(n + 1> n) (i) Bn(2n = 3n)
(c) Find the equivalence relation corresponding to the
partition set P= {{a, b},{c}, d,e}} of the set A =
fa, b, c, d, e}.
(d) Find the number of positive integers not exceeding 100
that are divisible by either 4 or 9.
(e) Find generating functions corresponding to the numeric
function
a, =n'; n1.

KHZ-DU20o24 SOT prng bnd Semester Examimaion-2024

 Use(a) 3.
(b)
(b) (a) ) () (h) Findthg)
e ()
Show Let
divisible Therefore, AlJohn' s Every
equivalences.
Verify logicallyShow
l living Find
Determine
RegularDefine{1,-1, graphical not?or multiplication
the all The
R animals
that mathematical
induction
be to zero-divisors
subset
a by goldfish the that~p the set
Rreflexive
(a, equivalent graph, the -} i, greatest
John's have validity following order whether (3,9,12), Zz0
is whenever 3 thing under
an b) E is Complete modulo =
equivalence R, goldfishhearts. alive is of of lower in{0,1,2,
relation
(a, a the SECTION-Bby V ordinary the
terms the in Zz0
c) n and plant developing (~p he
tbound 20
has following graph. elements degree .*
¬ on isa animal.
it an or A with poset is,19}
relation. R positive
a a is )) multiplication. a
not and
commutative
set prove heart. examples: sequence (2*.|
least under
(b,c)¬ R. A argument:
a aand of
integer.
such plant. scries
that ~p the upper
). addition
that group 3,3,3,3,2
n- A bound ring.
of~q
logical
n are G= List and
is is of

[5] [5]

6. ý. 4
(b) (a) (b) (a) (b) Findt(hae)
fromUsing Show Let 4a,-2 Find
(ii) () Let diagram,Show a, an
(a a(G,) = =
vertex G the 6aF-1- 6
Dijkstra's that be = b)-l =a:c b that
th e solution
8; be when usingsolution
numeric
(G,+)
a set for = a (P(S),
to r22, b-l·a1. group generating
S 9a,-2
z is of th e =
algorithm
of an all b=
C,
6 and {a, S)
=
the abelean a*b nonzero recurrence ;n
with a, b, is
$**** following
d c}. function.
a >
ao
b, POSET. recurrence 2the of
to
group. 2 abreal c
find = ¬ with
relation
1, G.
weighted numbers
the a, Show Draw
= a, ao
shortest 2. that =
graph. and the
4a,-1+ 1
elation
Hasse
path and

(S]
 Semester: "
Qn. Set Code-7 (SOT) Programme: B. Tech
What is the content of the Need matrix? Branch: CSE, IT. CSCE, CSSE
II. Find if the system is in a safe state by SPRING END SEMESTER EXAMINATION-2024
demonstrating an order in which the processes may 4h Semester B.Tech
complete. OPERATING SYSTEMS
If a request from process P4 arrives for (0,4.2,0) can the CM20002 /CS20002 / CS 2002 / IT20002/ CC20002
request be granted immediately?
(For 2022 & Previous Admitted Batches)
(b) Explain the deadlock recovery mechanism. [3)
Full Marks: 50
Time: 2 Hours 30 Minutes
Answer any FIVE questions.
(a) A disk has 200 cylinders numbered from 0 to 199. The (6] Question paper consists of two SECTIONS Le. A and B.
drive is currently serving a request at cylinder 53 and Section A is compusory.
Attempt any Four question from Sections B.
the previous request was at cylinder 25. The pending The figures in the margin indicate full marks.
request queue is 98, 183, 37, 122, 14, 124, 65, 67. Candidates are required to give their answers in their own words as far us practicable
Starting from the current head position, the total and all parts of a question should be answered ut one place oniy.
distance the disk arm moves to satisfy all the pending
requests for SSTF Disk Scheduling Algorithm is X SECTION-A
cylinders. Similarly, the total distance the disk arm [lx 10]
moves to satisfy all the pending requests for C-SCAN 1. Answer the following questions:
Disk Scheduling Algorithm is Y cylinders, find X+ Y. (a) Differentiate between Serial Processing OS and Batch
14] Processing OS.
(b) Explain the steps along with the data structures required
to be referred fora close( ) system call to close a file. (b) If time slice size is of 3 units of time and only one
process with 14 burst time is there in the ready queue,
and RR CPU scheduling algorithm is applied., then
6. (a) What is the role of an inode? Describe the structure of [6] what will be the number of context switches?
inode in UNIX.
(c) A process executes the following segment of code:
compare [4) for(i=1; i<5; it+) fork();
(b) Explain any two file allocation methods and
them in terms of space and time. How many child processes will be created?
(d) CPU generates a logical address as Ox00f3 whose
sk****
physical address is Oxfr15. Find out the starting
segment address of the segment and offset, if 8bits are
used for the offset.
(e) At present, the value of a counting semaphore is 7. If
20 P() operations and X number of V)operations are
performed leading to a final value of 5 for the counting
semaphore. Find the value X.

KIT-DU2024 SOT Spring End Semester Examination-2024

 () Highlight the advantages of acyclic graph structured (b) A shared variable D is 100 initially. A process PI
directory. (3]
incrcases Dby 20, process P2 reduces Dby S0, process
(g) A system has 6 identical resources and N Cincreases Dby 10. Find the Minimum and Maximum
processes
competing for them. Each process can request atmost 2 value of D after the executionof the three processes.
resources. For what values of N will the system lead to
a Deadlock?

(h) Justify whether it is possible to have a deadlock with v3. (a) In the memory, four partitions are of sizes 4KB, 8KB, [71
20KB and 2KB (in order) respectively. Total 7
one process only.
processes arrive at time 0 with memory request size (in
(i) Compare between Device controllers and Device Bytes) and usage time (in ms) as given in the following
drivers. table:

() "It is better to dispatch shorter processes first while Req No PI P2 P3 P4 Ps P6 P7

Req Size 2 143 6 6 10
scheduling." Justify. Use Time 4 10 2

Calculate the time at which process P7 will be

SECTION-B
completed if the Best fit method is used for fixed sized
(a) Consider the following scheduling scenario. Processes [7] partitioned memory.
are allocated CPU in round robin fashion, according to (b) Write short notes on any one of the following [3)
the given priority (lower the number higher the
priority). for a time quantum of 5 units only for one
1. Thrashing
time. After this, processes are arranged in increasing ii. Inverted Page Table
order of their remaining CPU burst time in the ready
queue. New priorities are assigned according to the A. (a) Consider the following snapshot of resource allocation (7]
remaining CPU bursts time of the processes that is, of a system.
process with shortest remaining CPU burst time is
Allocation Max Need
assigned with highest priority. The processes are now PID
E F G H F F G H
executed according to the new priorities and each
PI
process gets the control of the CPUuntil they finished P2 lolaoo 0
their execution. With Draw the Gantt chart,and find the P3 4 6
number of context switches, waiting time of each P4 0 0 6
process. PS 0 4 0 6
PID CPUBurst Priority
A 22 4
Resource type E has 3 instances, F has 14 instances, G
has 12 instances and H has 12 instances.
18 2
C Answer the following questions using banker's
D algorithm.
E 4
 6.
T
(b)
Explain (a)
burst
WIlI and Simultaneous
Lhe interrupt
request?
The
address the Processing.
respond?
mode Ag, address
address
what
data decoder importancethe
e bus
Distinguish arassigned
transfer daisy
What is
all of
computer a
*****
the for
in
addresses the to
DMA.
between device one
chain of
device has interrupt
to 16
cycle ignores Ajso- method
which address is
stealing (7CA4)16the vector
for
the lines
devIce lines handling in
and Agand
VO

DU
2024
SOT
Time:
1 Candidates
() (e) (d) (c) (b) (a) 2
statement.the Hours
nstructions.
pring
ester
End
Using WriteHardwired
operationarithmetic representation.
floating
point Thememory How andConsider
R2 WhatAnswer
and are COMPUTER SPRING
represent many contains
overflow all
required Question 30
a the ADD is Minutes (For
the the parts
stack capacity a The END
expression:
assembly Control 64 function
following of to
figures paper 2022
024 flags register
RI,11110000. agàe Attempt
organized -(18)10 X question Answer ORGANISATION Qn.
of R2 Section
CS21002
& Semester
B.Tech4thSEMESTER
their inany consists
Unit 2048 RAM 8 //after of
RISECTION-A the Previous Set
X=code into answers
should any
What MAR,
R2 thecontains questions: margin Four isAof Code-7
is chips is FIVE
computer A/ to relatively lEEE bytcs? execution compulsory. two /
the bequestion CS
(B are wi l IR indicate
inSECTIONS Admitted
questions.
evaluate - destination. registers?
answered their 2006 EXAMINATION-2024 (SOT)
-
C) be a
value &
754 needed of own from
with the full ARCHITECTURE
inflexible. single the
the value
10101010 words
atmarks.
Sections Le. Batches)
instruction?
to one
zero-address A Branch:
Programme.
Semester:
B.Tech f
following precision provide place as and
Justify of far B. B.
Full CSE,
carry and only as
a practicable Marks:50 IT,
CSCE,
[lx10] CSSE
 (8) Draw the circuit schematic of DRAM cell and explain (b) Ahardwired CPU uses 10control signals S1 to S10 at
the cause of leakage. various time steps Tlto T5, to implement 4 instructions
Ilto 14 as shown below:
(n) Differentiate between micro program counter and
TI T2 T3 T4
program counter. TS
(i) What is the hit ratio of the cache S1,S3,SS S2,S4,S6 SI, S7 S10 S3.S8
memory if cache
memory access time is 50ns, main memory access time 12 SI,S3,S5 S8,S9,S10 Ss,S6, S7 S6 S10
Is 25ns and average access time is 62ns?
13 SI,S3,S5 S7, S8.S10 S2,S6, S9 S1O S1,S3
0) Differentiate between Memory mapped /0 and VO 14 SI,S3,S5 S2,S6. S7 S5, S10 S6.S9 S10
mapped IO.
Draw the logic circuit for generating control signals Ss
SECTION-B and S10 respectively? Why constant 4 in MUX is still
Z. (a) Discuss the factors that affect the present in three bus architecture, though incrementer is
performance of the present?
computer. If a 8GHz computer takes 7 clock cycles for
ALU instructions. 11 clock cycles for branch
instructions and 6 clock cycles for data transfer
Instructions. Find the total time taken by the computer (a) Explain about the different types of locality of
references.
to execute the program that consists of 10 ALU
instructions, 5 branch instructions and 5 data transfer A cache consists of a total of 256 blocks. The main
instructions. memory contains 16384 blocks, each consisting of 64
(b) Explain the Relative Auto Increment and Decrement words. How many bits are there in each of the TAG.
addressing modes. The content of the top of memory BLOCK and WORD field in case of direct mapping?
stack is 2452. The content of SP is 1258.A two byte How many bits are there in each of the TAG, SET, and
call subroutine instruction is located in memory address WORD field in case of 4-way set-associative mapping?
1456 followed by address field of 5490 at location (b) Difference between SRAM and DRAM. Organize a
1457. What are the content of PC, SP and top of stack; 2MX32 memory module using 512KX8 static memory
1. After call instruction execution chip.
ii. After return from subroutine
V5. (a) Write the loating point presentation in memory
according to IEEE standard with diagram. Divide the
for the
3. (a) Write the sequence of control steps required
bus CPU
tollowing using Non-restoring division algorithm 14+5.
instructions given below in single
(b) Write the steps for multiplication according to Booth
organization: algorithm with the example to multiply 9with -4.
Branch<0LI
Il: MOV R2, (R3) and I2:

4Semesler Examination-2024 KIIT-DU2024 SOT Sorng End Semester Examinution-2024