How many onto (or surjective) functions are there from an nelement (n > 2) set to a 2 element set?
_____________________________________________________________________________________

A partial ordered relation is transitive, reflexive and
_____________________________________________________________________________________

A vertex of a graph is called even or odd depending upon
_____________________________________________________________________________________

Which of the following statements are TRUE?
(1) The problem of determining whether there exists a cycle in an undirected graph is in P.
(2) The problem of determining whether there exists a cycle in an undirected graph is in NP.
(3) If a problem A is NPComplete, there exists a nondeterministic polynomial time algorithm to solve A.
_____________________________________________________________________________________

If n is an integer and n2 is odd ,then n is
_____________________________________________________________________________________

How many different words can be formed out of the letters of the word VARANASI?
_____________________________________________________________________________________

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 (n1) edges (iv)G has n edges
_____________________________________________________________________________________

The complete graph with four vertices has k edges where k is
_____________________________________________________________________________________

Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise ?
_____________________________________________________________________________________

In how many ways can a hungry student choose 3 toppings for his prize from a list of 10 delicious possibilities?
_____________________________________________________________________________________

In any undirected graph,the sum of degrees of all nodes
_____________________________________________________________________________________

The number of colours required to properly color vertices of every planar graph is
_____________________________________________________________________________________

The trapzoidal rule for integration gives exact result when integrated is polynomial of degree
_____________________________________________________________________________________

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to
_____________________________________________________________________________________

Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is
_____________________________________________________________________________________

If two fair coins are flipped and at least one of the outcomes is known to be a head, what is the probability that both outcomes are heads?
_____________________________________________________________________________________

A graph G is called a ..... if it is a connected acyclic graph
_____________________________________________________________________________________

In how many ways can a president and vice president be chosen from a set of 30 candidates?
_____________________________________________________________________________________

Let G be a simple undirected planar graph on 10 vertices with 15edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
_____________________________________________________________________________________

Which of the following pair is not congruent modulo 7?
_____________________________________________________________________________________

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

The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)} is
_____________________________________________________________________________________

The length of Hamiltonian Path in a connected graph of n vertices is
_____________________________________________________________________________________

The number of leaf nodes in a complete binary tree of depth d is
_____________________________________________________________________________________

Four fair coins are tossed simultaneously. The probability that latest one head and tail turn up is
_____________________________________________________________________________________

Find the number of relations from A = {cat, dog, rat} to B = {male , female}
_____________________________________________________________________________________

Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white.
_____________________________________________________________________________________

The number of functions from an m element set to an n element set is:
_____________________________________________________________________________________

In a graph if e=(u, v) means
_____________________________________________________________________________________

Rank of the matrix Row1 [1,1 ] and Row2[0,0] is
_____________________________________________________________________________________

In any undirected graph the sum of degrees of all the nodes
_____________________________________________________________________________________

Let N = {1, 2, 3, ….} be ordered by divisibility, which of the following subset is totally ordered,
_____________________________________________________________________________________

Two dice are thrown simultaneously. The probability that the product of the two numbers on the two disc is an even number, is
_____________________________________________________________________________________

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

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
_____________________________________________________________________________________

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

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three?
_____________________________________________________________________________________

_____________________________________________________________________________________

Length of the walk of a graph is
_____________________________________________________________________________________

Number of elements in the power set P(S) of the set S={(Q),1(2,3)}
_____________________________________________________________________________________

A graph is a collection of
_____________________________________________________________________________________

Hasse diagram are drawn
_____________________________________________________________________________________

Number of vertices of odd degree in a graph is
_____________________________________________________________________________________

Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even.
_____________________________________________________________________________________

A graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are
_____________________________________________________________________________________

Cyclometric complexity of a flow graph G with n vertices and e edges is
_____________________________________________________________________________________

The statement ( p^q) _ p is a
_____________________________________________________________________________________

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to
_____________________________________________________________________________________

Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
_____________________________________________________________________________________

Bag A contains 5 white and 2 black balls .Bag B contains 2 white and 3 black balls .if any one bag is chosen and a ball is taken out of it at random ,what is the probability the ball is black?
