Gate Exam

The minimum number of colours required to colour the vertices of a cycle with n nodes in
such a way that no two adjacent nodes have the same colour is
(a) 2
(b) 3
(c) 4
(d) n_2[+2

Read Solution (Total 0)

Gate Other Question

The trapezoidal rule for integration gives exact result when the integrand is a polynomial
of degree
(a) 0 but not 1
(b) 1 but not 0
(c) 0 or 1
(d) 2 In how many ways can a given positive integer n 2 be expressed as the sum of 2 positive integers (which are not necessarily distinct). For example, for n = 3, the number of ways is 2, i.e., 1+2, 2+1. Give ANSWER??