FINAL_EXAM_OVERVIEW

What is a binary search tree (BST)?

• A tree where each node has at most two children and values are stored in sorted order.

• A tree where nodes are connected in a circular manner.

• A tree where all nodes have the same value.

• A tree where nodes are arranged randomly.

What is the advantage of an AVL tree over a general binary search tree (BST)?

• AVL trees are always balanced, ensuring better search performance.

• AVL trees allow duplicate values.

• AVL trees do not require rotations for balancing.

• AVL trees are faster to construct than BSTs.

Which graph traversal method explores all vertices at the current depth before moving to the next depth?

• Depth-first search (DFS)

• Breadth-first search (BFS)

• Topological sort

• Kruskal's algorithm

What are the three types of inheritance in object-oriented programming?

• Public inheritance, protected inheritance, private inheritance

• Single inheritance, multiple inheritance, hierarchical inheritance

• Static inheritance, dynamic inheritance, hybrid inheritance

• Parent inheritance, child inheritance, sibling inheritance

What is the purpose of Dijkstra's shortest path algorithm?

• To find the shortest path from one vertex to all other vertices in a weighted and directed graph

• To sort the vertices of a graph in topological order

• To locate the spanning tree of a graph

• To balance a binary search tree

What is the purpose of virtual functions in C++?

• To implement member functions in a derived class

• To enable dynamic binding during runtime

• To trace programs involving base and derived classes

• To declare static functions in a class

Which data structure is best suited for adjacency representation in graphs?

• Array

• Linked list

• Adjacency matrix or adjacency list

• Stack

What is the primary focus of the Big O function in algorithm analysis?

• To measure the growth rate of a function

• To sort data using AVL trees

• To implement heap operations

• To trace polymorphism in C++

Which operation is NOT typically associated with heap-related problems?

• Insert and delete

• Heap up and heap down

• Heap sort

• Linked list traversal

What is polymorphism in C++ and how is it achieved?

• It is the ability to implement member functions in a derived class, achieved through inheritance

• It is the ability to perform dynamic binding, achieved through virtual functions

• It is the ability to trace programs involving base classes, achieved through static functions

• It is the ability to declare virtual functions, achieved through heap operations