Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ashishkumar
3
answers
1
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 5
Which of the following statements regarding $LR(0)$ parser is FALSE? A $LR(0)$ configurating set cannot have multiple reduce items A $LR(0)$ configurating set cannot have both shift as well as reduce items If a reduce item is ... a $LR(0)$ configurating set it cannot have any other item A $LR(0)$ parser can parse any regular grammar
Which of the following statements regarding $LR(0)$ parser is FALSE?A $LR(0)$ configurating set cannot have multiple reduce itemsA $LR(0)$ configurating set cannot have ...
3.4k
views
commented
Nov 4, 2019
Compiler Design
go-cd-1
parsing
lr-parser
+
–
3
answers
2
Test by Bikram | Computer Networks | Test 1 | Question: 27
A sliding window protocol uses Selective Repeat. The sender sliding window size is $32$. After receiving the first $100$ frames, the acknowledgement number that is piggybacked by the receiver along with data frame is _______.
A sliding window protocol uses Selective Repeat. The sender sliding window size is $32$. After receiving the first $100$ frames, the acknowledgement number that is piggyb...
2.0k
views
commented
Oct 17, 2019
Computer Networks
tbb-cn-1
numerical-answers
+
–
11
answers
3
GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is...
24.9k
views
commented
Oct 8, 2019
DS
gatecse-2014-set1
data-structures
binary-tree
numerical-answers
normal
+
–
5
answers
4
GATE CSE 2015 Set 3 | Question: 39
Consider the following recursive C function. void get(int n) { if (n<1) return; get (n-1); get (n-3); printf("%d", n); } If $get(6)$ function is being called in $main()$ then how many times will the $get()$ function be invoked before returning to the $main()$? $15$ $25$ $35$ $45$
Consider the following recursive C function.void get(int n) { if (n<1) return; get (n-1); get (n-3); printf("%d", n); }If $get(6)$ function is being called in $main()$ th...
18.5k
views
commented
Jun 30, 2018
Algorithms
gatecse-2015-set3
algorithms
recurrence-relation
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register