- 1Aptitude · 1 mark · MCQ · EasyThe ratio of boys to girls in a class is 7 to 3.
- 2Aptitude · 1 mark · MCQ · EasyA polygon is convex if, for every pair of points, P and Q belonging to the polygon, the line segment PQ lies completely inside or on the polygon.
- 3Aptitude · 1 mark · MCQ · ModerateConsider the following sentences:
- 4Aptitude · 1 mark · MCQ · Moderate

- 5Aptitude · 1 mark · MCQ · Easy____ is to surgery as writer is to ____
- 6Aptitude · 2 marks · MCQ · ModerateWe have 2 rectangular sheets of paper, M and N, of dimensions 6cm×1cm each. Sheet M is rolled to form an open cylinder by bringing the short edges of the sheet together. Sheet N is cut into equal square patches and assembled to form the largest possible closed cube. Assuming the ends of the cylinder are closed, the ratio of the volume of the cylinder to that of the cube is ____
- 7Aptitude · 2 marks · MCQ · ModerateDetails of prices of two items P and Q are presented in the above table. The ratio of cost of item P to cost of item Q is 3:4. Discount is calculated as the difference between the marked price and the selling price. The profit percentage is calculated as the ratio of the difference between selling price and cost, to the cost
(Profit %=CostSelling price−Cost×100).
- 8Aptitude · 2 marks · MCQ · ModerateThere are five bags each containing identical sets of ten distinct chocolates. One chocolate is picked from each bag.
- 9Aptitude · 2 marks · MCQ · ModerateGiven below are two statements 1 and 2, and two conclusions I and II.
- 10Aptitude · 2 marks · MCQ · EasySome people suggest anti-obesity measures (AOM) such as displaying calorie information in restaurant menus. Such measures sidestep addressing the core problems that cause obesity: poverty and income inequality.
- 111 mark · MCQ · EasySuppose that L1 is a regular language and L2 is a context-free language. Which one of the following languages is NOT necessarily context-free?
- 121 mark · MCQ · ModerateLet P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of n elements. Which one of the following choices is correct?
- 131 mark · MCQ · ModerateConsider the following three functions.
- 141 mark · MCQ · EasyConsider the following statements.
- 151 mark · MCQ · ModerateConsider the following statements.
- 161 mark · MCQ · EasyLet the representation of a number in base 3 be 210. What is the hexadecimal representation of the number?
- 171 mark · MCQ · ModerateLet p and q be two propositions. Consider the following two formulae in propositional logic.
- 181 mark · MCQ · EasyConsider the following two statements.
- 191 mark · MCQ · ModerateConsider the following array.
- 201 mark · MCQ · EasyA binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than the maximum element in T?
- 211 mark · MSQ · ModerateIn the context of operating systems, which of the following statements is/are correct with respect to paging?
- 221 mark · MSQ · EasyLet ⟨M⟩ denote an encoding of an automaton M. Suppose that Σ={0,1}. Which of the following languages is/are NOT recursive?
- 231 mark · MSQ · ModerateSuppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery.
- 241 mark · MSQ · ModerateWhich of the following standard C library functions will always invoke a system call when executed from a single-threaded process in a UNIX/Linux operating system?
- 251 mark · MSQ · ModerateConsider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory foo.
- 261 mark · NAT · EasyIn an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is ____.
- 271 mark · NAT · ModerateConsider the following undirected graph with edge weights as shown:
- 281 mark · NAT · ModerateThe lifetime of a component of a certain type is a random variable whose probability density function is exponentially distributed with parameter 2. For a randomly picked component of this type, the probability that its lifetime exceeds the expected lifetime (rounded to 2 decimal places) is ____.
- 291 mark · NAT · ModerateThere are 6 jobs with distinct difficulty levels, and 3 computers with distinct processing speeds. Each job is assigned to a computer such that:
- 301 mark · NAT · EasyConsider the following expression.
- 311 mark · NAT · EasyConsider the following sequence of operations on an empty stack.
- 321 mark · NAT · ModerateConsider a computer system with a byte-addressable primary memory of size 232 bytes. Assume the computer system has a direct-mapped cache of size 32KB (1KB=210bytes), and each cache block is of size 64 bytes.
- 331 mark · NAT · ModerateA relation r(A,B) in a relational database has 1200 tuples. The attribute A has integer values ranging from 6 to 20, and the attribute B has integer values ranging from 1 to 20. Assume that the attributes A and B are independently distributed.
- 341 mark · NAT · ModerateConsider the following representation of a number in IEEE 754 single-precision floating point format with a bias of 127.
- 351 mark · NAT · EasyThree processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is ____ milliseconds.
- 362 marks · MCQ · ModerateConsider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation (SDT) actions, given as pseudo-code:
- 372 marks · MCQ · ModerateThe following relation records the age of 500 employees of a company, where empNo (indicating the employee number) is the key:
- 382 marks · MCQ · ModerateConsider a 3-bit counter, designed using T flip-flops, as shown below:
- 392 marks · MCQ · ModerateAssume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is d8d7d6d5c8d4d3d2c4d1c2c1, where the data bits and the check bits are given in the following tables:
- 402 marks · MCQ · ModerateConsider the following recurrence relation.
- 412 marks · MCQ · ModerateConsider the following context-free grammar where the set of terminals is {a,b,c,d,f}.
- 422 marks · MCQ · ModerateLet ri(z) and wi(z) denote read and write operations respectively on a data item z by a transaction Ti. Consider the following two schedules.
- 432 marks · MCQ · ModerateConsider the relation R(P,Q,S,T,X,Y,Z,W) with the following functional dependencies.
- 442 marks · MCQ · ModerateLet G be a group of order 6, and H be a subgroup of G such that 1<∣H∣<6.
- 452 marks · MCQ · HardConsider the two statements.
- 462 marks · MCQ · HardLet G=(V,E) be an undirected unweighted connected graph. The diameter of G is defined as:
diam(G)=maxu,v∈V{the length of shortest path between u and v}
Let M be the adjacency matrix of G.
Define graph G2 on the same set of vertices with adjacency matrix N, where
Nij={10if Mij>0 or Pij>0, where P=M2otherwise
Which one of the following statements is true?
- 472 marks · MCQ · ModerateConsider the following ANSI C program.
- 482 marks · MCQ · EasyConsider the following language.
L={w∈{0,1}∗∣w ends with the substring 011}
Which one of the following deterministic finite automata accepts L?
- 492 marks · MCQ · HardFor a Turing machine M, ⟨M⟩ denotes an encoding of M. Consider the following two languages.
- 502 marks · MSQ · HardDefine Rn to be the maximum amount earned by cutting a rod of length n meters into one or more pieces of integer length and selling them. For i>0, let p[i] denote the selling price of a rod whose length is i meters. Consider the array of prices:
- 512 marks · MSQ · ModerateAn articulation point in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components.
- 522 marks · MSQ · ModerateConsider the following Boolean expression.
- 532 marks · MSQ · HardA relation R is said to be circular if aRb and bRc together imply cRa.
- 542 marks · MSQ · ModerateA TCP server application is programmed to listen on port number P on host S. A TCP client is connected to the TCP server over the network.
- 552 marks · MSQ · ModerateConsider two hosts P and Q connected through a router R. The maximum transfer unit (MTU) value of the link between P and R is 1500 bytes, and between R and Q is 820 bytes.
- 562 marks · MSQ · HardConsider the following pseudocode, where S is a semaphore initialized to 5 in line#2 and counter is a shared variable initialized to 0 in line#1. Assume that the increment operation in line#7 is not atomic.
- 572 marks · MSQ · HardConsider a dynamic hashing approach for 4-bit integer keys:
- 582 marks · NAT · EasyConsider the following ANSI C function:
- 592 marks · NAT · ModerateConsider the sliding window flow-control protocol operating between a sender and a receiver over a full-duplex error-free link. Assume the following:
- 602 marks · NAT · ModerateConsider the following C code segment:
- 612 marks · NAT · ModerateIn a pushdown automaton P=(Q,Σ,Γ,δ,q0,F), a transition of the form.
- 622 marks · NAT · EasyConsider the following matrix.
- 632 marks · NAT · ModerateA five-stage pipeline has stage delays of 150, 120, 150, 160 and 140 nanoseconds. The registers that are used between the pipeline stages have a delay of 5 nanoseconds each.
- 642 marks · NAT · ModerateA sender (S) transmits a signal, which can be one of the two kinds: H and L with probabilities 0.1 and 0.9 respectively, to a receiver (R).
- 652 marks · NAT · HardConsider the following instruction sequence where registers R1, R2 and R3 are general purpose and MEMORY[X] denotes the content at the memory location X.