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 skywalker_19
0
votes
0
answers
1
Operating Systems
To check that a mutual exclusion algorithm is not free from deadlock,is it necessary to check if the entire processes in the system are in deadlock- If there are 5 processes in the system- P0,P1,P2,P3,P4 and if we have to prove that the ... definitely in deadlock- This means it is not necessary for all processes in the system to be in deadlock to say deadlock has occurred?
To check that a mutual exclusion algorithm is not free from deadlock,is it necessary to check if the entire processes in the system are in deadlock-If there are 5 proces...
290
views
asked
Oct 23, 2018
Operating System
deadlock-prevention-avoidance-detection
process-synchronization
operating-system
+
–
2
votes
1
answer
2
Indexing
How to prove that if same size blocks are allocated to B trees and B+ trees then:- No. of index nodes in B tree >= No. Of index nodes in B+ tree
How to prove that if same size blocks are allocated to B trees and B+ trees then:-No. of index nodes in B tree >= No. Of index nodes in B+ tree
678
views
asked
Oct 8, 2018
Databases
indexing
databases
b-tree
bplustrees
+
–
1
votes
1
answer
3
Korth
In a self referential relationship many to many relationship set, how minimum many tables are required to store in case of partial participation. Example: If an employee can report to several managers and manager can supervise any number of employees- Shouldn't it be 1 table with compose candidate key as Eid,Supid
In a self referential relationship many to many relationship set, how minimum many tables are required to store in case of partial participation. Example: If an employee ...
976
views
asked
Oct 3, 2018
Databases
er-diagram
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register