The chromatic number of the following graph is

How many times is the function my_function() called?

What is the time complexity of quicksort in the average-case scenario?

Which of the following is not a type of queue?

Min priority queue is the most commonly used data structure for implementing

Consider the following undirected graph with edge weights as shown:

The number of minimum-weight spanning trees of the graph is

Which sorting algorithm would be most suitable for sorting a list that is almost sorted?

Dot duration is the basic unit of time measurement in

Consider a graph G=(V, E), where V = { v₁,v₂,…,v₁₀₀ }, E={ (v_i, v_j) | 1 <= i < j <= 100) and weight of the edge (v_i, v_j) is |i-j|. The weight of minimum spanning tree of G is

Consider the C program below. 

#include <stdio.h> int *A, stkTop; int stkFunc (int opcode, int val) {     static int size=0, stkTop=0;     switch (opcode)     {     case -1:         size = val;         break;     case 0:         if (stkTop < size ) A[stkTop++]=val;         break;     default:         if (stkTop) return A[--stkTop];     }     return -1; } int main() {     int B[20];     A=B;     stkTop = -1;     stkFunc (-1, 10);     stkFunc (0, 5);     stkFunc (0, 10);     printf ("%dn", stkFunc(1, 0)+ stkFunc(1, 0)); }

The value printed by the above program is ___________