- 1Aptitude · 1 mark · MCQ · EasyExpedite, Hasten, Hurry, ____
- 2Aptitude · 1 mark · MCQ · ModerateA black square PQRS has been cut into two parts. One part of it is shown in
Panel I. Which one of the shapes in Panel II is the other part?
- 3Aptitude · 1 mark · MCQ · EasyA day can only be cloudy or sunny. The probability of a day being cloudy is 0.5, independent of the condition on other days. What is the probability that in any given four days, there will be three cloudy days and one sunny day?
- 4Aptitude · 1 mark · MCQ · EasyThe values of Stock A and Stock B on a particular day are Rs. 50 and Rs. 80, respectively. An investor invests Rs. 100 in Stock A and Rs. 80 in Stock B. He sells all the stocks the next day when the value of Stock A is Rs. 55 and Stock B is Rs. 70. The profit made by the investor is Rs. _____
- 5Aptitude · 1 mark · MCQ · Moderate‘When it is raining, peacocks dance.’
- 6Aptitude · 2 marks · MCQ · EasyWater : P :: Food : Q
- 7Aptitude · 2 marks · MCQ · ModerateTwo tiles are missing in Panel I. Which one of the options in Panel II is the appropriate choice for the missing tiles?
- 8Aptitude · 2 marks · MCQ · HardFigures (i) and (ii) represent intercity highway systems. The black dots represent cities and the line segments between them represent intercity highways.
A salesperson needs to make a trip. She needs to start from a city, visit each of the remaining cities exactly once, and finally return to the same city from which she started.
- 9Aptitude · 2 marks · MCQ · EasyThe figure in Panel I below is a grid of cells with four rows and four columns. The numbers on the top and on the left represent the number of cells that are to be shaded in that column and row, respectively. Which one of the options shown in Panel II below represents the grid shaded correctly?
- 10Aptitude · 2 marks · MCQ · ModerateAn unbiased six-faced dice whose faces are marked with numbers 1,2,3,4,5, and 6 is rolled twice in succession and the number on the top face is recorded each time. The probability that the sum of the two recorded numbers is a prime number is _____
- 111 mark · MCQ · ModerateFor two different persons x and y, the predicate M(x,y) denotes that x knows y. Consider the following statement.
- 121 mark · MCQ · EasyThe set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal.
- 131 mark · MCQ · EasyWhich one of the following statements is equivalent to the following assertion?
Turing machine M decides the language L⊆{0,1}∗
- 141 mark · MCQ · EasyThe probability density function f(x) of a random variable X which takes real values is
- 151 mark · MCQ · EasyIn the context of DBMS, consider the two sets T and S given below.
- 161 mark · MCQ · EasyWhich one of the following options is not a property of Boolean Algebra?
- 171 mark · MCQ · EasyIn C runtime environment, which one of the following is stored in heap?
- 181 mark · MCQ · ModerateConsider the following two statements about interrupt handling mechanisms in a CPU.
- 191 mark · MCQ · ModerateConsider the following three ANSI-C programs, P1, P2, and P3.
- 201 mark · MCQ · EasyConsider concurrent execution of two transactions T1 and T2 in a DBMS, both of which access a data object A. For these two transactions to not conflict on A, which one of the following statements must be true?
- 211 mark · MCQ · ModerateConsider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2Mbps, 500kbps, and 1Mbps, respectively. All processing delays and propagation delays are negligible. Assume that there is no other background traffic over the path and no other additional overhead to transfer the file.
- 221 mark · MCQ · EasyWhich one of the following protocols may need to broadcast some of its messages?
- 231 mark · MCQ · EasyWhich one of the following CPU scheduling algorithms cannot be preemptive?
- 241 mark · MCQ · ModerateConsider the following functions, where n is a positive integer.
- 251 mark · MSQ · ModerateWhich of the following can be recurrence relation(s) corresponding to an algorithm with time complexity Θ(n)?
- 261 mark · MSQ · ModerateLet R be a binary relation on the set {1,2,…,10}, where (x,y)∈R if the product of x and y is square of an integer. Which of the following properties is/are satisfied by R?
- 271 mark · MSQ · EasyFor a real number a, let I(a)=∫−11(3x2−ax+1)dx. Which of the following statements is/are true?
- 281 mark · MSQ · EasyIn a system, numbers are represented using 4-bit two's complement form. Consider four numbers N1=1011, N2=1101, N3=1010 and N4=1001 in the system. Which of the following operations will result in arithmetic overflow?
- 291 mark · MSQ · ModerateWhich of the following grammars is/are ambiguous?
- 301 mark · NAT · EasyThe keys 5,28,19,15,26,33,12,17,10 are inserted into a hash table using the hash function h(k)=kmod9. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is ____. (answer in integer)
- 311 mark · NAT · EasyConsider the system of linear equations given below.
- 321 mark · NAT · ModerateConsider an array A=[10,7,8,19,41,35,25,31]. Suppose the merge sort algorithm is executed on array A to sort it in increasing order. The merge sort algorithm will carry out a total of 7 merge operations.
- 331 mark · NAT · EasyIf an IP network uses a subnet mask of 255.255.240.0, the maximum number of IP addresses that can be assigned to network interfaces is ________. (answer in integer)
- 341 mark · NAT · ModerateThe 32-bit IEEE 754 single precision representation of a number is 0xC2710000. The number in decimal representation is _____. (rounded off to two decimal places)
- 351 mark · NAT · ModerateA lexical analyzer uses the following token definitions
- 362 marks · MCQ · ModerateConsider a complete graph Kn with n vertices (n>4). Note that multiple spanning trees can be constructed over Kn. Each of these spanning trees is represented as a set of edges. The Jaccard coefficient between any two sets is defined as the ratio of the size of the intersection of the two sets to the size of the union of the two sets.
- 372 marks · MCQ · ModerateLet G be a weighted directed acyclic graph with m edges and n vertices. Given G and a source vertex s in G, which one of the following options gives the worst case time complexity of the fastest algorithm to find the lengths of shortest paths from s to all vertices that are reachable from s in G?
- 382 marks · MCQ · ModerateConsider an array A of integers of size n. The indices of A run from 1 to n. An algorithm is to be designed to check whether A satisfies the condition given below.
- 392 marks · MCQ · ModerateConsider a table T, where the elements T[i][j],0≤i,j≤n, represent the cost of the optimal solutions of different subproblems of a problem that is being solved using a dynamic programming algorithm. The recursive formulation to compute the table entries is as follows:
- 402 marks · MCQ · EasyConsider the following 4-variable Boolean function
- 412 marks · MCQ · ModerateConsider the canonical LR(0) parsing of the grammar below using terminals {a, b, c} and non-terminals {A, B, C} with S as the start symbol.
- 422 marks · MCQ · ModerateIn the context of schema normalization in relational DBMS, consider a set F of functional dependencies. The set of all functional dependencies implied by F is called the closure of F. To compute the closure of F, Armstrong's Axioms can be applied. Consider X, Y, and Z as sets of attributes over a relational schema. The three rules of Armstrong's Axioms are described as follows.
- 432 marks · MCQ · ModerateConsider the transmission of data bits 110001011 over a link that uses Cyclic Redundancy Check (CRC) code for error detection. If the generator bit pattern is given to be 1001, which one of the following options shows the remainder bit pattern appended to the data bits before transmission?
- 442 marks · MCQ · ModerateConsider a processor that has 16 general purpose registers and it uses 2-byte instruction format for all its instructions. Variable-sized opcodes are permitted. There are three different types of instructions; M-type, R-type, and C-type. Each M-type instruction has 2 register operands and a 6-bit immediate operand. Each R-type instruction has 3 register operands. Each C-type instruction has a register operand and a 6-bit offset value. If there are 2 unique M-type opcodes and 7 unique R-type opcodes, which one of the following options gives the maximum number of unique opcodes possible for C-type instructions?
- 452 marks · MCQ · HardConsider the control flow graph given below.
- 462 marks · MCQ · ModerateAn index in a DBMS is said to be dense if an index entry appears for every search-key value in the indexed file. Otherwise it is called a sparse index. Consider the following two statements.
- 472 marks · MSQ · HardConsider the following two finite automata D1 and D2.
- 482 marks · MSQ · HardLet Σ={a,b,c,d} and let L={aibjckdℓ∣i,j,k,ℓ≥0}.
- 492 marks · MSQ · HardConsider a binary search tree (BST) with n leaf nodes (n>0). Given any node V, the key present in the node is denoted as Val(V). All the keys present in the given BST are distinct. The keys belong to the set of real numbers.
- 502 marks · MSQ · ModerateConsider a stack S and a queue Q. Both of them are initially empty and have the capacity to store ten elements each. The elements 1,2,3,4, and 5 arrive one by one, in that order. When an element arrives, it is assigned either to S (pushed on S) or to Q (enqueued to Q). Once all the five elements are stored, the output is generated in two steps. First, stack S is emptied by popping all elements. Then queue Q is emptied by dequeueing all elements. The output obtained by following this process is 4 3 1 2 5.
- 512 marks · MSQ · ModerateConsider three processes P1, P2, and P3 running identical code, as shown in the pseudocode below. A and B are two binary semaphores initialized to 1 and 0, respectively. X is a shared variable initialized to 0. Each line in the pseudocode is executed atomically.
- 522 marks · MSQ · HardConsider a system with a processor and a 4KB direct mapped cache with block size of 16 bytes. The system has a 16MB physical memory. Four words P, Q, R, and S are accessed by the processor in the same order 10 times. That is, there are a total of 40 memory references in the sequence P,Q,R,S,P,Q,R,S,…
- 532 marks · NAT · ModerateTo keep track of free blocks in a file system, one of the two approaches is generally used – using bitmaps (bit vectors) or using linked lists. Consider that the linked list approach is used to keep track of free blocks in a file system. Assume that the disk size is 16GB, block size is 2KB, and block numbers used are 32-bit long. A single pointer of size 4bytes is used in each block of the list to point to the next block of the list. The number of blocks required to hold the free disk block numbers is _________ (answer in integer)
- 542 marks · NAT · ModerateA system has a Translation Lookaside Buffer (TLB) that has a reach of 1MB. TLB reach is defined as the total amount of physical memory that can be accessed through the TLB entries. The paging system uses pages of size 4KB. The virtual address space is 64GB and physical address space is 1GB. If each TLB entry stores a 4-bit process id, page number, frame number, and a 2-bit control field, then the size of the TLB (in bytes) is _____. (answer in integer)
- 552 marks · NAT · ModerateConsider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes 20KB, 4KB, 25KB, 18KB, 7KB, 9KB, 15KB, and 12KB. Assume that no two holes are adjacent. Two processes P1 of size 16KB and P2 of size 9KB arrive in that order, and they are allocated memory using the best-fit technique. After allocating space to P1 and P2, the number of holes of size less than 8KB is _____. (answer in integer)
- 562 marks · NAT · HardConsider a system with 1MB physical memory and a word length of 1byte. The system uses a direct mapped cache, with block numbers starting from 0. The word with physical address 0xA2C28 is mapped to the cache block number 17610. The maximum possible size of the cache (in KB) for this configuration is _____.
(answer in integer)
- 572 marks · NAT · ModerateA non-pipelined instruction execution unit that operates at 1.6GHz clock takes an average of 5 clock cycles to complete the execution of an instruction. To improve the performance, the system was pipelined with a goal of achieving an average throughput of one instruction per clock cycle. However, it could operate only at 1.2GHz due to pipeline overheads. While executing a program in the pipelined design, 30% of instructions encountered a stall of 2 cycles due to pipeline hazards. The speed-up obtained by the pipelined design over the non-pipelined one for this program is ________. (rounded off to two decimal places)
- 582 marks · NAT · EasyConsider a new TCP connection between a sender and a receiver. The receiver advertised window is constant at 48KB, the maximum segment size (MSS) is 2KB, and the slow start threshold for TCP congestion control is 16KB. Assume that there are no timeouts or duplicate acknowledgements. The number of rounds of transmission required for the congestion control algorithm of the TCP connection to reach the congestion avoidance phase is ________. (answer in integer)
- 592 marks · NAT · ModerateConsider the digital circuit shown below with two input lines A and B, two select lines S0 and S1, and an output line Y. The blocks Q and M represent active high 2:4 decoder and 4-to-1 multiplexer, respectively. Out of 16 possible input combinations, the number of combinations that produce Y=1 is ____.
(answer in integer)
- 602 marks · NAT · EasyConsider the following ANSI-C program.
- 612 marks · NAT · ModerateConsider the following ANSI-C function.
- 622 marks · NAT · EasyThe determinant of a 4×4 matrix A is 3. The value of the determinant of 2A is ____. (answer in integer)
- 632 marks · NAT · ModerateSuppose an unbiased coin is tossed 6 times. Each coin toss is independent of all previous coin tosses. Let E1 be the event that among the second, fourth, and sixth coin tosses, there are at least two heads. Let E2 be the event that among the first, second, third, and fifth coin tosses, there are equal number of heads and tails.
- 642 marks · NAT · HardConsider a function f:(0,1)→{0,1} defined as follows.
- 652 marks · NAT · HardIt is necessary to design a link-layer protocol between two hosts that are directly connected over a lossless link of length 3000 kilometers. Assume that the link bandwidth is 108 bits per second and that the propagation delay in the link is 5 nanoseconds per meter. Every transmitted data byte is assigned a unique sequence number.