Recent questions without a selected answer

1 votes
0 answers
31
1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0)evensum=evensum+elseoddsum=oddsum+i;
0 votes
0 answers
32
Design a circuit with 4 inputs that has outputs with a binary value equal to the number of inputs that are HIGH.
0 votes
0 answers
33
0 votes
0 answers
37
Design a DFA (Deterministic Finite Automaton) that recognizes the language L defined follows: L= {w - {a, b}* | every a in w is immediately followed by bb}
0 votes
0 answers
39
I recently qualified gate with low score of 320. As per last year cutoff I may get CS in NIT goa or NIT puducherry or IIIT tirichyIs it worth if i join in any one of thes...
0 votes
0 answers
40
I am not able to access the pgee test links it shows me "currently unable to handle this request" Please help
0 votes
0 answers
41
S2: R1(x);r2(z);r3(x);r1(z);r2(y);r3(y);w1(x);w2(z);w3(y);w2(y)Please help
0 votes
1 answer
45
Given, that the eigen values of a 2 x 2 matrix are -1,1 and its singular values are 1,0. What is the rank of the matrix?a) rank is 0b) rank is 1c) Such a matrix can't exi...
0 votes
1 answer
47
In quick sort, n numbers the (n/10)th element is selected as pivot using n^2 sortimng time complexity what will be the time complexity of quick sort is.....a)O(nlogn)b)O(...
0 votes
0 answers
48
Use the semantic rules below to draw an annotated parse tree for the expression. Compute the final value. (4*2)+3+(3*3+2)n
0 votes
0 answers
50
Describe the bottleneck between the main memory and the CPU, and state how the bottleneck is resolved
1 votes
2 answers
52
#include<stdio.h>#define ADD(a,b)(a+b)#define SQUARE(x)(x*x)int main(){int x=2;int y=3;int z = ADD(SQUARE(x++),y);printf("%d\n",z);return 0;}What is the output of the abo...
0 votes
0 answers
55
1 votes
0 answers
56
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved? Answer Follow·1 Request ...
2 votes
1 answer
58
for (i = 1; i <= N; i++){ for (j= 1;j <= i^2;j=j+i){ //some code}} how is this O(n^2)? explain in detail and simple terms
0 votes
1 answer
59