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

Q. Which one of the following will set the value of y to 5 if x has the value 3, but not otherwise?

View solution

Q. “x1 is a clone of x” means x1 is identical to x in terms of the physical attributes namely, height, weight and complexion. Given, height, weight and complexion only form a complete set of attributes for an entity, cloning is an equivalence relation. What is your impression about this statement?

View solution

Q. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is …………...

(i) commutative
(ii) transitive
(iii) implicative
(iv) equivalence

View solution

Q. If x and y are independent Gaussian random variables with average value 0 and with same variance, their joint probability density function is given by:

View solution

Q. Assertion(A): Bit maps are not often used in memory management.
Reason(R): Searching a bitmap for a run of given length is a slow operation.

View solution

Q. The complete graph with four vertices has k edges where k is:

View solution

Q. Which two of the following are equivalent for an undirected graph G?

(i) G is a tree
(ii) There is at least one path between any two distinct vertices of G
(iii) G contains no cycles and has (n-1) edges
(iv) G has n edges

View solution

Q. A relation R in {1,2,3,4,5,6} is given by {(1,2),(2,3),(3,4),(4,4),(4,5)}. This relation is:

View solution

Q. The set of positive integers under the operation of ordinary multiplication is:

View solution

Q. In a set of 8 positive integers, there always exists a pair of numbers having the same remainder when divided by:

View solution

Q. A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls are red and two are green?

View solution

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

View solution

Q. Depth ion travels of the following directed graph is:

View solution