Which of the following operations in the simple linked list will modify the beginning of the linked list?

You have implemented a queue with a circular array keeping track of the first item, the last item, and the count (the number of items in the array). Suppose the address of the first is zero, and that of the last is CAPACITY-1, what can you say about the count?

In the linked representation of a sparse matrix, the head node for a column list stores_____

The hashing function which dynamically adapts to changes in the table being accessed is called ________.

What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?

If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a perfect binary tree?

In a selection sort algorithm, the number of passes required to perform the sort are ______.

Which of the following operations is more expensive in the dynamically created linked list than it is in the conventional array?

A binary tree, all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:

What do we call a binary tree in which all the levels, except possibly the last level, have the maximum number of nodes, and in which all the nodes at the last level appear as far left as possible?