Gate Exam

Le t G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to

option
(A) 3
(B) 4
(C) 5
(D) 6

Read Solution (Total 0)

Gate Other Question

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is

option
(A) T(n) = 2T(n - 2) + 2
(B) T(n) = 2T(n - 1) + n
(C) T(n) = 2T(n/2) + 1
(D) T(n) = 2T(n - 1) + 1 The amount of ROM needed to implement a 4 bit multiplier is

option
(A) 64 bits
(B) 128 bits
(C) 1 Kbits
(D) 2 Kbits