Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
jayadev
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by jayadev
0
votes
0
answers
1
concurrency control
question about concurrency control methods
question about concurrency control methods
347
views
asked
Jul 2, 2022
Databases
transaction-and-concurrency
databases
concurrency
2phaselocking
+
–
4
votes
0
answers
2
#pipeline #self doubt
Consider a 5—stage pipeline processor used to execute 200 number of instructions and among those 100 instructions cause 3 stall cycles each. What is the total cycles required for these operation if CPI is not equal to one.
Consider a 5—stage pipeline processor used to execute 200 number of instructions and among those 100 instructions cause 3 stall cycles each. What is the total cycles re...
386
views
asked
Feb 3, 2022
CO and Architecture
co-and-architecture
pipelining
stall
+
–
0
votes
3
answers
3
#fork #threads
Consider the following program segment of C-programming language: #include<stdio.h> int main() { if (fork() || fork()) fork(); printf("GATE\n"); return 0; } Number of times the above program prints 'GATE' is_?
Consider the following program segment of C-programming language:#include<stdio.h int main() { if (fork() || fork()) fork(); printf("GATE\n"); return 0; } Number of times...
950
views
asked
Feb 1, 2022
Operating System
threads
operating-system
process
+
–
0
votes
1
answer
4
Deterministic Finite Automata ( DFA)
follow method first draw dfa for ‘a’ always followed by ‘bb’ and reverse it
follow method first draw dfa for ‘a’ always followed by ‘bb’ and reverse it
796
views
asked
Jan 7, 2022
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
1
answer
5
Transactions and concurrency control
When Ti attempts to write data item Q, if TS(Ti ) < w-timestamp(Q), then Ti is attempting to write an obsolete value of {Q}. Rather than rolling back Ti as the timestamp ordering protocol would have done, this {write} operation can be ... Ti any transaction which comes after the Ti will have a chance of reading that change made by Ti by performing Read(Q) .
When Ti attempts to write data item Q, if TS(Ti ) < w-timestamp(Q), then Ti is attempting to write an obsolete valueof {Q}. Rather than rolling back Ti as the timestamp o...
428
views
asked
Dec 30, 2021
Databases
transaction-and-concurrency
databases
concurrency
+
–
0
votes
0
answers
6
#boolean algebra #ex-or #functionally complete
481
views
asked
Dec 15, 2021
Digital Logic
digital-logic
functional-completeness
+
–
0
votes
1
answer
7
#threads
Why the operating system has the knowledge about kernel level threads but not about user level threads?
Why the operating system has the knowledge about kernel level threads but not about user level threads?
433
views
asked
Dec 7, 2021
Operating System
threads
operating-system
process
+
–
1
votes
1
answer
8
#threads
Does kernel level threads have separate PCB(process control block)?
Does kernel level threads have separate PCB(process control block)?
380
views
asked
Dec 6, 2021
Operating System
threads
operating-system
process
+
–
1
votes
1
answer
9
#self doubt #round robin #cpu scheduling
in round robin algorithm if a process with burst time = 10 arrived at t=0 and time quantum is 2 units, context switch time is 2 units . Then completion time of the process will be?
in round robin algorithm if a process with burst time = 10 arrived at t=0 and time quantum is 2 units, context switch time is 2 units . Then completion time of the proces...
1.1k
views
asked
Oct 10, 2021
Operating System
operating-system
process-scheduling
round-robin-scheduling
context-switch
+
–
0
votes
1
answer
10
paging question
If the page table is 2MB, frame size is 1KB and each entry in page table has 16 bits then, does each entry of the page table occupy 1KB in main memory?
If the page table is 2MB, frame size is 1KB and each entry in page table has 16 bits then, does each entry of the page table occupy 1KB in main memory?
403
views
asked
Sep 12, 2021
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register