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

GATE 2024 CSE Daily Practice Questions for 13 October 2023: Students appearing for GATE 2024 examination in February 2024 and aspiring to get admission to the computer science engineering programme must regularly practice the questions shared below. Regularly solving the questions will familiarise you with the examination pattern and syllabus which will ultimately boost your confidence. Start practicing GATE 2024 CSE daily practice questions provided below and analyse for preparation level! The registrations are now closed, if candidates have still not paid the GATE 2024 late registration fee must pay before October 20, 2023 via online mode and complete their application process.

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

GATE 2024 CSE Daily Practice Questions for 13 October 2023

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

Question 1: A circular queue has been implemented using a single linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operation can be performed in O (1) time?

I. Next pointer of front node points to the rear node.

II. Next pointer of rear node points to the front node.

A: I only

B: II only

C: Both I and II

D: Neither I nor II

Question 2: The queue data structure is to be realized by using stack. The number of stacks needed would be

A: It cannot be implemented

B: 2 stacks

C: 4 stacks

D: 1 stack

Also Check|GATE 2024 Application Scrutiny: IISc Bangalore to complete the process by October 31

Question 3: What operation is performed by the above function f?

A: Leaves the queue Q unchanged

B: Reverses the order of the elements in the queue Q

C: Deletes the element at the front of the queue Q and inserts it at the rear keeping the other elements in the same order

D: Empties the queue Q

Question 4: A priority queue Q is used to implement a stack 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 keys chosen are in

A: non-increasing order

B: non-decreasing order

C: strictly increasing order

D: strictly decreasing order

Question 5: Consider the following statements:

(i). First-in-first out types of computations are efficiently supported by STACKS.

(ii). Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.

(iii). Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.

(iv). Last-in-first-out type of computations are efficiently supported by QUEUES.

A: (ii) and (iii) are true

B: (i) and (ii) are true

C: (iii) and (iv) are true

D: (ii) and (iv) are true

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.