1
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Assume that the operators +, -, ×, are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, ×, +, -. The postfix expression corresponding to the infix expression a + b×c-d^e^f is
A
abc×+def^^-
B
abc×+de^f^-
C
ab+c×d-e^f^
D
- + a×bc^^def
2
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
A program attempts to generate as many permutation as possible of the string “abcd” by pushing the character a,b,c,d in the same order onto a stack, but it may pop off the top character at any time. Which one of the following a strings CANNOT be generated using this program?
A
abcd
B
dcba
C
cbad
D
cabd
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p point such that both the operations enQueue and deQueue can be performed in constant time? GATE CSE 2004 Data Structures - Linked List Question 9 English
A
rear node
B
front node
C
not possible with a single pointer
D
node next to front
4
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
Let P be a singly linked list, Let Q be the pointer to an intermediate node x in the list.What is the worst-case time complexity of the best known algorithm to delete the node x from the list?
A
O(n)
B
O(log2n)
C
O(log n)
D
O(1)
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12