Menu

Question Discussion & Solution

MCQ

Q.

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a

A

queue

B

stack

C

tree

D

linked list

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Which one of the below mentioned is linear data structure?

A

Queue

B

Stack

C

Arrays

D

All of these

Discussion

MCQ

2.

When new data are to be inserted into a data structure, but there is not available space; this situation is usually called

A

Underflow

B

overflow

C

houseful

D

saturated

Discussion

MCQ

3.

For parameters, a specific selection of values is called

A

Parameters

B

Instances

C

Member

D

Entity

Discussion

MCQ

4.

Data structure that allows extremely fast exact-match search, is known to be

A

Arrays

B

Pointers

C

Stacks

D

Hash tables

Discussion

MCQ

5.

Which file open mode would be used to write data only to the end of an existing file?

A

ios::app

B

ios::in

C

ios::out

D

ios::trunc

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs