CCP CCP Data Structures & Abstract Data Types 2

Question 1

In a binary tree, a node with no children is called a:

Accepted Answer

Leaf

Answer

A leaf node is a node in a binary tree that has no left or right child.

Question 2

A hash table resolves collisions using chaining by storing colliding elements in a:

Accepted Answer

Linked list at each bucket

Answer

Chaining stores all keys that hash to the same bucket in a linked list attached to that bucket.

Question 3

What is the average-case time complexity for searching in a balanced binary search tree (BST)?

Accepted Answer

O(log n)

Answer

A balanced BST halves the search space at each level, yielding O(log n) average-case search time.

Question 4

Which graph representation uses a 2D matrix to indicate edges between vertices?

Accepted Answer

Adjacency matrix

Answer

An adjacency matrix uses an n×n boolean (or weighted) matrix where entry [i][j] indicates an edge from vertex i to vertex j.

Question 5

A priority queue dequeues elements based on:

Accepted Answer

Assigned priority value

Answer

A priority queue always removes the element with the highest (or lowest) priority value, regardless of insertion order.

(CCP) Certified Computing Professional Practice Test