“From where are they bringing their books? ________ bringing _______ books from _____.”

The words that best fill the blanks in the above sentence are

“A _____ investigation can sometimes yield new facts, but typically organized ones are more successful.”

The word that best fills the blank in the above sentence is

The area of a square is 𝑑. What is the area of the circle which has the diagonal of the square as its diameter?

What would be the smallest natural number which when divided either by 20 or by 42 or by 76 leaves a remainder of 7 in each case?

What is the missing number in the following sequence?

2, 12, 60, 240, 720, 1440, _____, 0

In appreciation of the social improvements completed in a town, a wealthy philanthropist decided to gift Rs. 750 to each male senior citizen in the town and Rs. 1000 to each female senior citizen. Altogether, there were 300 senior citizens eligible for this gift. However, only 8/9^th of the eligible men and 2/3^rd of the eligible women claimed the gift. How much money (in Rupees) did the philanthropist give away in total?

If pqr ≠ 0 and \({{p}^{-x}}=\frac{1}{q},{{q}^{-y}}=\frac{1}{r}\text{ }!!!!\text{ },\text{ }!!!!\text{ }{{r}^{-z}}=\frac{1}{p}\text{ }!!!!\text{ },\text{ }!!!!\text{ }\)What is the value of the product of xyz?

In a party, 60% of the invited guests are male and 40% are female. If 80% of the invited guests attended the party and if all the invited female guests attended, what would be the ratio of males to females among the attendees in the party?

In the figure below, ∠DEC + ∠BFC is equal to _________.

A six-sided unbiased die with four green faces and two red faces is rolled seven times. Which of the following combinations is the most likely outcome of the experiment?

Which one of the following is a closed form expression for the generating function of the sequence {a_n}, where a_n = 2n + 3 for all n = 0, 1, 2, …. ?

Consider the following C program.

include<stdio.h>

struct Ournode {

        char x, y, z ;

} ;

int main ( ) {

        struct Ournode p = {‘1’, ‘0’, ‘a’ + 2} ;

        struct Ournode *q = &p;

        printf (“%c, %c”, ( (char) q + 1) , ( (char) q + 2) ) ;

        return 0 ;

}

The output of this program is:

A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let enqueue be implemented by inserting a new node at the head, and dequeue be

implemented by deletion of a node from the tail.

Which one of the following is the time complexity of the most time-efficient implementation of enqueue and dequeue, respectively, for this data structure?

Let ⊕ and ⊙ denote the Exclusive OR and Exclusive NOR operations, respectively.

Which one of the following is NOT CORRECT?

Consider the following processor design characteristics.

I. Register-to-register arithmetic operations only

II. Fixed-length instruction format

III. Hardwired control unit

Which of the characteristics above are used in the design of a RISC processor?

Let be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true?

The set of all recursively enumerable languages is

The following are some events that occur after a device controller issues an interrupt while process L is under execution?

(P) The processor pushes the process status onto the control stack.

(Q) The processor finishes the execution of the current instruction.

(R) The processor executes the interrupt service routine.

(S) The processor pops the process status of from the control stack.

(T) The processor loads the new PC value based on the interrupt.

Which one of the following is the correct order in which the events above occur?

Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is M units if the corresponding memory page is available in memory, and D units if the memory access causes a page fault. It has been experimental measured that the average time taken for a memory access in the process is X units.

Which one of the following is the correct expression for the page fault rate experienced by the process?

In an Entity-Relationship (ER) model, suppose 𝑅 is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in 𝑅 and that the cardinality of E1 is greater than the cardinality of E2.

Which one of the following is true about 𝑅?

Consider the following two tables and four queries in SQL.

Book (isbn, bname), Stock (isbn, copies)

Query 1: SELECT B.isbn, S.copies

FROM Book B INNER JOIN Stock S

ON B.isbn = S.isbn;

Query 2: SELECT B.isbn, S.copies

FROM Book B LEFT OUTER JOIN Stock S

ON B.isbn = S.isbn;

Query 3: SELECT B.isbn, S.copies

FROM Book B RIGHT OUTER JOIN Stock S

ON B.isbn = S.isbn;

Query 4: SELECT B.isbn, S.copies

FROM Book B FULL OUTER JOIN Stock S

ON B.isbn = S.isbn;

Which one of the queries above is certain to have an output that is a superset of the outputs

of the other three queries?

Match the following:

Consider the following statements regarding the slow start phase of the TCP congestion

control algorithm. Note that cwnd stands for the TCP congestion window and MSS denotes

the Maximum Segment Size.

(i) The cwnd increases by 2 MSS on every successful acknowledgment.

(ii) The cwnd approximately doubles on every successful acknowledgement.

(iii) The cwnd increases by 1 MSS every round trip time.

(iv) The cwnd approximately doubles every round trip time.

Which one of the following is correct?

Which one of the following statements is FALSE?

Two people, P and Q, decide to independently roll two identical dice, each with 6 faces, numbered 1 to 6. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a trial as a throw of the dice by P and Q. Assume that all 6 numbers on each dice are equi-probable and that all trials are independent. The probability (rounded to 3 decimal places) that one of them wins on the third trial is _____.

The value of $∫_0^{(\pi /4)}x cos (x^2) dx$ correct to three decimal places (assuming that 𝜋 = 3.14 ) is _____.

Consider a matrix A = uv^T where  $u=(^1_2) ,\ v=(^1_1)$.Note that v^T denotes the transpose of v. The largest eigenvalue of A is ________.

The chromatic number of the following graph is _______.

Let G be a finite group on 84 elements. The size of a largest possible proper subgroup of G is ________.

The postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is ______.

Consider the following C program:

include <stdio.h>

int counter = 0 ;

int calc (int a, int b) {

int c;

counter++;

if (b==3) return (aaa) ;

else {

c = calc (a, b/3) ;

return (ccc) ;

}

}

int main ( ) {

      calc (4, 81) ;

      printf (“%d” , counter) ;

}

The output of this program is: ________ .

Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered D flip-flops.

The number of states in the state transition diagram of this circuit that have a transition back

to the same state on some value of “in” is _____.

A 32-bit wide main memory unit with a capacity of 1 GB is built using 256M × 4-bit DRAM chips. The number of rows of memory cells in the DRAM chip is 2¹⁴. The time taken to perform one refresh operation is 50 nanoseconds. The refresh period is 2 milliseconds. The percentage (rounded to the closest integer) of the time available for performing the memory read/write operations in the main memory unit is __________.

Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource instances can be requested and released only one at a time. The largest value of K that will always avoid deadlock is ____.

Consider a long-lived TCP session with an end-to-end bandwidth of 1 Gbps (= 10⁹ bits-per-second). The session starts with a sequence number of 1234. The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again is _______.

Consider a matrix P whose only eigenvectors are the multiples of \(\left[ {\begin{array}{*{20}{c}} 1\ 4 \end{array}} \right]\).

Consider the following statements. 

(I) P does not have an inverse

(II) P has a repeated eigenvalue

(III) P cannot be diagonalized

Which one of the following options is correct?

Let N be the set of natural numbers. Consider the following sets.

P: Set of Rational numbers (positive and negative)

Q: Set of functions from {0, 1} to N

R: Set of functions from N to {0, 1}

S: Set of finite subsets of N.

Which of the sets above are countable?

Consider the following C program:

#include<stdio.h>

void fun1 (char *s1, char *s2) {

          char *tmp ;

          tmp = s1 ;

          s1 = s2 ;

          s2 = tmp ;

}

void fun2 (char **s1, char **s2) {

          char *tmp ;

          tmp = * s1 ;

          * s1 = * s2 ;

          * s2 = tmp ;

}

int main ( ) {

          char *str1 = “Hi”, *str2 = “Bye” ;

          fun1 (str1, str2) ;            printf (“%s  %s  “,    str1,  str2) ;

          fun2 (&str1, &str2) ;      printf (“%s %s “,   str1, str2) ;

          return 0 ;

}

The output of the program above is

Let G be a simple undirected graph. Let T_D be a depth first search tree of G. Let T_B be a breadth first search tree of G. Consider the following statements.

(I) No edge of G is a cross edge with respect to T_D. (A cross edge in G is between two nodes neither of which is an ancestor of the other in T_D .)

(II) For every edge (u, v) of if u is at depth i and v is at depth j in T_B , then |𝑖 − 𝑗| = 1.

Which of the statements above must necessarily be true?

Assume that multiplying a matrix G₁ of dimension 𝑝 × 𝑞 with another matrix G₂ of dimension 𝑞 × 𝑟 requires 𝑝𝑞𝑟 scalar multiplications. Computing the product of n matrices G₁G₂G₃…G_n can be done by parenthesizing in different ways. Define G_i G_i+1 as an explicitly computed pair for a given paranthesization if they are directly multiplied. For example, in the matrix multiplication chain G₁G₂G₃G₄G₅G₆ using parenthesization (G₁(G₂G₃))(G₄(G₅G₆)), G₂G₃ and G₅G₆ are the only explicitly computed pairs.Consider a matrix multiplication chain F₁F₂F₃F₄F₅, where matrices F₁, F₂, F₃, F₄ and F₅ are of dimensions 2 × 25, 25 × 3, 3 × 16, 16 × 1 and 1 × 1000, respectively. In the parenthesization of F₁F₂F₃F₄F₅ that minimizes the total number of scalar multiplications, the explicitly computed pairs is/are

Consider the following C code. Assume that unsigned long int type length is 64 bits.

unsigned long int fun (unsigned long int n) {

unsigned long int i, j = 0, sum = 0 ;

for (i = n; i > 1 ; i = i/2)

j++ ;

for ( ; j > 1 ; j = j/2)

sum++ ;

return (sum) ;

}

The value returned when we call fun with the input 2⁴⁰ is

Consider the first-order logic sentence 𝜑 ≡ ∃𝑠∃𝑡∃𝑢∀𝑣∀𝑤∀𝑥∀𝑦 𝜓(𝑠, 𝑡, 𝑢, 𝑣, 𝑤, 𝑥, 𝑦) where 𝜓(𝑠, 𝑡, 𝑢, 𝑣, 𝑤, 𝑥, 𝑦) is a quantifier-free first-order logic formula using only predicate symbols, and possibly equality, but no function symbols. Suppose 𝜑 has a model with a universe containing 7 elements.

Consider the unsigned 8-bit fixed-point binary number representation below, b₇ b₆ b₅ b₄ b₃ . b₂ b₁ b₀ where the position of the binary point is between b₃ and b₂. Assume b₇ is the most significant bit. Some of the decimal numbers listed below cannot be represented exactly in the above representation:

(i) 31.500 (ii) 0.875 (iii) 12.100 (iv) 3.001

Which one of the following statements is true?

The size of the physical address space of a processor is 2^𝑃 bytes. The word length is 2^𝑊 bytes. The capacity of cache memory is 2^𝑁 bytes. The size of each cache block is 2^𝑀 words. For a 𝐾-way set-associative cache memory, the length (in number of bits) of the tag field is

Consider the following languages:

I. $𝑎^𝑚 𝑏^𝑛𝑐^𝑝𝑑^𝑞| 𝑚 + 𝑝 = 𝑛 + 𝑞, where \text{ 𝑚}, 𝑛, 𝑝, 𝑞 ≥ 0$

II. ${𝑎^𝑚𝑏^𝑛𝑐^𝑝𝑑^𝑞| 𝑚 = 𝑛 \text{ and } 𝑝 = 𝑞, where \text{ 𝑚}, 𝑛, 𝑝, 𝑞 ≥ 0}$

III. $𝑎^𝑚𝑏^𝑛𝑐^𝑝𝑑^𝑞| 𝑚 = 𝑛 = 𝑝 \text{ and } 𝑝 ≠ 𝑞, where \text{ 𝑚}, 𝑛, 𝑝, 𝑞 ≥ 0$

IV. $𝑎^𝑚𝑏^𝑛𝑐^𝑝𝑑^𝑞| 𝑚𝑛 = 𝑝 + 𝑞, where \text{ 𝑚}, 𝑛, 𝑝, 𝑞 ≥ 0$

Which of the languages above are context-free?

Consider the following problems. L(𝐺) denotes the language generated by a grammar 𝐺. L(𝑀) denotes the language accepted by a machine 𝑀.

(I) For an unrestricted grammar 𝐺 and a string 𝑤, whether 𝑤 ∈ (𝐺)

(II) Given a Turing machine M, whether L(M) is regular

(III) Given two grammars 𝐺₁ and 𝐺₂, whether (𝐺₁) = (𝐺₂)

(IV) Given an NFA N, whether there is a deterministic PDA P such that N and P accept the same language.

Which one of the following statements is correct?

A lexical analyzer uses the following patterns to recognize three tokens T₁, T₂, and T₃ over the alphabet {a,b,c}.

𝑇₁: 𝑎? (𝑏|𝑐)∗𝑎

𝑇₂: 𝑏? (𝑎|𝑐)∗𝑏

𝑇₃: 𝑐? (𝑏|𝑎)∗𝑐

Note that ‘x?’ means 0 or 1 occurrence of the symbol x. Note also that the analyzer outputs the token that matches the longest possible prefix. If the string 𝑏𝑏𝑎𝑎𝑐𝑎𝑏𝑐 is processed by the analyzer, which one of the following is the sequence of tokens it outputs?

Consider the following parse tree for the expression a # b $c$ d # e # f, involving two binary operators $ and #.

Which one of the following is correct for the given parse tree?

In a system, there are three types of resources and four processes that execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[ ] is the maximum number of instances of that would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation.

Consider a state of the system with the Allocation matrix as shown below, and in which 3 instances of E and 3 instances of F are the only resources available.

From the perspective of deadlock avoidance, which one of the following is true?

Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is 𝑁. Three semaphores empty, full and mutex are defined with respective initial values of 0, 𝑁 and 1. Semaphore empty denotes the number of available slots in the buffer, for the consumer to read from. Semaphore denotes the number of available slots in the buffer, for the producer to write to. The placeholder variables, denoted by P, Q, R, and S, in the code below can be assigned either empty or full. The valid semaphore operations are: wait ( ) and signal ( ).

Which one of the following assignments to P, Q, R and S will yield the correct solution?

Consider the relations r(A, B) and s(B, C), where s*.B is a primary key and r.B is a foreign key referencing s.*B. Consider the query

Q: 𝑟 ⋈ (𝜎_𝐵<5(𝑠))

Let LOJ denote the natural left outer-join operation. Assume that r and s contain no null values.

Which one of the following queries is NOT equivalent to Q?

Consider the following four relational schemas. For each schema, all non-trivial functional dependencies are listed. The underlined attributes are the respective primary keys.

Schema I:

Field ‘courses’ is a set-valued attribute containing the set of courses a student has

registered for.

Non-trivial functional dependency:

rollno → courses

Schema II:

Non-trivial functional dependencies:

rollno, courseid → email

email → rollno

Schema III:

Non-trivial functional dependencies:

rollno, courseid → marks, grade

marks → grade

Schema IV:

Non-trivial functional dependencies:

rollno, courseid → credit

courseid → credit

Which one of the relational schemas above is in 3NF but not in BCNF?

Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1, 2, … , 100. There is an edge between vertices 𝑢 and 𝑣 if and only if the label of 𝑢 can be obtained by swapping two adjacent numbers in the label of 𝑣. Let 𝑦 denote the degree of a vertex in G, and 𝑧 denote the number of connected components in G.

Then, 𝑦 + 10𝑧 = _____.

Consider the following program written in pseudo-code. Assume that x and y are integers.

Count (x,y)  {

          if  (y !=  1) {

                if (x != 1) {

                    print ("*") ;

                    Count (x/2,  y) ;

                }

else {

                      y = y-1;

                      Count (1024,  y) ;

}

        }

}

The number of times that the print statement is executed by the call Count (1024,1024) is _____.

Consider Guwahati (G) and Delhi (D) whose temperatures can be classified as high (𝐻), medium (𝑀) and low (𝐿). Let (𝐻_𝐺) denote the probability that Guwahati has high temperature. Similarly, (𝑀_𝐺) and (𝐿_𝐺) denotes the probability of Guwahati having medium and low temperatures respectively. Similarly, we use (𝐻_𝐷), (𝑀_𝐷) and 𝑃(𝐿_𝐷) for Delhi. The following table gives the conditional probabilities for Delhi’s temperature given Guwahati’s temperature.

Consider the first row in the table above. The first entry denotes that if Guwahati has high temperature (𝐻_𝐺) then the probability of Delhi also having a high temperature (𝐻_𝐷) is 0.40; i.e., (𝐻_𝐷|𝐻_𝐺) = 0.40. Similarly, the next two entries are (𝑀_𝐷|𝐻_𝐺) = 0.48 and (𝐿_𝐷|𝐻_𝐺) = 0.12. Similarly for the other rows. If it is known that (𝐻_𝐺) = 0.2, (𝑀_𝐺) = 0.5, and 𝑃(𝐿_𝐺) = 0.3, then the probability (correct to two decimal places) that Guwahati has high temperature given that Delhi has high temperature is _______.

Consider the following undirected graph G:

Choose a value for x that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is ______.

Consider the weights and values of items listed below. Note that there is only one unit of each item.

The task is to pick a subset of these items such that their total weight is no more than 11 Kgs and their total value is maximized. Moreover, no item may be split. The total value of items picked by an optimal algorithm is denoted by 𝑉_opt. A greedy algorithm sorts the items by their value-to-weight ratios in descending order and packs them greedily, starting from the first item in the ordered list. The total value of items picked by the greedy algorithm is denoted by 𝑉_greedy.

The value of 𝑉_opt − 𝑉_greedy is ____________.

The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is _____.

Consider the minterm list form of a Boolean function 𝐹 given below.

$F(P,Q,R,S)=∑m(0,2,5,7,9,11)+d(3,8,10,12,14)$

Here, 𝑚 denotes a minterm and 𝑑 denotes a don’t care term. The number of essential prime implicants of the function 𝐹 is ______.

The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writeback (WB). The IF, ID, OF and WB stages take 1 clock cycle each for every instruction. Consider a sequence of 100 instructions. In the PO stage, 40 instructions take 3 clock cycles each, 35 instructions take 2 clock cycles each, and the remaining 25 instructions take 1 clock cycle each. Assume that there are no data hazards and no control hazards.

The number of clock cycles required for completion of execution of the sequence of instructions is ______.

A processor has 16 integer registers (R0, R1, .. , R15) and 64 floating point registers (F0, F1,… , F63). It uses a 2-byte instruction format. There are four categories of instructions: Type-1, Type-2, Type-3, and Type-4. Type-1 category consists of four instructions, each with 3 integer register operands (3Rs). Type-2 category consists of eight instructions, each with 2 floating point register operands (2Fs). Type-3 category consists of fourteen instructions, each with one integer register operand and one floating point register operand (1R+1F). Type-4 category consists of N instructions, each with a floating point register operand (1F).

The maximum value of N is __________.

Given a language 𝐿, define $L^i$ as follows:

$L^0={ε}$

$L^i=L^{i-1}⋅L\ For\ all\ i>0$

The order of a language is defined as the smallest such that 𝐿^𝑘 = 𝐿^𝑘+1.Consider the language L₁ (over alphabet 0) accepted by the following automaton:

The order of L₁ is ________

Consider an IP packet with a length of 4,500 bytes that includes a 20-byte IPv4 header and a 40-byte TCP header. The packet is forwarded to an IPv4 router that supports a Maximum Transmission Unit (MTU) of 600 bytes. Assume that the length of the IP header in all the outgoing fragments of this packet is 20 bytes. Assume that the fragmentation offset value stored in the first fragment is 0.

The fragmentation offset value stored in the third fragment is _______.

Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders (numbered as 0, 1, … , 199), and 256 sectors per track (numbered as 0, 1, … , 255). The following 6 disk requests of the form [sector number, cylinder number, platter number] are received by the disk controller at the same time: [120, 72, 2] , [180, 134, 1] , [60, 20, 0] , [212, 86, 3] , [56, 116, 2] , [118, 16, 1]  Currently the head is positioned at sector number 100 of cylinder 80, and is moving towards higher cylinder numbers. The average power dissipation in moving the head over 100 cylinders is 20 milliwatts and for reversing the direction of the head movement once is 15 milliwatts. Power dissipation associated with rotational latency and switching of head between different platters is negligible. The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _______.

Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carrier-sense-based medium access protocol. A node that receives a packet to transmit will carrier-sense the medium for 5 units of time. If the node does not detect any other transmission in this duration, it starts transmitting its packet in the next time unit. If the node detects another transmission, it waits until this other transmission finishes, and then begins to carrier-sense for 5-time units again. Once they start to transmit, nodes do not perform any collision detection and continue transmission even if a collision occurs. All transmissions last for 20 units of time. Assume that the transmission signal travels at the speed of 10 meters per unit time in the medium.

Assume that the system has two nodes P and Q, located at a distance of meters from each other. P starts transmitting a packet at time t= 0 after successfully completing its carrier-sense phase. Node Q has a packet to transmit at time t=0 and begins to carrier-sense the medium. The maximum distance (in meters, rounded to the closest integer) that allows Q to successfully avoid a collision between its proposed transmission and P’s ongoing transmission is _____.