Question Discussion & Solution

MCQ

. If every node u in G is adjacent to every other node v in G, A graph is said to be

isolated

complete

finite

strongly connected

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

A connected graph T without any cycles is called ........

free graph

no cycle graph

non cycle graph

circular graph

Discussion

MCQ

Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________

O(V*V)

O(V*V*V)

O(E*V)

O(E*E)

Discussion

MCQ

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

O(V + E)

O(V)

O(E)

None of the mentioned

Discussion

MCQ

In the case of Fibnocci heap the running time of Prim

O(E log V)

O(V log E)

O( log V)

O(E log E)

Discussion

MCQ

In which of the following case does a Binary Decision Diagram 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