F 0100csT308052401

Reg No.: Name: "%lst

APJ ABDUL KALAM TECHNOLOGICAL UNIVERS
B.Tech Degree s6 (R,s) I so gry (R,s) Examination May 2024(rot\N***4;.'
Course Code: CST 308 \$1ffiffy.2'
-\..j.g9--7
Course name: COMPREHENSIVE COURSE WORK
Max. Marks:50 Duration: lHour
Instructions: (I) Each question carries one mark. No negative marksfor ntrung onswers
(2) Total number of questions: 50
(3) l
All questions are to be answered. Each question witl befoltowed by possible answers of
which only ONE is conecl
(1) If more thon one option is chosen, it will not be consideredfor valuation.

l. State True or False

i) Binary search is used for searching in a sorted array

ii) The time complexity of binary search is O(log n)
a) True, True b) False, True c) True, false d) False,False
2. Thepostordertraversalofabinarytreeis 8,g,6,7,4,5,2,3,l.Theinordertraversalofthesame
tree is 8, 6,9, 4,7,2,5, l, 3. The height of a tree is the length of the longest path from the root to
any leaf. The height of the binary tree above is

a)l b)2 c)3 d)4

3. What can be said about the array representation of a circular queue when it contains only one
element?

a) FRONT: b) FRONT: c) FRONT: REAR d) None of these

REAR + I REAR - I :NULL

4. + A* - BCD is a prefix expression. If A, B, C, D have value 5,4,2,3 respectively the expression

evaluates to

a) 13 b) 7 c) ll d) .15
*;
5. The Breadth First Search (BFS) algorithm has been implemented using the queue data structure.
Which one of the following is a possible order of visiting the node in the graph below?

a) MNOPQR b) NQMPOR c) QMNROP POQNMR d)

6. Which of the following can be the sequence of nodes examined in binary search tree while
searching for key 88?

Page 1. of 7
 0100csr308052401

a) 90,40,65,50,88 b) 90,110,80,85,88 c) 190'60'90'85'88 d) 65,140,80,70,88

is
7. The data structure that i$used to implement recursion

a) Binary Tree b) Stack c) Queue d) All of the above

is
8. If we want to find the last node of a linked list, then the correct coding
a) if(temp->link!:NULL) b) if(temP->data:num)
tempnemP->link temP:temP->link
c) while(temP->link !:NULL) d) while(temP->link !:data)
temp:temP->link temP:temP->link
linked lists is:
9. A hashing firnction which stores colliding items together in

a) Separate chaining b) Linear hashing c) Universal d) Linear hashing

with collision hashing
detection

For merging two sorted lists of size m and n into a sorted

listbof size m*n' we required
10.
comparisons of
a) o(m) b) o(n) c) O(m+n) d) O(log s1* log n
Job First scheduling is
1l The advantage of Round Robin cpU scheduring over Shortest
a) Better average b) Better average c) Both (a) and (b) d) Neither (a) nor
(b)
tum around time response time
12
The first fit, best fit and worst fit are strategies to select
a

a) c) processorto run d)
process from a b)
free hole from a all ofthe above
the- next Process
queue to Put in set of available
memory holes
and offset for a logical address of ll42
l3 For a page size of 200 words, what is the page number
a) 5,142 b) 2,142 c) 6,142 d) 7,140

t4 TheprocessA'B,C.DandEreferencesinthefollowingorder.
algorithms with 4 frames. Tl
A, B, C, D, A, B, E, A, B, C, D, E for the LRU page replacement
number of page faults with pure demand paging is
a)6b)lic)8d)9
and 23V operations were
l5 A counting semaphore was initializedto 9. Then 27P opetations
completedln this semaphore. The resulting value of th' semaphore
is
a)o b)5 c)7 d)13
suppose that a disk drive has 5000 tracks, numbered
from 0 to 4999. The drive is cunently
l6
- 125. The queue of pending reques
serving a request at track 143 and the previous was 1t_tr19k
Starting from the current
in FIFO order is 86,1470,g13,1774,'984, 1509, 1022,1750,130 '
SSTF is
position, the total distance in terms of track movement for
a) 640 b) 246 c) 350 d)
None

Page2of 7
 0100csr308052401

External fragmentation exists when ....... ?

a) enough total b) c) a request cannot d)

" the total memory none ofthe
memgry exists be satisfied
is insufficient to mentioned
to satisff a even when the
satisff a request total memory is
request but it is
not contiguous free
Consider the following three processes in the FCFS'
Process Id Busrt Time Anival Time
Pl 3
a
J
P2 6 6
P3 9 9
What is the average waiting time?
a)2 b)3 c)4 d)s
Which of the following algorithms is used to avoid deadlock?
a) Dynamic b)
Primality c) Banker's d) Deadlock
Programming algorithms algorithm algorithm
algorithm
Which of the following component does not belong to PCB (Process Control Block)?
a) CPU registers b)
CPU scheduling Accounting c) d) Operating SYstem
information information information
data to
Which memory type is typically used for storing frequently accessed instructions and
improve CPU performance?
a) RAM RoM b) Cache memory c) Virtual memory d)
In pipelining, what is a structuralhazatd?
a) Occurs when b) Occurs when c) Occurs when d) Occurs when
instructions are there are control signals there is a conflict
insufficient are . in data values
dependent on
each other
resources to misinterpreted
execute
instructions
simultaneously
Pipelining can introduce hazards in CPU execution. Which of the following is NOT
ahazard
23
typically encountered in pipelined architectures?
;i Stnrctural hazard b) Datahaznd c) Control hazafi
d) ' Logical hazard

24 what does Register Transfer Logic (RTL) primarily deal with?

a) Datatranimission b) Data transfer c) communication d) Data processing
between CPU and between registers between algorithms
memory within the CPU peripheral
devices
Suppose a CpU has a clock speed of 2 GHz. How many clock cycles are required
to execute an
25

instruction that takes 4 clock cycles to complete?

a) 0.5 ns b) 2ns c) 4ns d) 8ns

Page 3 of 7
 0100csT308062401

which of the following Hazards occur at the following 2 instructions in pipeline?

ADD R4, R2, R8
ADD R4, R7, R4
a) RAW b;
wAR c) WAW d) Both (a) and (b)
within the mnemonic is
An addressing mode in which the location of the data is contained
known as
a) Immediate b) Implied c) Register d) Direct addressing
addressing mode addressing mode mode
addressing mode
CISC stands for -
a) Complex b)
ComPlete c) Complex d)None ofthe
Instruction above
Instruction Set Instruction
Computer Sequential Sequential
Compilation ComPiler
when we perform subtraction on -i and -5 the answer in 2's complement form is

a) llll0 b) lll0 c) 1010 d) 0010

The instruction cYcle involves:

a) Fetch, Decode, b) Fetch, Store, c) Load, Execute, d) Decode, Execute,

Store Store
Execute Execute
The regular expression denoting the set of all strings
NOT containing two consecutive 0's is
given by
a) (0+10)* b)(0+10)*(e+1) c)
(1+01)*(e+0) d)
(e+0)(101)*(e+0)
that have three consecutive
The minimal FA accepting the set of all strings over alphabets {0,1}
0's has
a) 4 states b)5 states c)
6 states Noned)
Which of the following grarnmars are equivalent?
ii) S-> a A iii) S-> aA iv) S-> aA / bB
(i) s-> AB
A-> bB A->aAl B A->a
A->aNa
A-> a /b B->b B-> b
B->b
a) (i) & (ii) b) (i) & (iiD c) (ii) & (iii) d) (i), (ii), & (iv)

The class of NP problems is NoT closed with respect

to operator
34
a) Union b)Intersection c)
Kleen Closure d) ComPliment

35 Consider the follwoing two languages -

11: {ln0nln0n/ n>:0}
y2: lanbkln<:k<:2n)
Which of the following statement is True'
c) d) Neither Ll nor
a) Both Ll andL2 b)Ll is Context L2 is context
are Context Free Free but notL2 Free but not Ll L2 is context free

36 A type 0 or unrestricted grammar

a) Generates allthe b) Generates all the c) Generates sets d) None of these

sets that are sets accepted by that are not
accepted by of
the class regular
Halting Turing Turing Machines languages
Machines but not
by all Turing
Machines

Page 4 of 7
 0100csT308062401

37 Which ofthe following statement is True?

a) Every Regular b)
Every CFG is c)
Every CSG is d) None of these
Grammar is CFG Regular Grammar CFG
.
38 The Tree which represents the derivations in a cFG is called
a) Parse trree b) Derivation Tree c) Both (a) and (b) d) None
39 Ifyou consider : :
r, in which r (l I + I I l)* over X {0, I }, then the number
a regular expression
of sates in minimal DFA and NFA respectively are:
a) DFA -4, NFA - b)
DFA - 3, NFA c)
DFA _ 3, NFA _
- DFA - 4, NFA d) -
3:4 4
40 Wb€n L and L' happen to be recursively enumerable, here L is:
a) context-free b) regular c) recursive d) context-sensitive
41 Consider the relation R(A, B, c, D, E) and the functional dependency set F:{AB-.C, B-D,
C---E ).What is the highest normal form of the relation R ?

a) INF b) 2NF c) 3NF d) BCNF

42 which of the following statements are TRUE about an SeL query?
(P) An SQL query can contain a HAVING clause even if it does not contain
a GROUp By
clause.

(Q) An SQL query can contain a HAVING clause only if it has a GROUP
By clause.
(R) All athibutes used in the GROUP BY clause must appear in the SELECT
clause.
(S) Not all attributes used in the GROUP BY clause need to appear in the
SELECT clause.
a) PandS b) PandR c) QandR d) QandS
43 What is the meaning of following SeL query?
sELEcr name FROM student WHERE mobileNo LrKE , eoo%02' ;
a) List of student b) List of student c) List of student d) List of student
ftrme whose name whose name whose name whose
mobile number mobile number's mobile number mobile number
begins with two second digit and starting and contain two 0's
0's fourth digif?re 0. ending with two
0's
44 Consider the following relational schema.
sfu dent(snum,sname,age)
Enrolled (snum,cname).
What is the output of the following query.?
SELECT cname, MIN(age) FROM student S, enrolled E
WHERE S.snum: E.Snum GROUP By cname HAVING COUNT(*) > 3;

Page 5 of 7
 0100csT308062401

a) For each class b) For each class c) For atmost one d) None of these.
find the age of with more than 3 class with more
tstudents,
the three finds the than 3 students.
youngest student age ofthe find the age of
who has enrolled youngest student the youngest
in this class. who has enrolled student who has
in this class. enrolled in this
class.
45 Let El andE2 be two entities in an E/Rdiagram with simple single-valued attributes. Rl
and R2 are two relationships between El and E2, where Rl is one-to-many and R2 is
many-to-many. Rl and R2 do not have any attributes of their own. What is the minimum
number of tables required to represent this situation in the relational model?

a), O)o c)s d)6

46 Which one of the following statements is NOT correct about the B+ tree data structure used for
creating an index of a relational database table?
a) B* Tree is ab) Non-leaf nodes c) in d) Each leaf node
Key values
heighrbalanced have pointers toeach node are has a pointer to

tree. data records. kept in sorted the next leaf

order. node.
47 Let the set of functional dependencies F: {QR+S, R+P. Sr Q} hold on a relation schema X
(PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z,whereY :
I
(PR)andZ=(QRS).
Consider the two statements given below.
I. Both Y andZ are in BCNF
n ll. Decomposition of X into Y andZ is dgpendency preserving and lossless t

Which of the above statements is/are correct?

a) Both I and II b) I only c) II Only d) Neither I nor II
48 Map the following statements to TRUE(T) or FALSE(F) respectively
(i) In SQL, by default'order by'clause lists items in descending order.
(ii) InSQL,'SELECT'clauseautomaticallyeliminatesallduplicates.
a) (i) TRUE and (ii) b) (i) TRUE and (ii) c) and d)
(i) FALSE (i) FALSE and
TRUE FALSE (ii) TRUE (ii) FALSE

Page 6 of 7
 0100csT308062401

49 Which of the following is a DML command?

a) DELETE b) CREATE c) ALTER d) DROP
50 Consider the relation R (A. B. C.'D, E) and the functional dependency ser F: {AB-+CD,
ABC---+E, C-'A). How many candidate keys are possible for the relation R ?

a)t b)2 c)3 d)4

PageT of 7