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:

A circuit which is a connected graph and which includes every vertex of the graph is known as_____.

A one dimensional array A has indices 1...75. Each element is a string and takes up three memory words. The array is stored starting at location 1120 decimal. The starting address of A[49] is:

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 ________.

Each object of a class has its own copy of the class's ________.

A(n) ________ informs the compiler that a class will be declared later in the program.