Q1 Consider a machine with a byte addressable memory of 216 bytes and block size of 8 bytes. Assume that a direct mapped cache consisting of 32 lines used with this machine. How many bits will be there in Tag line and word field of format of main memory addresses?
(1) 8,5,3
(2) 8,6,2
(3) 7,5,4
(4) 7,6,3
Solution (1)
Main memory address 16 bit(216)
block size=8 bytes=3 bits
lines=32 =5 bits
tag+line+block-size=16
x+5+3=16
x=16-8=8
Q2. The period of a signal is 100ms. Then the frequency of this signal in kilohertz is
(1) 10
(2)1/10
(3)1/100
(4)1/1000
Solution (3) F=1/T
T=100ms
T=100/1000=1/10 sec
F=10/1000=1/100
Q3. A complete n-ary tree is a tree in which each node has n children or no children . Let I be the number of internal node and L be the number of leaves in a complete n-ary tree. if L=41 and I=10.What is the value of n?
(1) 3
(2) 4
(3) 5
(4) 6
Solution (3)
L=(n-1)I+1
41=(n-1)10+1
41=10n-10+1
50=10n
n=5
Q4. Consider a single -level page table system with the page table stored in the memory .If the hit rate to TLB is 80% and it takes 15ns to search the TLB and 150ns to access the main memory then what is the effective memory access time in nanoseconds?
(1)185
(2)195
(3)205
(4)175
Solution (2)
EMAT=Hitrate(TLB+Memaccesstime)+missrate(TLB+2*memaccesstime)
EMAT=0.8(15+150)+0.2(15+2*150)
EMAT=195
Q5.Which of the is not an intermediate code form?
(1)Syntax tree
(2) Three address code
(3)Quadruples
(4)Post fix Notation
Solution (3)
Intermediate code represent in form
postfix Notation
Dag
3-Address code
Syntax tree
Q6. Let G be a directed graph whose vertex set in the set of numbers from 1 to 100. There is an edge from a vertex i to a vertex j if and only if either j=i+1 or j=3i. The minimum number of edge required in a path in G from vertex 1 to 100 is
(1) 23
(2) 99
(3) 4
(4) 7
Solution (4)
100-99-33-11-10-9-3-1
Condition is multiple of 3 or j=i+1
So total 7 edges.
Q7. Consider the linear programming
Max= z=2x1+3x2
2x1+x2=<4
x1+2x2<=5
x1,x2>=0
The optimum value of the LP is
(1) 23
(2) 9.5
(3) 13
(4) 8
Solution (4)
put the value of x1 =1 and x2=2
2(1)+2=4=4
satisfy
1+2(2)=5=5
Satisfy
So x1=1 and x2=2
Put the x1 and x2 value in z
z=2(1)+3(2)
z=8 the optimum value of LP.
Q8. What is the radix of numbers if the solution of the quadratic equation X2-10x+26=0 is x=4 and x=7?
(1)8
(2)9
(3)10
(4) 11
Solution (4)
16-4r+2r+6
2r=22
r=11
Q9 Using RSA public key cryptosystem if p=3 q=11 and d=7 find the value of e and encrypt the number 19
(1)20,19
(2) 33.11
(3) 3,28
(4) 77,28
Solution (3)
n=pq
n=3*11=33
∅=(n-1)(q-1)
∅=2*10=20
ed=1 mod ∅
7e=1 mod 20
7e mod 20=1
put the value of e that give remainder 1 after division with 20
So e=3
C=Memod n
C =193mod 33
C=28
Q10 A nonpipeline system takes 50ns to process a task. The same task can be processed in six-segment pipeline with a clockcycle of 10ns. Determine the speedup ratio of the pipeline for 500 tasks.
(1) 6
(2) 4.95
(3) 5.7
(4) 5-5
Solution (2)
non pipeline task take time=500*50=25000ns.
pipline task take time=(k+n-1)tp
pipeline task take time=(6+500-1)10=5050
speedup ratio=25000/5050=4.95
Q11 The number of positive integer not exceeding 100 that are either odd or square of an integer is
(1) 63
(2) 59
(3) 55
(4) 50
Solution (3)
odd integer=50
square of an integer=4,16,64,81,100
square of an integer=5
so total integer odd or square of an integer is =50+5=55
Q12 How many ways are there to pack six copies of the same book into four identical boxes where a box can contain as many as six books?
(1)4
(2) 6
(3) 7
(4) 9
Solution (3)
6,0,0,0
5,1,0,0
4,2,0,0
4,1,1,0
3,2,1,0
3,1,1,1
2,2,2,0
so Answer is 7
Q13. A disk with a sector size of 512 bytes,2000 tracks per surface,50 sector per track,five double platters and average seek time of 10ms.
if T is the capacity of a track in bytes and S is capacity of each surface in bytes then (T,S) is
(1) (50K,50000K)
(2) (25K,25000K)
(3) (25K,50000K)
(4) (40K,36000K)
Solution (3)
Capacity of track=50*512=25600 bytes=25K
Capacity of Surface=2000*50*512=512000000 bytes=50000 KB
Q14 A disk with a sector size of 512 bytes,2000 tracks per surface,50 sector per track,five double platters and average seek time of 10ms.
If the disk platters rotate at 5400 rpm,then what is the maximum rotational delay
(1) 0.011 sec
(2) 0.11 sec
(3)0.0011 sec
(4) 1.1 sec
Solution (1)
5400 rotation in sec=60 sec
1 rotation in sec=60/5400=0.01111
Q15 A disk with a sector size of 512 bytes,2000 tracks per surface,50 sector per track,five double platters and average seek time of 10ms.
What is the capacity of the disk in bytes?
(1) 25000 K
(2) 500,000K
(3) 250,000K
(4) 50,000 K
Solution (2)
10*2000*50*512=512000000=500000 K
Q16 A disk with a sector size of 512 bytes,2000 tracks per surface,50 sector per track,five double platters and average seek time of 10ms.
Given below are two statements
Statement I: The disk has a total number of 2000 cylinders.
Statement II: 51200 bytes is not a valid block size for the disk.
In the light of the above statement choose the correct answer from the options given below
(1)Both statement I and statement II are true.
(2) Both statement I and statement II are false.
(3) Statement I is correct and Statement II is false.
(4) Statement I is incorrect and statement II is true.
Solution (3)
Number of cylinder in disk=number of track in disk
So number of cylinder is 2000.
So statement I is correct.
Block size is multiple of sector size
512,1024------------
Maximum block size=50*512=25600 bytes
So statement II is false.
So option (3) is correct.
Q17 Which of the following are application of symbol table?
(A) Storage allocation
(B) Checking type compatibility
(C) Suppressing duplicate error messages
choose the correct answer from the options given below
(1) (A) and (B) only
(2) (A) and (C) only
(3) (B) and (C) only
(4) (A),(B),(C)
Solution (4)
Symbol table is data structure that is used by compiler to store tokens and also check semantic error using symbol table
0 Comments