APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY Previous Years Question Paper & Answer

Course : B.Tech

Semester : SEMESTER 6

Subject : Comprehensive Exam

Year : 2019

Term : MAY

Scheme : 2015 Full Time

Course Code : CS 352

Page:5





PDF Text (Beta):

39.

40.

41.

42.

43.

44.

45.

46.

47.

48.

V1108 Pages: 6

Which of the following register automatically increments its contents during the instruction
execution?

a) Instruction (b) Program c) General Purpose (d) Link Register
Register(IR) Counter(PC) register

What is the range of actual exponent in the IEEE single precision standard for floating point

numbers?

a) -126to 127 (0) -127 to 7 © -128 to 128 (d) -126 to 126

The method for updating the main memory as soon as a word is removed from the Cache is

called

a) write-through (0) write-back €) protected write (9) cache-write

Instruction decoder of a CPU

a) Decodes the (0) 1000605 the © Decodes and (d) None of the
instruction and instruction and stores the above
carries out the generates the instruction
arithmetic and corresponding currently being
logical control signals. decoded.
operations

The number -112 can be represented in sign and magnitude method (8 bit number) as

a) 90001111 (b) 11110000 c) 00010000 (d) 01110000

A computer uses 32-bit byte addressing. The computer uses a 2-way associative cache with a
capacity of 32KB. Each cache block contains 16 bytes. Calculate the number of bits in the
TAG, SET, and OFFSET fields of a main memory address.

a) ۲۸0-18, ௫) TAG=16, c) TAG=20, (d) TAG=16,
SET=10, SET=12, SET=10, SET=8,
OFFSET=4 OFFSET=4 OFFSET=2 OFFSET=8

Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then the

maximum and minimum sizes of the join respectively are

a) m+nand0 0) mnando €) m+nand ५) mnandm+n
|) - ല്‍

Consider the relation scheme R = (E, F, G, H, I, J, K, L, M, N) and the set of functional

dependencies {{E,F} — {G}, {7} — {LJ}, {E,H} - {K,L}, {K} — {M}, {L} ‏ج‎ {N}} गारे.

What is the key for R?

a) {EF} 0) (12111) 0) {E,F,H,K,L} ५) {६}

If every non-prime attribute is fully functionally dependent on the primary key, then the
relation will be in

a) BCNF (b) 2NF c) INF (9) 3NF
Suppose that we have an ordered file with r = 30,000 records stored on a disk with block size B

= 1024 bytes. File records are of fixed size and are unspanned, with record length R = 100
bytes. The blocking factor and the number of blocks needed for the file are

Page 5 of 6

Similar Question Papers