# Data Structures :: Arrays

Home > Technical Aptitude > Data Structures > Arrays > General Questions
NA
SHSTTON
155
Solv. Corr.
41
Solv. In. Corr.
196
Attempted
0 M:38 S
Avg. Time

1 / 76

Choose the correct option.

The smallest element of an array's index is called its

Alower bound.

Bupper bound.

Crange.

Dextraction.

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
82
Solv. Corr.
190
Solv. In. Corr.
272
Attempted
0 M:21 S
Avg. Time

2 / 76

Choose the correct option.

The extra key inserted at the end of the array is called a,

AEnd key.

BStop key.

CSentinel.

DTransposition.

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
202
Solv. Corr.
56
Solv. In. Corr.
258
Attempted
0 M:5 S
Avg. Time

3 / 76

Choose the correct option.

The largest element of an array index is called its

Alower bound.

Brange.

Cupper bound.

DAll of these.

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
99
Solv. Corr.
147
Solv. In. Corr.
246
Attempted
0 M:0 S
Avg. Time

4 / 76

Choose the correct option.

Each array declaration need not give, implicitly or explicitly, the information about

Athe name of array

Bthe data type of array

Cthe first data from the set to be stored

Dthe index set of the array

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
103
Solv. Corr.
115
Solv. In. Corr.
218
Attempted
0 M:54 S
Avg. Time

5 / 76

Choose the correct option.

The elements of an array are stored successively in memory cells because

Aby this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

Bthe architecture of computer memory does not allow arrays to store other than serially

Cboth of above

Dnone of above

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
88
Solv. Corr.
96
Solv. In. Corr.
184
Attempted
0 M:34 S
Avg. Time

6 / 76

What does the following function do if S is an array used to implement a stack.
float peep (float S[], int *t, int i)
{
float val;
if( (*t-i+1) > 0)
{
val = S[*t-i+1];
return val;
}
} ?

AReturns the ith value from top of the stack

BReturns the value at the top of the stack

CIt gives a compilation error

DReturns the value at the ith postion of the array

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
76
Solv. Corr.
105
Solv. In. Corr.
181
Attempted
0 M:25 S
Avg. Time

7 / 76

Choose the correct option.

You want to find the nth element of a set of numbers. If you store the numbers in

AFinding the nth element is slower if it was stored in an array

BFinding the nth element is faster if it was stored in an array

CFinding the nth element takes the same amount of time across all data structures

DFinding the nth element is slower if it was stored in a hash table

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
107
Solv. Corr.
96
Solv. In. Corr.
203
Attempted
0 M:0 S
Avg. Time

8 / 76

Choose the correct option.

Arrays are best data structures

Afor relatively permanent collections of data

Bfor the size of the structure and the data in the structure are constantly changing

Cfor both of above situation

Dfor none of above situation

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
156
Solv. Corr.
28
Solv. In. Corr.
184
Attempted
0 M:0 S
Avg. Time

9 / 76

Choose the correct option.

Arrays are best data structures for

Arelatively permanent collections of data

Bthe size of the structure and the data in the structure are constantly changing

Cboth of above situation

Dnone of above situation

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
40
Solv. Corr.
167
Solv. In. Corr.
207
Attempted
0 M:0 S
Avg. Time

10 / 76

Choose the correct option.

Two dimensional arrays are also called

Atables arrays

Bmatrix arrays

Cboth of the above

Dnone of the above

Explanation:

Here is no explanation for this answer

Workspace

## Data Structures Arrays Questions and Answers pdf

At Data Structures topic Arrays, you will get multiple online quiz difficulty wise, which will have a total of 6 quizzes, categorized as easy, medium, and moderate level. While preparing for any Arrays, take all the list quiz and check your preparation level for that topic. Each quiz have 10 different question, which needs to be answered in 20 min., all the listed quiz here is free, however, you will get only one chance for each quiz to attempt(Take Quiz seriously), so it is always recommended to take one quiz in each section before you start solving Arrays MCQs practice question, and one after solving all the question of the respective level, you can refer back your Arrays quiz result any time or you can download it as pdf for reference.

## Data Structures Quiz Online Test

The details of the Data Structures quiz are as follows. There are 10 questions for you. You have to answer them in 20 minutes. Within 20 minutes you have to see the errors in the sentences given as a question. Four options are also given to you, and you have to choose your opinion. You must be confident in your answer that the choices are difficult. Therefore, below we provide you with some information about Data Structures that you see and keep them in mind while answering questions.

## Data Structures MCQs Practice Questions with Answer

On this section of page you will find the easiest quickest ways to solve a question, formulas, shortcuts and tips and tricks to solve various easiest methods to solve Data Structures Question Quickly. It contains all the Data Structures topic Arrays questions which are common in any of the preliminary exams of any company. The solution is provided along with the questions. The practice of these questions is a must as they are easy as well as scoring and asked in all the exams They will confirm the selection if all the questions attempted wisely with little practice. It is recommanded to Take Mock test based on Data Structures topic and Arrays topic based quiz.

## Data Structures solved examples question

You can get here fully solved Arrays examples with a detailed answer and description. You can solve Arrays problems with solutions, the questions by companies wise by filtering the questions, additionally, you can check what type of questions are being asked in IT companies Written Round from Arrays. Arrays became one of the most important sections in the entire competitive exams, Companies Campus, and entrance online test. Go through Arrays Examples, Arrays sample questions. You can Evaluate your level of preparation in Arrays by Taking the Q4Interivew Arrays Online Mock Test based on most important questions. All the Arrays practice questions given here along with answers and explanations are absolutely free, you can take any number of time any mock Test.

## Why Data Structures Arrays?

In this practice section, you can practice Data Structures Questions based on "Arrays" and improve your skills in order to face the interview, competitive examination, IT companies Written exam, and various other entrance tests (CAT, GATE, GRE, MAT, Bank Exam, Railway Exam etc.) with full confidence.

## Where can I get Data Structures Arrays questions and answers with explanation?

Q4Interview provides you lots of fully solved Data Structures (Arrays) questions and answers with Explanation. Solved examples with detailed answer description, explanation are given and it would be easy to understand. You can download Data Structures Arrays quiz questions with answers as PDF files and eBooks.

## Where can I get Data Structures Arrays Interview Questions and Answers (objective type, multiple-choice, quiz, solved examples)?

Here you can find objective type Data Structures Arrays questions and answers for interview and entrance examination. Multiple choice and true or false type questions are also provided.