CameraIcon

SearchIcon

MyQuestionIcon

1

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

Atomic Mass and Atomic Mass Unit

A linear list...

Question

A linear list of elements in which deletion can be done from one end and insertion can take place only at the other end (rear) is known as

A

Queues

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

B

Stacks

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

C

Trees

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

D

Branch

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

Open in App

Solution

The correct option is A Queues
A linear list of elements in which deletion can be done from one end and insertion can take place only at the other end (rear) is known as queues.
A linked list is a linear collection of data elements, whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence.

Suggest Corrections

thumbs-up

0

Similar questions

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. 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 elements of a list.
a) The program should ask for the position of the element to be deleted from the list. Write a function to delete the element at the desired position in the list.
b) The program should ask for the value of the element to be deleted from the list. Write a function to delete the element of this value from the list.

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. To insert a node in a circular list at rear position it should be inserted at

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Atomic mass and atomic mass unit_tackle

CHEMISTRY

Watch in App

explore_more_icon

Explore more

Atomic Mass and Atomic Mass Unit

Standard IX Chemistry

Join BYJU'S Learning Program

CrossIcon