Question Detail

Deletion from one end and insertion from other end is

stack
branch
tree
queue

Answer: Option D

Similar Questions :

1. How many divisions are there in COBOL language

Two
Three
Four
Five

Answer: Option C

2. The memory address of the first element of an array is called

floor address
first address
foundation address
base address

Answer: Option D

3. Which sorting method is slowest

Quick sort
Heap sort
Shell sort
Bubble sort

Answer: Option D

4. The complexity of linear search algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

Answer: Option A

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

symbol table
activation record
dope vector
system table

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1