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 santhoshdevulapally
–1
votes
0
answers
31
LOTTERY SCHEDULING
Onetechniqueforimplementinglotteryschedulingworksbyassigning processeslotterytickets,which are used for allocating CPU time.Whenever a scheduling decision has to be made, a lottery ticket is chosen at random, and the process holding that ticket ... -prioritythreadsreceivemoreattention from the CPU than lower-prioritythreads consider on example and explain this scheduling algo.
Onetechniqueforimplementinglotteryschedulingworksbyassigning processeslotterytickets,which are used for allocating CPU time.Whenever a scheduling decision has to be made,...
519
views
asked
Nov 25, 2016
0
votes
0
answers
32
ME SWTEST
230
views
asked
Nov 22, 2016
0
votes
0
answers
33
HOW MANY NONISOMORPHIC ROOTED TREES ARE THERE WITH 3 VERTICES(use isomporphism for directed graphs)
497
views
asked
Nov 12, 2016
0
votes
0
answers
34
HOW MANY NONISOMORPHIC UNROOTED TREES ARE THERE WITH 3 VERICES
414
views
asked
Nov 12, 2016
0
votes
0
answers
35
SQL EXECUTION
247
views
asked
Nov 8, 2016
0
votes
1
answer
36
RECOVER SCHEDULES
239
views
asked
Nov 8, 2016
5
votes
1
answer
37
B+ TREE INSERTION
The following key values are inserted into a B+ Tree in which order of the internal node is 5 and that of leaf node is 4, in the sequence given below . The order of internal node is the maximum number of tree pointers in each node and the order ... maximum number of times leaf nodes would get split up as a result if these insertions is _____ ( Assume key distribution is not used )
The following key values are inserted into a B+ Tree in which order of the internal node is 5 and that of leaf node is 4, in the sequence given below . The order of inter...
2.7k
views
asked
Nov 8, 2016
Databases
b-tree
databases
+
–
3
votes
0
answers
38
Which parser can parse following grammar ?
Which of the Parsers from LL(1), LR(0), SLR(1), LALR(1) and CLR(1) can Parse the following grammar ? $\tt E \rightarrow ET | a$ $\tt T \rightarrow TE | b$
Which of the Parsers from LL(1), LR(0), SLR(1), LALR(1) and CLR(1) can Parse the following grammar ?$\tt E \rightarrow ET | a$$\tt T \rightarrow TE | b$
670
views
asked
Nov 1, 2016
Compiler Design
compiler-design
parsing
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
