GATE 2024 CSE Daily Practice Problems (DPP) and Questions 12 October 2023

GATE 2024 CSE Daily Practice Problems (DPP) and Questions 12 October 2023

GATE 2024 CSE Daily Practice Questions for 12 October 2023: GATE 2024 CSE Daily practice questions enable candidates to increase their speed, accuracy, and problem-solving skills. The GATE 2024 exam will be held on February 3, 4, 10, and 11. Since the exam is a few months away, candidates must practice GATE 2024 CSE questions to secure full marks in the examination. Candidates who will be appearing for the examination must check revised GATE 2024 registration dates and those who have not paid the late fee must do it before October 20, 2023.

Also Check| GATE 2024 CSE Daily Practice Problems (DPPs) and Questions for 11 October 2023

GATE 2024 CSE Daily Practice Questions for 12 October 2023

Students can find daily CSE practice questions for GATE 2024 here. Solve the given questions and analyse your exam preparation.

Question 1: Suppose we want to arrange the n numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is

A: n-1

B: n

C: n+1

D: None of the above

Question 2: If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values

A: 2,2,1,1,2

B: 2,2,1,2,2

C: 2,1,2,2,1

D: 2,1,2,2,2

Question 3: The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is

A: D

B: C

C: A

D: B

Question 4: Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?

A: A queue cannot be implemented using this stack.

B: A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.

C: A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction

D: A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each.

Question 5: Stack A has the entries a, b, c (with a on top). Stack B is empty. An entry popped out of stack A can be printed immediately or pushed to stack B. An entry popped out of the stack B can be only be printed. In this arrangement, which of the following permutations of a, b, c are not possible?

A: b a c

B: b c a

C: c a b

D: a b c

Also Read |

​​​​ For the latest Education News , keep visiting CollegeDekho. You can also ‘follow’ our WhatsApp Channel to stay updated with the latest happenings. You can also write to us at our E-Mail ID news@collegedekho.com .