Dummy

// question: 13 name: 1

1::[html]

Which of the following options is the closest in meaning to the phrase underlined in the sentence below?

It is fascinating to see life forms cope with varied environmental conditions.

{

~%-33.33333%

adopt to

#

=

adapt to

~%-33.33333%

adept in

#

~%-33.33333%

accept with

####

}

// question: 23 name: 1

1::[html]

Consider the statement

"Not all that glitters is gold”

Predicate glitters$(x)$ is true if $x$ glitters and predicate gold$(x)$ is true if x is gold. Which one of the following logical formulae represents the above statement?

{

~%-33.33333%

$\\forall x\: glitters (x)\\Rightarrow \\neg gold(x)$

#

~%-33.33333%

$\\forall x\: gold (x)\\Rightarrow glitters(x)$

#

~%-33.33333%

$\\exists x\: gold(x)\\wedge \\neg glitters(x)$

#

=

$\\exists x\: glitters(x)\\wedge \\neg gold(x)$

} </quiz>

// question: 32 name: 10

10::[html]

Consider the following program in C language\:\n

\n

<code class\="language-C">\n\#include <stdio.h>\n\nmain()\n\{\n   int i;\n   int*pi \= &i; \n   \n   scanf("%d",pi);\n   printf("%d\\n", i+5);\n\}</code>\n

\nWhich one of the following statements is TRUE?
{

~%-33.33333%

Compilation fails.

#

~%-33.33333%

Execution results in a run-time error.

~%-33.33333%

On execution, the value printed is $5$ more than the address of variable i.

#

=

On execution, the value printed is $5$ more than the integer value entered.

}

// question: 33 name: 11

11::[html]

Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search on $G$, when $G$ is represented as an adjacency matrix?

{

~%-33.33333%

$\\Theta(n)$

#

~%-33.33333%

$\\Theta(n+m)$

#

=

$\\Theta(n^2)$

~

$\\Theta(m^2)$

}

// question: 35 name: 13

13::[html]

Consider the directed graph below given.

Which one of the following is TRUE?

{

~%-33.33333%

The graph does not have any topological ordering.

#

~%-33.33333%

Both PQRS and SRQP are topological orderings.

#

=

Both PRSQ and SPRQ are topological orderings.

#

~%-33.33333%

PSRQ is the only topological ordering.

}

// question: 36 name: 14

14::[html]

Let $P$ be quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by P for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

{

~%-33.33333%

$t_1 \= 5$

#

~%-33.33333%

$t_1 < t_2$

#

=

$t_1>t_2$

#

~%-33.33333%

$t_1 \= t_2$

}

// question: 37 name: 15

15::[html]

Which one of the following is TRUE?

{

~%-33.33333%

The language $L \= \\left\\\{a^nb^n|n \\geq 0\\right\\\}$ is regular.

#

~%-33.33333%

The language $L \= \\left\\\{a^n|n \\text\{ is prime \}\\right\\\}$ is regular.

#

=

The language $L$\= $\\left\\\{ w | w \\text\{ has \} 3k+1 \\text\{ \} b's \\text\{ for some \} k\\in \\mathbb\{N\} \\text\{ with \} \\Sigma\=\\left\\\{ a,b \\right\\\}\\right\\\}$ is regular.

#

~%-33.33333%

The language $L \= \\left\\\{ww| \\in \\Sigma^* \\text\{ with \} \\Sigma \= \\left\\\{0,1\\right\\\}\\right\\\}$ is regular.

}

// question: 38 name: 16

16::[html]

Consider the finite automaton in the following figure\:

What is the set of reachable states for the input string 0011?

{

=

\{$q_0,q_1,q_2$\}

#

~%-33.33333%

\{$q_0,q_1$\}

#

~%-33.33333%

\{$q_0,q_1,q_2,q_3$\}

#

~%-33.33333%

\{$q_3$\}

}

// question: 39 name: 17

17::[html]

Which one of the following is FALSE?

{

~%-33.33333%

A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end.

#

~%-33.33333%

Available expression analysis can be used for common subexpression elimination.

#

~%-33.33333%

Live variable analysis can be used for dead code elimination.

#

=

$x\=4*5 \\Rightarrow x\=20$ is an example of common subexpression elimination.

####

}

// question: 40 name: 18

18::[html]Match the following\:

\n\n\n<thead>\n\n\n\n\n</thead>\n<tbody>\n\n\n\n\n\n\n\n\n\n\n\n\n</tbody>\n


1) Waterfall model	a) Specifications can be developed incrementally
2) Evolutionary model	b) Requirements compromises are inevitable
3) Component-based software engineering	c) Explicit recognition of risk
4) Spiral development	d) Inflexible partitioning of the project into stages

\n

\n\n

{

~%-33.33333%

1-a, 2-b, 3-c, 4-d

#

=

1-d, 2-a, 3-b, 4-c

#

~%-33.33333%

1-d, 2-b, 3-a, 4-c

#

~%-33.33333%

1-c, 2-a, 3-b, 4-d

}

// question: 14 name: 2

2::[html]

Choose the most appropriate word from the options given below to complete the following sentence.

He could not understand the judges awarding her the first prize, because he thought that her performance was quite _________.

{

~%-33.33333%

superb

#

~%-33.33333%

medium

#

=

mediocre

#

~%-33.33333%

exhilarating

}

// question: 42 name: 20

20::[html]

Which one of the following is FALSE?

{

~%-33.33333%

User level threads are not scheduled by the kernel.

#

~%-33.33333%

When a user level thread is blocked, all other threads of its process are blocked.

#

~%-33.33333%

Context switching between user level threads is faster than context switching between kernel level threads.

#

=

Kernel level threads cannot share the code segment.

}

// question: 43 name: 21

21::[html]

Consider the relation scheme $R \= (E, F, G, H, I, J, K, L, M, N)$ and the set of functional dependencies $\\left\\\{\\left\\\{E, F\\right\\\} \\to \\\{G\\\}, \\\{F\\\} \\to \\\{I, J\\\}, \\\{E, H\\\} \\to \\\{K, L\\\}, \\\{K\\\} \\to \\\{M\\\}, \\\{L\\\} \\to \\\{N\\\}\\right\\\}$ on $R$ What is the key for $R$?

{

~%-33.33333%

$\\\{E, F\\\}$

#

=

$\\\{E, F, H\\\}$

#

~%-33.33333%

$\\\{E, F, H, K, L\\\}$

#

~%-33.33333%

$\\\{E\\\}$

}

// question: 44 name: 22

22::[html]

Given the following statements\:

S1\: A foreign key declaration can always be replaced by an equivalent check assertion in SQL.

S2\: Given the table $R(a,b,c)$ where $a$ and $b$ together form the primary key, the following is a valid table definition.

\n\n

 <code class\="language-sql">\nCREATE TABLE S ( \n     a INTEGER, \n     d INTEGER, \n     e INTEGER, \n     PRIMARY KEY (d), \n     FOREIGN KEY (a) references R)\n</code>

\n\n

Which one of the following statements is CORRECT?

{

~%-33.33333%

S1 is TRUE and S2 is FALSE.

#

~%-33.33333%

Both S1 and S2 are TRUE.

#

~%-33.33333%

S1 is FALSE and S2 is TRUE.

#

=

Both S1 and S2 are FALSE.

}

// question: 45 name: 23

23::[html]

Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links.

[S1] The computational overhead in link state protocols is higher than in distance vector protocols.

[S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol.

[S3] After a topology change, a link state protocol will converge faster than a distance vector protocol.

Which one of the following is correct about S1, S2, and S3 ?

{

~%-33.33333%

S1, S2, and S3 are all true.

#

~%-33.33333%

S1, S2, and S3 are all false.

#

~%-33.33333%

S1 and S2 are true, but S3 is false.

#

=

S1 and S3 are true, but S2 is false.

}

// question: 46 name: 24

24::[html]

Which of the following are used to generate a message digest by the network security protocols?

(P) RSA (Q) SHA$-$1 (R) DES (S) MD5

{

~%-33.33333%

P and R only

#

~%-33.33333%

Q and R only

#

=

Q and S only

#

~%-33.33333%

R and S only

}

// question: 47 name: 25

25::[html]

Identify the correct order in which the following actions take place in an interaction between a web browser and a web server.

1. The web browser requests a webpage using HTTP.

2. The web browser establishes a TCP connection with the web server.

3. The web server sends the requested webpage using HTTP.

4. The web browser resolves the domain name using DNS.

{

=

4, 2, 1, 3

#

~%-33.33333%

1, 2, 3, 4

#

~%-33.33333%

4, 1, 2, 3

#

~%-33.33333%

2, 4, 1, 3

####

}

// question: 51 name: 29

29::[html]

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by $r(x)$ and $w(x)$ respectively. Which one of them is conflict serializable?

{

~%-33.33333%

$r_1(x)$; $r_2(x)$; $w_1(x)$; $r_3(x)$; $w_2(x)$;

#

~%-33.33333%

$r_2(x)$; $r_1(x)$; $w_2(x)$; $r_3(x)$; $w_1(x)$;

#

~%-33.33333%

$r_3(x)$; $r_2(x)$; $r_1(x)$; $w_2(x)$; $w_1(x)$;

#

=

$r_2(x)$; $w_2(x)$; $r_3(x)$; $r_1(x)$; $w_1(x)$;

}

// question: 15 name: 3

3::[html]

In a press meet on the recent scam, the minister said, "The buck stops here". What did the minister convey by the statement?

{

~%-33.33333%

He wants all the money

#

~%-33.33333%

He will return the money

#

=

He will assume final responsibility

#

~%-33.33333%

He will resist all enquiries

}

// question: 25 name: 3

3::[html]

Let $G\=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected components as $G$ ?

{

~%-33.33333%

$G_1$ \= $(V,E_1)$ where $E_1$ \= $\\left\\\{(u,v)| (u,v) \\notin E\\right\\\}$

#

=

$G_2$ \= $(V,E_2)$ where $E_2$ \= $\\left\\\{(u,v)| (v,u) \\in E \\right\\\}$

#

~%-33.33333%

$G_3$ \= $(V,E_3)$ where $E_3$ \= \{(u,v)| there is a path of length $\\leq2$ from $u$ to $v$ in $E$ \}

~%-33.33333%

$G_4$ \= $(V_4,E)$ where $V_4$ is the set of vertices in $G$ which are not isolated

####

}

// question: 52 name: 30

30::[html]

Given the following two statements\:

S1\: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF.

S2\: $AB \\to C$. $D \\to E$, $E \\to C$ is a minimal cover for the set of functional dependencies $AB \\to C$, $D \\to E$, $AB \\to E$, $E \\to C$.

Which one of the following is CORRECT?

{

=

S1 is TRUE and S2 is FALSE.

#

~%-33.33333%

Both S1 and S2 are TRUE.

#

~%-33.33333%

S1 is FALSE and S2 is TRUE.

#

~%-33.33333%

Both S1 and S2 are FALSE.

####

}

// question: 53 name: 31

31::[html]

An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution.

\n <tbody>\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n</tbody>

\n \n	\n Allocation \n	\n Max \n
\n \n	\n X \n	\n Y \n	\n Z \n	\n X \n	\n Y \n	\n Z \n
\n P0 \n	\n 0 \n	\n 0 \n	\n 1 \n	\n 8 \n	\n 4 \n	\n 3 \n
\n P1 \n	\n 3 \n	\n 2 \n	\n 0 \n	\n 6 \n	\n 2 \n	\n 0 \n
\n P2 \n	\n 2 \n	\n 1 \n	\n 1 \n	\n 3 \n	\n 3 \n	\n 3 \n

There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state\:

REQ1\: P0 requests 0 units of X, 0 units of Y and 2 units of Z

REQ2\: P1 requests 2 units of X, 0 units of Y and 0 units of Z

Which one of the following is TRUE?

{

~%-33.33333%

Only REQ1 can be permitted.

#

=

Only REQ2 can be permitted.

#

~%-33.33333%

Both REQ1 and REQ2 can be permitted.

#

~%-33.33333%

Neither REQ1 nor REQ2 can be permitted.

####

}

// question: 56 name: 34

34::[html]

A canonical set of items is given below

$S \\to L .> R $

$Q \\to R$

On input symbol $<$ the set has

{

~%-33.33333%

a shift-reduce conflict and a reduce-reduce conflict.

#

~%-33.33333%

a shift-reduce conflict but not a reduce-reduce conflict.

#

~%-33.33333%

a reduce-reduce conflict but not a shift-reduce conflict.

#

=

neither a shift-reduce nor a reduce-reduce conflict.

####

}

// question: 57 name: 35

35::[html]

Let $L$ be a language and $\\bar\{L\}$ be its complement. Which one of the following is NOT a viable possibility?

{

~%-33.33333%

Neither $L$ nor $\\bar\{L\}$ is recursively enumerable $(r.e.)$.

#

~%-33.33333%

One of $L$ and $\\bar\{L\}$ is r.e. but not recursive; the other is not r.e.

=

Both $L$ and $\\bar\{L\}$ are r.e. but not recursive.

~%-33.33333%

Both $L$ and $\\bar\{L\}$ are recursive.

####

}

// question: 58 name: 36

36::[html]

Which of the regular expressions given below represent the following DFA?

I) $0^*1(1+00^*1)^* $

II) $0^*1^*1+11^*0^*1 $

III) $(0+1)^*1$

{

~%-33.33333%

I and II only

#

=

I and III only

#

~%-33.33333%

II and III only

#

~%-33.33333%

I, II and III

####

}

// question: 60 name: 38

38::[html]

Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?

{

~%-33.33333%

#

~%-33.33333%

#

~%-33.33333%

#

=

####

}

// question: 62 name: 40

40::[html]

Consider a hash table with 9 slots. The hash function is $h(k)\= k \\mod 9$. The collisions are resolved by chaining. The following 9 keys are inserted in the order\: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum, minimum, and average chain lengths in the hash table, respectively, are

{

=

3, 0, and 1

#

~%-33.33333%

3, 3, and 3

#

~%-33.33333%

4, 0, and 1

#

~%-33.33333%

3, 0, and 2

#

####

}

// question: 63 name: 41

41::[html]

Consider the following C function in which size is the number of elements in the array E\:

\n

<code class\="language-C">\nint MyX(int *E, unsigned int size) \n\{ \n   int Y \= 0; \n   int Z; \n   int i, j, k; \n\n   for(i \= 0; i< size; i++) \n          Y \= Y + E[i]; \n          for(i\=0; i < size; i++) \n             for(j \= i; j < size; j++)\n             \{\n                  Z \= 0; \n                  for(k \= i; k <\= j; k++) \n                       if(z > Y) \n                           Y \= Z; \n               \} \n   return Y; \n\} \n</code>

\nThe value returned by the function MyX is the

{

=

maximum possible sum of elements in any sub-array of array E.

#

~%-33.33333%

maximum element in any sub-array of array E.

#

~%-33.33333%

sum of the maximum elements in all possible sub-arrays of array E.

#

~%-33.33333%

the sum of all the elements in the array E.

#

####

}

// question: 64 name: 42

42::[html]

Consider the following pseudo code. What is the total number of multiplications to be performed?

\n

\n<code class\="language-c">\n D \= 2 \n for i \= 1 to n do \n    for j \= i to n do \n       for k \= j + 1 to n do \n          D \= D * 3 \n</code>

{

~%-33.33333%

Half of the product of the 3 consecutive integers.

#

~%-33.33333%

One-third of the product of the 3 consecutive integers.

#

=

One-sixth of the product of the 3 consecutive integers.

#

~%-33.33333%

None of the above.

####

}

// question: 66 name: 44

44::[html]

An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by $k$. What is the miss ratio if the access sequence is passed through a cache of associativity $ A\\geq k $ exercising least-recently-used replacement policy?

{

=$n/N$#

~%-33.33333%

$1/N$

#

~%-33.33333%

$1/A$

#

~%-33.33333%

$k/n$

####

}

// question: 67 name: 45

45::[html]

Consider the 4-to-0 multiplexer with two select lines $ S_1$ and $ S_0 $ given below

The minimal sum-of-products form of the Boolean expression for the output $F$ of the multiplexer is

{

=

$\\bar\{P\}Q + Q\\bar\{R\} + P\\bar\{Q\}R$

#

~%-33.33333%

$\\bar\{P\}Q + \\bar\{P\}Q\\bar\{R\} + PQ\\bar\{R\} + P\\bar\{Q\}R$

#

~%-33.33333%

$\\bar\{P\}QR + \\bar\{P\}Q\\bar\{R\} + Q\\bar\{R\} + P\\bar\{Q\}R$

#

~%-33.33333%

$PQ\\bar\{R\}$

####

}

// question: 69 name: 47

47::[html]

A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) \= f(2) \= -1$ and $f(1) \= 1$. Which one of the following statements must be true?

{

=

There exists a $y$ in the interval $(0,1)$ such that $f(y) \= f(y+1)$

#

~%-33.33333%

For every $y$ in the interval $(0,1)$,$f(y)$ \= $f(2-y)$

#

~%-33.33333%

The maximum value of the function in the interval $(0,2)$ is 1

#

~%-33.33333%

There exists a $y$ in the interval $(0,1)$ such that $f(y)$ \= $-f(2-y)$

####

}

// question: 17 name: 5

5::[html]

The roots of $ax^2+bx+c \= 0$ are real and positive. $a$, $b$ and $c$ are real. Then $ax^2+b|x|+c \= 0$ has

{

~%-33.33333%

no roots

#

~%-33.33333%

2 real roots

#

~%-33.33333%

3 real roots

#

=

4 real roots

}

// question: 74 name: 52

52::[html]

An ordered $n-$tuple $(d_1, d_2,....,d_n)$ with $d_1 \\geq d_2 \\geq ... \\geq d_n$ is called graphic if there exists a simple undirected graph with $n$ vertices having degrees $d_1,d_2,...,d_n$ respectively. Which one of the following 6-tuples is NOT graphic?

{

~%-33.33333%

$(1,1,1,1,1,1)$

#

~%-33.33333%

$(2,2,2,2,2,2)$

#

=

$(3,3,3,1,0,0)$

#

~%-33.33333%

$(3,2,1,1,1,0)$

####

}

// question: 75 name: 53

53::[html]

Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE?

{

~%-33.33333%

$(( p \\leftrightarrow q) \\wedge r) \\vee (p \\wedge q \\wedge \\sim r)$

#

=

$( \\sim (p \\leftrightarrow q) \\wedge r)\\vee (p \\wedge q \\wedge \\sim r)$

#

~%-33.33333%

$( (p \\to q) \\wedge r) \\vee (p \\wedge q \\wedge \\sim r)$

#

~%-33.33333%

$(\\sim (p \\leftrightarrow q) \\wedge r) \\wedge (p \\wedge q \\wedge \\sim r) $

####

}

// question: 76 name: 54

54::[html]

Given the following schema\:

employees(emp-id, first-name, last-name, hire-date, dept-id, salary)

departments(dept-id, dept-name, manager-id, location-id)

You want to display the last names and hire dates of all latest hires in their respective departments in the location ID 1700. You issue the following query\:\n

<code class\="language-sql"><span class\="pln">\nSQL</span><span class\="pun">></span><span class\="pln">SELECT </span><span class\="kwd">last</span><span class\="pun">-</span><span class\="pln">name</span><span class\="pun">,</span><span class\="pln"> hire</span><span class\="pun">-</span><span class\="pln">date  \n         FROM employees \n         WHERE </span><span class\="pun">(</span><span class\="pln">dept</span><span class\="pun">-</span><span class\="pln">id</span><span class\="pun">,</span><span class\="pln"> hire</span><span class\="pun">-</span><span class\="pln">date</span><span class\="pun">)</span><span class\="pln"> IN \n         </span><span class\="pun">(</span><span class\="pln">SELECT dept</span><span class\="pun">-</span><span class\="pln">id</span><span class\="pun">,</span><span class\="pln"> MAX</span><span class\="pun">(</span><span class\="pln">hire</span><span class\="pun">-</span><span class\="pln">date</span><span class\="pun">)</span><span class\="pln"> \n         FROM employees JOIN departments USING</span><span class\="pun">(</span><span class\="pln">dept</span><span class\="pun">-</span><span class\="pln">id</span><span class\="pun">)</span><span class\="pln"> \n         WHERE location</span><span class\="pun">-</span><span class\="pln">id </span><span class\="pun">\=</span><span class\="lit">1700</span><span class\="pln"> \n         GROUP BY dept</span><span class\="pun">-</span><span class\="pln">id</span><span class\="pun">);</span></code>

\n\nWhat is the outcome?{

~%-33.33333%

It executes but does not give the correct result

#

=

It executes and gives the correct result.

#

~%-33.33333%

It generates an error because of pairwise comparison.

#

~%-33.33333%

It generates an error because of the GROUP BY clause cannot be used with table joins in a sub-query.

####

}

// question: 18 name: 6

6::[html]

The Palghat Gap (or Palakkad Gap) , a region about 30 km wide in the southern part of the Western Ghats in India, is lower than the hilly terrain to its north and south. The exact reasons for the formation of this gap are not clear. It results in the neighbouring regions of Tamil Nadu getting more rainfall from the South West monsoon and the neighbouring regions of Kerala having higher summer temperatures.

What can be inferred from this passage?

{

~%-33.33333%

The Palghat gap is caused by high rainfall and high temperatures in southern Tamil Nadu and Kerala

#

~%-33.33333%

The regions in Tamil Nadu and Kerala that are near the Palghat Gap are low-lying

#

=

The low terrain of the Palghat Gap has a significant impact on weather patterns in neighbouring parts of Tamil Nadu and Kerala

#

~%-33.33333%

Higher summer temperatures result in higher rainfall near the Palghat Gap area

####

}

// question: 28 name: 6

6::[html]

Let the function

$$f(\\theta) \= \\begin\{vmatrix\} \\sin\\theta & \\cos\\theta & \\tan\\theta \\\\ \\sin(\\frac\{\\pi\}\{6\}) & \\cos(\\frac\{\\pi\}\{6\}) & \\tan(\\frac\{\\pi\}\{6\}) & \\\\ \\sin(\\frac\{\\pi\}\{3\}) & \\cos(\\frac\{\\pi\}\{3\}) & \\tan(\\frac\{\\pi\}\{3\}) \\end\{vmatrix\}\n$$

\n

where

$\\theta \\in \\left[ \\frac\{\\pi\}\{6\},\\frac\{\\pi\}\{3\} \\right]$ and $f'(\\theta)$ denote the derivative of $f$ with respect to $\\theta$. Which of the following statements is/are TRUE?

(I) There exists $\\theta \\in (\\frac\{\\pi\}\{6\},\\frac\{\\pi\}\{3\})$ such that $f'(\\theta) \= 0$

(II) There exists $\\theta \\in (\\frac\{\\pi\}\{6\},\\frac\{\\pi\}\{3\})$ such that $f'(\\theta)\\neq 0$

{

~%-33.33333%

I only

#

~%-33.33333%

II only

#

=

Both I and II

#

~%-33.33333%

Neither I Nor II

}

// question: 19 name: 7

7::[html]

Geneticists say that they are very close to confirming the genetic roots of psychiatric illnesses such as depression and schizophrenia, and consequently, that doctors will be able to eradicate these diseases through early identification and gene therapy.

On which of the following assumptions does the statement above rely?

{

~%-33.33333%

Strategies are now available for eliminating psychiatric illnesses

#

=

Certain psychiatric illnesses have a genetic basis

#

~%-33.33333%

All human diseases can be traced back to genes and how they are expressed

#

~%-33.33333%

In the future, genetics will become the only relevant field for identifying psychiatric illnesses

####

}

// question: 29 name: 7

7::[html]

Consider the following Boolean expression for F\:

$F(P,Q,R,S)\= PQ + \\bar\{P\}QR + \\bar\{P\}Q\\bar\{R\}S$

The minimal sum$-$of$-$products form of $F$ is

{

=

$PQ+QR+QS$

#

~%-33.33333%

$P+Q+R+S$

#

~%-33.33333%

$\\bar\{P\} + \\bar\{Q\}+ \\bar\{R\}+ \\bar\{S\}$

#

~%-33.33333%

$\\bar\{P\}R + \\bar\{R\} \\bar\{P\}S+P$

}

// question: 11 name: test_

test_::[html]

An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array $A[0\: n -1]$ is given below.

\n

Let $L_\{i\}$ denote the length of the longest monotonically increasing sequence starting at index $i$ in the array.

\n

Initialize $L_\{n-1\} \= 1$.

\n

For all $i$ such that $0\\leq i\\leq n-2$

\n

$L_\{i\} \= \\left \\\{ \\frac\{1+L_\{i+1\}\}\{1\}\\right \\\}\\frac\{if A\\left [ 1 \\right ]< A\\left [ i+1 \\right ]\}\{Otherwise\}\\right \\\}$

\n

Finally the length of the longest monotonically increasing sequence is Max $(L_\{0\}, L_\{1\},….. L_\{n-1\})$. Which of the following statements is <b>TRUE</b>?

{

~

2

~

3

=

9

}

// question: 22 name: 10

10::[html]

When a point inside of a tetrahedron (a solid with four triangular surfaces) is connected by straight lines to its corners, how many (new) internal planes are created with these lines? _____________

{#

=%100%6:0#

####

}

// question: 34 name: 12

12::[html]

Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes is $O(n^a\\log^bn)$. Then the value of $a+10b$ is __________.

{#

=%100%1:0# }

// question: 41 name: 19

19::[html]

Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder 100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135 and 145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request for cylinder 90 is serviced after servicing ____________ number of requests.

{#

=%100%3:0# }

// question: 24 name: 2

2::[html]

Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________ .

{#

=%100%0.24:0.27#

####

}

// question: 48 name: 26

26::[html]

Consider a token ring network with a length of 2 km having 10 stations including a monitoring station. The propagation speed of the signal is $2 \\times10^8m/s$ and the token transmission time is ignored. If each station is allowed to hold the token for $2 µsec$, the minimum time for which the monitoring station should wait (in $µsec$) before assuming that the token is lost is _______.

{#

=%100%28:30#

####

}

// question: 49 name: 27

27::[html]

Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window is _________.

{#

=%100%1100:1300#

####

}

// question: 50 name: 28

28::[html]

Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a one-way latency of 50 msec. To achieve a link utilization of $60\\%$, the minimum number of bits required to represent the sequence number field is ________.

{#

=%100%5:0#

####

}

// question: 54 name: 32

32::[html]

Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.

\n <tbody>\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n</tbody>

\n Process Name \n	\n Arrival Time \n	\n Execution Time \n
\n A \n	\n 0 \n	\n 6 \n
\n B \n	\n 3 \n	\n 2 \n
\n C \n	\n 5 \n	\n 4 \n
\n D \n	\n 7 \n	\n 6 \n
\n E \n	\n 10 \n	\n 3 \n

Using the shortest remaining time first scheduling algorithm, the average process turnaround time (in msec) is ____________________.

{#

=%100%7.2:0#

####

}

// question: 55 name: 33

33::[html]

Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the optimal replacement policy is__________.

{#

=%100%7:0#

####

}

// question: 59 name: 37

37::[html]

There are 5 bags labeled 1 to 5. All the coins in a given bag have the same weight. Some bags have coins of weight 10 gm, others have coins of weight 11 gm. I pick 1, 2, 4, 8, 16 coins respectively from bags 1 to 5. Their total weight comes out to 323 gm. Then the product of the labels of the bags having 11 gm coins is ___.

{#

=%100%12:0#

####

}

// question: 61 name: 39

39::[html]

The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is ________________.

{#

=%100%147.1:148.1#

####

}

// question: 16 name: 4

4::[html]

If $(z +1/z)^2\=98$, compute $(z^2 +1/z^2)$.

{#

=%100%96:0# }

// question: 26 name: 4

4::[html]

Consider the following system of equations\:

$3x + 2y \= 1 $

$4x + 7z \= 1 $

$x + y + z \= 3$

$x - 2y + 7z \= 0$

The number of solutions for this system is __________________

{#

=%100%1:0#

####

}

// question: 65 name: 43

43::[html]

Consider a 6-stage instruction pipeline, where all stages are perfectly balanced.Assume that there is no cycle-time overhead of pipelining. When an application is executing on this 6-stage pipeline, the speedup achieved with respect to non-pipelined execution if 25% of the instructions incur 2 pipeline stall cycles is ______________________.

{#

=%100%4:0#

####

}

// question: 68 name: 46

46::[html]

The function $f(x) \=x \\sin x$ satisfies the following equation\: $f(x) + f(x) +t \\cos x \= 0$. The value of $t$ is______.

{#

=%100%-2:0#

####

}

// question: 70 name: 48

48::[html]

Four fair six-sided dice are rolled. The probability that the sum of the results being 22 is $\\frac\{X\}\{1296\}$. The value of $X$ is _______

{#

=%100%10:0#

####

}

// question: 71 name: 49

49::[html]

A pennant is a sequence of numbers, each number being 1 or 2. An n-pennant is a sequence of numbers with sum equal to n. For example, $(1,1,2)$ is a 4-pennant. The set of all possible 1-pennants is $\{(1)\}$, the set of all possible 2-pennants is $\{(2), (1,1)\}$ and the set of all 3-pennants is $\{(2,1), (1,1,1), (1,2)\}$. Note that the pennant $(1,2)$ is not the same as the pennant $(2,1)$. The number of 10-pennants is________

{#

=%100%88.9:89.1#

####

}

// question: 27 name: 5

5::[html]

The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is _____________________

{#

=%100%0:0#

}

// question: 72 name: 50

50::[html]

Let ܵ $S$ denote the set of all functions $f\:\\\{0,1\\\}^4 \\to \\\{0,1\\\}$. Denote by $N$ the number of functions from S to the set $\\\{0,1\\\}$. The value of $ \\log_2 \\log_2N $ is _______.

{#

=%100%16:0#

####

}

// question: 73 name: 51

51::[html]

Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j)\:1 \\leq i \\leq 12, 1 \\leq j \\leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \\leq 1$ and $|b-d| \\leq 1$. The number of edges in this graph is______.

{#

=%100%506:0#

####

}

// question: 77 name: 55

55::[html]

Consider two processors $P_1$ and $P_2$ executing the same instruction set. Assume that under identical conditions, for the same input, a program running on $P_2$ takes 25% less time but incurs 20% more CPI (clock cycles per instruction) as compared to the program running on $P_1$. If the clock frequency of $P_1$ is 1GHZ, then the clock frequency of $P_2$ (in GHz) is ______.

{#

=%100%1.6:0#

####

}

// question: 20 name: 8

8::[html]

Round-trip tickets to a tourist destination are eligible for a discount of 10% on the total fare. In addition, groups of 4 or more get a discount of 5% on the total fare. If the one way single person fare is Rs 100, a group of 5 tourists purchasing round-trip tickets will be charged Rs _________.

{#

=%100%850:0#

####

}

// question: 30 name: 8

8::[html]

The base (or radix) of the number system such that the following equation holds is____________.

$\\frac\{312\}\{20\} \= 13.1$

{#

=%100%5:0#

}

// question: 21 name: 9

9::[html]

In a survey, 300 respondents were asked whether they own a vehicle or not. If yes, they were further asked to mention whether they own a car or scooter or both. Their responses are tabulated below. What percent of respondents do not own a scooter?

\n <tbody>\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n</tbody>

\n \n	\n \n	\n Men \n	\n Women \n
\n Own vehicle \n	\n Car \n	\n 40 \n	\n 34 \n
\n Scooter \n	\n 30 \n	\n 20 \n
\n Both \n	\n 60 \n	\n 46 \n
\n Do not own vehicle \n	\n 20 \n	\n 50 \n

{#

=%100%48:0#

####

}

// question: 31 name: 9

9::[html]

A machine has a 32-bit architecture, with 1-word long instructions. It has 64 registers, each of which is 32 bits long. It needs to support 45 instructions, which have an immediate operand in addition to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is ____________

{#

=%100%16383:0#

####

}