1 votes
1
Let L = $\{ a^n b^m | m , n \in \textbf{N} \text{ and m is multiple of n}\}$How do we prove that this language is not CFL.
14 votes
2
A relational database contains two tables Student and Performance as shown below:$$\overset{\text{Table: student}}{\begin{array}{|l|l|} \hline \text{Roll_no} & \text{Stud...
1 votes
6
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
0 votes
7
#include <stdio.h>int fun(){ static int num = 16; return num ;}int main(){ for(fun(); fun(); fun()) printf("%d ", fun()); return 0;}Predict the output along with t...