Q. A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.

View solution

Q. Which of the following connected simple graph has exactly one spanning tree?

View solution

Q. How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?

View solution

Q. The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is

View solution

Q. The upper bound of computing time of m coloring decision problem is

View solution

Q. Which one of the following statements is incorrect ?

View solution

Q. Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex s to u has weight 53 and shortest path from s to v has weight 65. Which statement is always true ?

View solution

Q. In any simplex table, if corresponding to any negative Dj, all elements of the column are negative or zero, the solution under the test is

View solution

Q. Let a * H and b * H be two co-sets of H.

(i) Either a * H and b * H are disjoint
(ii) a * H and b * H are identical

Then,

View solution

Q. Domain and Range of the function
Y = –√(–2x + 3) is

View solution

Q. Maximum number of edges in a n-Node undirected graph without self loop is

View solution

Q. What is the probability of choosing correctly an unknown integer between 0 and 9 with 3 chances?

View solution

Q. Any integer composed of 3^n identical digits divisible by

View solution

Q. The circumferences of the two concentric disks are divided into 100 sections each. For the outer disk, 100 of the sections are painted red and 100 of the sections are painted blue. For the inner disk, the sections are painted red and blue in an arbitrary manner. It is possible to align the two disks so that …………… of the sections on the inner disks have their colours matched with the corresponding section on outer disk.

View solution

Q. The proposition ~pvq is equivalent to

View solution

Q. The number of integers between 1 and 250 that are divisible by 2, 5 and 7 is

View solution

Q. A partially ordered set is said to be a lattice if every two elements in the set have

View solution

Q. Consider the problem of connecting 19 lamps to a single electric outlet by using extension cords each of which has four outlets. The number of extension cords required is

View solution

Q. The decimal number equivalent of (4057.06)8 is

View solution

Q. The value of the following expression (13/4*3)%5+1 is

View solution