Exploring Graphs and Trees Quiz

What is a simple graph in graph theory?

• A graph with multiple edges between the same pair of vertices

• A graph with no loops and no multiple edges

• A graph with loops but no multiple edges

• A graph with multiple edges but no loops

Which of the following is a type of tree in data structures?

• Binary Tree

• Circular Tree

• Hexagonal Tree

• Linear Tree

Which algorithm is used for breadth-first traversal of a graph?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Dijkstra's Algorithm

• Prim's Algorithm

In a Binary Search Tree (BST), what is the property of the left child node?

• It is always greater than the parent node

• It is always less than the parent node

• It is always equal to the parent node

• It can be greater or less than the parent node

Which of the following is a common way to represent a graph in computer memory?

• Adjacency Matrix

• Binary Tree

• Linked List

• Hash Table

What is a common application of trees in computer science?

• Sorting algorithms

• Network routing

• Database indexing

• Image processing

What is the degree of a vertex in a graph?

• The number of edges connected to the vertex

• The number of vertices in the graph

• The number of loops in the graph

• The number of isolated vertices

Which of the following is not a type of tree?

• AVL Tree

• Red-Black Tree

• Spanning Tree

• Fibonacci Tree

In graph theory, what is a path?

• A sequence of vertices with no repeated edges

• A sequence of edges with no repeated vertices

• A sequence of vertices and edges with no repetitions

• A sequence of vertices where each adjacent pair is connected by an edge

What is the height of a tree?

• The number of nodes in the tree

• The number of edges in the longest path from the root to a leaf

• The number of leaves in the tree

• The number of branches in the tree