Disha Expert Team Solutions for Chapter: Practice Sets, Exercise 8: PRACTICE SET - 8

The total number of edges in a complete graph of n vertices is:

Consider two regular languages $L1=\left(a + b\right) * a$ and $L2 = b \left(a + b\right)*$. The intersection of $L1$ and $L2$ is given by:

Which of the following C++ statement is correct?

Which of the following statement is false in context of constructors in C++?

The correct hierarchical relationship among context-free, right-linear and context-sensitive language is given by:

The number of flip flops required in a modulo N counter is:

Quick Sort is run on two inputs shown below to sort in ascending order:
$1, 2, 3, \_\_\_\_\_ n$
$n, n-1, n - 2 ..... 2, 1$
Let $C1$ and $C2$ be the number of comparisons made for the inputs (i) and (iii) respectively then:

There are occasions when it does not matter if the function produces $0$ or $1$ for a given minterm. Minterms that may produce either $0$ or $1$ for the function are said to be: