Q. 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}}

View solution

Q. Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?

View solution

Q. Which of the following is a HyperGraph, where V is the set of vertices, E is the set of edges?

View solution

Q. What would be the Incidence Matrix of the given HyperGraph?
V = {x,y,z} E = {{x,y}{y}{x,z}{z,y}}

View solution

Q. What is the degree sequence of the given HyperGraph, in non-increasing order.
V = {v1,v2,v3,v4,v5,v6} E = {{v1,v4,v5} {v2,v3,v4,v5} {v2} {v1} {v1,v6}}

View solution

Q. MultiGraphs having self-loops are called PseudoGraphs?

View solution

Q. Binary Decision Diagram is a type of __________

View solution

Q. In which of the following case does a Binary Decision Diagram is used for?

View solution

Q. In a Binary Decision Diagram, how many types of terminal exists?

View solution

Q. In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line.

View solution

Q. How many nodes are required to create a Binary Decision Tree having 4 variables?

View solution

Q. Two or more And Inverter Graphs can represent same function.

View solution

Q. 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.

View solution

Q. And Inverter Graph is a type of __________

View solution

Q. The And Inverter Graph representation of a Boolean function is more efficient than the Binary Decision Diagram.

View solution

Q. Which of the following logical operation can be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?

View solution

Q. Depth First Search is equivalent to which of the traversal in the Binary Trees?

View solution

Q. Time Complexity of DFS is? (V – number of vertices, E – number of edges)

View solution

Q. The Data structure used in standard implementation of Breadth First Search is?

View solution

Q. The Depth First Search traversal of a graph will result into?

View solution