• Placement Questions

Placement Papers with Solutions

(#M40029624) GATE QUESTION GATE - CS Keep an EYE

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?

Option
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (5)   (1) Submit Your Solution

(#M40029623) GATE QUESTION GATE - CS Keep an EYE

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero(the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

Option
(A) This algorithm is equivalent to the first-come-first-serve algorithm.
(B) This algorithm is equivalent to the round-robin algorithm.
(C) This algorithm is equivalent to the shortest-job-first algorithm.
(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm.

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (1) Submit Your Solution

(#M40029622) GATE QUESTION GATE - CS Keep an EYE

Using public key cryptography, X adds a digital signature s to message M, encrypts , and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
(A) Encryption: X's private key followed by Y's private key; Decryption: X's public
key followed by Y's public key
(B) Encryption: X's private key followed by Y's public key; Decryption: X's public
key followed by Y's private key
(C) Encryption: X's public key followed by Y's private key; Decryption: Y's public
key followed by X's private key
(D) Encryption: X's private key followed by Y's public key; Decryption: Y's private
key followed by X's public key

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40029621) GATE QUESTION GATE - CS Keep an EYE

The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are

Option
(A) TCP, UDP, UDP and TCP
(B) UDP, TCP, TCP and UDP
(C) UDP, TCP, UDP and TCP
(D) TCP, UDP, TCP and UDP

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (23)   (3) Submit Your Solution Profit and Loss

(#M40029620) GATE QUESTION GATE - CS Keep an EYE

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

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (7)   (3) Submit Your Solution

(#M40029619) GATE QUESTION GATE - CS Keep an EYE

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.

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (3)   (1) Submit Your Solution

(#M40029618) GATE QUESTION GATE - CS Keep an EYE

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

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (2)   (1) Submit Your Solution

(#M40029617) GATE QUESTION GATE - CS Keep an EYE

Which of the following statements are TRUE?
(1) The problem of determining whether there exists a cycle in an undirected
graph is in P.
(2) The problem of determining whether there exists a cycle in an undirected
graph is in NP.
(3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.

Option
(A) 1,2 and 3
(B) 1 and 2 only
(C) 2 and 3 only
(D) 1 and 3 only

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (1) Submit Your Solution

(#M40029616) GATE QUESTION GATE - CS Keep an EYE

In a k-way set associative cache, the cache is divided into v sets, each of which
consists of k lines. The lines of a set are placed in sequence one after another.
The lines in set s are sequenced before the lines in set (s+1). The main memory
blocks are numbered 0 onwards. The main memory block numbered j must be
mapped to any one of the cache lines from
(A) (j mod v) *k to (j mod v) *k + (k − 1)
(B) (j mod v) to (j mod v) + (k − 1)
(C) (j mod k) to ( j mod k) + (v − 1)
(D) (j mod k) * v to ( j mod k) * v + (v − 1)

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (3)   (0) Submit Your Solution

(#M40029615) GATE QUESTION GATE - CS Keep an EYE

Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even.

Option
(A) P only
(B) Q only
(C) Both P and Q
(D) Neither P nor Q

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (15)   (10) Submit Your Solution