A procedure that calls itself in a program is called _______.

State whether True or False. For all possible inputs, a linear algorithm to solve a problem must perform faster than a quadratic algorithm to solve the same problem.

If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

What is the worst-case scenario for quicksort to sort an array of n elements?

Which of the following lines of the code will delete two successive nodes of a single linked linear list(with more than two nodes)? Here 'LINK[X]' denotes the address field of node X.

A non- planar graph with the minimum number of vertices has:

________ algorithms are used to arrange random data into some order.

____ methods are methods that exist to be used with an object created from a class.

In a truth table, the expression ____ is true

In a truth table, the expression ____ is false.

Every element in an array is assigned a unique number known as a ________.