1 votes
0 answers
1
Is this the correct way to solve ?Q) int algorithm(int n){ int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorit...
0 votes
0 answers
2
The difference between 201 and next larger double precisionnumber is 2P, if IEEE double precision format is used then thevalue of P is ________.what is next larger precis...
1 votes
1 answer
3
The given logic circuit is realizing the boolean function and function Identify the function f3(A,B,C,D)Answer given is
0 votes
0 answers
4
0 votes
1 answer
5
I’m getting 25.99 in gate 2019, OBC. can I get RA in IIT Bombay?
4 votes
0 answers
6
Will ISRO 2019 recruit this year? till now there is no information about ISRO 2019 form.Please share if you have information regarding it.
0 votes
1 answer
7
Can anyone pls write about ISRO cut off for CSE in GEN and OBC category?
2 votes
0 answers
8
When ISRO 2019 form filling will start?
2 votes
1 answer
9
Will I get any IITs under 40 marks in gate 2018 in OBC category ?
1 votes
5 answers
11
Every LL(1) grammar is ______A.SLR(1)B.LALR(1)C.LR(1)D.Both B & C
0 votes
1 answer
12
The number of tokens in the fortran statements DO 10 I = 1.3 is ?
0 votes
0 answers
13
Incompatable types work with the _____________A. Syntax treeB.semantic analyzerC.Code optimizerD.Lexical analyzerAnswer is BPlease explain why?
0 votes
0 answers
14
Which of the following is not a token of c -program?A. 1.02e + 2B. # defineC. 123.33D. MAXplease explain why?
0 votes
1 answer
15
Question:Find the number of tokens in the following C code using lexical analyzer of the compiler.
7 votes
9 answers
16
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
0 votes
0 answers
17
Consider the following graph:The number of strongly connected components of the graph are ________.
0 votes
1 answer
18
T(n) = T(root(n)) + n where n>=2Time complexity ?
2 votes
2 answers
19
int main() { int a = 1, b = 2, c = 3; printf("%d", a += (a += 3, 5, a)); } How is this evaluated ?
0 votes
1 answer
20
An implementation of a queue Q, using two stacks S1and S2, is given below: The number Push and Pop operation needed is represented by X and Y, then the value of X + Y for...