Register
Filter

Answers by pradeepdeepu

0 votes
2
TOC Chomsky Classification
Consider the grammar below: G: S → AaBC BC → ε aB →aaB A → ε Which of the following is TRUE?( Marks: -0.33 ) G is Type 2 G is Type 3 G is Type 1 G is Type 0
Consider the grammar below:G: S → AaBCBC → εaB →aaBA → εWhich of the following is TRUE?( Marks: -0.33 ) G is Type 2 G is Type 3 G is Type 1 G is Type 0
0 votes
3
computer networks
0 votes
4
# made easy demo test #Q 60
0 votes
5
2NF decomposition
How is it option D??
How is it option D??
0 votes
7
Compiler
First {a} =? First{a, b} =? First{a, b, c} =? First {a, $} =? Where a, b, c are terminals.
First {a} =?First{a, b} =?First{a, b, c} =?First {a, $} =?Where a, b, c are terminals.
2 votes
10
Transaction Management
Which of the following protocols does not ensure conflict serializability and safety from deadlocks? Graph based protocols Two-phase locking protocol Time-stamp ordering protocol Both a & b
Which of the following protocols does not ensure conflict serializability and safety from deadlocks?Graph based protocolsTwo-phase locking protocolTime-stamp ordering pro...
0 votes
12
Application layer Protocol
Which of the following is/are stateful application layer protocol? (i) HTTP (ii) FTP (iii) TCP (iv) POP3
Which of the following is/are stateful application layer protocol?(i) HTTP(ii) FTP(iii) TCP(iv) POP3
1 votes
13
Backtracking
Here , Number of backtracks are 3 or 4 ? I am getting 3 but given answer is 4. Please explain.
Here , Number of backtracks are 3 or 4 ? I am getting 3 but given answer is 4. Please explain.
1 votes
15
Order Of Evaluation
What is the output generated by this code? main(){ int i=0; printf("%d %d %d %d %d %d %d", i++, ++i, i, i++, i, ++i, i++); } 4 4 3 2 2 2 0 4 5 5 2 5 5 0 0 2 2 2 2 4 4 Compiler Dependent
What is the output generated by this code?main(){ int i=0; printf("%d %d %d %d %d %d %d", i++, ++i, i, i++, i, ++i, i++); }4 4 3 2 2 2 04 5 5 2 5 5 00 2 2 2 2 4 4Compiler...
1 votes
16
GATE CSE 2002 | Question: 2.19
To evaluate an expression without any embedded function calls One stack is enough Two stacks are needed As many stacks as the height of the expression tree are needed A Turing machine is needed in the general case
To evaluate an expression without any embedded function callsOne stack is enoughTwo stacks are neededAs many stacks as the height of the expression tree are neededA Turin...