Register
Filter

Answers by AnilGoudar

2 votes
31
Operator precedence
EF→E∗F∣F+E∣F→F−F∣id E -> E*F | F+E | F F -> F - F | id What is operator precedence order for * , + , - ?
EF→E∗F∣F+E∣F→F−F∣idE - E*F | F+E | FF - F - F | idWhat is operator precedence order for * , + , - ?
0 votes
32
Pda for language
Construct pda for l={ a^2n b^n |n>=1}.
Construct pda for l={ a^2n b^n |n>=1}.
2 votes
33
NULL * 0 = 0 or NULL
1) NULL * 0 = 0 or NULL ? 2) CAN UNIQUE KEY CONTAIN MULTIPLE NULL VALUES
1) NULL * 0 = 0 or NULL ? 2) CAN UNIQUE KEY CONTAIN MULTIPLE NULL VALUES
2 votes
34
normal form
1 votes
35
DBMS Doubt - Normalization
Does any normal form impose the condition "every non-key should depend upon every key"?
Does any normal form impose the condition "every non-key should depend upon every key"?
0 votes
36
peter linz excercise
Which of the following languages are regular 1)L= wwR v : v,w belongs to {a,b}+ 2)L=uwwR v : u,v,w belongs to {a,b}+ 3)L=uwwR v : u,v,w belongs to {a,b}+ .|u| >= |v|
Which of the following languages are regular1)L= wwR v : v,w belongs to {a,b}+2)L=uwwR v : u,v,w belongs to {a,b}+ 3)L=uwwR v : u,v,w belongs to {a,b}+ .|...
1 votes
37
exception
Which option is correct?
Which option is correct?
2 votes
38
Recursive enumerable sets
A is recursive if both A and its complement are accepted by turing machine True or false
A is recursive if both A and its complement are accepted by turing machineTrue or false
5 votes
39
GATE CSE 2010 | Question: 32
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$ $10$, $11$, $01$, $00$ $10$, $00$, $01$, $11$ $11$, $10$, $00$, $01$
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$$10$, $11$, $...
0 votes
40
Ace Test Series: Theory Of Computation - Finite Automata
Simple question. However the question mention MFA or minimal Finite Automation. So can i take NFA as it has 3 states. DFA has four ( 1 extra for the dead state);
Simple question. However the question mention MFA or minimal Finite Automation. So can i take NFA as it has 3 states. DFA has four ( 1 extra for the dead state);
0 votes
42
#process synchronization
What is the difference between spinlock and deadlock?
What is the difference between spinlock and deadlock?
2 votes
43
what is the difference between command and instruction
what is the difference between command and instruction
what is the difference between command and instruction
1 votes
44
structure
Which option is correct? & why?
Which option is correct? & why?
3 votes
45
ISRO2017-48
What problem is solved by Dijikstra banker' algorithm? Mutual exclusion Deadlock recovery Deadlock avoidance Cache coherence
What problem is solved by Dijikstra banker' algorithm?Mutual exclusionDeadlock recoveryDeadlock avoidanceCache coherence
0 votes
48
Push Down Automata
Consider the following PDA: Which of the following language accepted by above PDA? All string that start and end with same symbol. All string that contain same number of ‘a’ and ‘b’. Contain same numbers of ‘a’ and ‘b’ and start and end with same symbol. None of the above
Consider the following PDA:Which of the following language accepted by above PDA?All string that start and end with same symbol.All string that contain same number of ‘...
4 votes
49
Test by Bikram | Theory of Computation | Test 1 | Question: 23
PDA can be used for: infix to postfix conversion implementing recursive function calls evaluating arithmetic expressions all of the above
PDA can be used for:infix to postfix conversionimplementing recursive function callsevaluating arithmetic expressionsall of the above
2 votes
51
ISRO2017-52
Given reference to the following pages by a program 0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3 How many page faults will occur if the program has three page frames available to it and uses an optimal replacement? 7 8 9 None of the above
Given reference to the following pages by a program0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3How many page faults will occur if the program has three page frames available t...
16 votes
52
ISRO2017-21
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$ $60$ ns $30$ ns $150$ ns $70$ ns
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$$60$ ns$30$ ns$150$ ns$70$ ns
1 votes
56
ISRO2017-75
Choose the most appropriate HTML tag in the following to create a numbered list <dl> <list> <ul> <ol>
Choose the most appropriate HTML tag in the following to create a numbered list<dl><list><ul><ol>
4 votes
57
ISRO 2017-79
The output of a lexical analyzer is A parse tree Intermediate code Machine code A stream of tokens
The output of a lexical analyzer isA parse treeIntermediate codeMachine codeA stream of tokens
1 votes
59
ISRO2014-70
Dirty bit is used to indicate which of the following? A page fault has occurred A page has corrupted data A page has been modified after being loaded into cache An illegal access of page
Dirty bit is used to indicate which of the following?A page fault has occurredA page has corrupted dataA page has been modified after being loaded into cacheAn illegal ac...
1 votes
60
Finit Automata
The possible number of prefixes for the given 'n' length string is (assume all symbols in the given string are different) a) n b) n+1 c) n+2 d) n-1 please explain.
The possible number of prefixes for the given 'n' length string is (assume all symbols in the given string are different)a) nb) n+1c) n+2d) n-1please explain.
Page: