Turing Prep | Previous Year Questions

Question : 1

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

India is a post-colonial country because

it was a former British colony

Indian Information Technology professionals have colonized the world

India does not follow any colonial practices

India has helped other countries gain freedom

Correct Answer : A

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 2

Who ___________ was coming to see us this evening?

you said

did you say

did you say that

had you said

Correct Answer : B

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 3

Match the columns.

Column 1
1) eradicate
2) distort
3) saturate
4) utilize

Column 2
P) misrepresent
Q) soak completely
R) use
S) destroy utterly

1:S, 2:P, 3:Q, 4:R

1:P, 2:Q, 3:R, 4:S

1:Q, 2:R, 3:S, 4:P

1:S, 2:P, 3:R, 4:Q

Correct Answer : A

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 4

What is the average of all multiples of 10 from 2 to 198?

90

100

110

120

Correct Answer : B

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 5

The value of $\sqrt{12+\sqrt{12+\sqrt{12+\dots}}}$ is

3.464

3.932

4.000

4.444

Correct Answer : C

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 6

The old city of Koenigsberg, which had a German majority population before World War 2, is now called Kaliningrad. After the events of the war, Kaliningrad is now a Russian territory and has a predominantly Russian population. It is bordered by the Baltic Sea on the north and the countries of Poland to the south and west and Lithuania to the east respectively. Which of the statements below can be inferred from this passage?

Kaliningrad was historically Russian in its ethnic make up

Kaliningrad is a part of Russia despite it not being contiguous with the rest of Russia

Koenigsberg was renamed Kaliningrad, as that was its original Russian name

Poland and Lithuania are on the route from Kaliningrad to the rest of Russia

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 7

The number of people diagnosed with dengue fever (contracted from the bite of a mosquito) in north India is twice the number diagnosed last year. Municipal authorities have concluded that measures to control the mosquito population have failed in this region.

Which one of the following statements, if true, does not contradict this conclusion?

A high proportion of the affected population has returned from neighbouring countries where dengue is prevalent

More cases of dengue are now reported because of an increase in the Municipal Office’s administrative efficiency

Many more cases of dengue are being diagnosed this year since the introduction of a new and effective diagnostic test

The number of people with malarial fever (also contracted from mosquito bites) has increased this year

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 8

If $x$ is real and $\mid x^2-2x+3 \mid = 11$, then possible values of $\mid -x^3+x^2-x\mid$ include

2, 4

2, 14

4, 52

14, 52

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 9

The ratio of male to female students in a college for five years is plotted in the following line graph. If the number of female students doubled in 2009, by what percent did the number of male students increase in 2009?

Correct Answer : 140

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 10

At what time between 6 𝑎.𝑚. and 7 𝑎.𝑚. will the minute hand and hour hand of a clock make an angle closest to 60^∘?

6: 22 𝑎.𝑚.

6: 27 𝑎. 𝑚.

6: 38 𝑎.𝑚.

6: 45 𝑎. 𝑚.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 11

The security system at an IT office is composed of 10 computers of which exactly four are working. To check whether the system is functional, the officials inspect four of the computers picked at random (without replacement). The system is deemed functional if at least three of the four computers inspected are working. Let the probability that the system is deemed functional be denoted by $p$. Then 100$p$_____________ = .

Correct Answer : 11.85 to 11.95

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 12

Each of the nine words in the sentence ”The quick brown fox jumps over the lazy dog” is written on a separate piece of paper. These nine pieces of paper are kept in a box. One of the pieces is drawn at random from the box. The expected length of the word drawn is _____________. (The answer should be rounded to one decimal place.)

Correct Answer : 3.8 to 3.9

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 13

The maximum number of edges in a bipartite graph on 12 vertices is __________________________.

Correct Answer : 36

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 14

If the matrix $A$ is such that

$A= \begin{bmatrix} 2\\ −4\\7\end{bmatrix}\begin{bmatrix}1& 9& 5\end{bmatrix}$

then the determinant of $A$ is equal to ______.

Correct Answer : 0

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 15

A non-zero polynomial ݂$f(x)$ of degree 3 has roots at $x = 1 , x = 2$ and $x = 3$ Which one of the following must be TRUE?

$f(0)f(4)< 0$

$f(0)f(4)> 0$

$f(0)+f(4)> 0$

$f(0)+f(4)< 0$

Correct Answer : A

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 16

The dual of a Boolean function $F(x_1,x_2,\dots,x_n,+, .,')$ written as $F^D$ is the same expression as that of $F$ with + and ⋅ swapped. $F$ is said to be self-dual if $F = F^D$. The number of self-dual functions with $n$ Boolean variables is

$2^n$

$2^{n-1}$

$2^{2^n}$

$2^{2^{n-1}}$

Correct Answer : D

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 17

Let ݇$k = 2^n$. A circuit is built by giving the output of an ݊$n$-bit binary counter as input to an ݊$n$-to-$2^n$ bit decoder. This circuit is equivalent to a

$k$݇-bit binary up counter.

$k$݇-bit binary down counter.

$k$݇-bit ring counter.

$k$݇-bit Johnson counter.

Correct Answer : C

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 18

Consider the equation $(123)_5 = (x8)_y$ with $x$ and $y$ as unknown. The number of possible solutions is _____ .

Correct Answer : 3

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 19

A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is _____.

Correct Answer : 20

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 20

Consider the function func shown below:


int func(int num) { 

   int count = 0; 

   while (num) { 

     count++; 

     num>>= 1; 

   } 

   return (count); 

}

The value returned by func(435)is __________.

Correct Answer : 9

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 21

Suppose $n$ and $p$ are unsigned int variables in a C program. We wish to set $p$ to $n_{C_3}$. If n is large, which one of the following statements is most likely to set $p$ correctly?

$p = n * (n-1) * (n-2) / 6;$

$p = n * (n-1) / 2 * (n-2) / 3;$

$p = n * (n-1) / 3 * (n-2) / 2;$

$p = n * (n-1) * (n-2) / 6.0;$

Correct Answer : B

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 22

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

10, 8, 7, 3, 2, 1, 5

10, 8, 7, 2, 3, 1, 5

10, 8, 7, 1, 2, 3, 5

10, 8, 7, 5, 3, 2, 1

Correct Answer : A

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 23

Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1? ܶ

$T(n) = 2T(\frac {n} {2}) + log \ n$

$\theta (n)$

$\theta (n \ log \ n)$

$\theta (n^2)$

$\theta (log \ n)$

Correct Answer : A

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 24

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing

the shortest path between every pair of vertices.

the shortest path from W to every vertex in the graph.

the shortest paths from W to only those nodes that are leaves of T.

the longest path in the graph.

Correct Answer : B

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 25

If $L_1 = \{a^n | n \geq 0 \}$ and $L_2 = \{b^n | n \geq 0 \}$, consider

(I) $L_1⋅L_2$ is a regular language

(II) L1⋅L2 = $\{a^n b^n|n \geq 0\}$.

Which one of the following is CORRECT?

Only (I)

Only (II)

Both (I) and (II)

Neither (I) nor (II)

Correct Answer : A

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 26

Let $A \leq _m B$ denotes that language A is mapping reducible (also known as many-to-one reducible) to language B. Which one of the following is FALSE?

If $A \leq _m B$ and B is recursive then A is recursive.

If $A \leq _m B$ and A is undecidable then B is undecidable.

If $A \leq _m B$ and B is recursively enumerable then A is recursively enumerable.

If $A \leq _m B$ and B is not recursively enumerable then A is not recursively enumerable.

Correct Answer : D

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 27

Consider the grammar defined by the following production rules, with two operators ∗ and

$S\:\to\:T∗P \\ T\:\to\:U\mid T∗U \\ P\:\to\:Q+P\mid Q \\ Q\:\to Id \\ U\:\to Id$

Which one of the following is TRUE?

+ is left associative, while ∗ is right associative

+ is right associative, while ∗ is left associative

Both + and ∗ are right associative

Both + and ∗ are left associative

Correct Answer : B

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 28

Which one of the following is NOT performed during compilation?

Dynamic memory allocation

Type checking

Symbol table management

Inline expansion

Correct Answer : A

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 29

Which one of the following is TRUE?

The requirements document also describes how the requirements that are listed in the document are implemented efficiently.

Consistency and completeness of functional requirements are always achieved in practice.

Prototyping is a method of requirements validation.

Requirements review is carried out to find the errors in system design.

Correct Answer : C

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 30

A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a 100 x 10⁶ bytes disk on which the file system is stored and data block size is 10³ bytes, the maximum size of a file that can be stored on this disk in units of 10⁶ bytes is ____________.

Correct Answer : 99.55 to 99.65

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 31

The maximum number of superkeys for the relation schema R(E,F,G,H) with E as the key is _____.

Correct Answer : 8

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 32

Given an instance of the STUDENTS relation as shown as below

$\begin{array}{|c|c|c|c|c|} \hline \textbf {StudentID} & \textbf{StudentName} & \textbf{StudentEmail} & \textbf{StudentAge} & \textbf{CPI} \\\hline \text{2345} & \text{Shankar} & \text{shankar@math} & \text{X} & \text{9.4}\\\hline\text{1287} & \text{Swati} & \text{swati@ee} & \text{19} & \text{9.5}\\\hline\text{7853} & \text{Shankar} & \text{shankar@cse} & \text{19} & \text{9.4} \\\hline \text{9876} & \text{Swati} & \text{swati@mech} & \text{18} & \text{9.3} \\\hline \text{8765} & \text{Ganesh} & \text{ganesh@civil} & \text{19} & \text{8.7} \\\hline \end{array}$

For $(StudentName, StudentAge)$ to be a key for this instance, the value $X$ should NOT be equal to______.

Correct Answer : 19

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 33

Which of the following is TRUE about the interior gateway routing protocols − Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)

RIP uses distance vector routing and OSPF uses link state routing

OSPF uses distance vector routing and RIP uses link state routing

Both RIP and OSPF use link state routing

Both RIP and OSPF use distance vector routing

Correct Answer : A

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 34

Which of the following socket API functions converts an unconnected active TCP socket into a passive socket?

connect

bind

listen

accept

Correct Answer : C

Question Type : MCQ

Max Marks : 1

Negative Marks : 0.33

Question : 35

In the diagram shown below, L1 is an Ethernet LAN and L2 is a Token-Ring LAN. An IP packet originates from sender S and traverses to R, as shown. The links within each ISP and across the two ISPs, are all point-to-point optical links. The initial value of the TTL field is 32. The maximum possible value of the TTL field when R receives the datagram is _______.

Correct Answer : 26

Question Type : NAT

Max Marks : 1

Negative Marks : 0

Question : 36

Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is 10⁶ bytes / sec. A user on host A sends a file of size 10³ bytes to host B through routers R1 and R2 in three different ways. In the first case a single packet containing the complete file is transmitted from A to B. In the second case, the file is split into 10 equal parts, and these packets are transmitted from A to B. In the third case, the file is split into 20 equal parts and these packets are sent from A to B. Each packet contains 100 bytes of header information along with the user data. Consider only transmission time and ignore processing, queuing and propagation delays. Also assume that there are no errors during transmission. Let T1, T2 and T3 be the times taken to transmit the file in the first, second and third case respectively. Which one of the following is CORRECT?

T1 < T2 < T3

T1 > T2 > T3

T2 = T3, T3 < T1

T1 = T3, T3 > T2

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 37

An IP machine Q has a path to another IP machine H via three IP routers R1, R2, and R3.

Q—R1—R2—R3—H

H acts as an HTTP server, and Q connects to H via HTTP and downloads a file. Session layer encryption is used, with DES as the shared key encryption protocol. Consider the following four pieces of information

[I1] The URL of the file downloaded by Q

[I2] The TCP port numbers at Q and H

[I3] The IP addresses of Q and H

[I4] The link layer addresses of Q and H

Which of I1, I2, I3, and I4 can an intruder learn through sniffing at R2 alone?

Only I1 and I2

Only I1

Only I2 and I3

Only I3 and I4

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 38

A graphical HTML browser resident at a network client machine Q accesses a static HTML webpage from a HTTP server S. The static HTML page has exactly one static embedded image which is also at S. Assuming no caching, which one of the following is correct about the HTML webpage loading (including the embedded image)?

Q needs to send at least 2 HTTP requests to S, each necessarily in a separate TCP connection to server S

Q needs to send at least 2 HTTP requests to S, but a single TCP connection to server S is sufficient

A single HTTP request from Q to S is sufficient, and a single TCP connection between Q and S is necessary for this

A single HTTP request from Q to S is sufficient, and this is possible without any TCP connection between Q and S

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 39

Consider the following schedule S of transactions T1, T2, T3, T4:

${\begin{array}{|l|l|l|l|}\hline \textbf{T1}& \textbf{T2}& \textbf{T3}& \textbf{T4} \\\hline & \text{Reads(X)} \\ && \text{Writes(X)} \\ && \text{Commit} \\ \text{Writes(X)} \\ \text{Commit}& \\ & \text{Writes(Y) } \\ & \text{Reads(Z)} \\ & \text{Commit} \\ &&& \text{Reads(X)} \\ &&& \text{Reads(Y)} \\ & &&\text{Commit} \\\hline \end{array}}$

Which one of the following statements is CORRECT?

S is conflict-serializable but not recoverable

S is not conflict-serializable but is recoverable

S is both conflict-serializable and recoverable

S is neither conflict-serializable nor is it recoverable

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 40

Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size $\text{size}(r(R))<\text{size}(s(S)),$ , the join will have fewer number of disk block accesses if

relation $r(R)$ is in the outer loop.

join selection factor between $r(R)$ and $s(S)$ is more than 0.5.

join selection factor between $r(R)$ and $s(S)$ is less than 0.5.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 41

Consider the procedure below for the Producer-Consumer problem which uses semaphores:

semaphore n = 0;
semaphore s = 1;
void producer()
{
        while(true)
        {
             produce();
             semWait(s);
             addToBuffer();
             semSignal(s);
             semSignal(n);
        }
}

void consumer()
{
        while(true)
        {
             semWait(s);
             semWait(n);
             removeFromBuffer();
             semSignal(s);
             consume();
        }
}

Which one of the following is TRUE?

The producer will be able to add an item to the buffer, but the consumer can never consume it

The consumer will remove no more than one item from the buffer.

Deadlock occurs if the consumer succeeds in acquiring semaphore s when the buffer is empty.

The starting value for the semaphore n must be 1 and not 0 for deadlock-free operation.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 42

Three processes A, B and C each execute a loop of 100 iterations. In each iteration of the loop, a process performs a single computation that requires t_c CPU milliseconds and then initiates a single I/O operation that lasts for t_io milliseconds. It is assumed that the computer where the processes execute has sufficient number of I/O devices and the OS of the computer assigns different I/O devices to each process. Also, the scheduling overhead of the OS is negligible. The processes have the following characteristics:

$\begin{array}{} \textbf{Process id} & \textbf{$t_c$} & \textbf{$t_{io}$} \\\textbf{A} & \text{100 ms} & \text{500 ms} \\\textbf{B} & \text{350 ms} & \text{500 ms}\\\textbf{C} & \text{200 ms} & \text{500 ms} \\\end{array}$

The processes A, B, and C are started at times 0, 5 and 10 milliseconds respectively, in a pure time sharing system (round robin scheduling) that uses a time slice of 50 milliseconds. The time in milliseconds at which process C would complete its first I/O operation is ___________.

Correct Answer : 1000

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 43

A computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program accesses the pages numbered 1, 2, …, 100 in that order, and repeats the access sequence THRICE. Which one of the following page replacement policies experiences the same number of page faults as the optimal page replacement policy for this program?

Least-recently-used

First-in-first-out

Last-in-first-out

Most-recently-used

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 44

For a C program accessing X[i][j][k], the following intermediate code is generated by a compiler. Assume that the size of an integer is 32 bits and the size of a character is 8 bits.

t0 = i ∗ 1024
t1 = j ∗ 32
t2 = k ∗ 4
t3 = t1 + t0
t4 = t3 + t2
t5 = X[t4]

Which one of the following statements about the source code for the C program is CORRECT?

X is declared as “int X[32][32][8]”.

X is declared as “int X[4][1024][32]”.

X is declared as “char X[4][32][8]”.

X is declared as “char X[32][16][2]”

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 45

Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $Σ = \{0,1\}$. Let

$L=\left\{\langle M \rangle \mid M \text{ is a Turing machine that accepts a string of length 2014} \right\}.$

Then $L$ is:

decidable and recursively enumerable

undecidable but recursively enumerable

undecidable and not recursively enumerable

decidable but not recursively enumerable

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 46

Let $L_1 = \{ w \in \{0,1\}^* | w$ has at least as many occurrences of (110)’s as (011)’s}. Let $L_2 = \{ w \in \{0,1\}^* | w$ has at least as many occurrences of (000)’s as (111)’s}. Which one of the following is TRUE?

$L_1$ is regular but not $L_2$

$L_2$ is regular but not $L_1$

Both $L_1$ and $L_2$ are regular

Neither $L_1$ nor $L_2$ are regular

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 47

Consider two strings $A = "qpqrr"$ and $B = "pqprqrp"$. Let $x$ be the length of the longest common subsequence (not necessarily contiguous) between $A$ and $B$ and let $y$ be the number of such longest common subsequences between $A$ and $B$. Then $x + 10y = $ ______.

Correct Answer : 34

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 48

Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____.

Correct Answer : 358

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 49

Consider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___.

Correct Answer : 6

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 50

Consider the following function.


double f(double x){

    if( abs(x*x - 3) < 0.01) 

        return x;

    else 

        return f(x/2 + 1.5/x);

}

Give a value $q$ (to 2 decimals) such that $f(q)$ will return $q$:_____.

Correct Answer : 1.72 to 1.74

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 51

Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?

A queue cannot be implemented using this stack.

A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.

A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.

A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 52

Consider the C function given below.


int f(int j)

{ 

    static int i = 50; 

    int k; 

    if (i == j) 

    { 

        printf("something"); 

        k = f(i); 

        return 0; 

    } 

    else return 0; 

}

Which one of the following is TRUE?

The function returns 0 for all values of j.

The function prints the string something for all values of j.

The function returns 0 when j = 50.

The function will exhaust the runtime stack or run into an infinite loop when j = 50.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 53

In designing a computer’s cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context?

A smaller block size implies better spatial locality

A smaller block size implies a smaller cache tag and hence lower cache tag overhead

A smaller block size implies a larger cache tag and hence lower cache hit time

A smaller block size incurs a lower cache miss penalty

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 54

If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected?

Width of tag comparator

Width of set index decoder

Width of way selection multiplexor

Width of processor to main memory data bus

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 55

The value of a float type variable is represented using the single-precision 32-bit floating point format of IEEE-754 standard that uses 1 bit for sign, 8 bits for biased exponent and 23 bits for mantissa. A float type variable X is assigned the decimal value of −14.25. The representation of X in hexadecimal notation is

C1640000H

416C0000H

41640000H

C16C0000H

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 56

In the Newton-Raphson method, an initial guess of $x_2 = 0$ is made and the sequence $x_0,x_1,x_2$ … is obtained for the function

$0.75x^3 - 2x^2 - 2x + 4 = 0$

Consider the statements

(I) $x_3 = 0$.

(II) The method converges to a solution in a finite number of iterations.

Which of the following is TRUE?

Only I

Only II

Both I and II

Neither I nor II

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 57

The product of the non-zero eigenvalues of the matrix

$\begin{bmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{bmatrix}$

is ______.

Correct Answer : 6

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 58

The probability that a given positive integer lying between 1 and 100 (both inclusive) is NOT divisible by 2, 3 or 5 is ______ .

Correct Answer : 0.259 to 0.261

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 59

The number of distinct positive integral factors of 2014 is _________________________ .

Correct Answer : 8

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 60

Consider the following relation on subsets of the set ܵ$S$ of integers between 1 and 2014. For two distinct subsets $U$ ܷand ܸ$V$ of ܵ$S$ we say ܷ$U < V$ if the minimum element in the symmetric difference of the two sets is in ܷ$U$.

Consider the following two statements: ܵ

$S1$: There is a subset of ܵ$S$ that is larger than every other subset. ܵ

$S2$: There is a subset of ܵ$S$ that is smaller than every other subset.

Which one of the following is CORRECT?

Both $S1$ and ܵ$S2$ are true

$S1$ is true and ܵ$S2$ is false

$S2$ is true and ܵ$S1$ is false

Neither ܵ$S1$ nor ܵ$S2$ is true

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 61

A cycle on $n$ ݊vertices is isomorphic to its complement. The value of ݊$n$ is _____.

Correct Answer : 5

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 62

The number of distinct minimum spanning trees for the weighted graph below is _____

Correct Answer : 6

Question Type : NAT

Max Marks : 2

Negative Marks : 0

Question : 63

Which one of the following Boolean expressions is NOT a tautology?

$((\,a\,\to\,b\,)\,\wedge\,(\,b\,\to\,c))\,\to\,(\,a\,\to\,c)$

$(\,a\,\to\,c\,)\,\to\,(\,\sim b\,\to\,(a\,\wedge\,c))$

$(\,a\,\wedge\,b\,\wedge\,c)\,\to\,(\,c\vee\,a)$

$a\,\to\,(b\,\to\,a)$

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 64

SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below:


select * from R where a in (select S.a from S)

select R.* from R, S where R.a=S.a

select distinct R.* from R,S where R.a=S.a

select R.* from R,(select distinct a from S) as S1 where R.a=S1.a

select R.* from R,S where R.a=S.a and is unique R

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0.67

Question : 65

Consider a main memory system that consists of 8 memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for 100 nanoseconds (ns) by the data, address, and control signals. During the same 100 ns, and for 500 ns thereafter, the addressed memory module executes one cycle accepting and storing the data. The (internal) operation of different memory modules may overlap in time, but only one request can be on the bus at any time. The maximum number of stores (of one word each) that can be initiated in 1 millisecond is ____________.

Correct Answer : 10000

Question Type : NAT

Max Marks : 2

Negative Marks : 0

GATE 2014 CS SET - 2