Question Discussion & Solution

MCQ

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

Can

either 0 or 2

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

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

Conjunction

Disjunction

Negation

All of the mentioned

Discussion

MCQ

If the graph is represented as an adjacency matrix then the time complexity of Kruskal

O(E log V)

O(VlogE)

O(V2)

O(logE)

Discussion

MCQ

Adjacency matrix of all graphs are symmetric.

May be

Can't say

Discussion

MCQ

Other name for directed graph is ..........

Direct graph

Bigraph

Dir-graph

Digraph

Discussion

MCQ

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

Representation of Boolean Functions

String Matching

Searching

Sorting of number

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics