# GATE CS 2012

Question 1

The amount of ROM needed to implement a 4 bit multiplier is
• 64 bits
• 128 bits
• 1 Kbits
• 2 Kbits

Question 2

Which of the following transport layer protocols is used to support electronic mail?
• SMTP
• IP
• TCP
• UDP

Question 3

```Which of the following problems are decidable?
```
• 1, 2, 3, 4
• 1, 2
• 2, 3, 4
• 3, 4

Question 4

The truth table represents the Boolean function
• X
• X+Y
• X xor Y
• Y

Question 5

The decimal value 0.5 in IEEE single precision floating point representation has
• fraction bits of 000…000 and exponent value of 0
• fraction bits of 000…000 and exponent value of −1
• fraction bits of 100…000 and exponent value of 0
• no exact representation

Question 6

The worst case running time to search for an element in a balanced in a binary search tree with n2^n elements is
```(A) [Tex]\\Theta(n log n)[/Tex]

(B) [Tex]\\Theta (n2^n) [/Tex]

(C) [Tex]\\Theta (n) [/Tex]

(D) [Tex]\\Theta (log n) [/Tex]
```
• A
• B
• C
• D

Question 7

Consider the following logical inferences.
I1: If it rains then the cricket match will not be played.
The cricket match was played.
Inference: There was no rain.
I2: If it rains then the cricket match will not be played.
It did not rain.
Inference: The cricket match was played.
Which of the following is TRUE?
• Both I1 and I2 are correct inferences
• I1 is correct but I2 is not a correct inference
• I1 is not correct but I2 is a correct inference
• Both I1 and I2 are not correct inferences

Question 8

Which of the following is TRUE?
• Every relation in 3NF is also in BCNF
• A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
• Every relation in BCNF is also in 3NF
• No relation can be in both BCNF and 3NF

Question 9

What will be the output of the following C program segment? C ```char inchar = \'A\'; switch (inchar) { case \'A\' : printf (\"choice A \\n\") ; case \'B\' : printf (\"choice B \") ; case \'C\' : case \'D\' : case \'E\' : default: printf (\"No Choice\") ; } ```
• ```No choice
```
• ```Choice A
```
• ```Choice A
Choice B No choice
```
• ```Program gives no output as it is erroneous
```

Question 10

```Assuming P != NP, which of the following is true ?
(A) NP-complete = NP
(B) NP-complete  P =
(C) NP-hard = NP
(D) P = NP-complete

```
• A
• B
• C
• D

There are 60 questions to complete.

Last Updated :
Take a part in the ongoing discussion