The expenditure on the project_____________as follows : equipment Rs. 20 lakhs, Rs. 12 lakhs, and contingency Rs. 3 lakhs.

The search engine’s business model_________________around the fulcrum of trust.

Two cars start at the same time from the same location and go in the same direction. The speed of the first car is 50km/h and the speed of the second car is 60 km/h. The number of hours it takes for the distance between the two cars to be 20km is______.

Ten friends planned to share equally the cost of buying a gift for their teacher. When two of them decided not to contribute, each of the other friends paid Rs. 150 more. The cost of the gift was Rs._________.

A court is to a judge as_____________is to a teacher.

The police arrested four criminals – P, Q, R and S. The criminals knew each other. They made the following statements:

P says “Q committed the crime.”

Q says “S committed the crime.”

R says “I did not do it.”

S says “What Q said about me is false.”

Assume only one of the arrested four committed the crime and only one of the statements made above is true. Who committed the crime?

In the given diagram, teachers are represented in the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of people, the percentage of administrators shall be in the range of___________.

“A recent High Court judgement has sought to dispel the idea of begging as a disease which leads to its stigmatization and criminalization and to regard it as a symptom. The underlying disease is the failure of the state to protect citizens who fall through the social security net.”

Which one of the following statements can be inferred from the given passage?

In a college, there are three student clubs. Sixty students are only in the Drama club, 80 students are only in the Dance club, 30 students are only in the Maths club, 40 students are in both Drama and Dance clubs, 12 students are in both Dance and Maths clubs, 7 students are in both Drama and Maths clubs, and 2 students are in all the clubs. If 75% of the students in the college are not in any of these clubs, then the total number of students in the college is_______.

Three of the five students allocated to a hostel put in special requests to the warden. Given the floor plan of the vacant rooms, select the allocation plan that will accommodate all their requests.

Request by X: Due to pollen allergy, I want to avoid a wing next to the garden.

Request by Y: I want to live as far from the washrooms as possible since I am very sensitive to smell.

Request by Z: I believe in Vaastu and so want to stay in the South-west wing.

The shaded rooms are already occupied. WR is washroom

A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?

The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has 16 address lines denoted by to. What is the range of addresses (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal?

1. $\left| A \right|$ = $n2^{n-1}$
2. $\left| A \right|$ =$\sum_{n}^{k} = 1^{k}\left( \frac{n}{k} \right)$

Consider Z= X - Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in n bits. To avoid overflow, the representation of Z would require a minimum of:

1. X is invertible.
2. Determinant of X is non-zero.

Consider the following two statements about database transaction schedules:

1. A strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.
2. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable schedules that are not conflict serializable.

Which of the above statements is/are TRUE?

Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to

Compute $\lim_{x \to 3}\frac{x^{4}-81}{2x^{2}-5x-3}$

Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?

For $\Sigma = {a,b}$, let us consider the regular language L= $\left\{ x|x = a^{2+3k}or x = B^{10+12k},k\ge 0 \right\}$ Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L? 

Which of the following protocol pairs can be used to send and retrieve e-mails (in that order)?

Consider the following C function.

void convert (int n) {

if(n<0)

printf ( %d”, n);

else {

convert(n/2);

printf(n%d",n%2);

Which one of the following will happen when the function convert is called with any positive integer n as argument?

Consider the following C program:

#include <stdio.h>

int r () {

static int num=7;

}

return num--;

}

int main() {

for (r();r();r())

printf("%d", r.());

return 0;

}

Which one of the following values will be displayed on the execution of the programs?

Consider three machines M, N, and P with IP addresses 100.10.5.2, 100.10.5.5, and 100.10.5.6 respectively. The subnet mask is set to 255.255.255.252 for all three machines. Which one of the following is true?

Suppose that in an IP-over-Ethernet network, machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this?

Consider three 4-variable functions fi, f2, and f3, which are expressed in sum-of-minterms as

$f_{1} = \Sigma (0,2,5,8,14)$

$f_{2} = \Sigma (2,3,6,8,14,15)$

$f_{3} = \Sigma (2,7,11,14)$

For the following circuit with one AND gate and one XOR gate, the output function f can be expressed as:

Which one of the following languages over $\Sigma$ = {a,b} is NOT context-free? 

Let the set of functional dependencies F = {QR → SR → PS →Q} hold on a relation schema X= (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y =(PR) and Z=(QRS).

Consider the two statements given below.

1. Both Y and Z are in BCNF
2. Decomposition of X into Y and Z is dependency preserving and lossless

Which of the above statements is/are correct?

Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressible. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?

$\forall x\left[ \left( \forall z z|x\Rightarrow\left( \left( z = x \right)\vee \left( z = 1 \right) \right) \right)\Rightarrow \exists w\left( w\gt x \right)\wedge \left( \forall z z |w\Rightarrow \left( \left( w = z \right) \vee \left( z = 1 \right)\right)\right) \right]$

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let $x_{1},x_{2},x_{3},x_{4},x_{5}$ and $x_{6}$ be the placeholders for the non-terminals D, T, L or $L_{1}$ or  in the following table:

There are n unsorted arrays: $A_{1},A_{2},.......,A_{n}$.Assume that n is odd. Each of $A_{1},A_{2},.......,A_{n}$ contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_{1}, A_{2},......., A_{n}$ is

Let G be any connected, weighted, undirected graph.

1. G has a unique minimum spanning tree, if no two edges of G have the same weight.,
2. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut.

Which of the above two statements is/are TRUE?

Consider the following snapshot of a system running n concurrent processes. Process i is holding $x_{i}$ instances of a resource R, $1 \le i \le n$  Assume that all instances of R are currently in use. Further, for all i, process i can place a request for at most $y_{i}$  additional instances of R while holding the  $x_{i}$ instances it already has. Of the n processes, there are exactly two processes p and q such that $y_{p} =y_{q}$= 0. Which one of the conditions guarantees that no other process apart from p and q can complete execution? 

1. The smallest element in a max-heap is always at a leaf node
2. The second largest element in a max-heap is always a child of the root node
3. A max-heap can be constructed from a binary search tree in $\Theta(n)$ time
4. A binary search tree can be constructed from a max-heap in $\Theta(n)$ time

Consider the grammar given below:

$S\to Aa$

$A\to BD$

$B\to b|\in $

$D\to d|\in $

Let a, b, d, and $ be indexed as follows:

Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in the descending order. (For example, if the FOLLOW set is (a, b, d, $}, then the answer should be 3210).

An array of 25 distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to 2 decimal places).

Two numbers are chosen independently and uniformly at random from the set {1,2,..., 13}. The probability (rounded off to 3 decimal places) that their 4-bit (unsigned) binary representations have the same most significant bit is ______.

The processes are executed on a uniprocessor system running a time-shared operating system. If the minimum and maximum possible values of D after the three processes have completed execution are X and Y respectively, then the value of Y -X is______________.

Consider a sequence of 14 elements: A=[-5, -10, 6, 3,-1, -2, 13, 4, -9,-1, 4, 12, -3, 0]. The subsequence sum $S\left( i,j \right) = \sum_{k=j}^{j}A[k]$ Determine the maximum of S(i,j), where $0 \le i \le j \lt 14$.(Divide and conquer approach may be used.)

Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:

These processes are run on a single processor using a preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is______.

The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointer. The disk block size is 4 kB, and the disk block address is 32-bits long. The maximum possible file size is (rounded off to 1 decimal place)__________GB.

A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock. To service a cache miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 3 cycles to fetch all the eight words of the block, and finally transmits the words of the requested block at the rate of 1 word per cycle. The maximum bandwidth for the memory system when the program running on the processor issues a series of read operations is ________ $10^{6}$bytes/sec.

Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at random. The expected value of the distance between a and b in T i.e., the number of edges in the unique path between a and b) is (rounded off to 2 decimal places) ___________.

Suppose Y is distributed uniformly in the open interval (1,6). The probability that the polynomial $3x^{2}+6xY+3Y+6$ has only real roots is (rounded off to 1 decimal place)________.

Let I be the set of all bijections from{1,...,5} to {1,...,5}, where id denotes the identity function, i.e. id(j) = j,$\forall j$. Let $\circ$denote composition on functions. For a string $x = x_{1},x_{2}.......x_{n} \in \Sigma^{n},n\ge 0, let \Pi(x) = x_{1}\circ x_{2}\circ .......\circ x_{n}$.Consider the language $L = \left\{ x\in \Sigma^{*}|\Pi(x)=id \right\}$. The minimum number of states in any DFA accepting L is_____.

Consider that 15 machines need to be connected in a LAN using 8-port Ethernet Switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is

What is the minimum number of 2-input NOR gates required to implement a 4-variable function expressed in sum-of-minterms form as $f = \Sigma (0,2,5,7,8,10,13,15)$  Assume that all the inputs and their complements are available?

The primary key of the student table is Roll no. For the Performance table, the columns Roll_no, and Subject_code together form the primary key. Consider the SQL query given below:

SELECT S. Student name, sum(P.Marks)

FROM Student S, Performance P

WHERE P.Marks > 84 GROUP BY S. Student name;

The number of rows returned by the above SQL query is________.

Consider the following C program:

#include <stdio.h>

int main () {

float sum = 0.0, j = 1.0, i = 2.0;

while (ilj > 0.0625) {

j = j + j;

sum = sum + i/j;

printf ("%f\n", sum);

}

return 0;

}

The number of times the variable sum will be printed, when the above program is executed, is __________.

In an RSA cryptosystem, the value of the public modulus parameter n is 3007. If it is also known that $\Phi(n)=2880$, where $\Phi()$ denotes Euler's Totient Function, then the prime factor of n which is greater than 50 is_____________.