Gate Exam

An index is clustered, if
(A) it is on a set of fields that form a candidate key.
(B) it is on a set of fields that include the primary key.
(C) the data records of the file are organized in the same order as the data
entries of the index.
(D) the data records of the file are organized not in the same order as the data
entries of the index.

Read Solution (Total 0)

Gate Other Question

Which of the following statements is/are FALSE?
(1) For every non-deterministic Turing machine, there exists an equivalent
deterministic Turing machine.
(2) Turing recognizable languages are closed under union and complementation.
(3) Turing decidable languages are closed under intersection and
complementation
(4) Turing recognizable languages are closed under union and intersection.

Option
(A) 1 and 4 only
(B) 1 and 3 only
(C) 2 only
(D) 3 only
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.

Option
(A) Network layer -4 times and Data link layer-4 times
(B) Network layer -4 times and Data link layer-3 times
(C) Network layer -4 times and Data link layer-6 times
(D) Network layer -2 times and Data link layer-6 times