Question Discussion & Solution

MCQ

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

Direct graph

Bigraph

Dir-graph

Digraph

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________

O(V)

O(E^2)

O(V^2)

Discussion

MCQ

Find the odd out

Prim's Minimal Spanning Tree Algorithm

Kruskal's Minimal Spanning Tree Algorithm

Floyd-Warshall's All pair shortest path Algorithm

Dijkstra's Minimal Spanning Tree Algorithm

Discussion

MCQ

For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is

e^n

Discussion

MCQ

All trees with n vertices consists of n-1 edges.

May be

Can't say

Discussion

MCQ

With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

(V*(V-1))/2

(V*(V+1))/2

(V+1)C2

(V-1)C2

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