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 rishi71662data4
3
votes
1
answer
1
gatebook-os
Consider a virtual memory system running on a RISC CPU. Page tables are not locked in memory and may be swapped to disk. An 1w (load word) instruction reads one data word from memory; the address is the sum of value in a register and an immediate constant ... In the worst case how many page faults could be generated as a result of the fetch, decode, and execution of an 1w instruction?
Consider a virtual memory system running on a RISC CPU. Page tables are not locked in memory and may be swapped to disk. An 1w (load word) instruction reads one data word...
2.3k
views
asked
Dec 21, 2017
Operating System
page-fault
operating-system
virtual-memory
+
–
0
votes
1
answer
2
Process Synchronization
In a given synchronization construct, if there is no deadlock and no strict alternation between two process then is it always true that a process will starve ?
In a given synchronization construct, if there is no deadlock and no strict alternation between two process then is it always true that a process will starve ?
611
views
asked
Nov 16, 2017
Operating System
process-synchronization
operating-system
critical-section
+
–
4
votes
1
answer
3
tifr2010-b-26 gate2014-3-39
I don't seem to get the difference in both the questions. Finding L (or a) will take O(log n) comparisons which is fine. But now to search all elements between L and H (or a and b), weather it will take O(log n) time or constant time ? In ... , it is unclear. So how much time does it take ro search all elements between L and H (or a and b). ? Kindly explain.
I don't seem to get the difference in both the questions. Finding L (or a) will take O(log n) comparisons which is fine. But now to search all elements between L and H (o...
677
views
asked
Oct 26, 2017
DS
binary-search-tree
data-structures
+
–
4
votes
1
answer
4
Modified form of GATE1996_2.15
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot i) 1,2,3,…n ii) n,n−1,n−2,…,2,1 Let S1 and S2 be the number of swaps made for the inputs (i) and (ii) respectively. Then, i) How is S1 and S2 related ? ii) How will the answer change if the pivot is changed to middle element ?
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivoti) 1,2,3,…nii) n,n−1,n−2,…,2,1Let S1 and S2 be the number of s...
966
views
asked
Oct 18, 2017
Algorithms
algorithms
data-structures
sorting
quick-sort
+
–
2
votes
1
answer
5
Canonical Normal Form, Boolean Expression, Minimization
Are multiple SOP and POS expressions possible such that they all are unique ?
Are multiple SOP and POS expressions possible such that they all are unique ?
749
views
asked
Oct 17, 2017
Digital Logic
digital-logic
canonical-normal-form
+
–
4
votes
1
answer
6
GATE2001-2.15 GATE1994-1.6
How many undirected graphs are possible with n vertices if graphs are not necessarily connected if they are necessarily connected
How many undirected graphs are possible with n verticesif graphs are not necessarily connectedif they are necessarily connected
1.4k
views
asked
Oct 12, 2017
Graph Theory
graph-theory
combinatory
+
–
3
votes
2
answers
7
Process Synchronization
Mutual Exclusion is important for deadlock to happen. Is this statement necessarily true always ?
Mutual Exclusion is important for deadlock to happen. Is this statement necessarily true always ?
3.3k
views
asked
Oct 11, 2017
Operating System
process-synchronization
deadlock-prevention-avoidance-detection
operating-system
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
