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
Recent activity by tp21
1
answer
1
GATE Overflow | Mock GATE | Test 1 | Question: 62
Which of the following sorting algorithms performs efficiently to sort a singly linked list containing $\log n$ nodes and the corresponding time complexity is? $\text{Insertion sort, } O(\log ^2 n)$ $\text{Merge sort, } \Theta (( \log n) \log (\log n ))$ $\text{Heap sort, } \Theta ( \log ^2)(\log n ))$ $\text{Quick sort, } O ( \log 2)(\log n ))$
Which of the following sorting algorithms performs efficiently to sort a singly linked list containing $\log n$ nodes and the corresponding time complexity is?$\text{Inse...
1.6k
views
commented
Oct 29, 2019
Algorithms
go-mockgate-1
data-structures
linked-list
sorting
algorithms
+
–
2
answers
2
Ace Test Series: DBMS - Transaction And Serializable
625
views
commented
Oct 22, 2019
Databases
ace-test-series
databases
transaction-and-concurrency
serializability
+
–
2
answers
3
Self doubt on 2PL protocol
How can 2PL protocol ( simple one ) ensure conflict serializability even though it cannot ensure freedom from deadlock ? I mean ,if a schedule is conflict serializable it has a conflict equivalent to a serial schedule and serial schedules won't have deadlocks .Right ?
How can 2PL protocol ( simple one ) ensure conflict serializability even though it cannot ensure freedom from deadlock ?I mean ,if a schedule is conflict serializable it...
590
views
answered
Oct 20, 2019
Databases
-2phaselocking
conflict-serializable
transaction-and-concurrency
databases
+
–
3
answers
4
How is this lexical error ?
5.8k
views
commented
Sep 29, 2019
Compiler Design
compiler-design
lexical-analysis
test-series
+
–
1
answer
5
Self Doubt on Page Fault
To calculate EMAT in case of page fault we used: EMAT= page fault rate*(page fault service time) + (1-page fault rate)*(memory access time) My doubt is: In case of NO PAGE FAULT, why we considered only one memory access time . Why ... considered (VA -> PA time) + memory access time. Then why not we consider address translation time in questions involving only pagefault?
To calculate EMAT in case of page fault we used:EMAT= page fault rate*(page fault service time) + (1-page fault rate)*(memory access time)My doubt is:In case of NO PAGE ...
1.1k
views
commented
Sep 24, 2019
Operating System
operating-system
virtual-memory
page-fault
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register