I know the price of success: dedication, hard work, and an unremitting devotion to the things you want to see happen.
1. The man who is now Municipal Commissioner worked as _____________.
(A) the security guard at a university
(B) a security guard at the university
(C) a security guard at university
(D) the security guard at the university
View/Hide Ans
Correct Answer is B
2. Nobody knows how the Indian cricket team is going to cope with the difficult and seamer-friendly wickets in Australia.
Choose the option which is closest in meaning to the underlined phrase in the above sentence.
(A) put up with
(B) put in with
(C) put down to
(D) put up against
View/Hide Ans
Correct Answer is A
3. Find the odd one in the following group of words.
mock, deride, praise, jeer
(A) mock
(B) deride
(C) praise
(D) jeer
View/Hide Ans
Correct Answer is C
4. Pick the odd one from the following options.
(A) CADBE
(B) JHKIL
(C) XVYWZ
(D) ONPMQ
View/Hide Ans
Correct Answer is D
5. In a quadratic function, the value of the product of the roots (∝, ß) is 4.
Find the value of
(A) increased by 5 %
(B) decreased by 13%
(C) decreased by 20%
(D) decreased by 11%
View/Hide Ans
Correct Answer is B
6. Among 150 faculty members in an institute, 55 are connected with each other through Facebook® and
85 are connected through WhatsApp®.
30 faculty members do not have Facebook® or WhatsApp® accounts.
The number of faculty members connected only through Facebook® accounts is ______________.
(A) 35
(B) 45
(C) 65
(D) 90
View/Hide Ans
Correct Answer is A
7. Computers were invented for performing only high-end useful computations. However, it is no understatement that they have taken over our world today. The internet, for example, is ubiquitous. Many believe that the internet itself is an unintended consequence of the original invention. With the advent of mobile computing on our phones, a whole new dimension is now enabled. One is left wondering if all these developments are good or, more importantly, required.
Which of the statement(s) below is/are logically valid and can be inferred from the above paragraph?
(i) The author believes that computers are not good for us.
(ii) Mobile computers and the internet are both intended inventions
(A) (i) only
(B) (ii) only
(C) both (i) and (ii)
(D) neither (i) nor (ii)
View/Hide Ans
Correct Answer is D
8. All hill-stations have a lake. Ooty has two lakes.
Which of the statement(s) below is/are logically valid and can be inferred from the above sentences?
(i) Ooty is not a hill-station.
(ii) No hill-station can have more than one lake.
(A) (i) only
(B) (ii) only
(C) both (i) and (ii)
(D) neither (i) nor (ii)
View/Hide Ans
Correct Answer is D
9. In a 2×4 rectangle grid shown below, each cell is a rectangle.
How many rectangles can be observed in the grid?
10. Choose the correct expression for f(x) given in the graph.
11. Consider the following expressions:
(i) false
(ii) Q
(iii) true
(iv) P ∨ Q
(v) ~Q ∨ P
The number of expressions given above that are logically implied by P ∧ (P → Q) is ___________
(A) 3
(B) 4
(C) 5
(D) 6
View/Hide Ans
Correct Answer is B
12. Let f (x) be a polynomial and g(x)=f'(x) be its derivative.
If the degree of (f(x)+f(-x)) is
10, then the degree of (g(x)-g(-x)) is ___________
(A) 8
(B) 9
(C) 10
(D) 11
View/Hide Ans
Correct Answer is B
13. The minimum number of colours that is sufficient to vertex-colour any planar graph is
___________
(A) 3
(B) 4
(C) 5
(D) 6
View/Hide Ans
Correct Answer is B
14. Consider the systems, each consisting of m linear equations in n variables.
I. If m < n, then all such systems have a solution
II. If m > n, then none of these systems has a solution
III. If m = n, then there exists a system which has a solution
Which one of the following is CORRECT?
(A) I, II and III are true
(B) Only II and III are true
(C) Only III is true
(D) None of them is true
View/Hide Ans
Correct Answer is C
15. Suppose that a shop has an equal number of LED bulbs of two different types. The probability
of an LED bulb lasting more than 100 hours given that it is of Type1 is 0.7,and given that it
is of Type 2is 0.4.
The probability that an LED bulb chosen uniformly at random lasts more
than 100 hours is ___________
(A) 0.45
(B) 0.55
(C) 0.65
(D) 0.75
View/Hide Ans
Correct Answer is B
16. Suppose that the eigen values of matrix A are 1, 2, 4.
The determinant of (A-1)T is
_______
(A) 0.024 to 0.026
(B) 0.124 to 0.126
(C) 0.224 to 0.226
(D) 0.324 to 0.326
View/Hide Ans
Correct Answer is B
17. Consider an eight-bit ripple-carry adder for computing the sum of A and B, where A and B are
integers represented in 2’s complement form.
If the decimal value of A is one,the decimal
value of B that leads to the longest latency for the sum to stabilize is ___________
(A) 0.0
(B) -1.0
(C) 1.0
(D) 1.5
View/Hide Ans
Correct Answer is B
18. Let, x1⊕x2⊕x3⊕x4 =0 where x1, x2,
x3, x4 are Boolean variables,and ⊕ is the XOR operator.
Which one of the following must always be TRUE?
(A) x1x2x3x4 = 0
(B) x1x3+x2 = 0
(C) x1'⊕x3' = x2'⊕ x4'
(D) x1+x2+x3+x4 = 0
View/Hide Ans
Correct Answer is C
19. Let X be the number of distinct 16-bit integers in 2’scomplement representation. Let Y be the
number of distinct 16-bit integers in sign magnitude representation.
Then X-Y is ___________
(A) 0
(B) 1
(C) 2
(D) 3
View/Hide Ans
Correct Answer is B
20. A processor has 40 distinct instructions and 24 general purpose registers. A 32-bit instruction
word has an opcode,two register operands and an immediate operand.
The number of bits
available for the immediate operand field is .
(A) 15
(B) 16
(C) 17
(D) 18
View/Hide Ans
Correct Answer is B
21. Breadth First Search(BFS) is started on a binary tree beginning from the root vertex. There is
a vertex t at a distance four from the root.
If t is the n-th vertex in this BFS traversal,then the
maximum possible value of n is _______
(A) 15
(B) 31
(C) 63
(D) 127
View/Hide Ans
Correct Answer is B
22. The value printed by the following program is _______
void f(int *p,int m){
m =m+5;
*p =*p+m;
return;
}
void main(){
int i=5,j=10;
f(&i,j);
printf("%d",i+j);
}
(A) 20
(B) 30
(C) 40
(D) 50
View/Hide Ans
Correct Answer is B
23. Assume that the algorithms considered here sort the input sequences in ascending order. If the
input is already in ascending order,which of the following are TRUE?
I. Quicksort runs in Θ(n2) time
II. Bubblesort runs in Θ(n2) time
III. Mergesort runs in Θ(n) time
IV. Insertion sort runs in Θ(n) time
(A) I and IIonly
(B) I and IIIonly
(C) II and IVonly
(D) I and IVonly
View/Hide Ans
Correct Answer is D
24. The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
(A) Greedy paradigm.
(B) Divide-and-Conquer paradigm.
(C) Dynamic Programming paradigm.
(D) neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm
View/Hide Ans
Correct Answer is C
25. N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided
to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on
which the operation is to be performed.
An algorithm performs the following operations on the list in this order:
Θ(N) delete, O(logN) insert, O(logN) find, and Θ(N) decrease-key.
What is the time complexity of all these
operations put together?
(A) O(log2N)
(B) O(N)
(C) O(N2)
(D) Θ(N2 log N)
View/Hide Ans
Correct Answer is C
26. The number of states in the minimum sized DFA that accepts the language defined by the
regular expression
(0+1)*(0+1)(0+1)*
is___________ .
(A) 1
(B) 2
(C) 3
(D) 4
View/Hide Ans
Correct Answer is B
27. Language L1 is defined by the grammar: S1 →aS1b|ε
Language L2 is defined by the grammar: S2→abS2|ε
Consider the following statements:
P: L1 is regular
Q: L2 is regular
Which one of the following is TRUE?
(A) Both P and Q are true
(B) P is trueand Q is false
(C) P is falseand Q is true
(D) Both P and Q are false
View/Hide Ans
Correct Answer is C
28. Consider the following types of languages:
L1 : Regular
L2 : Context-free
L3 : Recursive
L4 : Recursively enumerable.
Which of the following is/are TRUE?
I. L3'∪L4 is recursively enumerable
II. L2'∪L3 is recursive
III. L1* ∩L2 is context-free
IV. L1∪L2' is context-free
(A) I only
(B) I and III only
(C) I and IV only
(D) I, II and III only
View/Hide Ans
Correct Answer is D
29. Match the following:
Codes:
Group I
Group II
(P) Lexical analysis
(i) Left most derivation
(Q) Top down parsing
(ii) Type checking
(R) Semantic analysis
(iii) Regular expressions
(S) Runtime environments
(iv) Activation records
(A) P-i, Q-ii, R-iv,S-iii
(B) P-iii, Q-i, R-ii, S-iv
(C) P-ii, Q-iii, R-i, S-iv
(D) P-iv, Q-i, R-ii, S-iii
View/Hide Ans
Correct Answer is B
30. In which one of the following page replacement algorithms it is possible for the page fault rate
to increase even when the number of allocated frames increases?
(A) LRU(Least Recently Used)
(B) OPT (Optimal Page Replacement)
(C) MRU(Most Recently Used)
(D) FIFO (First In First Out)
View/Hide Ans
Correct Answer is D
31. B+ Trees are considered BALANCED because
(A) the lengths of the paths from the root to all leaf nodes are all equal.
(B) the lengths of the paths from the root to all leaf nodes differ from each other by at
most 1.
(C) the number of children of any two non-leaf sibling nodes differ by atmost 1.
(D) the number of records in any two leaf nodes differ by atmost 1
View/Hide Ans
Correct Answer is A
32. Suppose a database schedule S involves transactions T1,......, Tn. Construct the precedence
graph of S with vertices representing the transactions and edges representing the conflicts.
If
S is serializable, which one of the following orderings of the vertices of the precedence graph
is guaranteed to yield a serial schedule?
(A) Topological order
(B) Depth-first order
(C) Breadth-first order
(D) Ascending order of transaction indices
View/Hide Ans
Correct Answer is A
33. Anarkali digitally signs a message and sends it to Salim.
Verification of the signature by Salim
requires
(A) Anarkali’s public key
(B) Salim’s public key
(C) Salim’s private key
(D) Anarkali’s private key
View/Hide Ans
Correct Answer is A
34. In an Ethernet local area network, which one of the following statements is TRUE?
(A) A station stops to sense the channel once it starts transmitting a frame.
(B) The purpose of the jamming signal is to pad the frames that are smaller than the
minimum frame size.
(C) A station continues to transmit the packet even after the collision is detected.
(D) The exponential backoff mechanism reduces the probability of collision on
retransmissions.
View/Hide Ans
Correct Answer is D
35. Identify the correct sequence in which the following packets are transmitted on the network
by a host when a browser requests a webpage froma remote server, assuming that the host has
just been restarted.
(A) HTTP GET request, DNS query, TCPSYN
(B) DNS query, HTTPGET request, TCP SYN
(C) DNS query, TCP SYN, HTTP GET request
(D) TCP SYN, DNS query, HTTP GET request
View/Hide Ans
Correct Answer is C
36. A binary relation R on N*N is defined as follows: (a,b)R(c,d) if a ≤c or b≤d.
Consider
the following propositions:
P: R is reflexive
Q: R is transitive
Which one of the following statements is TRUE?
(A) Both P and Q aretrue.
(B) P is true and Q is false.
(C) P is false and Q is true.
(D) Both P and Q are false.
View/Hide Ans
Correct Answer is B
37. Which one of the following well-formed formulae in predicate calculus is NOT valid?
View/Hide Ans
Correct Answer is D
38. Consider a set U of 23 different compounds in a Chemistry lab.There is a subset S of U of
9 compounds, each of which reacts with exactly 3 compounds of U. Consider the following
statements:
I. Each compoundin U\S reacts with an odd number of compounds.
II. At least one compound in U\S reacts with an odd number of compounds.
III. Each compound in U\S reacts with an even number of compounds.
Which one of the above statements is ALWAYS TRUE?
(A) Only I
(B) Only II
(C) Only III
(D) None
View/Hide Ans
Correct Answer is B
39. The value of the expression 1399(mod 17), in the range 0 to 16, is ___________
(A) 3
(B) 4
(C) 5
(D) 6
View/Hide Ans
Correct Answer is B
40. Suppose the functions F and G can be computed in 5 and 3 nanoseconds by functional units
UF and UG, respectively. Given two instances of UF and two instances of UG, it is required to
implement the computation F(G(Xi)) for 1≤i≤10.
Ignoring all other delays, the minimum
time required to complete this computation is ___________ nanoseconds.
(A) 27
(B) 28
(C) 29
(D) 30
View/Hide Ans
Correct Answer is B
41. Consider a processor with 64 registers and an instruction set of size twelve. Each instruction
has five distinct fields, namely, opcode, two source register identifiers, one destination register
identifier, and a twelve-bit immediate value. Each instruction must be stored in memory in
a byte-aligned fashion.
If a program has 100 instructions, the amount o fmemory(in bytes)
consumed by the program text is___________.
(A) 400
(B) 500
(C) 600
(D) 700
View/Hide Ans
Correct Answer is B
42. The width of the physical address on a machine is 40 bits.
The width of the tag field in a 512
KB 8-way set associative cache is ___________ bits
(A) 23
(B) 24
(C) 25
(D) 26
View/Hide Ans
Correct Answer is B
43. Consider a 3 GHz processor with a three-stage pipeline and stage latencies t1,
t2, and t3 such that t1 = 3t2/4 = 2t3.
If the longest pipeline stage is split into two pipeline
stages of equal latency,the new frequency is ___________ GHz, ignoring delays in the pipeline
registers.
(A) 2.9 to 3.1
(B) 3.9 to 4.1
(C) 4.9 to 5.1
(D) 5.9 to 6.1
View/Hide Ans
Correct Answer is B
44. A complete binary min-heap is made by including each integer in [1,1023] exactly once.
The depth of a node in the heap is the length of the path from the root of the heap to that
node. Thus, the root is at depth 0.
The maximum depth at which integer 9 can appear is ___________
.
(A) 7
(B) 8
(C) 9
(D) 10
View/Hide Ans
Correct Answer is B
45. The following function computes XY for positive integers X and Y.
int exp(int X, int Y){
int res=1, a=X, b=Y;
while (b!=0){
if (b%2==0) { a=a*a; b=b/2;}
else {res=res*a; b=b-1;}
}
return res;
}
Which one of the following conditions is TRUE before every iteration of the loop?
(A) XY = ab
(B) (res*a)Y = (res*X)b
(C) XY = res*ab
(D) XY = (res*a)b
View/Hide Ans
Correct Answer is C
46. Consider the following New-order strategy for traversing a binary tree:
1) Visit the root;
2) Visit the right subtree using New-order;
3) Visit the left subtree using New-order;
The New-order traversal of the expression tree corresponding to the reverse polish expression
3 4*5-2ˆ67*1+-
is given by:
(A) + - 1 6 7 * 2 ˆ 5 - 3 4 *
(B) - + 1 * 6 7 ˆ 2 - 5 * 3 4
(C) - + 1 * 7 6 ˆ 2 - 5 * 4 3
(D) 1 7 6 * + 2 5 4 3 * - ˆ -
View/Hide Ans
Correct Answer is C
47. Consider the following program:
int f(int *p,int n)
{
if (n<=1) return 0;
else return max(f(p+1,n-1),p[0]-p[1]);
}
int main()
{
int a[]={3,5,2,6,4};
printf("%d", f(a,5));
}
Note: max(x,y) returns the maximum of x and y.
The value printed by this program is ___________
(A) 2
(B) 3
(C) 4
(D) 5
View/Hide Ans
Correct Answer is B
48. Let A1, A2, A3 and A4 be four matrices of dimensions 10*5, 5*20, 20*10, and 10*5,
respectively.
The minimum number of scalar multiplications required to find the product
A1A2A3A4 using the basic matrix multiplication method is ___________
(A) 500
(B) 1500
(C) 2000
(D) 2500
View/Hide Ans
Correct Answer is B
49. The given diagram shows the flowchart for a recursive function A(n). Assume that all
statements, except for the recursive calls, have O(1) time complexity.If the worst case time
complexity of this function is O(n∝), then the least possible value (accurate upto two decimal
positions) of ∝ is ___________
50. The number of ways in which the numbers 1,2,3,4,5,6,7 can be inserted in an empty binary
search tree, such that the resulting tree has height 6, is ___________
Note: The height of a tree with a single node is 0.
(A) 32
(B) 64
(C) 128
(D) 256
View/Hide Ans
Correct Answer is B
51. In an adjacency list representation of an undirected simple graph G=(V, E), each edge (u, v)
has two adjacency listen tries: [v] in the adjacency list of u, and [u] in the adjacency list of
v. These are called twins of each other. A twin pointer is a pointer from an adjacency list
entry to its twin.If |E|=m and |V|=n, and the memory size is not a constraint, what is the
time complexity of the most efficient algorithm to set the twin pointer in each entry in each
adjacency list?
(A) Θ(n2)
(B) Θ(n+m)
(C) Θ(m2)
(D) Θ(n4)
View/Hide Ans
Correct Answer is B
52. Consider the following two statements:
I. If all states of an NFA are accepting states then the language accepted by the NFA is ∑*.
II. There exists a regular language A such that for all languages B, A∩B is regular.
Which one of the following is CORRECT?
(A) Only I is true
(B) Only II is true
(C) Both I and II are true
(D) Both I and II are false
View/Hide Ans
Correct Answer is B
53. Consider the following languages:
L1 = {anbmcn+m : m, n ≥1}
L2 = {anbmc2n : n≥1}
Which one of the following is TRUE?
(A) Both L1 and L2 are context-free.
(B) L1 is context-free while L2 is not context-free.
(C) L2 is context-free while L1 is not context-free.
(D) Neither L1 nor L2 is context-free
View/Hide Ans
Correct Answer is B
54. Consider the following languages.
L1 = {<M> | M takes at least 2016 steps on some input}
L2 = {<M> | M takes at least 2016 steps on all input}
L3 = {<M> | M accepts ε}
where for each Turing machine M, <M> denotes a specific encoding of M.
Which one of the
following is TRUE?
(A) L1 is recursive and L2, L3 are not recursive
(B) L2 is recursive and L1, L3 are not recursive
(C) L1, L2 are recursive and L3 is not recursive
(D) L1, L2, L3 are recursive
View/Hide Ans
Correct Answer is C
55. Which one of the following grammars is free from left recursion?
(A) S → AB
A →Aa | b
B → c
(B) S → Ab | Bb | c
A → Bd | ε
B → e
(C) S → Aa | B
A → Bb | Sc | ε
B → d
(D) S → Aa | Bb | c
A → Bd | ε
B → Ae | ε
View/Hide Ans
Correct Answer is B
56. A student wrote two context-free grammars G1 and G2 for generating a single C-like array
declaration. The dimension of the array is atleast one. For example,
int a[10][3];
The grammars use D as the start symbol,and use six terminal symbols int ;id[ ] num.
Which ofthe grammars correctly generate the declaration mentioned above?
(A) Both G1 and G2
(B) Only G1
(C) Only G2
(D) Neither G1 nor G2
View/Hide Ans
Correct Answer is A
57. Consider the following processes, with the arrival time and the length of the CPU burst given
in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first.
The average turn around time of these processes is milliseconds ___________
(A) 7.2 to 7.3
(B) 8.2 to 8.3
(C) 9.2 to 9.3
(D) 10.2 to 10.3
View/Hide Ans
Correct Answer is B
58. Consider the following two-process synchronization solution.
The shared variable turn is initialized to zero.
Which one of the following is TRUE?
(A) This isacorrecttwo-processsynchronizationsolution.
(B) This solutionviolatesmutualexclusionrequirement.
(C) This solutionviolatesprogressrequirement.
(D) This solutionviolatesboundedwaitrequirement.
View/Hide Ans
Correct Answer is C
59. Consider a non-negative counting semaphore S. The operation P(S) decrements S, and V(S)
increments S. During an execution, 20 P(S) operations and 12 V(S) operations are issued in
some order.
The largest initial value of S for which atleast one P(S) operation will remain
blocked is ___________
(A) 6
(B) 7
(C) 8
(D) 9
View/Hide Ans
Correct Answer is B
60. A file system uses an in-memory cache to cache disk blocks.The miss rate of the cache is
shown in the figure. The latency to read a block from the cache is 1 ms and to read a block
from the disk is 10 ms. Assume that the cost of checking whether a block exists in the cache
is negligible. Available cache sizes are in multiples of 10 MB.
61. Consider the following database schedule with two transactions, T1 and T2.
S = r2(X); r1(X); r2(Y); w1(X); r1(Y); w2(X); a1; a2
where ri(Z) denotes a read operation bytransaction Ti on avariable Z, wi(Z) denotes a write
operation by Ti on avariable Z and ai denotes an abort by transaction Ti.
Which one of the following statements about the above schedule is TRUE?
(A) S is non-recoverable
(B) S is recoverable,but has a cascading abort
(C) S does not have a cascading abort
(D) S is strict
View/Hide Ans
Correct Answer is C
62. Consider the following database table named water_schemes :
63. A network has a data transmission bandwidth of 20*106 bits per second. It uses CSMA/CD
in the MAC layer.The maximum signal propagation time from one node to another node is
40 microseconds.
The minimum size of a frame in the network is___________ bytes.
(A) 100
(B) 200
(C) 300
(D) 400
View/Hide Ans
Correct Answer is B
64. For the IEEE 802.11 MAC protocol for wireless communication, which of th efollowing
statements is/are TRUE?
I. At least three non-overlapping channels are available for transmissions.
II. The RTS-CTS mechanismis used for collision detection.
III. Unicast frames are ACKed
(A) All I,II,and III
(B) I and III only
(C) II and III only
(D) II only
View/Hide Ans
Correct Answer is B
65. Consider a 128*103 bits/second satellite communication link with one way propagation delay
of 150 milliseconds. Selective retransmission(repeat) protocol is used on this link to send
data with a frame size of 1 kilobyte. Neglect the transmission time of acknowledgement.
The
minimum number of bits required for the sequence number field to achieve 100% utilization
is ___________
(A) 3
(B) 4
(C) 5
(D) 6
View/Hide Ans
Correct Answer is B
© 2022. All Rights Reserved | Copyright | Terms of Use & Privacy Policy