The process of inserting elements ito a stack is known as
Push
Pop
Insertion
Write
The process of visiting all the elements in a data structure is called _______.
Traversing
Searching
Inserting
Deleting
_________ linked list does not contain a Null Pointer.
Single
Double
Circular
Linear
A pointer variable which contains the location at the top element of the stack is called
Top
Last
Final
End
The data structure is used for Job scheduling
Queue
Stack
Linked list
Array