GATE Papers >> CSE >> 2016 >> Question No 125

Question No. 125 CSE | GATE 2016
N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed.
An algorithm performs the following operations on the list in this order: ΘN delete, O(logN) insert, O(logN) find, and ΘN decrease-key. What is the time complexity of all these operations put together?

Answer : (C) O(N2)

Solution of Question No 125 of GATE 2016 CSE Paper
Data Structure used Find Insert Delete Decrease key Overall asymptotic time
Sorted doubly linked list O(N logN) O(N logN) O(N) O(N) O(N logN)

Sorted doubly linked list take maximum of of O(N logN) time, but since not present in option.

So, go for nearest value O(N2).


Posted on  15/12/2020 05:32:58  by  dobson
FpG9yE xnxx

Posted on  29/06/2021 05:10:43  by  Merziuziy
jefGbF levitra nizagara

Posted on  18/10/2020 17:50:55  by  dobsonz
NvVvv4 write my essay

Posted on  04/12/2020 03:07:52  by  dobson
Bn0egy waldorf doll

Posted on  09/01/2021 12:35:39  by  johnanz

Posted on  27/01/2021 12:50:59  by  markus
write my essays

Posted on  23/07/2021 00:33:46  by  johnansog

Posted on  03/08/2021 16:39:42  by  johnanz
wajQi6 xnxx videos

Posted on  13/12/2020 00:19:46  by  johnan

Posted on  17/01/2021 09:33:35  by  johnanz

Posted on  26/01/2021 13:08:12  by  markus

Posted on  13/12/2020 04:33:25  by  dobson

Posted on  09/01/2021 08:22:07  by  dobson

Posted on  03/08/2021 16:48:30  by  johnanz
Leave a comment