Winners are not afraid of losing. But losers are. Failure is part of the process of success. People who avoid failure also avoid success.
1. Out of the following four sentences, select the most suitable sentence with respect to grammar and usage.
(A) I will not leave the place until the minister does not meet me.
(B) I will not leave the place until the minister doesn’t meet me.
(C) I will not leave the place until the minister meet me.
(D) I will not leave the place until the minister meets me.
View/Hide Ans
Correct Answer is D
2. A rewording of something written or spoken is a ______________.
(A) paraphrase
(B) paradox
(C) paradigm
(D) paraffin
View/Hide Ans
Correct Answer is A
3. Archimedes said, “Give me a lever long enough and a fulcrum on which to place it, and I will move the world.”
The sentence above is an example of a ___________ statement.
(A) figurative
(B) collateral
(C) literal
(D) figurine
View/Hide Ans
Correct Answer is A
4. If ‘relftaga’ means carefree, ‘otaga’ means careful and ‘fertaga’ means careless, which of the following could mean ‘aftercare’?
(A) zentaga
(B) tagafer
(C) tagazen
(D) relffer
View/Hide Ans
Correct Answer is C
5. A cube is built using 64 cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube.
The resulting surface area of the body (in square units) after the removal is __________.
(A) 56
(B) 64
(C) 72
(D) 96
View/Hide Ans
Correct Answer is D
6. A shaving set company sells 4 different types of razors, Elegance, Smooth, Soft and Executive. Elegance sells at Rs. 48, Smooth at Rs. 63, Soft at Rs. 78 and Executive at Rs. 173 per piece. The table below shows the numbers of each razor sold in each quarter of a year.
7. Indian currency notes show the denomination indicated in at least seventeen languages. If this is not an indication of the nation’s diversity, nothing else is.
Which of the following can be logically inferred from the above sentences?
(A) India is a country of exactly seventeen languages.
(B) Linguistic pluralism is the only indicator of a nation’s diversity.
(C) Indian currency notes have sufficient space for all the Indian languages.
(D) Linguistic pluralism is strong evidence of India’s diversity.
View/Hide Ans
Correct Answer is D
8. Consider the following statements relating to the level of poker play of four players P, Q, R and S.
I. P always beats Q
II. R always beats S
III. S loses to P only sometimes
IV. R always loses to Q
Which of the following can be logically inferred from the above statements?
(i) P is likely to beat all the three other players
(ii) S is the absolute worst player in the set
(A) (i) only
(B) (ii) only
(C) (i) and (ii)
(D) neither (i) nor (ii)
View/Hide Ans
Correct Answer is D
9. If f(x) = 2x7+3x-5, which of the following is a factor of f(x)?
(A) (x3+8)
(B) (x-1)
(C) (2x-5)
(D) (x+1)
View/Hide Ans
Correct Answer is B
10. In a process, the number of cycles to failure decreases exponentially with an increase in load. At a load of 80 units, it takes 100 cycles for failure. When the load is halved, it takes 10000 cycles for failure.
The load for which the failure will happen in 5000 cycles is ________.
(A) 40.00
(B) 46.02
(C) 60.01
(D) 92.02
View/Hide Ans
Correct Answer is B
11. Let p, q, r, s represent the following propositions.
p: x ∈{8,9,10,11,12}
q: x is a composite number
r: x is a perfect square
s: x is a prime number
The integer x≥2 which satisfies: ~((p → q) ^ (~r ∨ ~s)) is ________
(A) 10
(B) 11
(C) 12
(D) 9
View/Hide Ans
Correct Answer is B
12. Let an be the number of n-bit strings that do NOT contain two consecutive1s.
Which one of the following is the recurrence relation for an?
(A) an = an-1+2an-2
(B) an = an-1+an-2
(C) an = 2an-1+an-2
(D) an = 2an-1+2an-2
View/Hide Ans
Correct Answer is B
13.
(A) 0
(B) 1
(C) -1
(D) 2
View/Hide Ans
Correct Answer is B
14. A probability density function on the interval [a,1] is given by 1/x2 and outside this interval
the value of the function is zero.
The value of a is ________
(A) 0
(B) 0.5
(C) 0.75
(D) 1
View/Hide Ans
Correct Answer is B
15. Two eigen values of a 3*3 real matrix P are (2+√-1) and 3.
The determinant of P is ________
(A) 12
(B) 15
(C) 18
(D) 21
View/Hide Ans
Correct Answer is B
16. Consider the Boolean operator # with the following properties:
x#0=x, x#1=x', x#x=0 and x#x'=1.
Then x#y is equivalent to
(A) xy'+ x'y
(B) xy'+ x'y'
(C) x'y+xy
(D) xy+ x'y'
View/Hide Ans
Correct Answer is A
17. The 16-bit 2’s complement representation of an integer is 1111111111110101; its decimal
representation is ________
(A) -9
(B) -11
(C) -13
(D) -15
View/Hide Ans
Correct Answer is B
18. We want to design asynchronous counter that counts the sequence 0-1-0-2-0-3 and then
repeats.
The minimum number of J-K flip-flops required to implement this counter is
.
(A) 1 to 2
(B) 3 to 4
(C) 5 to 6
(D) 7 to 8
View/Hide Ans
Correct Answer is B
19. A processor can support a maximum memory of 4 GB, where the memory is word-addressable
(a word consists of two bytes).
The size of the address bus of th eprocessor is atleast
bits
(A) 15
(B) 31
(C) 63
(D) 127
View/Hide Ans
Correct Answer is B
20. A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are
performed efficiently.
Which one of the following statements is CORRECT (n refers to the
number of items in the queue)?
(A) Both operations can b eperformed in O(1) time
(B) At most one operation can be performed in O(1) time but the worst case time for
the other operation will be Ω(n)
(C) The worst case time complexity for both operations will be Ω(n)
(D) Worst case time complexity for both operations will be Ω(logn)
View/Hide Ans
Correct Answer is A
21. Consider the following directed graph:
22. Consider the following C program.
void f(int,short);
void main()
{
int i=100;
short s=12;
short *p=&s;
__________________ ; //call to f()
}
Which one of the following expressions, when placed in the blank above, will NOT result in
a type checking error?
(A) f(s,*s)
(B) i =f(i,s)
(C) f(i,*s)
(D) f(i,*p)
View/Hide Ans
Correct Answer is D
23. The worst case running times of Insertion sort, Mergesort and Quicksort, respectively, are:
(A) Θ(nlogn), Θ(nlogn), and Θ(n2)
(B) Θ(n2), Θ(n2), and Θ(n log n)
(C) Θ(n2), Θ(nlogn), and Θ(n log n)
(D) Θ(n2), Θ(nlogn), and Θ(n2)
View/Hide Ans
Correct Answer is D
24. Let G be a weighted connected undirected graph with distinct positive edge weights. If every
edge weight is increased by the same value,then which of the following statements is/are
TRUE?
P: Minimum spanning tree of G does not change
Q: Shortest path between any pair of vertices does not change
(A) P only
(B) Q only
(C) Neither P nor Q
(D) Both P and Q
View/Hide Ans
Correct Answer is A
25. Consider the following C program
#include <stdio.h>
void mystery(int *ptra,int *ptrb){
int *temp;
temp =ptrb;
ptrb =ptra;
ptra =temp;
}
int main(){
int a=2016, b=0, c=4, d=42;
mystery(&a, &b);
if (a<c)
mystery(&c,&a);
mystery(&a,&d);
printf("%d\n", a);
}
The output of the program is ________
(A) 2015
(B) 2016
(C) 2017
(D) 2018
View/Hide Ans
Correct Answer is B
26. Which of the following languages is generated by the given grammar?
S → aS | bS | ε
View/Hide Ans
Correct Answer is D
27. Which of the following decision problems are undecidable?
(A) I and IV only
(B) II and III only
(C) III and IV only
(D) II and IV only
View/Hide Ans
Correct Answer is C
28. Which one of the following regular expressions represents the language: the set of all binary
strings having two consecutive 0s and two consecutive 1s?
View/Hide Ans
Correct Answer is B
29. Consider the following code segment.
x =u-t;
y =x*v;
x =y+w;
y =t-z;
y =x*y;
The minimum number of total variables required to convert the above code segment to static
single assignment form is ________
(A) 9
(B) 10
(C) 11
(D) 12
View/Hide Ans
Correct Answer is B
30. Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths
submitted at the same time to a computer system.
Which one of the following process
scheduling algorithms would minimize the average waiting time in the ready queue?
(A) Shortest remaining time first
(B) Round-robin with time quantum less than the shortest CPU burst
(C) Uniform random
(D) Highest priority first with priority proportional to CPU burst length
View/Hide Ans
Correct Answer is A
31. Which of the following is NOT a superkey in a relational schema with attributes
V, W, X, Y, Z and primary key V Y?
(A) VXYZ
(B) VWXZ
(C) VWXY
(D) VWXYZ
View/Hide Ans
Correct Answer is B
32. Which one of the following is NOT a part of the ACID properties of database transactions?
(A) Atomicity
(B) Consistency
(C) Isolation
(D) Deadlock-freedom
View/Hide Ans
Correct Answer is D
33. A database of research articles in a journal uses the following schema.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)
The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following
functional dependencies exist in the schema.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → TITLE
(VOLUME, NUMBER) → YEAR
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → PRICE
The database is redesigned to use the following schemas.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)
(VOLUME, NUMBER, YEAR)
Which is the weakest normal form that the new database satisfies, but the old one does not?
(A) 1NF
(B) 2NF
(C) 3NF
(D) BCNF
View/Hide Ans
Correct Answer is B
34. Which one of the following protocols is NOT used to resolve one form of address to another
one?
(A) DNS
(B) ARP
(C) DHCP
(D) RARP
View/Hide Ans
Correct Answer is C
35. Which of the following is/are example(s) of stateful application layer protocols?
(i) HTTP
(ii) FTP
(iii) TCP
(iv) POP3
(A) (i) and (ii) only
(B) (ii) and (iii) only
(C) (ii) and (iv) only
(D) (iv) only
View/Hide Ans
Correct Answer is C
36. The coefficient of x12 in (x3+x4+x5+x6+..... )3 is ________
(A) 9
(B) 10
(C) 11
(D) 12
View/Hide Ans
Correct Answer is B
37. Consider the recurrence relation a1 = 8, an = 6n2+2n+an-1.
Let a99 = K*104.
The value
of K is ________
(A) 97.9 to 98.1
(B) 197.9 to 198.1
(C) 297.9 to 298.1
(D) 397.9 to 398.1
View/Hide Ans
Correct Answer is B
38. A function f : N+ → N+, defined on the set of positive integers N+, satisfies the following
properties:
f(n) = f(n/2) if n is even
f(n) = f(n+5) if n is odd
Let R = {i | ∃ j: f(j)=i} be the set of distinct values that f takes. The maximum possible size of R is ________
(A) 1
(B) 2
(C) 3
(D) 4
View/Hide Ans
Correct Answer is B
39. Consider the following experiment.
Step 1. Flip a fair coin twice.
Step 2. If the outcomes are (TAILS, HEADS) then output Y and stop.
Step 3. If the outcomes are either(HEADS, HEADS) or (HEADS, TAILS), then output N and
stop.
Step 4. If the outcomes are(TAILS, TAILS), then goto Step1.
The probability that the output of the experiment is Y is (upto two decimal places) ________
(A) 0.23 to 0.24
(B) 0.33 to 0.34
(C) 0.43 to 0.44
(D) 0.53 to 0.64
View/Hide Ans
Correct Answer is B
40. Consider the two cascaded 2-to-1 multiplexers as shown in the figure.
41. The size of the data count register of a DMA controller is 16 bits.The processor needs to
transfer a file of 29,154 kilobytes from disk to main memory. The memory is byte addressable.
The minimum number of times the DMA controller needs to get the control of the system bus
from the processor to transfer the file from the disk to main memory is ________
(A) 446
(B) 456
(C) 456
(D) 466
View/Hide Ans
Correct Answer is B
42. The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first
stage (with delay 800 picoseconds) is replaced with a functionally equivalent design involving
two stages with respective delays 600 and 350 picoseconds.
The throughput increase of the
pipeline is ________ percent
(A) 23 to 24
(B) 33 to 34
(C) 43 to 44
(D) 53 to 54
View/Hide Ans
Correct Answer is B
43. Consider a carry lookahead adder for adding two n-bit integers, built using gates of fan-in at
most two.
The time to perform addition using this adder is
(A) Θ(1)
(B) Θ(log n)
(C) Θ(√n)
(D) Θ(n)
View/Hide Ans
Correct Answer is B
44. The following function computes the maximum valu econtained in an integer array p[] of size n (n>=1).
int max(int *p,int n){
int a=0,b=n-1;
while (__________________){
if (p[a]<=p[b]) {a=a+1;}
else {b=b-1;}
}
return p[a];
}
The missing loop condition is
(A) a!=n
(B) b!=0
(C) b>(a+1)
(D) b!=a
View/Hide Ans
Correct Answer is D
45. What will be the output of the following C program?
void count(int n){
static int d=1;
printf("%d ",n);
printf("%d ",d);
d++;
if(n>1) count(n-1);
printf("%d ",d);
}
void main(){
count(3);
}
(A) 3 1 2 2 1 3 4 4 4
(B) 3 1 2 1 1 1 2 2 2
(C) 3 1 2 2 1 3 4
(D) 3 1 2 1 1 1 2
View/Hide Ans
Correct Answer is A
46. What will be the output of the following pseudo-code when parameters are passed by reference
and dynamic scoping is assumed?
a=3;
void n(x) {x=x*a; print(x);}
void m(y) {a=1; a=y-a; n(a); print(a);}
void main() {m(a); }
(A) 6, 2
(B) 6, 6
(C) 4, 2
(D) 4, 4
View/Hide Ans
Correct Answer is D
47. An operator delete(i) for a binary heap data structure is to be designed to delete the item in
the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index
of the array. If the heap tree has depth d (number ofedges on the path from the root to the
farthest leaf),then what is the time complexity to re-fix the heap efficiently after the removal
of the element?
(A) O(1)
(B) O(d) butnot O(1)
(C) O(2d) butnot O(d)
(D) O(d2d) butnot O(2d)
View/Hide Ans
Correct Answer is B
48. Consider the weighted undirected graph with 4 vertices, where the weight of edge {i,j} is
given by the entry Wi,j in the matrix W.
49. Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5 and 6. The maximum possible weight that a minimum weight spanning tree of G can
have is ________
(A) 6
(B) 7
(C) 8
(D) 9
View/Hide Ans
Correct Answer is B
50. G = (V,E) is an undirected simple graph in which each edge has a distinct weight, and e is a
particular edge of G.
Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE?
I. If e is the lightest edge of some cycle in G, then every MST of G includes e
II. If e is the heaviest edgeof some cycle in G, then every MST of G excludes e
(A) I only
(B) II only
(C) both I and II
(D) neither I nor II
View/Hide Ans
Correct Answer is B
51. Let Q denote a queue containing sixteen numbers and S be an empty stack. Head(Q) returns
the element at the head of the queue Q without removing it from Q. Similarly Top(S) returns
the element at the top of S without removing it from S. Consider the algorithm given below.
The maximum possible number of iterations of the while loop in the algorithm is
________
(A) 128
(B) 256
(C) 512
(D) 64
View/Hide Ans
Correct Answer is B
52. Consider thefollowingcontext-freegrammars:
G1: S → aS|B; B → b|bB
G2: S → aA|bB; A → aAjB|ε; B → bB|ε
Which one of the following pairs of languages is generated by G1 and G2, respectively?
View/Hide Ans
Correct Answer is D
53. Consider the transition diagram of a PDA given below with input alphabet ∑={a,b} and
stack alphabet Γ={X,Z}.
Z is the initial stack symbol. Let L denote the language accepted
by the PDA
54. Let X be a recursive language and Y be a recursively enumerable but not recursive language.
Let W and Z be two languages such that Y' reduces to W, and Z reduces to X' (reduction means
the standard many-one reduction).
Which one of the following statements is TRUE?
(A) W can be recursively enumerable and Z is recursive.
(B) W can be recursive and Z is recursively enumerable.
(C) W is not recursively enumerable and Z is recursive.
(D) W is not recursively enumerable and Z is not recursive.
View/Hide Ans
Correct Answer is C
55. The attributes of three arithmetic operators in some programming language are given below.
56. Consider the following Syntax Directed Translation Scheme(SDTS), with non-terminals {S, A} and terminals {a, b}.
S → aA {print1}
S → a {print2}
A → Sb { print3}
Using the above SDTS, the output printed by a bottom-up parser,for the input aab is:
(A) 1 3 2
(B) 2 2 3
(C) 2 3 1
(D) syntax error
View/Hide Ans
Correct Answer is C
57. Consider a computer system with 40-bit virtual addressing and page size of sixteen
kilobytes. If the computer system has a one-level page table per process and each page table
entry requires 48 bits,then the size of the per-process page table is ________ megabytes.
(A) 374
(B) 384
(C) 394
(D) 364
View/Hide Ans
Correct Answer is B
58. Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number
63, moving towards larger cylinder numbers on its servicing pass.The cylinders are numbered
from 0 to 199.
The total head movement(in number of cylinders) incurred while servicing
these requests is ________
(A) 336
(B) 346
(C) 356
(D) 366
View/Hide Ans
Correct Answer is B
59. Consider a computer system with ten physical page frames. The system is provided with
an access sequence (a1,a2,. . . .a20,a1,a2 . . . .a20),
where each ai is a distinct virtual page
number. The difference in the number of page faults between the last-in-first-out page
replacement policy and the optimal page replacement policy is ________
(A) 4
(B) 1
(C) 2
(D) 3
View/Hide Ans
Correct Answer is B
60. Consider the following proposed solution for the critical section problem. Thereare n
processes: P0......Pn-1. In the code,function pmax returns an integer not smaller than any
of its arguments.For all i, t[i] is initialized to zero.
Code for Pi:
do {
c[i]=1; t[i]=pmax(t[0],...,t[n-1])+1; c[i]=0;
for everyj 6= i in{0,...,n-1} {
while (c[j]);
while (t[j]!=0&&t[j]<=t[i]);
}
Critical Section;
t[i]=0;
Remainder Section;
} while(true);
Which one of the following is TRUE about the above solution?
(A) At most one process can be in the critical section at anytime
(B) The bounded wait condition is satisfied
(C) The progress condition is satisfied
(D) It cannot cause a deadlock
View/Hide Ans
Correct Answer is A
61. Consider the following two phase locking protocol. Suppose a transaction T accesses (for
read or write operations), a certain set of objects {O1,....,Ok}. This is done in the following
manner:
Step 1. T acquires exclusive locks to O1, ..., Ok in increasing order of their addresses.
Step 2. The required operations are performed.
Step 3. All locks are released.
This protocol will
(A) guarantee serializability and deadlock-freedom
(B) guarantee neither serializability nor deadlock-freedom
(C) guarantee serializability but not deadlock-freedom
(D) guarantee deadlock-freedom but not serializability
View/Hide Ans
Correct Answer is A
62. Consider that B wants to send a message m that is digitally signed to A.Let the pair of private
and public keys for A and B be denoted by Kx- and Kx+ for x = A,B, respectively. Let Kx(m)
represent the operation of encrypting m with a key Kx and H(m) represent the message digest.
Which one of the following indicates the CORRECT way of sending the message m a long
with thed igital signature to A?
View/Hide Ans
Correct Answer is B
63. An IP datagram of size 1000 bytes arrives at a router.The router has to forward this packet on
a link whose MTU(maximum transmission unit) is 100 bytes. Assume that the size of the IP
header is 20 bytes.
The number of fragments that the IPdatagram will be divided into for transmission is
________.
(A) 12
(B) 13
(C) 14
(D) 15
View/Hide Ans
Correct Answer is B
64. For a host machine that uses the token bucket algorithm for congestion control,the token
bucket has a capacity of 1 megabyte and the maximum output rate is 20 megabytes per second.
Tokens arrive at a rate to sustain output at a rate of 10 megabytes per second. The token bucket
is currently full and the machine needs to send 12 megabytes of data.
The minimum time
required to transmit the data is ________ seconds
(A) 0.1
(B) 1.1
(C) 2.1
(D) 3.1
View/Hide Ans
Correct Answer is B
65. A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames
are of size 1000 bytes and the transmission rate at the sender is 80 Kbps(1 Kbps=1000
bits/second). Size of an acknowledgement is 100 bytes and the transmission rate at the receiver
is 8 Kbps. The one-way propagation delay is 100 milliseconds.
Assuming no frame is lost,the sender throughput is ________ bytes/second.
(A) 2000
(B) 2500
(C) 3000
(D) 3500
View/Hide Ans
Correct Answer is B
© 2022. All Rights Reserved | Copyright | Terms of Use & Privacy Policy