Which of the following terms does not relate to stack operations?

Which of the following algorithms has a time complexity that is not O(n^2)?

Assuming an integer (int) is 4 bytes, what is the total size of an array int arr[15]?

Which of the following is not a variant of merge sort?

Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is

Which of the following cannot be implemented using a stack data structure?

Consider the following C code segment:

a = b + c; e = a + 1; d = b + c; f = d + 1; g = e + f;

In a compiler, this code segment is represented internally as a directed acyclic graph (DAG). The number of nodes in the DAG is

Find the correct statement about Binary Trees.

There are n unsorted arrays: A1, A2, ....,An. Assume that n is odd. Each of A1, A2, ...., An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1, A2, ....,An is

What is the chromatic index of a graph?