What is the auxiliary space complexity of the tree sort algorithm?

The data structure required for Breadth-First Traversal on a graph is?

For which of the following combinations of the degrees of vertices would the connected graph be Eulerian?

In recursion, the condition for which the function will stop calling itself is called the?

Consider the polynomial p(x) = k₀ + k₁x + k₂x² + k₃x³, where k₀, k₁, k₂, and k₃ are non-zero constants. The minimum number of multiplications needed to evaluate p(x) is:

What is the time complexity of Depth First Search (DFS) on a graph G with n vertices and m edges, when the graph is represented using an adjacency matrix?

#include int main() { int array[10]; int j=0; for (j=0; j<10; j++) { array[j]=0; } printf("%d", array[10]); }

A text is made up of the characters a, b, c, d, e with the following probabilities: a = 0.11, b = 0.40, c = 0.16, d = 0.09, e = 0.24. The optimal Huffman coding technique will have an average length of:

// size of array is n min = arr[0] for i from 1 to n: if (arr[i] < min) min = arr[i] How many times the assignment operator (inside the loop) is executed using the given algorithm when the array

• is sorted in ascending order?
• is sorted in descending order?

Which of the following statements about Linked List data structure is/are not true when compared to an array?