Test: Data Structure- 3 - Humanities/Arts MCQ

Simple 

Compound

Both a) and b)

None of the above

Underflow 

Overflow

Peek

None of the above

Simple

Compound 

Both a) and b)

None of the above

Stack 

Linked List

Arrays

Queues

Stack

Queue

Deque 

None of the above

Infinite node 

3

2

0

Linear List

Arrays

Both a) and b) 

None of the above

LIFO (Last in First Out) 

FIFO (First in First Out)

Both a) and b)

None of the above

Elements of an array can be sorted

Easier to access the elements in an array

Elements of mixed data tyeps can be stored

Index of the first element starts from 0

LIFO (Last in First Out)

FIFO (First in First Out) 

Both a) and b)

None of the above

Linear search 

Binary search

Both a) and b)

None of the above

List Comprehension 

Queues Comprehension

Both a) and b)

None of the above

The value of the current node

The address of the next node

Both a) and b) 

None of the above

Data can only be removed from the top

A new data element can only be added to the top of the stack.

Both a) and b) 

None of the above

The Object of some class

An array of characters 

Same as other primitive data types

LinkedList of charcaters.