2 votes
42
Why does a perfect square number have odd number of factors?
1 votes
46
Please Explain the Rule to find number of additions and subtractions required for multiplication of two given numbers.
2 votes
48
3 votes
49
0 votes
50
In the _______method , after the station finds the line idle , it sends or refrains from sending based on probabilitya)None-Persistentb)One -Persistentc) P-Persistentd)No...
1 votes
51
Q. 6 Xs has to be placed in the figure below such that each row contains at least one X. In how many ways can this be done?a) 160b) 180c) 170d) 26
5 votes
52
Find the regular grammar for $L=\{a^nb^m \mid n+m \text{ is even}\}$
0 votes
54
How to solve this in the simplest way?$T(n) = T(n/4) + T(3n/4) +n$
0 votes
56
a)π/√2 B) √π/2C) π/2 D)√(π/2
1 votes
57
$\underset{n \to \infty}{\lim} \dfrac{1}{n} \bigg( \dfrac{n}{n+1} + \dfrac{n}{n+2} + \cdots + \dfrac{n}{2n} \bigg)$ is equal to$\infty$$0$$\log_e 2$$1$
5 votes
60
What would be the equivalent pointer expression for referring the array element a[i][j][k][l]?A. ((((a+i)+j)+k)+l)B. *(*(*(*(a+i)+j)+k)+l)C. (((a+i)+j)+k+l)D. ...
16 votes
62
Which one of the following is a top-down parser?Recursive descent parser.Operator precedence parser.An LR(k) parser.An LALR(k) parser.
11 votes
64
An operator precedence parser is aBottom-up parser.Top-down parser.Back tracking parser.None of the above.
2 votes
65
#include <stdio.h int main() { //code int x; printf("%d",printf("A")+printf("BC")*printf("DEF")); return 0; }What should be the output of following program? Please explai...
0 votes
66
1 votes
67
0 votes
68