# Mathematics/Mathematics MCQs Set-3 Sample Test,Sample questions

1.35

2.36

3.45

4.19

## Question: ```A binary cycle space forms a ______ over the two element field. ```

1.triangular graph

2.vector space

3. binary tree

4.hamiltonian graph

## Question: ```A bridge can not be a part of _______ ```

1.a simple cycle

2.a tree

3.a clique with size ≥ 3 whose every edge is a bridge

4.a graph which contains cycles

1.5

2.32

3.17

4.8

## Question: ```A graph G has the degree of each vertex is ≥ 3 say, deg(V) ≥ 3 ∀ V ∈ G such that 3|V| ≤ 2|E| and 3|R| ≤ 2|E|, then the graph is said to be ________ (R denotes region in the graph) ```

1.Planner graph

2.Polyhedral graph

3.Homomorphic graph

4.Isomorphic graph

## Question: ```A graph which consists of disjoint union of trees is called ______ ```

1.bipartite graph

2.forest

3.caterpillar tree

4.labeled tree

1.6k, 6k-1

2.4k, 4k+1

3.k, k+2

4. 2k+1, k

## Question: ```A linear graph consists of vertices arranged in a line. ```

1.false

2.true

3.either true or false

4.cannot determined

## Question: ```A polytree is called _______________ ```

1.directed acyclic graph

2.directed cyclic graph

3.bipartite graph

4.connected graph

## Question: ```A trail in a graph can be described as ______________ ```

1.a walk without repeated edges

2.a cycle with repeated edges

3.a walk with repeated edges

4.a line graph with one or more vertices

## Question: ```A ______ in a graph G is a circuit which consists of every vertex (except first/last vertex) of G exactly once. ```

1.Euler path

2.Hamiltonian path

3.Planar graph

4.Path complement graph

1.poset

2.core

3.walk

4.trail

## Question: ```Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called _______ ```

1.subgraph

2.tree

3.hamiltonian cycle

4.grid

1.502

2.345

3.78

4.69

1.cyclic

3.tree

## Question: ```G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is ______ ```

1.Complete bipartite graph

2.Hamiltonian cycle

3.Regular graph

4.Euler graph

1.6

2.10

3.25

4.7

1.60

2.945

3.756

4.127

## Question: ```If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________ ```

1.the degree of each vertex is at most n/2

2.the degree of each vertex is equal to n

3.the degree of every vertex is at least n+1/2

4.the degree of every vertex in G is at least n/2

## Question: ```If there are more than 1 topological sorting of a DAG is possible, which of the following is true. ```

1.Many Hamiltonian paths are possible

2.No Hamiltonian path is possible

3.Exactly 1 Hamiltonian path is possible

4.Given information is insufficient to comment anything

1.m+n-1

2.m-n

3.m*n

4.m*n+1

1.209

2.65

3.57

4.43

## Question: ```In which of the following case does a Propositional Directed Acyclic Graph is used for? ```

1.Representation of Boolean Functions

2.String Matching

3.Searching

4.Sorting of number

## Question: ```In which of the following does a Directed Acyclic Word Graph finds its application in? ```

1.String Matching

2.Number Sorting

3.Manipulations on numbers

4.Pattern Printing

## Question: ```Let a graph can be denoted as ncfkedn a kind of ____________ ```

1.cycle graph

2. line graph

3.hamiltonian graph

4.path graph

1.98

2.13

3.6

4.34

1.n-1 and n+1

2.v and k

3.k+1 and v-k

4.k-1 and v-1

1.BFS

2.DFS

3.Binary search

1.45

2.61

3.28

4.17

1.n – 1

2.n

3.2n+3

4.n+1

## Question: ```The sum of an n-node graph and its complement graph produces a graph called _______ ```

1.complete graph

2.bipartite graph

3.star graph

4.path-complement graph

1.cubic

3.linear

4.logarithmic

1.vertices

2.nodes

3.points

4.edges

## Question: ```The _______ of a graph G consists of all vertices and edges of G. ```

1.edge graph

2.line graph

3.path complement graph

4.eulerian circuit

## Question: ```Topological sorting of a graph represents _______ of a graph. ```

1.linear probing

2.linear ordering

4.insertion sorting

## Question: ```Two labeled trees are isomorphic if ____________ ```

1.graphs of the two trees are isomorphic

2.the two trees have same label

3.graphs of the two trees are isomorphic and the two trees have the same label

4.graphs of the two trees are cyclic

## Question: ```What is a bipartite graph? ```

1.a graph which contains only one cycle

2.a graph which consists of more than 3 number of vertices

3.a graph which has odd number of vertices and even number of edges

4.a graph which contains no cycles of odd length

## Question: ```What is a separable graph? ```

1.A disconnected graph by deleting a vertex

2.A disconnected graph by removing an edge

3.A disconnected graph by removing one edge and a vertex

4.A simple graph which does not contain a cycle

## Question: ```What is a star tree? ```

1.A tree having a single internal vertex and n-1 leaves

2.A tree having n vertices arranged in a line

3.A tree which has 0 or more connected subtrees

4.A tree which contains n vertices and n-1 cycles

1.30

2.15

3. 45

4.106

1.11

2. 14

3.18

4.19

## Question: ```What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph? ```

1.Depends on a Graph

2.Will always be zero

3.Will always be greater than zero

4.May be zero or greater than zero

1.O(S1)

2.O(S2)

3.O(S1+S2)

4.O(1)

## Question: ```Which algorithm efficiently calculates the single source shortest paths in a Directed Acyclic Graph? ```

1.topological sort

2.hash table

3.binary search

## Question: ```Which of the given statement is true? ```

1.All the Cyclic Directed Graphs have topological sortings

2.All the Acyclic Directed Graphs have topological sortings

3.All Directed Graphs have topological sortings

4.All the cyclic directed graphs hace non topological sortings

## More MCQS

##### R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!