• Placement Questions
• /
• Gate

Frequently Asked Gate Latest Exam Pattern - Gate Sample Question with Solutions Page 77

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

Assuming P ≠ NP, which of the following is TRUE?

Option
(A) NP-complete = NP
(B) NP-complete © P = null
(C) NP-hard = NP
(D) P = NP-complete

Asked In Gate Rats (12 years ago)

Unsolved

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

(#M40029639) GATE QUESTION GATE - Aptitude Keep an EYE

After several defeats in wars, Robert Bruce went in exile and wanted to commit
suicide. Just before committing suicide, he came across a spider attempting
tirelessly to have its net. Time and again, the spider failed but that did not deter
it to refrain from making attempts. Such attempts by the spider made Bruce
curious. Thus, Bruce started observing the near-impossible goal of the spider to
have the net. Ultimately, the spider succeeded in having its net despite several
failures. Such act of the spider encouraged Bruce not to commit suicide. And
then, Bruce went back again and won many a battle, and the rest is history.
Which one of the following assertions is best supported by the above information?
(A) Failure is the pillar of success
(B) Honesty is the best policy
(C) Life begins and ends with adventures
(D) No adversity justifies giving up hope

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (3)

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

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

The line graph L(G) of a simple graph G is defined as follows:
There is exactly one vertex v(e) in L(G) for each edge e in G.
For any two edges e and in G, L(G) has an edge between v(e) and v(), if
and only if e and e- are incident with the same vertex in G.
Which of the following statements is/are TRUE?
(P) The line graph of a cycle is a cycle.
(Q) The line graph of a clique is a clique.
(R) The line graph of a planar graph is planar.
(S) The line graph of a tree is a tree.

Option
(A) P only
(B) P and R only
(C) R only
(D) P, Q and S only

Asked In Gate Rats (12 years ago)

Unsolved

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

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

Consider the following sequence of micro operations MBR

Asked In Gate Rats (12 years ago)

Unsolved

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

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

Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are 5 ns, 7 ns, 10 ns, 8 ns and 6 ns, respectively. There are intermediate storage buffers after each stage and the delay of each buffer is 1 ns. A program consisting of 12 instructions 1 2 3 12 I , I , I ,......I is executed in this pipelined
processor. Instruction 4 I is the only branch instruction and its branch target is 9 I . If the branch is taken during the execution of this program, the time (in ns) needed to complete the program is

Option
(A) 132
(B) 165
(C) 176
(D) 328

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

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

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

The smallest integer than can be represented by an 8-bit number in 2's complement form is

Option
(A) -256
(B) -128
(C) -127
(D) 0

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) 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

(#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

(#M40025516) GATE QUESTION Sentence completion Keep an EYE

A.
He is a man of amiable
B.
disposition
C.
and emenable
D.
to rule and discipline
E.
All correct


FInd error

Asked In Gate MAN (12 years ago)

Unsolved

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