Data Structures

1: A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is implemented as DELETEMIN(Q).For a sequence of operations,the key chosen are in

A.	Non-increasing order
B.	Non-decreasing order
C.	Strictly increasing order
D.	Strictly decreasing order
	Answer : D Explanation : Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

Sample Online Test

GK Test 4 Statement & Argument Numerical Reasoning Psychometric Online Test 1

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Data Structures

Sample Online Test

Suggest an improvement