What is the maximum number of edges in a bipartite graph having 10 vertices?

Out of 4 distinct keys, how many distinct binary search trees can be created?

The maximum number of edges in an n-node undirected graph without self-loops is:

What is the running time of insertion sort if the input is pre-sorted?

How many write operations will be required to sort the array arr={2, 4, 3, 5, 1} using cycle sort?

For which type of graph is there no solution available?

What is the output of the following C program?

#include<stdio.h>

int main()

{

   char str[20] = "AbekusQuiz";

   printf ("%d", sizeof(str));

   return 0;

}

Consider the following code segment.

x = u - t; y = x * v; x = y + w; y = t - z; y = x * y;

The minimum number of total variables required to convert the above code segment to static single assignment form is 

Which of the following is a correct representation of the inclusion-exclusion principle (where |C,D| represents the intersection of sets C and D)?

Why is the array implementation of a stack not dynamic?