Question Detail

A linear list from which elements can be added or removed from either end is called

stack
queue
deque
tree

Answer: Option C

Similar Questions :

1. Which is problem oriented language

BASIC
PL/I
FORTRAN
none of above

Answer: Option D

2. Information about an array used in a program will be stored in

symbol table
activation record
dope vector
system table

Answer: Option C

3. O log(n) can be conneted with

Selection sort
Insertion sort
Binary sort
Merge sort

Answer: Option C

4. Recursive problems are implemented by

queues
stacks
linked lists
strings

Answer: Option B

5. Preorder is

depth first order
breadth first order
topological order
linear order

Answer: Option A

Read more from - Data Structure Questions Answers - Chapter 1