0 votes
0 answers
1
Consider the following NFA M , over the alphabet {a}let L(M) be the language accepted by the NFA M . let $M'$ denote the machine obtained by the final and non final sta...
0 votes
0 answers
3
Consider the following 8 bit multiplication process (-121) X (-113) . What is the recorded multiplier in the multiplication.
0 votes
0 answers
4
Initially all flips-flops in the circuit are cleared to zero , what is the mod value of the counter ___________I got – 3 sorry for the poor image quality
0 votes
0 answers
5
0 votes
0 answers
6
Which of the following features cannot captures by CFG ? Syntax of if – then- else statementWhether the variable is declared before its useMatching nested parenthesisN...
3 votes
0 answers
7
Every undecidable language is not recognized by TM ??Statement is True / False
0 votes
0 answers
8
Help me in this ….
0 votes
1 answer
9
Certain CPU uses expanding op-code . It has 16 bit instructions with 6-bit addresses . It has maximum 192 one-address Instructions.Then number of 2-addresses instructions...
1 votes
1 answer
10
Suppose we want to pick two numbers from {1,2……,100} randomly . The probability that sum of the two numbers is divisible by 5 is _________________
0 votes
0 answers
11
Which of the following parser resolves the shift over reduce conflict ??
0 votes
0 answers
12
Let G be a simple graph with 11 vertices . if degree of each vertex is atleast 3 and atmost 5 , then the number of edges in G should lie between I got 16 and 28
0 votes
0 answers
15
The Counter is ..Decade counter Asynchronous counterjohnson counterRing counter My question is there’s any easy to solve such type of question ??of I have to just by-h...
0 votes
1 answer
17
0 votes
1 answer
18
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept