Question Discussion & Solution

MCQ

Adjacency matrix of all graphs are symmetric.

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

In a graph if e=(u, v) means

u is adjacent to v but v is not adjacent to u

e begins at u and ends at v

u is processor and v is successor

both b and c

Discussion

MCQ

Time complexity to find if there is an edge between 2 particular vertices is _________

O(V)

O(E)

O(1)

O(V+E)

Discussion

MCQ

Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________

O(V)

O(E*E)

O(E)

O(E+V)

Discussion

MCQ

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

3, Infinite, 4

4, 3, Infinite

4, Infinite

4, Infinite, Infinite

Discussion

MCQ

All undirected Multigraphs contain eulerian cycles.

May be

Can't say

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