5 votes
61
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
63
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
65
An operator precedence parser is aBottom-up parser.Top-down parser.Back tracking parser.None of the above.
2 votes
66
#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
67
1 votes
68
0 votes
69
16 votes
70
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function iscontinuous and differentiablecontinuous but not differentiabledifferentiable but...
6 votes
73
A student has to answer $9$ out of $12$ questions. How many ways if he has to answer at least $4$ out of first $5$ questions?
3 votes
74
Find First and Follow in the following grammar.$E\rightarrow E+T \mid T$$T\rightarrow TF \mid F$$F\rightarrow F^* \mid a \mid b$
2 votes
76
0 votes
77
What are the advantages of scope resolutor & referencing in c++?
0 votes
80
17 votes
82
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Secondary index} & (p) & \text{Function dependency} \\\hline (b) & \text{Non-proced...
1 votes
85
Given 2 long integers having n digits , it is required to multiply them.Assuming the numbers are represented in an array of size n . The time complexity to multiply them ...
2 votes
86
#include<stdio.h int main() { int a = 12; void *ptr = (int *)&a; printf("%d", *ptr); getchar(); return 0; }A12BCompiler ErrorCRunt Time ErrorD0
1 votes
87
If an = 1000*n /n!, for n = 1, 2, 3, ...., then the sequence {an }(a) doesn't have a maximum(b) attains maximum at exactly one value of n(c) attains maximum at exactly tw...
1 votes
88
5 votes
89
What will be the coefficient of x^17 in the expansion of (x+x^2+x^3+x^4+x^5+x^6)^4?