Graphs in Data Structures - Gunalakshmi

Graphs in Data Structures - Gunalakshmi

University

15 Qs

quiz-placeholder

Similar activities

2.3.1 Graph Traversal & Path Finding Algorithms

2.3.1 Graph Traversal & Path Finding Algorithms

12th Grade - University

20 Qs

Graph

Graph

University

10 Qs

Kuis 2 - ASD -A

Kuis 2 - ASD -A

University

10 Qs

Data Structure and Algorithms Semi-Final Examination

Data Structure and Algorithms Semi-Final Examination

University

13 Qs

Data Structures2

Data Structures2

University

11 Qs

A-Level Computer Science Data Structures Quiz

A-Level Computer Science Data Structures Quiz

12th Grade - University

14 Qs

BCS 8th BDA Quizz

BCS 8th BDA Quizz

University

20 Qs

20CS2018 - DAA - Batch1

20CS2018 - DAA - Batch1

University

15 Qs

Graphs in Data Structures - Gunalakshmi

Graphs in Data Structures - Gunalakshmi

Assessment

Quiz

Computers

University

Medium

Created by

Cherukuri Gunalakshmi

Used 12+ times

FREE Resource

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

How is a graph represented in memory?

  • Linked List

  • Adjacency Matrix

  • Hash Table

  • Tree Structure

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Which set represents the vertices of the graph?

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}

{1, 2, 3, 4, 5, 6,}

{1, 2, 3, 4, 5, 6, 7}

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Which two vertices are adjacent vertices?

5 is adjacent to 6

3 is adjacent to 6

4 is adjacent to 1

3 is adjacent to 2

4.

MULTIPLE CHOICE QUESTION

30 sec • 3 pts

Media Image

Which order of traversal is correct using depth-first?

A B C G D E F

A B D C E C G

A B G C D F E

A E C F D G C

5.

MULTIPLE CHOICE QUESTION

30 sec • 3 pts

Media Image

Which order of traversal is correct using breadth-first?

A B D E C F G

A B C G D E F

A B D C G E F

A B DG C D E F

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In which scenario is a weighted graph used?

  • When you only need a path between vertices

  • When there is no direction between vertices

  • When edges have associated values, such as cost or distance

  • When all vertices are directly connected to each other

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which graph traversal algorithm uses a stack data structure?


  • BFS

  • Floyd-Warshall Algorithm

  • Dijkstra's Algorithm

DFS

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?