- 1Aptitude · 1 mark · MCQOut of the following four sentences, select the most suitable sentence with respect to grammar and usage.
- 2Aptitude · 1 mark · MCQA rewording of something written or spoken is a \\\\.
- 3Aptitude · 1 mark · MCQArchimedes said, “Give me a lever long enough and a fulcrum on which to place it, and I will move the world.”
- 4Aptitude · 1 mark · MCQIf ‘relftaga’ means carefree, ‘otaga’ means careful and ‘fertaga’ means careless, which of the following could mean ‘aftercare’?
- 5Aptitude · 1 mark · MCQA 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 \\\\.
- 6Aptitude · 2 marks · MCQA 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.
- 7Aptitude · 2 marks · MCQIndian 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.
- 8Aptitude · 2 marks · MCQConsider the following statements relating to the level of poker play of four players P, Q, R and S.
- 9Aptitude · 2 marks · MCQIf f(x)=2x7+3x−5, which of the following is a factor of f(x)?
- 10Aptitude · 2 marks · MCQIn 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 \\\\.
- 111 mark · NATLet p,q,r,s represent the following propositions.
- 121 mark · MCQLet an be the number of n-bit strings that do NOT contain two consecutive 1s. Which one of the following is the recurrence relation for an?
- 131 mark · NAT
- 141 mark · NATA 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 ____.
- 151 mark · NATTwo eigenvalues of a 3×3 real matrix P are (2+−1) and 3. The determinant of P is ____.
- 161 mark · MCQConsider the Boolean operator # with the following properties:
- 171 mark · NATThe 16-bit 2’s complement representation of an integer is 1111 1111 1111 0101; its decimal representation is ____ .
- 181 mark · NATWe want to design a synchronous 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 ____ .
- 191 mark · NATA processor can support a maximum memory of 4GB, where the memory is word-addressable (a word consists of two bytes). The size of the address bus of the processor is at least ____ bits.
- 201 mark · MCQA 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)?
- 211 mark · NATConsider the following directed graph:
- 221 mark · MCQConsider the following C program.
- 231 mark · MCQThe worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
- 241 mark · MCQLet 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?
- 251 mark · NATConsider the following C program.
- 261 mark · MCQWhich of the following languages is generated by the given grammar?
- 271 mark · MCQWhich of the following decision problems are undecidable?
- 281 mark · MCQWhich one of the following regular expressions represents the language: the set of all binary strings having two consecutive 0s and two consecutive 1s?
- 291 mark · NATConsider the following code segment.
- 301 mark · MCQConsider 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?
- 311 mark · MCQWhich of the following is NOT a superkey in a relational schema with attributes V, W, X, Y, Z and primary key VY?
- 321 mark · MCQWhich one of the following is NOT a part of the ACID properties of database transactions?
- 331 mark · MCQA database of research articles in a journal uses the following schema.
- 341 mark · MCQWhich one of the following protocols is NOT used to resolve one form of address to another one?
- 351 mark · MCQWhich of the following is/are example(s) of stateful application layer protocols?
- 362 marks · NATThe coefficient of x12 in (x3+x4+x5+x6+⋯)3 is ____.
- 372 marks · NATConsider the recurrence relation a1=8, an=6n2+2n+an−1. Let a99=K×104. The value of K is ____.
- 382 marks · NATA function f:N+→N+, defined on the set of positive integers N+, satisfies the following properties:
- 392 marks · NATConsider the following experiment.
- 402 marks · MCQConsider the two cascaded 2-to-1 multiplexers as shown in the figure.
- 412 marks · NATThe 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 ____.
- 422 marks · NATThe 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.
- 432 marks · MCQConsider 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
- 442 marks · MCQThe following function computes the maximum value contained in an integer array p[] of size n (n≥1).
- 452 marks · MCQWhat will be the output of the following C program?
- 462 marks · MCQWhat will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed?
- 472 marks · MCQAn 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 of edges 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?
- 482 marks · NATConsider the weighted undirected graph with 4 vertices, where the weight of edge {i,j} is given by the entry Wij in the matrix W.
- 492 marks · NATLet 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 \\\\.
- 502 marks · MCQG=(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?
- 512 marks · NATLet 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.
- 522 marks · MCQConsider the following context-free grammars:
- 532 marks · MCQConsider 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.
- 542 marks · MCQLet 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?
- 552 marks · NATThe attributes of three arithmetic operators in some programming language are given below.
- 562 marks · MCQConsider the following Syntax Directed Translation Scheme (SDTS), with non-terminals {S,A} and terminals {a,b}.
- 572 marks · NATConsider 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.
- 582 marks · NATConsider 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 ____.
- 592 marks · NATConsider 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 ____.
- 602 marks · MCQConsider the following proposed solution for the critical section problem. There are 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.
- 612 marks · MCQConsider 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:
- 622 marks · MCQConsider 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 along with the digital signature to A?
- 632 marks · NATAn IP datagram of size 1000bytes arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is 100bytes. Assume that the size of the IP header is 20bytes.The number of fragments that the IP datagram will be divided into for transmission is____
- 642 marks · NATFor a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 1megabyte and the maximum output rate is 20megabytes per second. Tokens arrive at a rate to sustain output at a rate of 10megabytes per second. The token bucket is currently full and the machine needs to send 12megabytes of data. The minimum time required to transmit the data is ____ seconds.
- 652 marks · NATA sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000bytes and the transmission rate at the sender is 80Kbps (1Kbps=1000bits/second). Size of an acknowledgement is 100bytes and the transmission rate at the receiver is 8Kbps. The one-way propagation delay is 100milliseconds.