Recent questions tagged queue / GATE Overflow for GATE CSE

5 votes

2 answers

31

GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 6
Suppose you implement a queue using a singly linked list with head and tail pointers so that the front of the queue is at the tail of the list, and the rear of the queue is at the head of the list. What is the best possible worst-case ... $O(n)$ for dequeue. $O(n)$ for enqueue and $O(1)$ for dequeue. $O(n)$ for both functions.

Suppose you implement a queue using a singly linked list with head and tail pointers so that the front of the queue is at the tail of the list, and the rear of the queue ...

GO Classes

625 views

GO Classes asked May 22, 2022

4 votes

2 answers

32

GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 7
Consider a circular array-based implementation of the queue where the front and rear has been initialized to $-1.$ Array size is $N.$ Which of the following statements is true for the number of elements or size of the queue ... S1 is true but S2 is false S1 is false but S2 is true Both statements are true Both statements are false

Consider a circular array-based implementation of the queue where the front and rear has been initialized to $-1.$ Array size is $N.$Which of the following statements is ...

GO Classes

499 views

GO Classes asked May 22, 2022

3 votes

2 answers

33

GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 8
Which of the following is/are correct about implementation of stack and queue. If stack is implemented as an array, all the push and pop operations can be performed in constant time. If stack is implemented as a ... queue is implemented as a linked list, all the enqueue and dequeue operations can be performed in constant time.

Which of the following is/are correct about implementation of stack and queue.If stack is implemented as an array, all the push and pop operations can be performed in con...

GO Classes

487 views

GO Classes asked May 22, 2022

34 votes

6 answers

34

GATE CSE 2022 | Question: 52
Consider the queues $Q_{1}$ containing four elements and $Q_{2}$ containing none (shown as the $\textsf{Initial State}$ in the figure). The only operations allowed on these two queues are $\textsf{Enqueue (Q, element)}$ ... $\textsf{Final State}$ in the figure) without using any additional storage is________________.

Consider the queues $Q_{1}$ containing four elements and $Q_{2}$ containing none (shown as the $\textsf{Initial State}$ in the figure). The only operations allowed on the...

Arjun

18.6k views

Arjun asked Feb 15, 2022

1 votes

1 answer

35

NIELIT Scientific Assistant A 2020 November: 58
A stack can be implemented using queue, but then we need to use atleast : $3$ queues $2$ queues only one queue is sufficient none of the options

A stack can be implemented using queue, but then we need to use atleast :$3$ queues$2$ queuesonly one queue is sufficientnone of the options

gatecse

448 views

gatecse asked Dec 9, 2020

1 votes

1 answer

36

NIELIT Scientific Assistant A 2020 November: 114
Priority queue is implemented by : Doubly link list Graph Heap Stack

Priority queue is implemented by :Doubly link listGraphHeapStack

gatecse

460 views

gatecse asked Dec 9, 2020

1 votes

2 answers

37

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 6
Which of the following is useful in traversing a given graph by breadth first search? Stack Set List Queue

Which of the following is useful in traversing a given graph by breadth first search?StackSetListQueue

admin

699 views

admin asked Apr 1, 2020

1 votes

2 answers

38

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 12
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations? $O(n),O(n)$ $O(n),O(1)$ $O(1),O(n)$ $O(1),O(1)$

If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$$O(n),O(1)$$O(1),O(n)$$O(1),O(1)$

admin

3.7k views

admin asked Apr 1, 2020

4 votes

4 answers

39

NIELIT 2016 DEC Scientist B (IT) - Section B: 15
A ________ is a linear list in which insertions and deletions are made to from either end of the structure. Circular queue. Priority queue. Stack. Dequeue.

A ________ is a linear list in which insertions and deletions are made to from either end of the structure.Circular queue.Priority queue.Stack.Dequeue.

admin

2.0k views

admin asked Mar 31, 2020

1 votes

3 answers

40

NIELIT 2017 July Scientist B (CS) - Section B: 10
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT($n$ ... operations will be $\Omega(n)$. Worst case time complexity for both operations will be $\Omega(\log n)$.

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT($n$ refers to t...

admin

1.2k views

admin asked Mar 30, 2020

0 votes

1 answer

41

UGC NET CSE | December 2005 | Part 2 | Question: 24
The initial configuration of quaue is $a, b, c, d$. $'a'$ is at the front. To get the configuration $d, c, b, a$ how many deletions and additions required: $2$ deletions, $3$ additions $3$ deletions, $2$ additions $3$ deletions, $4$ additions $3$ deletions, $3$ additions

The initial configuration of quaue is $a, b, c, d$. $'a'$ is at the front. To get the configuration $d, c, b, a$ how many deletions and additions required:$2$ deletions, ...

go_editor

365 views

go_editor asked Mar 27, 2020

2 votes

3 answers

42

CMI2018-B-7
A First In First Out queue is a data structure supporting the operation Enque, Deque, Print, Enque(x) adds the item $x$ to the tail of the queue. Deque removes the element at the head of the queue and returns its value. Print prints the head of the ... reverse order. If the queue had $n$ elements to begin with, how many statements would you need to print the queue in reverse order?

A First In First Out queue is a data structure supporting the operation Enque, Deque, Print, Enque(x) adds the item $x$ to the tail of the queue. Deque removes the elemen...

gatecse

944 views

gatecse asked Sep 13, 2019

1 votes

2 answers

43

Cormen Edition 3 Exercise 10.1 Question 6 (Page No. 236)
Show how to implement a queue using two stacks. Analyze the running time of the queue operations.

Show how to implement a queue using two stacks. Analyze the running time of the queue operations.

akash.dinkar12

584 views

akash.dinkar12 asked Jun 28, 2019

0 votes

1 answer

44

Cormen Edition 3 Exercise 10.1 Question 5 (Page No. 236)
Whereas a stack allows insertion and deletion of elements at only one end, and a queue allows insertion at one end and deletion at the other end, a deque (double ended queue) allows insertion and deletion at both ends. Write ... time procedures to insert elements into and delete elements from both ends of a deque implemented by an array.

Whereas a stack allows insertion and deletion of elements at only one end, and a queue allows insertion at one end and deletion at the other end, a deque (double ended qu...

akash.dinkar12

1.7k views

akash.dinkar12 asked Jun 28, 2019

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true