GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

481.

Let G be a simple connected planar graph with 13 vetices and 19 edges. Then, the number of faces in the planar embedding of the graph is: [1 mark]
(a) 6
(b) 8
(c) 9
(d) 13

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
482.

The following is the Hasse diagram of the poset [{a,b,c,d,e}; ≤ ],

The poset is: [1 mark]
(a) not a lattice
(b) a lattice but not a distributive lattice
(c) a distributive lattice but not a Boolean algebra
(d) a Boolean algebra

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
483.

Let A, B and C be non-empty sets and let
X = (A − B) − C and Y = (A − C) − (B − C)
Which one of the following is TRUE? [1 mark]
(a) X = Y
(b) X ⊂ Y
(c) Y ⊂ X
(d) None of these

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
484.

The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be: [1 mark]
(a) O(n)
(b) O(n log n)
(c) O(n^3/2)
(d) O(n³)

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
485.

An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0’s and (ii) non-diagonal elements are 1’s. which one of the following is TRUE? [1 mark]
(a) Graph G has no minimum spanning tree (MST)
(b) Graph G has a unique MST of cost n-1
(c) Graph G has multiple distinct MSTs, each of cost n-1
(d) Graph G has multiple spanning trees of different costs

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
486.

A program P reads in 500 integers in the range [0,100] representing the scores of 500 students. It then prints the frequency of each score above 50. what would be the best way for P to store the frequencies? [1 mark]
(a) An array of 50 numbers
(b) An array of 100 numbers
(c) An array of 500 numbers
(d) A dynamically allocated array of 550 numbers

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]

801 1 ...‹‹79 8081 82 83 ›› ... 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