Question Discussion & Solution

MCQ

Dijkstra

May be

Can't say

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The maximum degree of any vertex in a simple graph with n vertices is

n+1

Discussion

MCQ

What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?

O(E*E)

O(V*V)

O(E)

O(V)

Discussion

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

Discussion

MCQ

If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.

x=5, y=3

x=3, y=5

x=3, y=3

x=5, y=5

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