search
Log In
0 votes
67 views

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???

in Algorithms 67 views

Please log in or register to answer this question.

Related questions

1 vote
2 answers
1
2 votes
1 answer
2
307 views
Which of the following are RECOVERABLE schedules
asked Oct 31, 2018 in Databases jatin khachane 1 307 views
1 vote
1 answer
3
335 views
there is a schedule which is allowed in Thomas write rule so it is view serializable. Suppose at a point write operation of an older transaction is ignored. then the same operation will be ignored in its serial order?
asked Dec 1, 2018 in Databases aditi19 335 views
0 votes
0 answers
4
42 views
In Log-Based Recovery why do we redo committed transactions?
asked Nov 2, 2018 in Databases jatin khachane 1 42 views
...