Abstract Data Types

Process of inserting an element in stack is called ____________

• Create

• Push

• Evaluation

• Pop

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• a) ABCD

• b) DCBA

• c) DCAB

• d) ABDC

___________ is neither an algorithm nor a program.

• a.Computing

• b.Pseudo code

• c.Computer science

• d.None of the above

_________________ is a collection of elements used to store the same type of data.

• Array
• Switch
• Case
• Loop

Which of these data structures is LIFO?

• Stack

• Queue

• Binary Tree

• Double linked list

It use pointer to link nodes.

• Variable

• Link List

• Pointer

• Trees

Act of adding values into a stack is called

• Popping

• Polling

• Pushing

• None

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC

Almost all programming languages start arrays at ___

• index 0

• index 1

• index 2

• the null character

Complex data structures built on top of linked lists, that use First-In First-Out behaviour, are called ___

• vectors

• strings

• queues

• stacks