Question 1 |

Consider the following two statements.

S1: If a candidate is known to be corrupt, then he will not be elected

S2: If a candidate is kind, he will be elected

Which one of the following statements follows from S1 and S2 as per sound inference rules of logic?

S1: If a candidate is known to be corrupt, then he will not be elected

S2: If a candidate is kind, he will be elected

Which one of the following statements follows from S1 and S2 as per sound inference rules of logic?

If a person is known to be corrupt, he is kind | |

If a person is not known to be corrupt, he is not kind | |

If a person is kind, he is not known to be corrupt | |

If a person is not kind, he is not known to be corrupt |

Question 1 Explanation:

Question 2 |

The cardinality of the power set of { 0, 1, 2,..., 10 } is _________.

10 | |

1024 | |

2048 | |

4096 |

Question 2 Explanation:

Question 3 |

Let R be the relation on the set of positive integers such that aRb if and only if a and b are distinct and have a common divisor other than 1. Which one of the following statements about R is true?

R is symmetric and reflexive but not transitive | |

R is reflexive but not symmetric and not transitive | |

R is transitive but not reflexive and not symmetric | |

R is symmetric but not reflexive and not transitive |

Question 3 Explanation:

Question 4 |

The number of divisors of 2100 is _____ .

28 | |

34 | |

36 | |

40 |

Question 4 Explanation:

Question 5 |

The larger of the two eigenvalues of the matrix \begin{bmatrix} 4 & 5\\ 2&1 \end{bmatrix} is _______.

4 | |

6 | |

8 | |

10 |

Question 5 Explanation:

Question 6 |

An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is

\Theta (n log n) | |

\Theta (n) | |

\Theta (log n) | |

\Theta (1) |

Question 6 Explanation:

Question 7 |

The minimum number of JK flip-flops required to construct a synchronous counter with the count sequence (0,0,1,1,2,2,3,3,0,0,...) is __________ .

2 | |

3 | |

4 | |

5 |

Question 7 Explanation:

Question 8 |

Assume that for a certain processor, a read request takes 50 nanoseconds on a cache miss and 5 nanoseconds on a cache hit. Suppose while running a program, it was observed that 80% of the processor's read requests result in a cache hit. The average read access time in nanoseconds is __________.

14 | |

42 | |

18 | |

48 |

Question 8 Explanation:

Question 9 |

A computer system implements a 40-bit virtual address, page size of 8 kilobytes, and a 128-entry translation look-aside buffer (TLB) organized into 32 sets each having four ways. Assume that the TLB tag does not store any process id. The minimum length of the TLB tag in bits is _________.

27 | |

5 | |

22 | |

7 |

Question 9 Explanation:

Question 10 |

Consider the following statements.

I. The complement of every Turing decidable language is Turing decidable

II. There exists some language which is in NP but is not Turing decidable

III. If L is a language in NP, L is Turing decidable

Which of the above statements is/are true?

I. The complement of every Turing decidable language is Turing decidable

II. There exists some language which is in NP but is not Turing decidable

III. If L is a language in NP, L is Turing decidable

Which of the above statements is/are true?

Only II | |

Only III | |

Only I and II | |

Only I and III |

Question 10 Explanation:

There are 10 questions to complete.