Menu

Question Discussion & Solution

MCQ

Q.

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

A

Conjunction

B

Disjunction

C

Negation

D

All of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

A complete graph can have ...............

A

n^2 spanning trees

B

n^(n-2) spanning trees

C

n^(n+1) spanning trees

D

n^n spanning trees

Discussion

MCQ

2.

A Graph Structured Stack is a _____________

A

Undirected Graph

B

Directed Graph

C

Directed Acyclic Graph

D

Regular Graph

Discussion

MCQ

3.

Number of vertices with odd degrees in a graph having a eulerian walk is ________

B

Can

C

2

D

either 0 or 2

Discussion

MCQ

4.

What is the number of edges present in a complete graph having n vertices?

A

(n*(n+1))/2

B

(n*(n-1))/2

C

n

D

Information given is insufficient

Discussion

MCQ

5.

What would be the value of the distance matrix, after the execution of the given code?

A

a

B

b

C

c

D

d

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs