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

## Question: ``` If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC? ```

1.Source â€“ 1, 8 Sink â€“ 7,4

2.Source â€“ 1 Sink â€“ 8,4

3.Source â€“ 1, 8 Sink â€“ 4

4.Source â€“ 4, Sink â€“ 1,8

Posted Date:-2022-05-13 10:20:27

## Question: ```A connected planar graph having 6 vertices, 7 edges contains _____________ regions. ```

1.15

2.3

3.1

4.11

Posted Date:-2022-05-13 10:57:39

## Question: ```A Graph Structured Stack is a _____________ ```

1.Undirected Graph

2.Directed Graph

3.Directed Acyclic Graph

4.Regular Graph

Posted Date:-2022-05-13 10:19:33

## Question: ```A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that? ```

1.Depth First Search

3.Topological Sorting

4.Dijkstraâ€™s Shortest path algorithm

Posted Date:-2022-05-13 10:54:08

## Question: ```And Inverter Graph is a type of __________ ```

1.Multigraph

2.Cyclic Graph

3.Directed Acyclic Graph

4.Directed Acyclic Word Graph

Posted Date:-2022-05-13 10:33:13

## Question: ```Binary Decision Diagram is a type of __________ ```

1.Multigraph

2.Cyclic Graph

3.Directed Acyclic Graph

4.Directed Acyclic Word Graph

Posted Date:-2022-05-13 10:29:42

## Question: ```Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed? ```

1.Yes just traverse through the array and form the tree

2.No we need one more traversal to form a tree

3.No in case of sparse trees

4.Yes by using both inorder and array elements

Posted Date:-2022-05-13 10:41:41

## Question: ```Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good? ```

1.yes because we are overcoming the need of pointers and so space efficiency

2.yes because array values are indexable

3.No it is not efficient in case of sparse trees and remaning cases it is fine

4.No linked list representation of tree is only fine

Posted Date:-2022-05-13 10:40:56

## Question: ```Express -15 as a 6-bit signed binary number. ```

1.001111

2.101111

3.101110

4.001110

Posted Date:-2022-05-13 10:35:00

## Question: ```Given an array of element 5, 7, 9, 1, 3, 10, 8, 4. Which of the following are the correct sequences of elements after inserting all the elements in a min-heap? ```

1.1,3,4,5,7,8,9,10

2.1,4,3,9,8,5,7,10

3.1,3,4,5,8,7,9,10

4.1,3,7,4,8,5,9,10

Posted Date:-2022-05-13 10:46:00

## Question: ```Graph Structured Stack finds its application in _____________ ```

1.Bogo Sort

2.Tomitaâ€™s Algorithm

3.Toddâ€“Coxeter algorithm

4.Heap Sort

Posted Date:-2022-05-13 10:21:10

## Question: ```How many children does a binary tree have? ```

1.2

2.any number of children

3.0 or 1 or 2

4.0 or 1

Posted Date:-2022-05-13 10:36:57

## Question: ```How many stacks are required for reversing a word algorithm? ```

1.one

2.two

3.three

4.four

Posted Date:-2022-05-13 10:25:25

## Question: ```If a connected Graph (G) contains n vertices what would be the rank of its incidence matrix? ```

1.n-1

2.values greater than n are possible

3.values less than n-1 are possible

4.insufficient Information is given

Posted Date:-2022-05-13 10:18:42

## Question: ```If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________ ```

1.(n*n-n-2*m)/2

2.(n*n+n+2*m)/2

3.(n*n-n-2*m)/2

4.(n*n-n+2*m)/2

Posted Date:-2022-05-13 10:58:16

## Question: ```If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array? ```

1.every node stores data saying which of its children exist in the array

2.no need of any changes continue with 2w and 2w+1, if node is at i

3.keep a seperate table telling children of a node

4.use another array parallel to the array with tree

Posted Date:-2022-05-13 10:40:03

## Question: ```In a Binary Decision Diagram, how many types of terminal exists? ```

1.1

2.2

3.3

4.4

Posted Date:-2022-05-13 10:30:49

## Question: ```In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line. ```

1.dashed, bold

2.bold, dashed

3.dotted, bold

4.dotted, dashed

Posted Date:-2022-05-13 10:31:32

## Question: ```In most of the cases, topological sort starts from a node which has __________ ```

1.Maximum Degree

2.Minimum Degree

3.Any degree

4.Zero Degree

Posted Date:-2022-05-13 10:50:55

## Question: ```In which of the following case does a Binary Decision Diagram is used for? ```

1.Representation of Boolean Functions

2.String Matching

3.Searching

4.Sorting of number

Posted Date:-2022-05-13 10:30:16

## Question: ```Most Efficient Time Complexity of Topological Sorting is? (V â€“ number of vertices, E â€“ number of edges) ```

1.O(V + E)

2.O(V)

3.O(E)

4.O(V*E)

Posted Date:-2022-05-13 10:50:18

## Question: ```Size of an And Inverter Graph is the number of _______ gates and the number of logic levels is number of ________ gates on the __________ path from a primary input to a primary output. ```

1.AND, AND, average

2.AND, OR, longest

3.OR, OR, shortest

4.AND, AND, longest

Posted Date:-2022-05-13 10:32:41

## Question: ```The column sum in an incidence matrix for a directed graph having no self loop is __________ ```

1.0

2.1

3.2

4.equal to the number of edges

Posted Date:-2022-05-13 10:16:48

## Question: ```The column sum in an incidence matrix for a simple graph is __________ ```

1.depends on number of edges

2.always greater than 2

3.equal to 2

4.equal to the number of edges

Posted Date:-2022-05-13 10:14:13

## Question: ```Time complexity to check if an edge exists between two vertices would be ___________ ```

1.O(V*V)

2.O(V+E)

3.O(1)

4.O(E)

Posted Date:-2022-05-13 10:17:26

## Question: ```Topological sort can be applied to which of the following graphs? ```

1.Undirected Cyclic Graphs

2.Directed Cyclic Graphs

3.Undirected Acyclic Graphs

4.Directed Acyclic Graphs

Posted Date:-2022-05-13 10:49:43

## Question: ```Topological sort can be implemented by? ```

1.Using Depth First Search

3.Using Depth and Breadth First Search

4.Using level ordered search

Posted Date:-2022-05-13 10:52:48

## Question: ```Topological sort is equivalent to which of the traversals in trees? ```

1.Pre-order traversal

2.Post-order traversal

3.In-order traversal

4.Level-order traversal

Posted Date:-2022-05-13 10:53:21

## Question: ```Topological sort of a Directed Acyclic graph is? ```

1.Always unique

2.Always Not unique

3.Sometimes unique and sometimes not unique

4.Always unique if graph has even number of vertices

Posted Date:-2022-05-13 10:52:12

## Question: ```What are the children for node â€˜wâ€™ of a complete-binary tree in an array representation? ```

1.2w and 2w+1

2.2+w and 2-w

3.w+1/2 and w/2

4.w-1/2 and w+1/2

Posted Date:-2022-05-13 10:38:36

## Question: ```What are the dimensions of an incidence matrix? ```

1.Number of edges*number of edges

2.Number of edges*number of vertices

3.Number of vertices*number of vertices

4.Number of edges * (1â„2 * number of vertices)

Posted Date:-2022-05-13 10:16:03

## Question: ```What are the set of functions that are to be executed to get the following output? cat ```

1.push(c, s); push(a, s); push(t, s); pop(s); pop(s); pop(s);

2.push(c,s); pop(s); push(a,s); pop(s);push(t,s);pop(s);

3.pop(c ); pop(a); pop(t);

4.push(c,s); push(a,s); pop(t);

Posted Date:-2022-05-13 10:26:42

## Question: ```What is the location of a parent node for any arbitary node i? ```

1.(i/2) position

2.(i+1)/ position

3.floor(i/2) position

4.ceil(i/2) position

Posted Date:-2022-05-13 10:45:20

## Question: ```What is the number of edges present in a complete graph having n vertices? ```

1.(n*(n+1))/2

2.(n*(n-1))/2

3.n

4.Information given is insufficient

Posted Date:-2022-05-13 10:56:41

## Question: ```What is the parent for a node â€˜wâ€™ of a complete binary tree in an array representation when w is not 0? ```

1.floor(w-1/2)

2.ceil(w-1/2)

3.w-1/2

4.w/2

Posted Date:-2022-05-13 10:39:15

## Question: ```What is/are the disadvantages of implementing tree using normal arrays? ```

1.difficulty in knowing children nodes of a node

2.difficult in finding the parent of a node

3.have to know the maximum number of nodes possible before creation of trees

4.difficult to implement

Posted Date:-2022-05-13 10:37:49

## Question: ```What will be the word obtained if the word â€œabbcabbâ€ is reversed using a stack? ```

1.bbabbca

2.abbcabb

3.bbacbba

4.bbacabb

Posted Date:-2022-05-13 10:24:53

## Question: ```When the topological sort of a graph is unique? ```

1.When there exists a hamiltonian path in the graph

2.In the presence of multiple nodes with indegree 0

3.In the presence of single node with indegree 0

4.In the presence of single node with outdegree 0

Posted Date:-2022-05-13 10:54:51

## Question: ```Which is the most appropriate data structure for reversing a word? ```

1.queue

2.stack

3.tree

4.graph

Posted Date:-2022-05-13 10:23:52

## Question: ```Which is the predefined method available in Java to convert decimal to binary numbers? ```

1.toBinaryInteger(int)

2.toBinaryValue(int)

3.toBinaryNumber(int)

4.toBinaryString(int)

Posted Date:-2022-05-13 10:35:46

## Question: ```Which of the following is not an application of topological sorting? ```

2.Finding Deadlock in an Operating System

3.Finding Cycle in a graph

4.Ordered Statistics

Posted Date:-2022-05-13 10:51:37

## Question: ```Which of the following logical operation canâ€™t be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams? ```

1.Conjunction

2.Disjunction

3.Negation

4.Tautology Checking

Posted Date:-2022-05-13 10:34:08

## Question: ```Which of the following properties does a simple graph not hold? ```

1.Must be connected

2.Must be unweighted

3.Must have no loops or multiple edges

4.Must have no multiple edges

Posted Date:-2022-05-13 10:58:52

## Question: ```Which of the following statements for a simple graph is correct? ```

1.Every path is a trail

2.Every trail is a path

3.Every trail is a path as well as every path is a trail

4.Path and trail have no relation

Posted Date:-2022-05-13 10:55:56

## 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!