What is the time complexity of Huffman Coding?

An algorithm that performs encryption or decryption is called a

The number of swappings needed to sort the numbers 10, 22, 9, 11, 31, 7, 14 in ascending order, using bubble sort is

In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.

What is the correct formula for the load factor when m items are placed in a hash table with an array size of s?

Which of these is not an application of a linked list?

A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than the maximum element in T?

What is an AVL tree?

Consider the intermediate code given below:

1. i = 1 2. j = 1 3. t1 = 5 * i 4. t2 = t1 + j 5. t3 = 4 * t2 6. t4 = t3 7. a[t4] = –1 8. j = j + 1 9. if j <= 5 goto(3) 10. i = i + 1 11. if i < 5 goto(2)

The number of nodes and edges in the control-flow-graph constructed for the above code, respectively, are

What will happen when the following code is executed?

void my_function()
{
  my_function();
}
int main()
{
  my_function();
  return 0;
}