- 1Aptitude · 1 mark · MCQThe man who is now Municipal Commissioner worked as \\\\.
- 2Aptitude · 1 mark · MCQNobody knows how the Indian cricket team is going to cope with the difficult and seamer-friendly wickets in Australia.
- 3Aptitude · 1 mark · MCQFind the odd one in the following group of words.
- 4Aptitude · 1 mark · MCQPick the odd one from the following options.
- 5Aptitude · 1 mark · MCQIn a quadratic function, the value of the product of the roots (α,β) is 4. Find the value of
- 6Aptitude · 2 marks · MCQAmong 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 ____.
- 7Aptitude · 2 marks · MCQComputers 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.
- 8Aptitude · 2 marks · MCQAll hill-stations have a lake. Ooty has two lakes.
- 9Aptitude · 2 marks · MCQIn a 2×4 rectangle grid shown below, each cell is a rectangle. How many rectangles can be observed in the grid?
- 10Aptitude · 2 marks · MCQChoose the correct expression for f(x) given in the graph.
- 111 mark · NATConsider the following expressions:
- 121 mark · NATLet 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 ____.
- 131 mark · NATThe minimum number of colours that is sufficient to vertex-colour any planar graph is \\\\.
- 141 mark · MCQConsider the systems, each consisting of m linear equations in n variables.
- 151 mark · NATSuppose 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 Type 1 is 0.7, and given that it is of Type 2 is 0.4. The probability that an LED bulb chosen uniformly at random lasts more than 100 hours is \\\\.
- 161 mark · NATSuppose that the eigenvalues of matrix A are 1,2,4. The determinant of (A−1)T is \\\\.
- 171 mark · NATConsider 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 ____.
- 181 mark · MCQLet, 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?
- 191 mark · NATLet X be the number of distinct 16-bit integers in 2’s complement representation. Let Y be the number of distinct 16-bit integers in sign magnitude representation.
Then X−Y is ____.
- 201 mark · NATA 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 ____.
- 211 mark · NATBreadth 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 ____.
- 221 mark · NATThe value printed by the following program is ____.
- 231 mark · MCQAssume 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?
- 241 mark · MCQThe Floyd-Warshall algorithm for all-pair shortest paths computation is based on
- 251 mark · MCQN 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.
- 261 mark · NATThe number of states in the minimum sized DFA that accepts the language defined by the regular expression
- 271 mark · MCQLanguage L1 is defined by the grammar: S1→aS1b∣ε
Language L2 is defined by the grammar: S2→abS2∣ε
- 281 mark · MCQConsider the following types of languages: L1: Regular, L2: Context-free, L3: Recursive, L4: Recursively enumerable. Which of the following is/are TRUE?
- 291 mark · MCQMatch the following:
- 301 mark · MCQIn 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?
- 311 mark · MCQB+ Trees are considered BALANCED because
- 321 mark · MCQSuppose 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?
- 331 mark · MCQAnarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires
- 341 mark · MCQIn an Ethernet local area network, which one of the following statements is TRUE?
- 351 mark · MCQIdentify the correct sequence in which the following packets are transmitted on the network by a host when a browser requests a webpage from a remote server, assuming that the host has just been restarted.
- 362 marks · MCQA 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:
- 372 marks · MCQWhich one of the following well-formed formulae in predicate calculus is NOT valid?
- 382 marks · MCQConsider 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:
- 392 marks · NATThe value of the expression 1399(mod 17), in the range 0 to 16, is ____.
- 402 marks · NATSuppose 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.
- 412 marks · NATConsider 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 of memory (in bytes) consumed by the program text is \\\\.
- 422 marks · NATThe 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.
- 432 marks · NATConsider a 3 GHz (gigahertz) processor with a three-stage pipeline and stage latencies tau1, tau2, and tau3 such that tau1=3tau2/4=2tau3. 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.
- 442 marks · NATA 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 \\\\.
- 452 marks · MCQThe following function computes XY for positive integers X and Y.
- 462 marks · MCQConsider the following New-order strategy for traversing a binary tree:
- 472 marks · NATConsider the following program:
- 482 marks · NATLet 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 ____.
- 492 marks · NATThe 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 up to two decimal positions) of α is \____.
- 502 marks · NATThe 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 \____.
- 512 marks · MCQIn an adjacency list representation of an undirected simple graph G=(V,E), each edge (u,v) has two adjacency list entries: [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?
- 522 marks · MCQConsider the following two statements:
- 532 marks · MCQConsider the following languages:
- 542 marks · MCQConsider the following languages.
- 552 marks · MCQWhich one of the following grammars is free from left recursion?
- 562 marks · MCQA student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example,
- 572 marks · NATConsider 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.
- 582 marks · MCQConsider the following two-process synchronization solution.
- 592 marks · NATConsider 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 at least one P(S) operation will remain blocked is \\\\.
- 602 marks · NATA 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 1ms and to read a block from the disk is 10ms. Assume that the cost of checking whether a block exists in the cache is negligible. Available cache sizes are in multiples of 10MB.
- 612 marks · MCQConsider the following database schedule with two transactions, T1 and T2.
- 622 marks · NATConsider the following database table named water_schemes:
- 632 marks · NATA 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.
- 642 marks · MCQFor the IEEE 802.11 MAC protocol for wireless communication, which of the following statements is/are TRUE?
- 652 marks · NATConsider a 128×103bits/second satellite communication link with one way propagation delay of 150milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of 1kilobyte. Neglect the transmission time of acknowledgement. The minimum number of bits required for the sequence number field to achieve 100% utilization is _____.