This set of Data Structure test focuses on “Binary Decision Diagrams & And Inverter Graph”. 1. Binary Decision Diagram is a type of __________ a) Multigraph b) Cyclic Graph c) Directed Acyclic Graph d) Directed Acyclic Word Graph 2. In which of the following case does a Binary Decision Diagram is used for? a) Representation … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Multigraph and Hypergraph”. 1. Given Adjacency matrices determine which of them are PseudoGraphs? i) {{1,0} {0,1}} ii) {{0,1}{1,0}} iii) {{0,0,1}{0,1,0}{1,0,0}} a) only i) b) ii) and iii) c) i) and iii) d) i) ii) and iii) 2. All undirected Multigraphs contain eulerian … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Propositional and Directed Acyclic Word Graph”. 1. In which of the following does a Directed Acyclic Word Graph finds its application in? a) String Matching b) Number Sorting c) Manipulations on numbers d) Pattern Printing 2. What is the number of words … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Directed Acyclic Graph”. 1. Every Directed Acyclic Graph has at least one sink vertex. a) True b) False 2. Which of the following is not a topological sorting of the given graph? a) A B C D E F b) A B … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Directed Graph”. 1. Dijkstra’s Algorithm will work for both negative and positive weights? a) True b) False 2. A graph having an edge from each vertex to every other vertex is called a ___________ a) Tightly Connected b) Strongly Connected c) Weakly … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Undirected Graph”. 1. The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________ a) 2((n*(n-1))/2) b) 2((n*(n+1))/2) c) 2((n-1)*(n-1))/2) d) 2((n*n)/2) 2. Given a plane graph, G having 2 connected component, … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Adjacency List”. 1. Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________ a) O(E) b) O(V*V) c) O(E+V) d) O(V) 2. For some sparse graph an adjacency list is more … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Incidence Matrix and Graph Structured Stack”. 1. Incidence matrix and Adjacency matrix of a graph will always have same dimensions? a) True b) False 2. The column sum in an incidence matrix for a simple graph is __________ a) depends on number … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Adjacency Matrix”. 1. The number of elements in the adjacency matrix of a graph having 7 vertices is __________ a) 7 b) 14 c) 36 d) 49 2. What would be the number of zeros in the adjacency matrix of the given … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Graph”. 1. Which of the following statements for a simple graph is correct? a) Every path is a trail b) Every trail is a path c) Every trail is a path as well as every path is a trail d) Path and … Read more
