Question 1 The number of integers between 1 and 250 that are divisible by 2, 5 and 7 is A 2 B 3 C 5 D […]

Question 2 An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are A all of even degree B […]

Question 3 A partially ordered set is said to be a lattice if every two elements in the set have A a unique least upper bound […]

Question 4 The minimum number of edges in a connected graph with ‘n’ vertices is equal to A n(n – 1) B n(n–1)/2 C n2 D […]