Documente Academic
Documente Profesional
Documente Cultură
dont just
dont just
just dont
just dont
know
know
know
know
Ans-C
Technical Section:1) Which of the following is NOT true about HTTP cookies ?
a. It is a small code which can compromise any 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 or Can be A 50%
i. Graph coloring
ii. DFA
iii. Post order traversal
production tree
9)If a binary tree has 20 leaf nodes, then how many nodes will
have two children nodes?
Numeric Question
Ans:-19
10)In a typical server in which order the operations- accept,
bind, listen and recv - will be executing?
a)listen,bind,accept,recv
b)bind,listen,accept,recv
c)listen,accept,bind,recv
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
in(N.Second) if 80% of time cache hit occurs?
Numeric Question
Ans:-14ns
12)R is a relation aRb such that a and b are distinct and there
is a divisor other than 1 . Then R can be:a) Reflexive and symmetric but not transitive
a. ABCD EFGH
b. ABCD
c. EFGH
d. DCBA
Ans:-D
17. Two operations are performed on given matrix
1. Add third row to second row
2.Subtract third row from first column
then Determinant of the matrix is:3
4
45
7
9
105
13 2
195
Numeric Question
Ans:-0
18. Consider the given code segment:
MUL R5, R0, R1
DIV R6, R2, R3
ADD R7, R3, R4
SUB R8 , R5, R4
In a microprocessor system, first operand will store the value
computed between second and third operands sing pipelining.
Each instruction will go through four stages: Instruction
Fetching (IF), Operand Fetching (OF), Operation Execution (OE)
and Write Back (WB). All operations except OE will take one
cycle time. MUL instruction will take 3 clock cycles for OE,
DIV instruction will take 5 clock cycles for OE while ADD and
SUB instruction will take 1 clock cycle for OE. Calculate the
number of clock cycles required for the code segment given
above:Numerical Question
Ans:-13
19) 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
Ans:-D
Ans:-12ms
23) Given that q1 and q2 are two problems. If q1 can be reduced
to 3 SAT problem and 3 SAT problem can be reduced to q2, which
of the following is true?
a. q1 is NP hard and q2 is NP
b. q2 is NP hard and q1 is NP
c. Both q1 and q2 are NP hard
d. Both q1 and q2 are NP
Ans:-B
Ans:-36 bits
36) Find the maximum number of ONTO relations from {1,2,3,4} to
{a,b,c} ?
Numeric Question
Ans:-36
37) All possible functions are made between set having 2 and 20
distinct elements respectively. Find the probability of
selecting an one to one function.
Numeric Question
Ans:-0.95
38) 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:S1 f(x) is continuous.
S2 f(x) is NOT bounded between [-1,1].
S3. A has a non zero finite value
a)only 1
b)only 2 and 3
c)only 2
d)only 3
Ans:-B
39). Consider the three languages given:
L1 = {wxwR| where wR is reversal of w | w,x belongs to (a,b)* and
|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.only L1
b.only L3
c. L1 & L3
d.all
Ans:-C
40)Which one of the following is Turing decidable
a)Compliment of turind Decidable is turing Decidable
b)a Language belong to NP may be turing Decidable
c)a language belong to NP Need not be turing Decidable
d)...............
Ans:41)For a given B+ tree of order 1 ,minimum number of nodes to
be fetched for a given query
"X greater than or equal to 7 and less than 15"
Numeric Question
Ans :-5
42) Cylinder 15000 rpm , avg seek time is twice the Rotational
latency
transfer rate is 32KBps
512 byte sector size.calculate total cylinder access time.
Numeric Question
Ans:-6.++
43) minimum number of JK flipflop required for the counter
sequence
0011223300..
Numeric Question
Ans:-2/3 not sure
44)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?
Numeric Question
Ans:-.......
Ans:-5
51) switch case problem in whic c code is given
Numeric Question
Ans:-10+5 = 15
55)..
Ans:-