Chapter Quiz

Which of the following statements accurately describes a property of AVL trees?

  

 

•   AVL trees allow unlimited height for optimal performance.

• AVL trees are always skewed.

• AVL trees self-balance to maintain a balance factor of at most one for each node.

• AVL trees provide slower lookups compared to Red-Black Trees.

Which traversal method is commonly implemented using a stack or recursion?

  

   -

  

• Depth First Search (DFS)

• Breadth First Search (BFS)

•   Dijkstra's Algorithm

• Bellman-Ford Algorithm

Which data structure is typically used for implementing Breadth First Search (BFS)?

  

• Stack

• Array

• queue

• linked List

In an AVL tree, what rotation is performed when a node is added to the right subtree of the right subtree?

  

• Left Rotation

• Right Rotation

• Left-Right Rotation

• Right-Left Rotation

What are the two most common ways to traverse a graph?

  

   -

• Depth First Search (DFS) and Bellman-Ford Algorithm

• Breadth First Search (BFS) and Dijkstra's Algorithm

• Depth First Search (DFS) and Breadth First Search (BFS)

•    Dijkstra's Algorithm and Bellman-Ford Algorithm

Explain how Depth First Search (DFS) works in graph traversal.

  

  

  

• DFS visits all adjacent vertices before moving to neighboring vertices.

• DFS prioritizes vertices closer to the starting vertex and explores their neighbors first.

• DFS uses a queue to visit vertices in the order they are added.

• DFS ensures that vertices are visited in alphabetical order.

What is the maximum height an AVL tree with 'N' nodes can have?

 

• N

• 2N

• log(N)

• log(N)2

In which traversal method are all adjacent vertices of a vertex visited before exploring neighboring vertices?

  

 

• Depth First Search (DFS)

•    -

  Breadth First Search (BFS)

• Dijkstra's Algorithm

•   Bellman-Ford Algorithm

Compare and contrast Depth First Search (DFS) and Breadth First Search (BFS) in terms of their traversal strategies.

   .

• DFS prioritizes vertices closer to the starting vertex, while BFS explores all adjacent vertices before moving to neighboring vertices

• DFS always finds the shortest path between two vertices, while BFS may not necessarily find the shortest pat

• DFS uses a queue for traversal, while BFS uses a stack.

• BFS is more efficient for large graphs, while DFS is more suitable for finding cycles.

Which of the following is an application of AVL trees?

 

 

• Real-time video processing

• Sorting algorithms

• Database indexing

• Audio compression