- 1Aptitude · 1 mark · MCQWhile trying to collect an envelope from under the table, Mr. X fell down and was losing consciousness.
- 2Aptitude · 1 mark · MCQIf she ____ how to calibrate the instrument, she ____ done the experiment.
- 3Aptitude · 1 mark · MCQChoose the word that is opposite in meaning to the word “coherent”
- 4Aptitude · 1 mark · MCQWhich number does not belong in the series below?
- 5Aptitude · 1 mark · MCQThe table below has question-wise data on the performance of students in an examination. The marks for each question are also listed. There is no negative or partial marking in the examination.
- 6Aptitude · 2 marks · MCQA dance programme is scheduled for 10.00a.m. Some students are participating in the programme and they need to come an hour earlier than the start of the event. These students should be accompanied by a parent. Other students and parents should come in time for the programme. The instruction you think that is appropriate for this is
- 7Aptitude · 2 marks · MCQBy the beginning of the 20th century, several hypotheses were being proposed, suggesting a paradigm shift in our understanding of the universe. However, the clinching evidence was provided by experimental measurements of the position of a star which was directly behind our sun.
- 8Aptitude · 2 marks · MCQThe Gross Domestic Product (GDP) in Rupees grew at 7% during 2012-2013. For international comparison, the GDP is compared in US Dollars (USD) after conversion based on the market exchange rate. During the period 2012-2013 the exchange rate for the USD increased from Rs. 50/USD to Rs. 60/USD. India's GDP in USD during the period 2012-2013
- 9Aptitude · 2 marks · MCQThe ratio of male to female students in a college for five years is plotted in the following line graph. If the number of female students in 2011 and 2012 is equal, what is the ratio of male students in 2012 to male students in 2011?
- 10Aptitude · 2 marks · MCQConsider the equation: (7526)8−(Y)8=(4364)8, where (X)N stands for X to the base N. Find $Y.
- 111 mark · MCQConsider the following statements:
- 121 mark · MCQLet X and Y be finite sets and f:X→Y be a function. Which one of the following statements is TRUE?
- 131 mark · NATLet G be a group with 15 elements. Let L be a subgroup of G. It is known that L=G and that the size of L is at least 4. The size of L is ____.
- 141 mark · MCQWhich one of the following statements is TRUE about every n×n matrix with only real eigenvalues?
- 151 mark · NATIf V1 and V2 are 4-dimensional subspaces of a 6-dimensional vector space V, then the smallest possible dimension of V1∩V2 is ____.
- 161 mark · NATIf ∫02π∣xsinx∣dx=kπ, then the value of k is equal to ____.
- 171 mark · MCQConsider the following minterm expression for F:
- 181 mark · MCQConsider the following combinational function block involving four Boolean variables x, y, a, b where x, a, b are inputs and y is the output.
- 191 mark · MCQConsider the following processors (ns stands for nanoseconds). Assume that the pipeline registers have zero latency.
- 201 mark · MCQLet A be a square matrix of size n×n. Consider the following pseudocode. What is the expected output?
- 211 mark · NATThe minimum number of arithmetic operations required to evaluate the polynomial P(X)=X5+4X3+6X+5 for a given value of X, using only one temporary variable is \\\\.
- 221 mark · MCQConsider the following rooted tree with the vertex labeled P as the root:

- 231 mark · NATSuppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is \\\\.

- 241 mark · MCQYou have an array of n elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is
- 251 mark · NATThe length of the shortest string NOT in the language (over Σ={a,b}) of the following regular expression is \(____\).
- 261 mark · MCQLet Σ be a finite non-empty alphabet and let 2Σ∗ be the power set of Σ∗. Which one of the following is TRUE?
- 271 mark · MCQOne of the purposes of using intermediate code in compilers is to
- 281 mark · MCQWhich of the following statements are CORRECT?
- 291 mark · MCQIn the context of modular software design, which one of the following combinations is desirable?
- 301 mark · NATA system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while processing the page reference string given below?
- 311 mark · MCQWhat is the optimized version of the relation algebra expression πA1(πA2(σF1(σF2(r)))), where A1,A2 are sets of attributes in r with A1⊆A2 and F1,F2 are Boolean expressions based on the attributes in r?
- 321 mark · MCQA prime attribute of a relation scheme R is an attribute that appears
- 331 mark · MCQIn the following pairs of OSI protocol layer/sub-layer and its functionality, the INCORRECT pair is
- 341 mark · MCQA bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output bit-string after stuffing is 01111100101, then the input bit-string is
- 351 mark · MCQHost A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram D?
- 362 marks · NATAn IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address 131.23.151.76. The router’s routing table has the following entries:
- 372 marks · NATEvery host in an IPv4 network has a 1-second resolution real-time clock with battery backup. Each host needs to generate up to 1000 unique identifiers per second. Assume that each host has a globally unique IPv4 address. Design a 50-bit globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?
- 382 marks · MCQAn IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header of length 20 bytes. The values of the relevant fields in the header of the third IP fragment generated by the router for this packet are
- 392 marks · MCQConsider the transactions T1, T2, and T3 and the schedules S1 and S2 given below.
- 402 marks · MCQConsider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation.
- 412 marks · NATA system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is \\\\\.
- 422 marks · NATAn operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds):
- 432 marks · NATConsider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10milliseconds to search the TLB and 80milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in milliseconds) is \\\\.
- 442 marks · MCQConsider the basic block given below.
- 452 marks · MCQWhich one of the following problems is undecidable?
- 462 marks · MCQConsider the following languages over the alphabet Σ={0,1,c}:
- 472 marks · NATSuppose you want to move from 0 to 100 on the number line. In each step, you either move right by a unit distance or you take a shortcut. A shortcut is simply a pre-specified pair of integers i,j with i<j. Given a shortcut i,j if you are at position i on the number line, you may directly move to j. Suppose T(k) denotes the smallest number of steps needed to move from k to 100. Suppose further that there is at most 1 shortcut involving any number, and in particular from 9 there is a shortcut to 15. Let y and z be such that T(9)=1+min(T(y),T(z)). Then the value of the product yz is ____.
- 482 marks · MCQConsider the decision problem 2CNFSAT defined as follows:
- 492 marks · NATSuppose we have a balanced binary search tree T holding n numbers. We are given two numbers L and H and wish to sum up all the numbers in T that lie between L and H. Suppose there are m such numbers in T. If the tightest upper bound on the time to compute the sum is O(nalogbn+mclogdn), the value of a+10b+100c+1000d is _____.
- 502 marks · MCQConsider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots are unfilled after the first 3 insertions?
- 512 marks · MCQConsider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode.
- 522 marks · MCQConsider the C function given below. Assume that the array listA contains n(>0) elements, sorted in ascending order.
- 532 marks · NATAn instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback (WB) with stage latencies 1ns, 2.2ns, 2ns, 1ns, and 0.75ns, respectively (ns stands for nanoseconds). To gain in terms of frequency, the designers have decided to split the ID/RF stage into three stages (ID, RF1, RF2) each of latency 2.2/3ns. Also, the EX stage is split into two stages (EX1, EX2) each of latency 1ns. The new design has a total of eight pipeline stages. A program has 20% branch instructions which execute in the EX stage and produce the next instruction pointer at the end of the EX stage in the old design and at the end of the EX2 stage in the new design. The IF stage stalls after fetching a branch instruction until the next instruction pointer is computed. All instructions other than the branch instruction have an average CPI of one in both the designs. The execution times of this program on the old and the new design are P and Q nanoseconds, respectively. The value of P/Q is \____.
- 542 marks · NATThe memory access time is 1ns for a read operation with a hit in cache, 5ns for a read operation with a miss in cache, 2ns for a write operation with a hit in cache and 10ns for a write operation with a miss in cache. Execution of a sequence of instructions involves 100 instruction fetch operations, 60 memory operand read operations and 40 memory operand write operations. The cache hit-ratio is 0.9. The average memory access time (in nanoseconds) in executing the sequence of instructions is \____.
- 552 marks · MCQThe above synchronous sequential circuit built using JK flip-flops is initialized with Q2Q1Q0=000. The state sequence for this circuit for the next 3 clock cycles is
- 562 marks · MCQWith respect to the numerical evaluation of the definite integral, K=∫abx2dx, where a and b are given, which of the following statements is/are TRUE?
- 572 marks · MCQThe value of the integral given below is
- 582 marks · NATLet S be a sample space and two mutually exclusive events A and B be such that A∪B=S. If P(⋅) denotes the probability of the event, the maximum value of P(A)P(B) is ____.
- 592 marks · MCQConsider the set of all functions f:{0,1,…,2014}→{0,1,…,2014} such that f(f(j))=j, for all 0≤j≤2014. Consider the following statements:
- 602 marks · NATThere are two elements x,y in a group (G,∗) such that every element in the group can be written as a product of some number of x's and y's in some order. It is known that
- 612 marks · MCQIf G is a forest with n vertices and k connected components, how many edges does G have?
- 652 marks · MCQLet ⊕ denote the Exclusive OR (XOR) operation. Let ‘1’ and ‘0’ denote the binary constants. Consider the following Boolean expression for F over two variables P and Q: