The only limit to our realization of tomorrow will be our doubts of today.
1. If ROAD is written as URDG, then SWAN should be written as:
(A) VXDQ
(B) VZDQ
(C) VZDP
(D) UXDQ
View/Hide Ans
Correct Answer is B
2. The Tamil version of ________ John Abraham-starrer Madras Cafe _____ cleared by the Censor Board with no cuts last week, but the film’s distributors ______ no takers among the exhibitors for a release in Tamil Nadu _________ this Friday.
(A) Mr., was, found, on
(B) a, was, found, at
(C) the, was, found, on
(D) a, being, find at
View/Hide Ans
Correct Answer is C
3. Extreme focus on syllabus and studying for tests has become such a dominant concern of Indian students that they close their minds to anything ________ to the requirements of the exam.
(A) related
(B) extraneous
(C) outside
(D) useful
View/Hide Ans
Correct Answer is B
4. Select the pair that best expresses a relationship similar to that expressed in the pair: Children : Pediatrician
(A) Adult : Orthopaedist
(B) Females : Gynaecologist
(C) Kidney : Nephrologist
(D) Skin : Dermatologist
View/Hide Ans
Correct Answer is B
5. A function f(x) is linear and has a value of 29 at x=-2 and 39 at x = 3.
Find its value at x=5
(A) 59
(B) 45
(C) 43
(D) 35
View/Hide Ans
Correct Answer is C
6. Alexander turned his attention towards India, since he had conquered Persia.
Which one of the statements below is logically valid and can be inferred from the above sentence?
(A) Alexander would not have turned his attention towards India had he not conquered Persia
(B) Alexander was not ready to rest on his laurels, and wanted to march to India
(C) Alexander was completely in control of his army and could command it to move towards India.
(D) Since Alexander’s kingdom extended to India borders after the conquest of Persia, he was keen to move further
View/Hide Ans
Correct Answer is A
7. The head of a newly formed government desires to appoint five of the six selected members P, Q, R, S, T and U to portfolios of Home, Power, Defence, Telecom, and Finance. U does not want any portfolio if S gets one of the five. R wants either Home or Finance or no portfolio. Q says that if S gets either Power of telecom, then she must get the other one. T insists on a portfolio if P gets one.
Which is the valid distribution of portfolios?
(A) P-Home, Q-Power, R-Defence, S-Telecom, T-Finance
(B) R-Home, S-Power, P-Defence, Q-Telecom, T-Finance
(C) P-Home, Q-Power, T-Defence, S-Telecom, U-Finance
(D) Q-Home, U-Power, T-Defence, R-Telecom, P-Finance
View/Hide Ans
Correct Answer is B
8. Choose the most appropriate equation for the function drawn as a thick line, in the plot below.
View/Hide Ans
Correct Answer is B
9. Most experts feel that in spite of possessing all the technical skills required to be a batsman of the highest order, he is unlikely to be so due to lack of requisite temperament. He was guilty of throwing away his wicket several times after working hard to lay a strong foundation. His critics pointed out that until he addressed this problem, success at the highest level will continue to elude him.
Which of the statements(s) below is/are logically valid and can be inferred from the above passage?
(i) He was already a successful batsman at the highest level.
(ii) He has to improve his temperament in order to become a great batsman.
(iii) He failed to make many of his good starts count.
(iv) Improving his technical skills will guarantee success.
(A) (iii) and (iv)
(B) (ii) and (iii)
(C) (i), (ii) and (iii)
(D)(ii) only
View/Hide Ans
Correct Answer is B
10. The exports and imports (in crores of Rs.) of a country from the year 2000 to 2007 are given in the following bar chart. In which year is the combined percentage increase in imports and exports the highest?
11. The maximum number of processes that can be in Ready state for a computer system with n CPUs is
(A) n
(B) n2
(C) 2n
(D) Independent of n
View/Hide Ans
Correct Answer is D
12. Let # be a binary operator defined as X # Y = X' + Y' where X and Y are Boolean variables.
Consider the following two statements.
S1: (P # Q) # R = P # (Q # R)
S2: Q # R = R # Q
Which of the following is/are true for the Boolean variables P, Q and R?
(A) Only S1 is True
(B) Only S2 is True
(C) Both S1 and S2 are True
(D) Neither S1 nor S2 are True
View/Hide Ans
Correct Answer is B
13. Consider the following relation
Cinema (theater, address, capacity)
Which of the following options will be needed at the end of the SQL query
SELECT P1. address
FROM Cinema P1
Such that it always finds the addresses of theaters with maximum capacity?
(A) WHERE P1. Capacity >= All (select P2. Capacity from Cinema P2)
(B)WHERE P1. Capacity >= Any (select P2. Capacity from Cinema P2)
(C) WHERE P1. Capacity > All (select max(P2. Capacity) from Cinema P2)
(D)WHERE P1. Capacity > Any (select max (P2. Capacity) from Cinema P2)
View/Hide Ans
Correct Answer is A
14.
The equality above remains correct if X is replace by
(A) Only I
(B) Only II
(C) I or III or IV but not II
(D) II or III or IV but not I
View/Hide Ans
Correct Answer is C
15. The number of 4 digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set {1, 2, 3} is ____.
(A) 12
(B) 13
(C) 14
(D) 15
View/Hide Ans
Correct Answer is D
16. Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (108 bits per second) over a 1 km (kilometer) cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is the signal speed (km/sec) in the cable?
(A) 8000
(B) 10000
(C) 16000
(D) 20000
View/Hide Ans
Correct Answer is D
17. Consider the following C program segment.
# include <stdio.h>
int main( )
{
char s1[7] = "1234", *p;
p = s1 + 2;
*p = '0' ;
printf ("%s", s1);
}
What will be printed by the program?
(A) 12
(B) 120400
(C) 1204
(D) 1034
View/Hide Ans
Correct Answer is C
18. In a web server, ten WebPages are stored with the URLs of the form http://www.yourname.com/var.html; where, var is a different number from 1 to 10 for each Webpage. Suppose, the client stores the Webpage with var = 1 (say W1) in local machine, edits and then tests. Rest of the WebPages remains on the web server. W1 contains several relative URLs of the form “var.html” referring to the other WebPages.
Which one of the following statements needs to be added in W1, so that all the relative URLs in W1 refer to the appropriate WebPages on the web server?
(A) <a.href: "http://www.yourname.com/", href: "...var.html">
(B) <base href: "http://www.yourname.com/">
(C) <a.href: "http://www.yourname.com/">
(D) <base href: "http://www.yourname.com/", range: "...var.html">
View/Hide Ans
Correct Answer is D
19.
(A) 0
(B) 1/2
(C) 1
(D) ∞
View/Hide Ans
Correct Answer is A
20. Two processes X and Y need to access a critical section. Consider the following synchronization construct used by both the processes.
21. Consider a software program that is artificially seeded with 100 faults. While testing this program, 159 faults are detected, out of which 75 faults are from those artificially seeded faults. Assuming that both real and seeded faults are of same nature and have same distribution, the estimated number of undetected real faults is ____________.
(A) 28
(B) 175
(C) 56
(D) 84
View/Hide Ans
Correct Answer is A
22. The result evaluating the postfix expression 10 5 + 60 6 / * 8 - is
(A) 284
(B) 213
(C) 142
(D) 71
View/Hide Ans
Correct Answer is C
23. While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree(BST) in the sequence shown, the element in the lowest level is
(A) 65
(B) 67
(C) 69
(D) 83
View/Hide Ans
Correct Answer is B
24. Consider a machine with a byte addressable main memory of 220 bytes, block size of 16 bytes and a direct mapped cache having 212 cache lines. Let the addresses of two consecutive bytes in main memory be (E201F)16 and (E2020)16.
What are the tag and cache line address (in hex) for main memory address (E201F)16?
(A) E, 201
(B) F, 201
(C) E, E20
(D) 2, 01F
View/Hide Ans
Correct Answer is A
25. In the given matrix, one of the eigenvalues is 1. the eigenvectors corresponding to the eigenvalue 1 are
26. Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?
(A) SLR, LALR
(B) Canonical LR, LALR
(C) SLR, canonical LR
(D) LALR, canonical LR
View/Hide Ans
Correct Answer is C
27. Given a hash table T with 25 slots that stores 2000 elements, the load factor ∝ for T is __________
(A) 80
(B) 0.0125
(C) 8000
(D) 1.25
View/Hide Ans
Correct Answer is A
28. Let T be the language represented by the regular expression ∑*0011∑* where ∑={0, 1}.
What is the minimum number of states in a DFA that recognizes L' (complement of L)?
(A) 4
(B) 5
(C) 6
(D) 8
View/Hide Ans
Correct Answer is B
29. Consider the following array of elements. <89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100>.
The minimum number of interchanges needed to convert it into a max-heap is
(A) 4
(B) 5
(C) 2
(D) 3
View/Hide Ans
Correct Answer is D
30. Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies
F = {
{P, R} → {S,T},
{P, S, U} → {Q, R}
}
Which of the following is the trivial functional dependency in F+ is closure of F?
(A) {P,R}→{S,T}
(B) {P,R}→{R,T}
(C) {P,S}→{S}
(D) {P,S,U}→{Q}
View/Hide Ans
Correct Answer is C
31. Consider a software project with the following information domain characteristic for calculation of function point metric.
Number of external inputs (I) = 30
Number of external output (O) = 60
Number of external inquiries (E) = 23
Number of files (F) = 08
Number of external interfaces (N) = 02
It is given that the complexity weighting factors for I, O, E, F and N are 4, 5, 4, 10 and 7, respectively. It is also given that, out of fourteen value adjustment factors that influence the development effort, four factors are not applicable, each of he other four factors have value 3, and each of the remaining factors have value 4. The computed value of function point metric is ____________
(A) 612.06
(B) 212.05
(C) 305.09
(D) 806.9
View/Hide Ans
Correct Answer is A
32. Consider the following statements.
I. TCP connections are full duplex.
I. TCP has no option for selective acknowledgment
III. TCP connections are message streams.
(A) Only I is correct
(B) Only I and II are correct
(C) Only II and III are correct
(D) All of I, II and III are correct
View/Hide Ans
Correct Answer is A
33. Suppose U is the power set of the set S = {1,2,3,4,5,6}. For any T ∈ U, let |T| denote the number of elements in T and T' denote the complement of T. For any T, R ∈ U, let T\R be the set of all elements in T which are not in R.
Which one of the following is true?
View/Hide Ans
Correct Answer is D
34. In a room there are only two types of people, namely Type 1 and Type 2. Type 1 people always tell the truth and Type 2 people always lie. You give a fair coin to a person in that room, without knowing which type he is from and tell him to toss it and hide the result from you till you ask for it. Upon asking, the person replies the following:
"The result of the toss is head if and only if I am telling the truth."
Which of the following options is correct?
(A) The result is head
(B) The result is tail
(C) If the person is of Type 2, then the result is tail
(D) If the person is of Type 1, then the result is tail
View/Hide Ans
Correct Answer is A
35. Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are _________.
(A) 199
(B) 200
(C) Any number between 0 and 199
(D) Any number between 100 and 200
View/Hide Ans
Correct Answer is A
36. Consider the following C program.
# include <stdio.h>
int main( )
{
static int a[] = {10, 20, 30, 40, 50};
static int *p[] = {a, a+3, a+4, a+1, a+2};
int **ptr = p;
ptr++;
printf("%d%d", prt-p, **ptr};
}
The output of the program is _________
(A) 140
(B) 120
(C) 100
(D) 40
View/Hide Ans
Correct Answer is A
37. Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64.
Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?
(A) 256
(B) 512
(C) 1024
(D) 2048
View/Hide Ans
Correct Answer is B
38. Consider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is 500 × 106 bits per second. The propagation speed of the media is 4 × 106 meters per second.
It is needed to design a Go-Back-N sliding window protocol for this network.
The average packet size is 107 bits.
The network is to be used to its full capacity.
Assume that processing delays at nodes are negligible.
Then, the minimum size in bits of he sequence number field has to be ________.
(A) 2
(B) 4
(C) 8
(D) 16
View/Hide Ans
Correct Answer is C
39. Consider the following partial Schedule S involving two transactions T1 and T2. Only the read and the write operations have been shown. The read operation on data item P is denoted by read(P) and the write operation on data item P is denoted by write(P)
40. Consider the following two C code segments.
Y and X are one and two dimensional arrays of size n and n × n respectively,
where 2≤n≤10.
Assume that in both code segments, elements of Y are initialized to 0 and each element X[i][j] of array X is initialized to i + j.
Further assume that when stored in main memory all elements of X are in same main memory page frame.
Code segment 1:
// initialize elements of Y to 0
// initialize elements X[i][j] of X to i+j
for (i = 0; i < n; i++)
y[i] + = X[0][i];
Code segment 2:
// initialize elements of Y to 0
// initialize elements X[i][j] of X to i+j
for (i = 0; i < n; i++)
y[i] + = X[i][0];
Which of the following statements is/are correct?
S1: Final contents of array Y will be same in both code segments.
S2: Elements of array X accessed inside the for loop shown in
code segment 1 are contiguous in main memory.
S3: Elements of array X accessed inside the for loop shown in
code segment 2 are contiguous in main memory.
(A) Only S2 is correct
(B) Only S3 is correct
(C) Only S1 and S2 are correct
(D) Only S1 and S3 are correct
View/Hide Ans
Correct Answer is C
41. Consider the following grammar G.
S → F | H
F → p | c
H → d | c
Where S, F and H are non-terminal symbols, p, d and c are terminal symbols. Which of the following statement(s) is/are correct?
S1: LL(1) can parse all strings that are generated using grammar G.
S2: LR(1) can parse all strings that are generated using grammar G.
(A) Only S1
(B) Only S2
(C) Both S1 and S2
(D) Neither S1 and S2
View/Hide Ans
Correct Answer is D
42. Which of the following languages are context-free?
L1 = {ambnanbm | m, n ≥ 1}
L2 = {ambnambn | m, n ≥ 1}
L3 = {ambn | m = 2n + 1}
(A) L1 and L2 only
(B) L1 and L3 only
(C) L2 and L3 only
(D) L3 only
View/Hide Ans
Correct Answer is B
43. If the following system has non-trivial solution,
px + qy + rz = 0
qx + ry + pz = 0
rx + py + qz = 0
then which one of the following options is True?
(A) p - q + r = 0 or p = q = -r
(B) p + q - r = 0 or p = -q = r
(C) p + q + r = 0 or p = q = r
(D) p - q + r = 0 or p = -q = -r
View/Hide Ans
Correct Answer is C
44. For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?
45. Consider the equation (43)x = (y3)8 where x and y are unknown.
The number of possible solutions is ________.
(A) 3
(B) 4
(C) 5
(D) 6
View/Hide Ans
Correct Answer is C
46. Since it is a network that uses switch, every packet goes through two links, one from source to switch and other from switch to destination.
Since there are 10000 bits and packet size is 5000, two packets are sent.
Transmission time for each packet is 5000/107 bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 10000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits, the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is _________.
(A) 1075
(B) 1575
(C) 2220
(D) 2200
View/Hide Ans
Correct Answer is B
47. Suppose Xi for i = 1, 2, 3 are independent and identically distributed random variables whose probability mass functions are
Pr[Xi = 0] = Pr[Xi = 1] = 1/2 for i = 1, 2, 3.
Define another random variable Y = X1 X2 ⊕ X3, where ⊕ denotes XOR.
Then Pr[Y = 0 | X3 = 0] = ____________.
(A) 0.75
(B) 0.50
(C) 0.85
(D) 0.25
View/Hide Ans
Correct Answer is A
48. In the network 200.10.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is ________
(A) 158
(B) 255
(C) 222
(D) 223
View/Hide Ans
Correct Answer is A
49. Consider the following recursive C function. If get(6) function is being called in main() then how many times will the get() function be invoked before returning to the main()?
void get (int n)
{
if (n < 1) return;
get(n-1);
get(n-3);
printf("%d", n);
}
(A) 15
(B) 25
(C) 35
(D) 45
View/Hide Ans
Correct Answer is B
50. Let G be connected undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of G is 500.
When the weight of each edge of G is increased by five, the weight of a minimum spanning tree becomes ________.
(A) 1000
(B) 995
(C) 2000
(D) 1995
View/Hide Ans
Correct Answer is B
51. Let R be a relation on the set of ordered pairs of positive integers such that ((p, q), (r, s)) ∈ R if and only if p-s = q-r.
Which one of the following is true about R?
(A) Both reflexive and symmetric
(B) Reflexive but not symmetric
(C) Not reflexive but symmetric
(D) Neither reflexive nor symmetric
View/Hide Ans
Correct Answer is D
52. Let f(n) = n and g(n) = n(1+sin n)), where n is a positive integer. Which of the following statements is/are correct?
I. f(n) = O(g(n))
II. f(n) = Ω(g(n))
(A) Only I
(B) Only II
(C) Both I and II
(D) Neither I nor II
View/Hide Ans
Correct Answer is D
53. The total number of prime implicants of the function f(w, x, y, z) = ∑m(0, 2, 4, 5, 6, 10) is ________.
(A) 2
(B) 3
(C) 4
(D) 5
View/Hide Ans
Correct Answer is A
54. Given the function F = P'+QR, where F is a function in three Boolean variables P, Q and R and P' = !P,
consider the following statements.
S1: F = ∑ m(4, 5, 6)
S2: F = ∑ m(0, 1, 2, 3, 7)
S3: F = π M(4, 5, 6)
S4: F = π M(0, 1, 2, 3, 7)
Which of the following is true?
(A) S1-False, S2-True, S3-True, S4-False
(B) S1-True, S2-False, S3-False, S4-True
(C) S1-False, S2-False, S3-True, S4-True
(D) S1-True, S2-True, S3-False, S4-False
View/Hide Ans
Correct Answer is A
55.
View/Hide Ans
Correct Answer is A
56. Consider B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long.
The maximum number of keys that can be accommodated in each non-leaf node of the tree is
(A) 49
(B) 50
(C) 51
(D) 52
View/Hide Ans
Correct Answer is B
57. Consider the following code sequence having five instructions I1 to I5. Each of these instructions has the following format.
OP Ri, Rj, Rk
where operation OP is performed on contents of registers Rj and Rk and the result is stored in register Ri.
I1 : ADD R1, R2, R3
I2 : MUL R7, R1, R3
I3 : SUB R4, R1, R5
I4 : ADD R3, R2, R4
I5 : MUL R7, R8, R9
Consider the following three statements:
S1: There is an anti-dependence between instructions I2 and I5.
S2: There is an anti-dependence between instructions I2 and I4.
S3: Within an instruction pipeline an anti-dependence always
creates one or more stalls.
Which one of above statements is/are correct?
(A) Only S1 is true
(B) Only S2 is true
(C) Only S1 and S2 are true
(D) Only S2 and S3 are true
View/Hide Ans
Correct Answer is B
58. Consider the following C program:
# include <stdio.h>
int main( )
{
int i, j, k = 0;
j = 2 * 3 / 4 + 2.0 / 5 + 8 / 5;
k -= --j;
for (i = 0; i < 5; i++)
{
switch(i + k)
{
case 1:
case 2: printf("\n%d", i + k);
case 3: printf("\n%d", i + k);
default: printf("\n%d", i + k);
}
}
return 0;
}
The number of times printf statement is executed is __________.
(A) 8
(B) 9
(C) 10
(D) 11
View/Hide Ans
Correct Answer is C
59. Suppose c = <c[0], ... , c[k - 1]> is an array of length k, where all the entries are from the set {0, 1}. For any positive integers a and n, consider the following pseudocode.
DOSOMETHING (c, a, n)
z ← 1
for i ← 0 to k - 1
do z ← z2 mod n
if c[i] = 1
then z ← (z × a) mod n
return z
If k=4, c =≤1,0,1,1>, a=2 and n=8, then the output of DOSOMETHING(c,a,n) is ____________.
(A) 0
(B) 1
(C) 2
(D) 3
View/Hide Ans
Correct Answer is A
60. The velocity v (in kilometer/minute) of a motorbike which starts from rest, is given at fixed intervals of time t(in minutes) as follows:
61. Consider the following reservation table for a pipeline having three stages S1, S2 and S3.
62. Consider the following policies for preventing deadlock in a system with mutually exclusive resources.
I. Processes should acquire all their resources at the
beginning of execution. If any resource is not
available, all resources acquired so far are released.
II. The resources are numbered uniquely, and processes are
allowed to request for resources only in increasing
resource numbers.
III. The resources are numbered uniquely, and processes are
allowed to request for resources only in decreasing
resource numbers.
IV. The resources are numbered uniquely. A process is allowed
to request only for a resource with resource number larger
than its currently held resources.
Which of the above policies can be used for preventing deadlock?
(A) Any one of I and III but not II or IV
(B) Any one of I, III and IV but not II
(C) Any one of II and III but not I or IV
(D) Any one of I, II, III and IV
View/Hide Ans
Correct Answer is D
63. Language L1 is polynomial time reducible to language L2. Language L3 is polynomial time reducible to L2, which in turn is polynomial time reducible to language L4.
Which of the following is/are True?
I. If L4 ∈ P, L2 ∈ P
II. If L1 ∈ P or L3 ∈ P, then L2 ∈ P
III. L1 ∈ P, if and only if L3 ∈ P
IV. If L4 ∈ P, then L1 ∈ P and L3 ∈ P
(A) II only
(B) III only
(C) I and IV only
(D) I only
View/Hide Ans
Correct Answer is C
64. Consider the following C program. The output of the program is __________.
# include <stdio.h>
int f1(void);
int f2(void);
int f3(void);
int x = 10;
int main()
{
int x = 1;
x += f1() + f2() + f3() + f2();
pirntf("%d", x);
return 0;
}
int f1()
{
int x = 25;
x++;
return x;
}
int f2( )
{
static int x = 50;
x++;
return x;
}
int f3( )
{
x *= 10;
return x;
}
(A) 230
(B) 131
(C) 231
(D) 330
View/Hide Ans
Correct Answer is A
65. Consider three software items: Program-X, Control Flow Diagram of Program-Y and Control Flow Diagram of Program-Z as shown below
© 2022. All Rights Reserved | Copyright | Terms of Use & Privacy Policy