Start Test

Whoops!! You have disabled JavaScript. This site requires JavaScript to completely work fine. Please consider enabling it. Thanks.

1 2 3 4 5 6 7 8 9 10

Question 1 reset

The Octal equivalent of the binary number 1011101011 is:

7353

1353

5651

5657

Question 2 reset

How many distinguishable permutations of the letters in the word BANANA are there?

120

240

480

Question 3 reset

Negation of the proposition Ǝ x H(x) is:

∀ x ⌐H(x)

∀ x H(x)

Ǝ x ⌐H(x)

⌐ x H(x)

Question 4 reset

The context-free languages are closed for

Union

Intersection

Kleene Star

Question 5 reset

Let P and Q be two propositions, ⌐(P ↔ Q) is equivalent to:

P ↔ ⌐ Q

⌐P↔ Q

⌐P↔ ⌐Q

Q → P

Question 6 reset

In RDBMS, different classes of relations are created using ____ technique to prevent modification anomalies.

Normal Forms

Data integrity

Referential integrity

Functional Dependencies

Question 7 reset

'ptrdata' is a pointer to a data type. The expression *ptrdata++ is evaluated as (in C++):

*(ptrdata++)

(*ptrdata++)

*(ptrdata)++

Depends on compiler

Question 8 reset

Which of the following algorithms do not take their decisions on measurements or estimates of the current traffic and topology?

Adaptive algorithms

Non - adaptive algorithms

Static algorithms

Recursive algorithms

Question 9 reset

Which of the following devices takes data sent from one network device and forwards it to the destination node based on MAC address?

Hub

Switch

Modem

Gateway

Question 10 reset

Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i <= n), the index of the parent is :

floor (i / 2)

ceiling (i / 2)

floor ((i +1) / 2)

ceiling ((i + 1) / 2)

Time Over