Which data structure allows deleting data elements from front and inserting from rear?

Which of the following data structure is linear type?

Traversing each and every record exactly once is called_______

Data structure= Organized data +________________

In linked list each node is divided into ___________parts?

In stack insertion and deletion can take place only at one end call the ____________________ of the stack.

Algorithm is a __________________ procedure.

In algorithm comment use by ________brackets.

A field or collection of fields in a record which identifies a record uniquely is called a ______________

Stack performs ____________ operation

In which algorithm takes less time or space is called

The algorithm is completed when the statement _______________ is encountered.

In algorithm several statements appear in the same step

Go to statement is the part of ______________

In algorithm assignment operation is performed using the symbol__________

In algorithm variable names should be in capital letters.