0 ratings0% found this document useful (0 votes) 101 views6 pagesComprehensive Course Work
Comprehensive Course Questions And Answers for APJKTU Semester 7 - Computer science
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
~ (0600CST308052201 Pages: 6
Reg No:
ea amex
aa A BDUL KALAM TECHNOLOGICAL UNIVERSITY
gree $6 (S, FE) / $6 (PT) (S) Examination January 2024 (2019 Scheme)
Course Code: CST308
ecto, ‘ourse name: COMPREHENSIVE COURSE WORK tour
Instructions: (I) Each question carries one mark. No i
(0 Bech een cre oe mark No eget hs for ore ors
@) All questions are to be answered. Each question willbe fo essible answers 0
Cae Each question will be followed by 4 possible answers of
(8 If more than one option s chosen, it wil mt be considered for valuation.
1 Ina timesharing operating system, when the timeslot assigned to process is completed, the process
switches from the current state to?
BY Suspended state b) Terminated ¢) Ready state 4) Blocked state
state
2 Dirty bit is used to indicate which of the following?
2) Apagefaulthas 6) Apagehas @Apagehas been d)_An illegal access of
‘occurred Corrupted data modified afler being page
loaded into cache
3. What is a short-term scheduler?
ay It selects which ‘b) It selects cc) Itselects 4) None of the
process has to be which process _—process to remove mentioned
brought into the has to be from memory by
ready queue executed next swapping
and allocates
CPU
4. Ifa process fails, most operating system write the error information 1 & :
a) new file b) another oY los file ) none of the
running mentioned
process
5. If. process is executing in its critical section, then no other processes can be executing in their
&
critical section. What is this condition called?
a mutual exclusion b) critical: c) synchronous d) asynchronous
‘exclusion exclusion excl
‘When are the register context: and stack of thread deallocated?
a) when the: thread b) when the c) when the thread d) when the ‘thread
terminates thread blocks “unblocks spawns
Page 1 of 6 9.
4
u
ih
a
WO
16
\ey Independent fn) 2n on
9600CST308052201 <
y
‘of these page replacem: which one suffers from Bel lady’s anomaly?
hms,
Coe rent algorithms a
Fl ¢) Replaces
a) LRU uy FIFO ) ae placement
cess’s threads’
ic i he ‘the same process’s t en
Which one of these is NOT shared by @) Message Queue @) File Descriptor
2) Address Space UBJ™ Stack
1"?
sits in minimum head movement
© Fes
Which of these disk scheduling policies rest 4) None of the above \
Circular scan b) Elevator . .s that can exist in the
@* computer system that consists of n number of CPUs, the maximum process
In a computer 5 sts of nim
Ready State would be: ; aon
on toon?
Which of the following is preserved in execution of transaction in isolation?
i 4) Consistency
8) Atomicity Yand¥> X
a) X¥9zandZz9¥ Yn>Xend¥ gy) YE>XadX PZ — d) XZ>Yani
a a
Identify the statement among the following that is FALSI
a) The relation in b) Arclation that ,5}The prime attributed) The prime attribute
which all keyshave has two can depend can depend
only asingle attributes is in transitively on any transitively on any
attribute isin its its BCNF key in the case of a key in the case of a
2NF va relation that isin its relation that is in its
“ BCNF 3NF
SQL allows tuples in relations, and correspondingly defines the multiplicity of tuples in the result of
dois. Which one of the following queries always gives the same answer as the nested query shown
below:
select * from Rwhere a in (select S.a from S)
way select R* from R,S b) select distinct ©) select R.* from d) select R.* from RS
where Ra~S.a(D) Re fromRS Riselect distinct a where Ra=S.a and
where from S) as SI where is unique R
RaS.a ‘Ra=Sh.a
‘The term for information that describes what type of data is available in a database i
8) Datadictionary —&) Data ©) Index data ay Metadata
repository
Consider the relation Cinema(theater, address, capacity)
‘Which of the following options will be needed at the end of the SQL query
SELECT PI address FROM Cinema P1
such that it always finds the addresses of theaters with maximum capacity?
Page 2 of 6 / “&
600CST308052201
8) WHERE p:
1 capaci
>=AllGelect "Y -5) WHERE
t “WHE ‘i
2.capacity from Pleapacity SRE rI capacity d) WHERE PI capacity
Cinema P2) >= Any . (elect > Any (select
(elect max(P2.capacity) max(P2.capacity)
PReapaciy from Cinema P2) from Cinema P2)
ae from Cinema
‘onsider the followi ‘
ing tw .
1 Strict tworphae jalements about database transaction schedules:
fT Tecoverable, "NE Protocol generates conflict serializable schedules that are also
1. Timestar i
| view serine Soncurreney control protocol with ‘Thomas Write Rule can generate
eas ee above statements wae TRO ‘not conflict serializable.
ian and It Tonly ©) Honly 4) Neither [nor It
Tees are considered BALANCED because
a) Tae! lengths ofthe The lengths of ©) The number of D) The number of
paths from the root the paths from children of any two records in any two
to all leaf nodes are the root to all non-leaf sibling leaf nodes differ by
all equal. leaf nodes nodes differ by at at most 1,
differ from most I.
each other by
at most 1.
‘Which of the following relational query languages have the same expressive power?
1) Relational algebra
Tl) Tuple relational calculus restricted to safe expressions
I) Domain relational calculus restricted to safe expressions.
i
20 Aneentity in A is associated with at most one entity in B. An entity in B, however, can be associated
Wand IIT only ») Tanditonly ©) tand ttt only 4) 1 Mand iit
with any number (zero or more) of entities in A.
a) One-to-many b) One-to-one c) Many-to-many Ld Many-to-one
21 Convert the following infix expression into its equivalent postfix expression.
A AD\(E-F)+G
4) (ABDA+EF-/ b) (ABD+AE c) (ABDA+EF/-G 4) (ABDEF+A/-
G+) -/G+) +4 G+)
The result of preorder traversal is same as:
a) Depth-first order ° b) Breadth-first Topological order d)_Linear order
‘search
Queues serve major role in .
Simulation of b) Simulation of c) Simulation of d) Simulation of heap
. recursion arbitrary limited resource sort
| Tinked list allocation
24 In the worst case, the number of comparisons needed to search a singly linked list of length n for a
| given element is?
i a) log 2n b) 2 ©) log2n=1 wa
| 25 If several elements are competing for the same bucket in the hash table, what is it called?
— (a+8n0) fe-F)1+ O (
(A4en0) (e-F) mute (a1 BAP) LE-F ro
ea fa anesl/—er fashies]) e-r)10
ABDNtEF-/ 40 [+ane5] fe-ryra
ABPNTEF-/At 0600CST308052201
b) Replication 57 Collision
a) Diffusion
4) Duplication
i tices?
26 What is the number of edges present in a complete graph having n vertices oS
a) (ntinttyy2 DT (nr(nIy2 on insufficient
27 Which of the following is not an in-place sorting algorithm? pe
a) Selection sort bY Heap sort ©) Quick sort
28 The time complexity of heap sort in worst case is: >
a) O(logn) bd) O~@ LI Ofntogn) d) O(n’)
29 ‘Suppose we are sorting an array
partitioning with the array looking like this:
251791211 10
Which statement is correct?
a pivotcould be b) The pivot
©) The pivot is notthe 4)
either the 7 or the 9, could be the 7, but it could be the
7, but itis not 9
the 9
20/ Consider situation where swap
should be preferred so that the nt
of eight integers using quicksort, and we have just finished the first
Neither the 7 nor the
9is the pivot
operation is very costly. Which of the following sorting algorithms
tumber of swap operations are mini
b) Selection Sort \¢}
Merge Sort
a6 BS c2 dB el £4
Selection search
Reduce page faults
ized in general?
2) Heap Sort Insertion Sort 4)
31 Mateh the following.
F @ Immediate address mode (1) Local variables
|) Direct address mede 2) Relocatable programs
Bl Indirect address mode 3) Pointer
F @ Index addressing mod ) Locality of reference
2-1 Base address made 5) Arrays
+4 O_ Relative address mod (6) Constant Operands
AS bre3dS eM by aSbacGdFel cl ats 2d el B a)
2
Search concept used in associative memory is:
25° Parallel search >) Sequential —¢) Binary Search a
Search
33 Memory interleaving is done to:
8) Increase the amount bf” Reduce ©) Simplify memory
of logical memory memory interfacing
< access time
© Which of the foll
lowing DMA trai
VO bandwidth?
8) Transparent DMA.
r b) Cycle. ©) Block Transfer and
and Polling Stealing and vectored interrupts
interrupts Vectored
interrupts
3 Consider the following sequence of micro-operations,
MBR — Pc.
MAR—X
PCKy
Page 4 of 6
table the highest
9 Block transfer and
Polling interrupts 36
&
38
39
40
4
a
0600CST308052201
Memory — MBR | >
i ing i it ic by this sequence ? .
Which one of the following is a possible operation performed by initiation of fterupt
4) Instruction fetch.) Operand fetch ¢) Conditional branch) Init
Register renaming is done in pipelined processors ; Poe
3) asanaltemativeto ) forefficient 9)” 10 handle certain) as par ov
register allocation at access 10 kinds of hazards trans
compile time funetion
parameters
and local
variables : |
Which ofthe following DMA transfer modes and interrupt handling mechanisms will enable the highest
VO bandwidth? 4
a) Transparent DMA —b)Cycle- ©) Block Transfer and ctf Block transfer an
and Polling Stealing and vectored interrupts Polling interrupts
interrupts Vectored
interrupts,
‘Accache has a 64 KB capacity, 128 -byte lines (blocks), and is 4 -way set associative. The system
‘bit addresses. How many lines (blocks) and sets does the cache have?
containing the cache uses 32 -
a) 64 Ub 128 ce) 256 d) 32
'A machine with W different opcodes can contain how many different sequences of micro-operations.
WH) ne arn
a) wy
How many 32K x I RAM chips are needed to provide a memory capacity of 256K-bytes?
es 8 b) 32 ) 64 d) 128
Which of the following will not be accepted by the following DFA?
oe
ababaabaa b) abbbaa__ c) abbbaabb_ d) abbaabbaa
‘Can a DFA recognize a palindrome number? a
b) No ) Yes, with input d) Can't be determined
ae
Which of the following options is correct?
‘Statement 1: Initial State of NFA is Initial State of DFA.
‘Statement 2: The final state of DFA will be every combiné
c) Statement I canbe d)_ Statement 1 is false
alphabet as S*
|B -Statement | is true —b) Statement I is
and Statement 2 is ‘true and true and Statement 2 and Statement 2 is
true Statement 2 is is true also false
false
Page 5 of 6 1a
9600¢ST308052201 =
Which of the following statement is correct? pene’ 6 Nemcsttn
a) AllRegular by Allcontext fepalr Oree No ee
Grammararecontext free graunmar ;
free but not are regular grammar are the
versa grammar but same entity
not vice versa .
45 Suppose AP fiz and By, then the simplified grammar would be: : oe
none o}
vay Aye by) ADxBryz 6) ADXDBBIY y) nomeol
46 © Given grammar G:
()sPAas_ *
(Q)SAAS ¥
G)APSA
(Adan <
oe ofthe following productions denies the format of Chomsky ‘Nomfal Form?
Us 24 b) 13 ce) 1,234 Xd) 2,34
47 Whatis the pumping length of string of length x?
) xl Oe
b) non regular ¢) may be regular 4) none of the
lar
UY reel mentioned
49 Which of the problems are unsolvable?
a) Halting problem b) Boolean {ey Halting problem & — d) None of the
Satisfiability Boolean |. mentioned
problem Satisfiability
problem
Xs) ‘A language L is said to be if there is a turing machine M such thet L(M)=L and M halts
atevery point. =n
a) Turing acceptable —b) Decidable coy Undecidable d) None ofthe
‘mentioned
Page 6 of 6
