- 1Aptitude · 1 mark · MCQ · EasyThe antonym of the word protagonist is ________.
- 2Aptitude · 1 mark · MCQ · EasyThe figure shows two 4-tile patterns.
- 3Aptitude · 1 mark · MCQ · EasyConsider a knock-out women's badminton singles tournament where there are no ties. The loser in each game is eliminated from the tournament. Every player plays until she is defeated or remains the last undefeated player. The last undefeated player is declared the winner of the tournament. If there are 64 players in the beginning of the tournament, how many games should be played in total to declare the winner of the tournament?
- 4Aptitude · 1 mark · MCQ · EasyA student needs to enroll for a minimum of 60 credits. A student cannot enroll for more than 70 credits. The credits are divided amongst project and three distinct sets of courses namely, core courses, specialization courses, and elective courses. It is compulsory for a student to enroll for exactly 15 credits of core courses and exactly 20 credits of project. In addition, a student has to enroll for a minimum of 10 credits of specialization courses. The maximum credits of elective courses that a student can enroll for is _____
- 5Aptitude · 1 mark · MCQ · Moderate'When the teacher is in the room, all students stand silently.'
- 6Aptitude · 2 marks · MCQ · EasyCombinatorics deals with problems involving counting. For example, “How many distinct arrangements of N distinct objects in M spaces on a circle are possible?” is a typical problem in combinatorics. This kind of counting is sometimes used in the modeling of several physical phenomena. Often, in such models, the different combinatorial possibilities are assigned probability values. Assigning probabilities enables the computation of the average values of physical quantities.
- 7Aptitude · 2 marks · MCQ · ModerateIn Panel I of the figure below, the front view and top view of a structure are shown. Which one of the 3D structures shown in Panel II possesses the views shown in Panel I?
- 8Aptitude · 2 marks · MCQ · ModerateFor positive real numbers S and K, the function HK(S) is defined as:
HK(S)=max(S−K,0). The max function is defined as:
max(a,b)={a,b,when a>bwhen a≤b
The graph below shows the plot of a function N(S) versus S.
- 9Aptitude · 2 marks · MCQ · ModerateIn the 2020 summer Olympics' Javelin throw finals, Neeraj Chopra exhibited a spectacular performance to win the gold medal. The silver medal was won by Jakub Vadlejch and the bronze medal was won by Vitezlav Vesely. There were six rounds of throws with each athlete having one throw per round. The best of all the throws of each athlete is considered for the medal. Following were the observations about the throws:
- 10Aptitude · 2 marks · MCQ · EasyAn 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 number appearing in the second roll is an integer multiple of the number appearing in the first roll is ________
- 111 mark · MCQ · ModerateAn urn contains one red ball and one blue ball. At each step, a ball is picked uniformly at random from the urn, and this ball together with another ball of the same color is put back in the urn. The probability that there are equal number of red and blue balls after two steps is
- 121 mark · MCQ · HardConsider 4×4 matrices with their elements from {0, 1}. The number of such matrices with even number of 1s in every row and every column is
- 131 mark · MCQ · EasyFor n>1, the maximum multiplicity of any eigenvalue of an n×n matrix with elements from R is
- 141 mark · MCQ · EasyMatch each addressing mode in List I with a data element or an element of a data structure (in a high-level language) in List II:
- 151 mark · MCQ · EasyConsider a processor P whose instruction set architecture is the load-store architecture. The instruction format is such that the first operand of any instruction is the destination operand.
- 161 mark · MCQ · EasyWhich one of the following dependencies among the register operands of different instructions can cause a data hazard in a pipelined processor?
- 171 mark · MCQ · ModerateConsider the following recurrence relations:
- 181 mark · MCQ · ModerateWith respect to a TCP connection between a client and a server, which one of the following statements is true?
- 191 mark · MSQ · ModerateWhich of the following statements is/are true with respect to the interaction of a web browser with a web server using HTTP 1.1?
- 201 mark · MSQ · ModerateLet n>1. Consider an n×n matrix M with its elements from R. Let the vector (0,1,0,0,...,0)∈Rn be in the null space of M.
- 211 mark · MSQ · ModerateConsider the following Boolean expression of a function F :
- 221 mark · MSQ · ModerateConsider the 8-bit signed integers X,Y and Z represented using the sign-magnitude form. The binary representations of X and Y are as follows:
- 231 mark · MSQ · ModerateLet n be an odd number greater than 100. Consider a binary minheap with n elements stored in an array P whose index starts from 1.
- 241 mark · MSQ · ModerateConsider a hash table P[0,1,…,10] that is initially empty. The hash table is maintained using open addressing with linear probing. The hash function used is h(x)=(x+7)mod11.
- 251 mark · MSQ · HardConsider the following grammar where S is the start symbol, and a and b are terminal symbols.
- 261 mark · MSQ · ModerateLet M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet.
- 271 mark · MSQ · ModerateConsider the following C statements:
- 281 mark · MSQ · ModerateWhich of the following statements is/are true?
- 291 mark · MSQ · ModerateWith respect to deadlocks in an operating system, which of the following statements is/are FALSE?
- 301 mark · MSQ · ModerateLet P,Q,R and S be the attributes of a relation in a relational schema. Let X→Y indicate functional dependency in the context of a relational database, where X,Y⊆{P,Q,R,S}.
- 311 mark · MSQ · ModerateIn the context of relational database normalization, which of the following statements is/are true?
- 321 mark · NAT · EasyConsider the function f:R→R defined as follows:
- 331 mark · NAT · EasyThe height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with 23 nodes is _____. (answer in integer)
- 341 mark · NAT · ModerateConsider the following program in C:
- 351 mark · NAT · ModerateConsider a system consisting of k instances of a resource R, being shared by 5 processes. Assume that each process requires a maximum of two instances of resource R and a process can request or release only one instance at a time. Further, a process can request the second instance of the resource only after acquiring the first instance.
- 362 marks · MCQ · HardConsider the real valued variables X, Y and Z represented using the IEEE 754 single-precision floating-point format. The binary representations of X and Y in hexadecimal notation are as follows:
- 372 marks · MCQ · ModerateConsider a 2-bit saturating up/down counter that performs the saturating up count when the input P is 0, and the saturating down count when P is 1. The Next State table of the counter is as shown. The counter is built as a synchronous sequential circuit using D flip-flops.
- 382 marks · MCQ · ModerateThe size of the physical address space of a processor is 232 bytes. The capacity of a cache memory unit is 223 bytes. The cache block size is 128 bytes. The cache memory unit can be built as a direct mapped cache or as a K-way set-associative cache, where K=2L and L∈{1,2,3}. Let the length of the TAG field be M bits for the direct mapped cache, and N bits for the set-associative cache.
- 392 marks · MCQ · EasyConsider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to by the pointer variable head.
- 402 marks · MCQ · HardLet P be the set of all integers from 1 to 15. Consider any order of insertion of the elements of P into a binary search tree that creates a complete binary tree.
- 412 marks · MCQ · ModerateLet G(V,E) be an undirected, edge-weighted graph with integer weights. The weight of a path is the sum of the weights of the edges in that path. The length of a path is the number of edges in that path.
- 422 marks · MCQ · ModerateConsider the control flow graph shown in the figure.
- 432 marks · MCQ · EasyConsider a relational database schema with two relations R(P,Q) and S(X,Y).
- 442 marks · MCQ · ModerateA TCP sender successfully establishes a connection with a TCP receiver and starts the transmission of segments. The TCP congestion control mechanism's slow-start threshold is set to 10000 segments. Assume that the round-trip time is fixed at 1 millisecond. Assume that the sender always has data to send, the segments are numbered from 1, and no segment is lost. Let t denote the time (in milliseconds) at which the transmission of segment number 2000 starts.
- 452 marks · MCQ · ModerateConsider the implementation of sliding window protocol over a lossless link, with a window size of W frames, where each frame is of size 1000 bits (including header). The bandwidth of the link is 100kbps (1k=103) and the one-way propagation delay is 100milliseconds. Assume that processing times at the sender and receiver are zero and the transmission time of acknowledgements is also zero. Which one of the following options gives the minimum size of W (in number of frames) required to achieve 100% link utilization?
- 462 marks · MSQ · HardLet f:R→R be defined as follows:
- 472 marks · MSQ · HardLet G(V,E) be a simple, undirected graph. A vertex cover of G is a subset V′⊆V such that for every (u,v)∈E, u∈V′ or v∈V′. Let the size of the smallest vertex cover in G be k. Let S be any vertex cover of size k.
- 482 marks · MSQ · ModerateConsider a Boolean function F with the following minterm expression:
- 492 marks · MSQ · HardLet G(V,E) be a simple, undirected, edge-weighted graph with unique edge weights.
- 502 marks · MSQ · HardConsider the following pseudocode for depth-first search (DFS) algorithm which takes a directed graph G(V,E) as input, where d[v] and f[v] are the discovery time and finishing time, respectively, of the vertex v∈V.
- 512 marks · MSQ · ModerateLet L1 and L2 be two languages over a finite alphabet, such that L1∩L2 and L2 are regular languages.
- 522 marks · MSQ · HardConsider the following context-free grammar G.
- 532 marks · MSQ · HardConsider the following two syntax-directed definitions SDD1 and SDD2 for type declarations.
- 542 marks · MSQ · ModerateConsider a system that has a cache memory unit and a memory management unit (MMU). The address input to the cache memory is a physical address. The MMU has a translation lookaside buffer (TLB). Assume that when a page is evicted from the main memory, the corresponding blocks in the cache are marked as invalid.
- 552 marks · MSQ · ModerateAn undirected, unweighted, simple graph G(V,E) is said to be 2-colorable if there exists a function c:V→{0,1} such that for every (u,v)∈E, c(u)=c(v).
- 562 marks · MSQ · ModerateAn ISP having an address block 202.16.0.0/15 assigns a block of 6000 IP addresses to a client, using the classless internet domain routing (CIDR) super-netting approach. Which of the following address blocks can be assigned by the ISP?
- 572 marks · NAT · ModerateLet G be an undirected graph, which is a path on 8 vertices. The number of matchings in G is ________. (answer in integer)
- 582 marks · NAT · EasyLet X be a random variable which takes values in the set {1, 2, 3, 4, 5, 6, 7, 8}.
Further, Pr(X=1)=Pr(X=2)=Pr(X=5)=Pr(X=7)=61 and
Pr(X=3)=Pr(X=4)=Pr(X=6)=Pr(X=8)=121.
- 592 marks · NAT · HardConsider a hard disk with a rotational speed of 15000rpm. The time to move the read/write head from a track to its adjacent track is 1millisecond. Initially, the head is on track 0. The number of sectors per track is 400. The sector size is 1024bytes. It is necessary to transfer data from 10 randomly located sectors in each of the following tracks in the order: 5, 12 and 7.
- 602 marks · NAT · ModerateThe EX stage of a pipelined processor performs the memory read operations for LOAD instructions, and the operations for the arithmetic and logic instructions. Let tEX denote the time taken by the EX stage to perform the operation for an instruction. For each instruction type, the values of tEX and M (the number of instructions of that type in a sequence of 100 instructions for a program P), are given in the table below.
- 612 marks · NAT · ModerateConsider the recursive functions represented by the following code segment:
- 622 marks · NAT · ModerateThe following sequence corresponds to the preorder traversal of a binary search tree T:
- 632 marks · NAT · ModerateConsider the following program snippet. Assume that the program compiles and runs successfully. Further, assume that the
fork() system call is always successful in creating a process. - 642 marks · NAT · ModerateConsider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst of 8 seconds. A new process of type A arrives at time t=10,20,30,40, and 50 (in seconds). Similarly, a new process of type C arrives at time t=11,22,33,44, and 55 (in seconds). The CPU scheduling policy is First Come First Serve (FCFS). The first process of type A starts running at t=10 seconds. The average waiting time (in seconds) for the 10 processes is ____. (rounded off to one decimal place)
- 652 marks · NAT · ModerateConsider a relational database schema with a relation R(A,B,C,D). If {A,B} and {A,C} are the only two candidate keys of the relation R, then the number of superkeys of relation R is ____. (answer in integer)