 A graph G is called a ….. if it is a connected acyclic graph
| ||||||||
What is the probability of choosing correctly an unknown integer between 0 and 9 with 3 chances ?
| ||||||||
In an undirected graph the number of nodes with odd degree must be
| ||||||||
A graph is a collection of
| ||||||||
The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)} is
_____________________________________________________________________________________ | ||||||||
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are
_____________________________________________________________________________________ | ||||||||
How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric ?
| ||||||||
The number of colours required to properly colour the vertices of every planer graph is
| ||||||||
In how many ways can a president and vice president be chosen from a set of 30 candidates?
| ||||||||
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?
| ||||||||
In a graph if e=(u, v) means
| ||||||||
A minimal spanning tree of a graph G is
| ||||||||
The number of leaf nodes in a complete binary tree of depth d is
| ||||||||
A partial ordered relation is transitive, reflexive and
| ||||||||
In a graph if e=[u, v], Then u and v are called
| ||||||||
In how many ways can a hungry student choose 3 toppings for his prize from a list of 10 delicious possibilities?
| ||||||||
A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are
| ||||||||
A vertex of a graph is called even or odd depending upon
| ||||||||
In any undirected graph the sum of degrees of all the nodes
| ||||||||
The expression a+a c is equivalent to
| ||||||||
A graph with one vertex and no edges is
| ||||||||
Length of the walk of a graph is
| ||||||||
The number of colours required to properly color vertices of every planar graph is
| ||||||||
A graph with no edges is known as empty graph. Empty graph is also known as
| ||||||||
| 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
| ||||||||
Choose the most appropriate definition of plane graph
| ||||||||
A continuous non intersecting curve in the plane whose origin and terminus coincide
| ||||||||
A graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are
| ||||||||
A debating team consists of 3 boys and 2 girls. Find the number of ways they can sit in a row?
| ||||||||
Which one of the following statements is incorrect ?
| ||||||||
Which of the following pair is not congruent modulo 7?
| ||||||||
The maximum degree of any vertex in a simple graph with n vertices is
| ||||||||
The complete graph with four vertices has k edges where k is
| ||||||||
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 ?
| ||||||||
How many onto (or surjective) functions are there from an n-element (n => 2) set to a 2-element set?
| ||||||||
Suppose v is an isolated vertex in a graph, then the degree of v is
| ||||||||
The number of nodes in a complete binary tree of height h (with roots at level 0) is equal to
| ||||||||
Hasse diagram are drawn
| ||||||||
In how many ways can 5 balls be chosen so that 2 are red and 3 are black
| ||||||||
Circle has ____________
| ||||||||
How many different words can be formed out of the letters of the word VARANASI?
| ||||||||
The proposition ~qvp is equivalent to
| ||||||||
A graph is tree if and only if
| ||||||||
If B is a Boolean Algebra, then which of the following is true
| ||||||||
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
| ||||||||
The number of distinguishable permutations of the letters in the word BANANA are,
| ||||||||
If R is a relation “Less Than” from A = {1,2,3,4} to B = {1,3,5} then RoR-1 is
|