adplus-dvertising
frame-decoration

Question

The number of colours required to properly colour the vertices of every planer graph is

a.

2

b.

3

c.

4

d.

5

Answer: (d).5

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The number of colours required to properly colour the vertices of every planer graph is

Similar Questions

Discover Related MCQs

Q. A binary search tree is a binary tree :

Q. The Inorder traversal of the tree will yield a sorted listing of elements of tree in

Q. Which of the following data structure is linear type ?

Q. To represent hierarchical relationship between elements, which data structure is suitable?

Q. Consider the following pseudo code segment :

K:=0
 for i1:= l to n
  for i2:= 1 to i1
   :
   :
   :
    for im:= 1 to im–1
     K:= K+1

The value of K after the execution of this code shall be

Q. Number of binary trees formed with 5 nodes are

Q. The following postfix expression is evaluated using a stack

823^/23* + 51* –

The top two elements of the stack after first * is evaluated

Q. Consider the following pseudo-code :

If (A > B) and (C > D) then
A = A + 1
B = B + 1
Endif

The cyclomatic complexity of the pseudo-code is

Q. Match the following with respect to java.util.* class methods :

(a) Bit Set                      (i) Time zone getTimezone( )
(b) Calendar                 (ii) int hashcode( )
(c) Time zone               (iii) int nextInt( )
(d) Random                  (iv) Void setID(String tzName)

      (a)     (b)    (c)   (d)

Q. Which of the following data structure is Non-linear type?

Q. The total number of comparisons in a bubble sort is

Q. Which of the following is a bad example of recursion?

Q. McCabe’s cyclomatic metric V(G) of a graph G with n vertices, e edges and p connected component is

Q. The number of nodes in a complete binary tree of height h (with roots at level 0) is equal to

Q. The number of different trees with 8 nodes is

Q. Given a binary tree whose inorder and preorder traversal are given by

Inorder  : EICFBGDJHK
Preorder : BCEIFDGHJK

The post order traversal of the above binary tree is

Q. The number of disk accesses performed by insertion operation in B-tree of height h is

Q. When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing n elements)

Q. An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are

Q. The minimum number of edges in a connected graph with ‘n’ vertices is equal to