GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

307.

Which of the following graphs has an Eulerian circuit? [2 marks]
(A) Any k-regular graph where k is an even number.
(B) A complete graph on 90 vertices.
(C) The complement of a cycle on 25 vertices.
(D) None of the above

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
308.

Let Graph(x) be a predicate which denotes that x is a graph. Let Connected(x) be a predicate which denotes that x is connected. Which of the following first order logic sentences DOES NOT represent the statement: “Not every graph is connected”?
[2 marks]

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
309.

How many different non-isomorphic Abelian groups of order 4 are there? [2 marks]
(A) 2
(B) 3
(C) 4
(D) 5

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
310.

Which one of the following uses UDP as the transport protocol? [1 mark]
(A) HTTP
(B) Telnet
(C) DNS
(D) SMTP

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
311.

In Ethernet when Manchester encoding is used, the bit rate is: [1 mark]
(A) Half the baud rate.
(B) Twice the baud rate.
(C) Same as the baud rate.
(D) None of the above

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
312.

Which one of the following is a top-down parser? [1 mark]
(A) Recursive descent parser.
(B) Operator precedence parser.
(C) An LR(k) parser.
(D) An LALR(k) parser.

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]

801 1 ...‹‹50 5152 53 54 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now