Heap is a

a$)2-3$ tree

b$)$ Complete binary tree

c$)$ Binary search tree

d$)$ AVL tree Which of the following techniques is used to implement the Floyd's algotithm?

a$)$ Decrease and conguer

b$)$ Greedy algorithm

c$)$ Divide and conquer

d$)$ Dynamic programming A directed acyclic graph $($DAG$)$ may has more than one topological sort ordering

results.

a$)$ True

b$)$ False

Which type of tree accurately represents the following tree?

d$)2-3$ tree

Which decrease$-$and$-$conquer type is used to solve the Insertion Sort algorithm?

a$)$ Decrease by a constant

b$)$ Decrease by a constant factor

c$)$ Variable$-$size decrease

d$)$ Decrease by a random factor

Disadvantage of an AVL trees is:

a$)$ Search and insertion

b$)$ Frequent rotations

c$)$ Time complexity

d$)$ Analysis

Which data structure is typically used to implement a heap?

a$)$ Queue

b$)$ Array

c$)$ Heap

d$)$ Stack

What is the worst$-$case time complexity of a Lomuto Partitioning algorithm?

a$)O(n^2)1-$ Choose the correct answer $[5$ marks$]$

The decrease$-$by$-$constant algorithm reduces the problem$-$size by:

a$)$ One

b$)$ Half

c$)$ A variable amount

d$)$ A random factor

Is it possible to apply the Topological Sort algorithm on

$c{y}_{c}ly$

The Main Idea for Decrease$-$and$-$Conquer is:

a$)$ How fast an algorithm in question runs.

b$)$ Divide instange of problem into two or more smaller instances.

c$)$ Reduce original problem instance to smaller instance of the same problem

d$)$ How simplicity of an algorithm in question is$.$

Which algorithm is commonly used for generating permutations?

a$)$ Binary tree

b$)$ Exponentiation by squaring

c$)$ Insertion sort

d$)$ Johnson$-$Trotter algorithm