MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

The Circular Motion

To insert a n...

Question

To insert a node in a circular list at rear position it should be inserted at

A

Front position of queue

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

Front-

1

position

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

Rear position

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

D

Rear-

1

position

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A Rear position
To insert a node in a circular list at rear position it should be inserted at rear position.
Circular linked list is a linked list where all nodes are connected to form a circle. There is no null at the end. A circular linked list can be a singly circular linked list or doubly circular linked list
We don’t need to maintain two pointers for front and rear if we use circular linked list. We can maintain a pointer to the last inserted node and front can always be obtained as next of last.

In the circular linked list we can insert elements anywhere in the list whereas in the array we cannot insert element anywhere in the list because it is in the contiguous memory. In the circular linked list the previous element stores the address of the next element and the last element stores the address of the starting element.

Suggest Corrections

thumbs-up

0

Similar questions

Q. A circular queue has been implemented using a singly 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 operations 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.

Q. Write a program to read a list of elements. Input an element from the user that has to be inserted in the list. Also input the position at which it is to be inserted. Write a user defined function to insert the element at the desired position in the list.

Q. Suppose a circular queue of capacity (n - 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array indeed variables respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

Q. Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are:

(i) is Empty (Q) : returns true if the queue is Empty, false otherwise.
(ii) delete (Q) : delete the elements at the front of the queue and returns its value.
(iii) insert (Q, i) : insert the integer i at the rear of the queue.

Consider the following functions:

void f (queue Q)
{
int i;
if (! is Empty (Q))
{
i = delete (Q);
f(Q);
insert (Q, i);
}
}

What operation is performed by the above function f?

Q. In a circular linked list, insertion of a record involves modification of

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Factorization of Polynomials

PHYSICS

Watch in App

explore_more_icon

Explore more

The Circular Motion

Standard XII Physics

Join BYJU'S Learning Program

CrossIcon