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
Questions by mysticPrince
0
votes
1
answer
1
Test Series Qs Compiler Design LR(0)
Consider the following grammar. S $\rightarrow$ (S)S | ∊ How many conflicts occur in LR (0) parser for the above grammar?
Consider the following grammar. S $\rightarrow$ (S)S | ∊How many conflicts occur in LR (0) parser for the above grammar?
891
views
asked
Jan 3, 2016
Compiler Design
compiler-design
lr-parser
+
–
0
votes
3
answers
2
Test Series Question on Second Chance page Replacement
Demand paging uses a second chance page replacement policy (clock). It uses one use bit to give every page one more chance in FIFO replacement. Whenever a page is referenced its use bit set to 0. Whenever it is need to replace by other page for ... 0, 1, 2, 0, 3, 0, 4, 2, 3 The number of page faults occur using clock algorithm are ___________.
Demand paging uses a second chance page replacement policy (clock). It uses one use bit to give every page one more chance in FIFO replacement. Whenever a page is referen...
2.8k
views
asked
Dec 17, 2015
Operating System
page-replacement
operating-system
+
–
0
votes
2
answers
3
Test Series QS - Algorithms
When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of different orders passing in which these keys values can occur on the search path from the root to node containing the value 50 are ________.
When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of d...
515
views
asked
Dec 8, 2015
DS
data-structures
binary-search-tree
numerical-answers
made-easy-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register