Note:ifyouarechangingtheexistinganswerpleasedowritetheexplanationforyour
answers.
Technical Section
1) Which of the following is not true about HTTP cookies ?
a. It is a small code which can pose a security threat.
b. It can enter the user workspace through HTTP Header.
c. It has expiry date and time.
d. It can be used to track the browsing pattern of the user.
Ans- B
i. Graph coloring
B. Parsing
ii. DFA
C. Expression evaluation
D. Regular expression
d. Durability
Ans: A
4) A grammar is given as :
X
0= 1
X
1
X
1= 0
X
1
+ 1
X
2
X
2
= 0
X
1
+
Which of the following regular expressions can correctly represent the
grammar?
a. 10(0*+ (10)*)1
b. 10(0*1(10)*)*1
c. 1(0+10)*1
d. 10(0+10)*1 + 110(0+10)*1
Ans: c.
5) In an unordered list of n distinct numbers find the complexity of
an algorithm which search for an element which is neither maximum nor
minimum.
a. (nlogn)
b. (n)
c. (log n)
d. (1)
Ans: d. answer is O(1) because the question said distinct
d)accept,listen,bind,recv
Ans B
11) A cache memory will take 50 ns in case of cache miss and 5 ns in
case of cache hit. What is the average cache time if 80% of time cache
hit occurs?
Ans 14ns
12)R is a relation aRb such that a and b are distinct and there is a
14) If a connection has speed f 104560 bits per second and works in
TCP connection. If '' is the RTT before TCP scaling and '' is the
window size after TCP scaling then value of and will be:
a. 63 ms , 65535 x 2^14
b. 63 ms , 65535 x 2^16
c. 500 ms , 65535 x 2^14
d. 500 ms , 65535 x 2^16
15) The edge which causes graph disconnected on deleting it is called
bridge. Which of the following is true about bridge?
a. There will be no bridge in a tree.
b. Bridge can never be a part of a simple cycle.
c. Every edge in a clique having more than 3 nodes is a bridge.
d. If a graph has bridge there will be no cycle in it.
Ans B
16. What will the following code print if input is given as
ABCD EFGH ?
void foo(char *a)
divisor other than 1 . Then R can be
a) Reflexive and symmetric but not transitive
b) Neither Reflexive nor symmetric but transitive
c) Symmetric but not reflexive, not transitive
d) Reflexive but not symmetric, not transitive
Ans C
13) A data of 8800 byte has to be sent using UDP protocol through IP
packets. if MTU of network is 1500 bytes. UDP header is 8 bytes and IP
header is 20 bytes and no options are using. In this scenario find the
number of fragments and offset value:
a. 6, 925
b. 6, 7400
c. 7, 1100
d. 7, 8800
Ans C
{
if(*a && *a != ' '){
foo(a+1);
putchar(*a);
}
}
a. ABCD EFGH
b. ABCD
c. EFGH
d. DCBA
Ans D
17. Two operations are performed on given matrix
I Add third row to second row
II Subtract third row from first column
then Determinant is
3
4
45
7
9
105
13
2
195
Ans 0
18. Consider the given code segment:
MUL R5, R0, R1
DIV R6, R2, R3
20. A system has 6 resources and N processes . Each process can demand
for 2 resources n maximum. For what value of n deadlock will
definitely occur?
a. 1
b. 2
c. 3
d. 4
start T3
.....
commit T2
What will be the undo - redo list of transactions?
Ans
31) If there are ten buckets numbered from 0 to 9 and input values can
be in between 0 and 2020, which of the following function can fairly
distribute values among buckets?
a. h(i) = i^2 mod 10
b. h(i) = i^3 mod 10
c. h(i) = (11* i^2) mod 10
d. h(i) = (12* i^2) mod 10
Ans B
32)A system has memory segments of size 200, 400, 600, 500, 300 and
250
respectively. If the processes of size 357, 210, 468, and 491 are
allocated in segments using best fit algorithm, what segments will be
left unused?
a. 200 & 300
b. 250 & 300
c. 200 & 400
d. 200 & 250
Ans A
33) Given two relations: R1(A,B)= {(1,5), (3,7)} and R2(A, C) = {(1 ,
7),(4,9)}. R is a relation obtained the doing FULL NATURAL OUTER JOIN
Ans C
34) Find number of minterms from the function
[D' +AB' +A'C + AC'D +A'C'D]'
Ans 1
35)Find the minimum number of states in DFA required to represent the
regular expression: (0+1)*10
Ans 3
36) Physical address is of 32 bits, page is of size 8KB and page table
entry contains 1bit for dirty bit ,1 bit for valid bit,3 bits for
permission bit
other than translation. Given 24MB is maximum page
table size, then what is the virtual address size in bits?
Ans 36 bits
37) Find the maximum number of ONTO relations from {1,2,3,4} to
{a,b,c} ?
Ans 36
38) All possible functions are made between set having 2 and 20
distinct elements respectively. Find the probability of selecting an
one to one function.
Ans 0.95
39) Let f(x) = x^ -1/3 for the values -1<x<1 and the A be the area
covered between this function and X axis. Which of the following
statements are correct:
a. f(x) is continuous.
b. f(x) is bounded.
c. A has a non zero finite value
d. None of these
Ans: c
40). Consider the three languages given:
L1 = {wxwR
| where wR
|w|>1, |x|>1}
L2: {a^m b^n | mn where m,n >0}
L3: {a^p b^q c^r | where p,q,r >0}
Which of these is/are regular?
a. L1
b. L3
c. L1 & L3
d. L1 , L2 & L3
Ans C
43) Cylinder 15000 rpm , avg seek time is twice the Rotational latency
transfer rate is 32KBps
512 byte sector size.calculate total cylinder access time.
Ans 6.00-6.11
44) minimum
number of JK flipflop required for the counter sequence
0011223300..
Ans 3 (Please justify.)
45)Propogation delay of AND/OR gate in 1.2 ns and XOR gate is twice
the AND/OR delay.
then total propogation delay of 4 bit binary adder is?
Ans 19.2 micro seconds
46) Question on subnet mask
47) Question on tautologies(Logic)