How many nodes will a tree consisting of m edges have?

The most important condition for which the closest pair is calculated for the points (p_m, p_n) is?

What is it called when a user tries to remove an element from an empty stack?

FIFO is the

Graph G is obtained by adding vertex s to K_3,4 and making s adjacent to every vertex of K_3,4. The minimum number of colors required to edge-color G is

Given a single array of size 10 and no other memory available, which of the following operations is not feasible to implement using only push and pop?

We have a complete n-ary tree, and let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If L=31 and I=10, what is the value of n?

Breath First Search(BFS) has been implemented using queue data structure.

Which one of the following is a possible order of visiting the nodes in the graph above?

In a modified merge sort, the input array is split at a position one-third of the length (N) of the array. What is the tightest upper bound on the time complexity of this modified Merge Sort?

Consider the queues Q1 containing four elements and Q2 containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue(Q,element) and Dequeue(Q). The minimum number of Enqueue operations on Q1 required to place the elements of Q1 in Q2 in reverse order (shown as the Final State in the figure) without using any additional storage is