207 views
0 votes
0 votes

IN CASE OF PRIORITY QUEUE OR WE CAN SAY MAX HEAP OR MIN HEAP.

.WHEN DUPLICATE ENTRIES EXIST THEN WHICH ELEMENT OUT OF TWO SAME ONE WILL GET FIRST CHANCE…

. SOME TIME IT NOT METTER MUCH BUT LET SAY YOU’R PERFORMING DIJKSTRA ALGORITHM THEN BECOME CONFUSING SOME TIME???/ ANYONE HAVE AN IDEA???

Please log in or register to answer this question.

Related questions

1 votes
1 votes
4 answers
1
samarpita asked Nov 13, 2021
614 views
every strict recoverable schedule is conflict serializable..if not then why?
0 votes
0 votes
2 answers
2
2 votes
2 votes
0 answers
3
vinay chauhan asked Jan 18, 2019
601 views
Is different 2 phase locking a subset of each other? For example, if the schedule is Strict 2PL then it will also be simple 2PL.Something like a 2PL is a subset of Strict...
0 votes
0 votes
1 answer
4
jatin khachane 1 asked Jan 16, 2019
1,362 views
Is the following schedule conflict serializableT1T2T3W(X) commit R(X) W(X) R(X) W(X) commit W(X) commit