Advanced DataStructures

Advanced DataStructures

University

10 Qs

quiz-placeholder

Similar activities

Graphs

Graphs

University

15 Qs

A-Level Computer Science Data Structures Quiz

A-Level Computer Science Data Structures Quiz

12th Grade - University

14 Qs

AlgoMania Quiz

AlgoMania Quiz

University

15 Qs

Eng. S2 - #4 AI Part 1

Eng. S2 - #4 AI Part 1

University

15 Qs

Graph

Graph

University

10 Qs

Topological Sort

Topological Sort

University

10 Qs

DSA Quiz 4 Set 1

DSA Quiz 4 Set 1

University

10 Qs

Data Structure and Algorithms Semi-Final Examination

Data Structure and Algorithms Semi-Final Examination

University

13 Qs

Advanced DataStructures

Advanced DataStructures

Assessment

Quiz

Computers

University

Hard

Created by

Rajalakshmi S

Used 1+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the primary difference between an adjacency matrix and an adjacency list?

Adjacency matrix is space-efficient for sparse graphs

Adjacency list is faster for checking if two nodes are connected

Adjacency matrix requires O(V^2) space, while adjacency list requires O(|V|+|E|) space

Adjacency list is slower for graph traversal

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What type of graph is required to perform a topological sort?

Directed Cyclic Graph

Undirected Graph

Directed Acyclic Graph

Weighted Graph

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

In topological Sort, which vertex is chosen first?

A vertex with highest indegree

A vertex with negative values

Any vertex

A vertex with zero indegree

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the time complexity of Topological sort in a graph with V vertex and E edges

O(V^2)

O( |V| + |E| )

O( V log V)

O( E^2)

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Dijkstra's Algorithm is used to find the shortest path between

All pair of vertices in a graph

A single source vertex to all other vertices in a graph

All vertices to a single destination vertex in a graph

All edges in a graph

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Dijkstra's algorithm does not work correctly if the graph contains

Positive Edge Weights

Self - Loops

Zero Edge Weights

Negative Edge Weights

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

In Dijkstra's Algorithm, What value is assigned to the source vertex at the beginning?

-1

Infinity

0

The maximum weight of the graph

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?