A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.

🎲 Try a Random Question  |  Total Questions in Quiz: 167  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Data Structure Practice Test — practice the complete quiz, review flashcards, or try a random question.

In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data. (Source: Wikipedia)

Important Data Structures are:
Linked List
Binary Tree
Hash Table
Stacks
Queues
Heaps


A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.