DSA Midterm Exam Set 3 Part 1

Which algorithm finds the minimum cost to connect all vertices?

• Depth-First Search

• Bellman–Ford Algorithm

• Minimum Spanning Tree

• Dijkstra’s Algorithm

The process of adding a new element to the end of an array.

• Append

• Insert

• Extend

• Add

These are the two direction a graph can take.

• Bidirected

• Directed

• Undirected

• Unidirected

The situation when two keys map to the same index.

• Colition

• Collision

• Collition

• Collide

A graph where edges have direction is called __ graph.

A list where each vertex maintains a record of connected vertices.

Algorithm that explores as far as possible along each branch before backtracking.

When left and right subtrees of every node differ in height by no more than 1.

A binary tree that keeps elements in a sorted order with small values are kept left and the larger value goes right, allowing efficient search.

An AVL imbalance on the left-left side is fixed by what rotation?