# Priority Queues: Quiz

## Priority Queues: Quiz >> Data Structures

*Please Do Not Click On The Options.

*** If You Click Mistakenly Then Please Refresh The Page To Get The Right Answers.**

#### Priority Queues: Quiz

TOTAL POINTS 6

**1**.

1 point

**2**.

1 point

**3**. Consider a complete binary tree represented by an array $[19,14,28,15,16,7,27,15,21,21,5,2]$.

1 point

**4**. Assume that a max-heap with $1_{5}$ elements is stored in a complete 5-ary tree. Approximately how many comparisons a call to $Insert()$ will make?

1 point

**5**. Assume that a max-heap with $1_{6}$ elements is stored in a complete 7-ary tree. Approximately how many comparisons a call to $ExtractMax()$ will make?

1 point

**6**. Assume that we represent a complete $d$-ary tree in an array $A[1…n]$ (this is a 1-based array of size $n$). What is the right formula for the indices of children of a node number $i$?

1 point

Post Views: 100