- 1Aptitude · 1 mark · MCQ · EasyRavi had _____ younger brother who taught at _____ university. He was widely regarded as _____ honorable man.
- 2Aptitude · 1 mark · MCQ · EasyThe CEO's decision to downsize the workforce was considered myopic because it sacrificed long-term stability to accommodate short-term gains.
- 3Aptitude · 1 mark · MCQ · EasyThe average marks obtained by a class in an examination were calculated as 30.8. However, while checking the marks entered, the teacher found that the marks of one student were entered incorrectly as 24 instead of 42. After correcting the marks, the average becomes 31.4. How many students does the class have?
- 4Aptitude · 1 mark · MCQ · ModerateConsider the relationships among P, Q, R, S, and T:
- 5Aptitude · 1 mark · MCQ · EasyAccording to the map shown in the figure, which one of the following statements is correct?
- 6Aptitude · 2 marks · MCQ · Easy“I put the brown paper in my pocket along with the chalks, and possibly other things. I suppose every one must have reflected how primeval and how poetical are the things that one carries in one’s pocket: the pocket-knife, for instance the type of all human tools, the infant of the sword. Once I planned to write a book of poems entirely about the things in my pocket. But I found it would be too long: and the age of the great epics is past.”
- 7Aptitude · 2 marks · MCQ · ModerateIn the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
- 8Aptitude · 2 marks · MCQ · EasyA fair six-faced dice, with the faces labelled '1', '2', '3', '4', '5', and '6', is rolled thrice. What is the probability of rolling '6' exactly once?
- 9Aptitude · 2 marks · MCQ · ModerateA square paper, shown in figure (I), is folded along the dotted lines as shown in the figures (II) and (III). Then a few cuts are made as shown in figure (IV). Which one of the following patterns will be obtained when the paper is unfolded?
- 10Aptitude · 2 marks · MCQ · EasyA shop has 4 distinct flavors of ice-cream. One can purchase any number of scoops of any flavor. The order in which the scoops are purchased is inconsequential. If one wants to purchase 3 scoops of ice-cream, in how many ways can one make that purchase?
- 111 mark · MCQ · EasySuppose a program is running on a non-pipelined single processor computer system. The computer is connected to an external device that can interrupt the processor asynchronously. The processor needs to execute the interrupt service routine (ISR) to serve this interrupt. The following steps (not necessarily in order) are taken by the processor when the interrupt arrives:
- 121 mark · MCQ · EasyWhich ONE of the following statements is FALSE regarding the symbol table?
- 131 mark · MCQ · EasyWhich ONE of the following techniques used in compiler code optimization uses live variable analysis?
- 141 mark · MCQ · ModerateConsider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory is byte addressable, what is the maximum number of entries in the page table?
- 151 mark · MCQ · EasyA schedule of three database transactions T1, T2, and T3 is shown. Ri(A) and Wi(A) denote read and write of data item A by transaction Ti,i=1,2,3. The transaction T1 aborts at the end. Which other transaction(s) will be required to be rolled back?
- 161 mark · MCQ · EasyIdentify the ONE CORRECT matching between the OSI layers and their corresponding functionalities as shown.
- 171 mark · MCQ · Moderateg(.) is a function from A to B, f(.) is a function from B to C, and their composition defined as f(g(.)) is a mapping from A to C.
- 181 mark · MCQ · EasyLet G be any undirected graph with positive edge weights, and T be a minimum spanning tree of G. For any two vertices, u and v, let d1(u,v) and d2(u,v) be the shortest distances between u and v in G and T, respectively. Which ONE of the options is CORRECT for all possible G,T,u and v?
- 191 mark · MCQ · EasyConsider the following context-free grammar G, where S, A, and B are the variables (non-terminals), a and b are the terminal symbols, S is the start variable, and the rules of G are described as:
- 201 mark · MCQ · ModerateConsider the following recurrence relation.
- 211 mark · MSQ · ModerateConsider the following B+ tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the B+ tree. Which of the following option(s) is/are CORRECT?
- 221 mark · MSQ · EasyConsider the 3-way handshaking protocol for TCP connection establishment. Let the three packets exchanged during the connection establishment be denoted as P1, P2, and P3, in order. Which of the following option(s) is/are TRUE with respect to TCP header flags that are set in the packets?
- 231 mark · MSQ · ModerateConsider the given system of linear equations for variables x and y, where k is a real-valued constant. Which of the following option(s) is/are CORRECT?
- 241 mark · MSQ · HardLet X be a 3-variable Boolean function that produces output as '1' when at least two of the input variables are '1'. Which of the following statement(s) is/are CORRECT, where a,b,c,d,e are Boolean variables?
- 251 mark · MSQ · EasyThe number −6 can be represented as 1010 in 4-bit 2's complement representation. Which of the following is/are CORRECT 2's complement representation(s) of −6?
- 261 mark · MSQ · ModerateWhich of the following statement(s) is/are TRUE for any binary search tree (BST) having n distinct integers?
- 271 mark · MSQ · ModerateA partial data path of a processor is given in the figure, where RA, RB, and RZ are 32-bit registers. Which option(s) is/are CORRECT related to arithmetic operations using the data path as shown?
- 281 mark · MSQ · ModerateA regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FALSE?
- 291 mark · NAT · ModerateSuppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests for an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its lifetime (not counting the time the process enters the ready queue when it is run initially) is ________. (Answer in integer)
- 301 mark · NAT · EasyLet S be the set of all ternary strings defined over the alphabet {a,b,c}. Consider all strings in S that contain at least one occurrence of two consecutive symbols, that is, “aa”, “bb” or “cc”. The number of such strings of length 5 that are possible is ____. (Answer in integer)
- 311 mark · NAT · EasyConsider the given function f(x).
- 321 mark · NAT · ModerateA box contains 5 coins: 4 regular coins and 1 fake coin. When a regular coin is tossed, the probability P(head)=0.5 and for a fake coin, P(head)=1. You pick a coin at random and toss it twice, and get two heads. The probability that the coin you have chosen is the fake coin is ________. (rounded off to two decimal places)
- 331 mark · NAT · ModerateThe pseudocode of a function fun() is given below:
- 341 mark · NAT · Easy#include <stdio.h>
void foo(int *p, int x){
*p=x;
}
int main(){
int *z;
int a = 20, b = 25;
z = &a;
foo(z,b);
printf("%d",a);
return 0;
}
- 351 mark · NAT · EasyThe height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node.
- 362 marks · MCQ · ModerateConsider a memory system with 1M bytes of main memory and 16K bytes of cache memory. Assume that the processor generates 20-bit memory address, and the cache block size is 16bytes. If the cache uses direct mapping, how many bits will be required to store all the tag values? [Assume memory is byte addressable, 1K=210, 1M=220.]
- 372 marks · MCQ · EasyA processor has 64 general-purpose registers and 50 distinct instruction types. An instruction is encoded in 32-bits. What is the maximum number of bits that can be used to store the immediate operand for the given instruction?
- 382 marks · MCQ · ModerateA computer has two processors, M1 and M2. Four processes P1, P2, P3, P4 with CPU bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive at the same time and these are the only processes in the system. The scheduler uses non-preemptive priority scheduling, with priorities decided as follows:
- 392 marks · MCQ · EasyConsider two relations describing teams and players in a sports league:
- 402 marks · MCQ · ModerateA packet with the destination IP address 145.36.109.70 arrives at a router whose routing table is shown. Which interface will the packet be forwarded to?
- 412 marks · MCQ · ModerateLet A be a 2×2 matrix as given.
- 422 marks · MCQ · ModerateConsider the following four variable Boolean function in sum-of-product form
- 432 marks · MCQ · HardLet G(V,E) be an undirected and unweighted graph with 100 vertices. Let d(u,v) denote the number of edges in a shortest path between vertices u and v in V. Let the maximum value of d(u,v), u,v∈V such that u=v, be 30. Let T be any breadth-first-search tree of G. Which ONE of the given options is CORRECT for every such graph G?
- 442 marks · MCQ · HardConsider the following two languages over the alphabet {a, b}:
- 452 marks · MCQ · ModerateConsider the following two languages over the alphabet {a,b,c}, where m and n are natural numbers.
- 462 marks · MSQ · EasyWhich of the following statement(s) is/are TRUE while computing First and Follow during top down parsing by a compiler?
- 472 marks · MSQ · ModerateConsider a relational schema team(name,city,owner), with functional dependencies {name→city,name→owner}.
- 482 marks · MSQ · ModerateWhich of the following predicate logic formulae/formula is/are CORRECT representation(s) of the statement: "\textit{Everyone has exactly one mother}"?
- 492 marks · MSQ · ModerateA={0,1,2,3,…} is the set of non-negative integers. Let F be the set of functions from A to itself. For any two functions, f1,f2∈F, we define
(f1⊙f2)(n)=f1(n)+f2(n)
for every number n in A. Which of the following is/are CORRECT about the mathematical structure (F,⊙)?
- 502 marks · MSQ · ModerateConsider the following deterministic finite automaton (DFA) defined over the alphabet, Σ={a,b}. Identify which of the following language(s) is/are accepted by the given DFA.
- 512 marks · NAT · ModerateA disk of size 512M bytes is divided into blocks of 64K bytes. A file is stored in the disk using linked allocation. In linked allocation, each data block reserves 4 bytes to store the pointer to the next data block. The link part of the last data block contains a NULL pointer (also of 4 bytes). Suppose a file of 1M bytes needs to be stored in the disk. Assume, 1K=210 and 1M=220. The amount of space in bytes that will be wasted due to internal fragmentation is _____ (Answer in integer)
- 522 marks · NAT · ModerateRefer to the given 3-address code sequence. This code sequence is split into basic blocks. The number of basic blocks is ________. (Answer in integer)
- 532 marks · NAT · ModerateA computer has a memory hierarchy consisting of two-level cache (L1 and L2) and a main memory. If the processor needs to access data from memory, it first looks into L1 cache. If the data is not found in L1 cache, it goes to L2 cache. If it fails to get the data from L2 cache, it goes to main memory, where the data is definitely available. Hit rates and access times of various memory units are shown in the figure. The average memory access time in nanoseconds (ns) is ____ (rounded off to two decimal places)
- 542 marks · NAT · HardIn optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modification of the optimal page replacement algorithm is as follows:
- 552 marks · NAT · EasyConsider the following database tables of a sports league.
- 562 marks · NAT · EasySuppose a 5-bit message is transmitted from a source to a destination through a noisy channel. The probability that a bit of the message gets flipped during transmission is 0.01. Flipping of each bit is independent of one another. The probability that the message is delivered error-free to the destination is _____.
(rounded off to three decimal places)
- 572 marks · NAT · HardSuppose a message of size 15000bytes is transmitted from a source to a destination using IPv4 protocol via two routers as shown in the figure. Each router has a defined maximum transmission unit (MTU) as shown in the figure, including IP header. The number of fragments that will be delivered to the destination is ____.
(Answer in integer)
- 582 marks · NAT · EasyConsider a probability distribution given by the density function P(x).
- 592 marks · NAT · ModerateConsider a finite state machine (FSM) with one input X and one output f, represented by the given state transition table. The minimum number of states required to realize this FSM is ____. (Answer in integer)
- 602 marks · NAT · ModerateConsider the given sequential circuit designed using D-Flip-flops. The circuit is initialized with some value (initial state). The number of distinct states the circuit will go through before returning back to the initial state is ________. (Answer in integer)
- 612 marks · NAT · ModerateThe value printed by the given C program is _____. (Answer in integer)
- 622 marks · NAT · ModerateLet LIST be a datatype for an implementation of linked list defined as follows:
- 632 marks · NAT · EasyConsider the following C program:
- 642 marks · NAT · ModerateThe maximum value of x such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is ____ . (answer in integer)
- 652 marks · NAT · ModerateIn a double hashing scheme, h1(k)=k(mod11) and h2(k)=1+(k(mod7)) are the auxiliary hash functions. The size m of the hash table is 11. The hash function for the i-th probe in the open address table is [h1(k)+ih2(k)](modm). The following keys are inserted in the given order: 63,50,25,79,67,24.