Question Discussion & Solution

MCQ

Time Complexity of DFS is? (V

O(V + E)

O(V)

O(E)

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Given the following program, what will be the 3rd number that

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

Graph Structured Stack finds its application in _____________

Bogo Sort

Tomita

Todd

All of the mentioned

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

A graph having an edge from each vertex to every other vertex is called a ___________

Tightly Connected

Strongly Connected

Weakly Connected

Loosely Connected

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