Explore Exams
Login Signup
Sign in Open App
Software Development Exam  >  Software Development Test  >  Basics of C++  >  Test: Arrays - 1 - Software Development MCQ

Arrays - 1 - Free MCQ Practice Test with solutions, Software Development


MCQ Practice Test & Solutions: Test: Arrays - 1 (20 Questions)

You can prepare effectively for Software Development Basics of C++ with this dedicated MCQ Practice Test (available with solutions) on the important topic of "Test: Arrays - 1". These 20 questions have been designed by the experts with the latest curriculum of Software Development 2026, to help you master the concept.

Test Highlights:

  • - Format: Multiple Choice Questions (MCQ)
  • - Duration: 40 minutes
  • - Number of Questions: 20

Sign up on EduRev for free to attempt this test and track your preparation progress.

Test: Arrays - 1 - Question 1
Save

How are arrays stored in memory in C++?

Detailed Solution: Question 1

Arrays in C++ are stored in contiguous memory locations, meaning that the elements of an array are stored one after another in memory.

Test: Arrays - 1 - Question 2
Save

What is the index of the first element in an array with N elements?

Detailed Solution: Question 2

In C++, the index of the first element in an array is 0.

Clear all your doubts with EduRev
Test: Arrays - 1 - Question 3
Save

Which of the following statements is true about passing arrays to functions in C++?

Detailed Solution: Question 3

In C++, arrays are automatically passed by reference to functions. When an array is passed to a function, any modifications made to the array within the function will affect the original array.

Test: Arrays - 1 - Question 4
Save

Which of the following is the correct syntax to declare a 1D array of integers in C++?

Detailed Solution: Question 4

The correct syntax to declare a 1D array of integers in C++ is "int array[]". The size of the array can be specified or left empty.

Test: Arrays - 1 - Question 5
Save

What is the time complexity of searching an element in an array using binary search (iterative method)?

Detailed Solution: Question 5

Binary search has a time complexity of O(log N) when applied to a sorted array. It repeatedly divides the search space in half, reducing the search range by half with each comparison.

Test: Arrays - 1 - Question 6
Save

Which of the following is the correct formula to calculate the middle index in binary search?

Detailed Solution: Question 6

The correct formula to calculate the middle index in binary search is "middle = (start + end) / 2". This formula finds the midpoint between the start and end indices.

Test: Arrays - 1 - Question 7
Save

Binary search can be applied on which of the following types of arrays?

Detailed Solution: Question 7

Binary search can be applied only to sorted arrays. It relies on the property of the array being sorted to efficiently locate the desired element.

Test: Arrays - 1 - Question 8
Save

What is an array in C++?

Detailed Solution: Question 8

An array is a collection of variables of the same data type, identified by a common name.

Test: Arrays - 1 - Question 9
Save

How are arrays stored in memory?

Detailed Solution: Question 9

Arrays in C++ are stored in a sequential manner in contiguous memory locations.

Test: Arrays - 1 - Question 10
Save

What is the index range of elements in an array with 10 elements?

Detailed Solution: Question 10

The index range of elements in an array with 10 elements is from 0 to 9.

Test: Arrays - 1 - Question 11
Save

What is the output of the following code snippet?
#include <iostream>
using namespace std;

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    cout << arr[2];
    return 0;
}

Detailed Solution: Question 11

The code initializes an array with elements 1, 2, 3, 4, 5. Printing arr[2] will output 3.

Test: Arrays - 1 - Question 12
Save

What is the output of the following code snippet?
#include <iostream>
using namespace std;

int main() {
    int arr[5] = {1, 2, 3, 4, 5};
    cout << arr[5];
    return 0;
}

Detailed Solution: Question 12

The code tries to access the element at index 5, which is out of bounds for the array. This results in a runtime error.

Test: Arrays - 1 - Question 13
Save

What is the output of the following code snippet?
#include <iostream>
using namespace std;

void modifyArray(int arr[]) {
    arr[0] = 100;
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    modifyArray(arr);
    cout << arr[0];
    return 0;
}

Detailed Solution: Question 13

The code passes the array to the modifyArray() function, which modifies the first element to 100. Printing arr[0] will output 100.

Test: Arrays - 1 - Question 14
Save

What is the output of the following code snippet?
#include <iostream>
using namespace std;

void printArray(int arr[], int size) {
    for (int i = 0; i < size; i++) {
        cout << arr[i] << " ";
    }
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    printArray(arr, 5);
    return 0;
}

Detailed Solution: Question 14

The code calls the printArray() function to print all the elements of the array. The output will be 1 2 3 4 5.

Test: Arrays - 1 - Question 15
Save

What is the output of the following code snippet?
#include <iostream>
using namespace std;

int binarySearch(int arr[], int left, int right, int key) {
    if (left <= right) {
        int mid = left + (right - left) / 2;
        if (arr[mid] == key)
            return mid;
        if (arr[mid] > key)
            return binarySearch(arr, left, mid - 1, key);
        return binarySearch(arr, mid + 1, right, key);
    }
    return -1;
}

int main() {
    int arr[] = {2, 4, 6, 8, 10};
    int key = 8;
    int result = binarySearch(arr, 0, 4, key);
    cout << result;
    return 0;
}

Detailed Solution: Question 15

The code performs a binary search for the key element 8 in the given array. Since 8 is present at index 3, the output will be 3.

Test: Arrays - 1 - Question 16
Save

What does the following code snippet do?
#include <iostream>
using namespace std;

int binarySearch(int arr[], int n, int key) {
    int low = 0, high = n - 1;
    while (low <= high) {
        int mid = low + (high - low) / 2;
        if (arr[mid] == key)
            return mid;
        if (arr[mid] < key)
            low = mid + 1;
        else
            high = mid - 1;
    }
    return -1;
}

int main() {
    int arr[] = {2, 4, 6, 8, 10};
    int key = 6;
    int result = binarySearch(arr, 5, key);
    cout << result;
    return 0;
}

Detailed Solution: Question 16

The code implements binary search iteratively on a sorted array and returns the index of the key element if found. If the key element is not found, it returns -1.

Test: Arrays - 1 - Question 17
Save

What does the following code snippet do?
#include <iostream>
using namespace std;

int binarySearch(int arr[], int low, int high, int key) {
    if (low <= high) {
        int mid = low + (high - low) / 2;
        if (arr[mid] == key)
            return mid;
        if (arr[mid] > key)
            return binarySearch(arr, low, mid - 1, key);
        return binarySearch(arr, mid + 1, high, key);
    }
    return -1;
}

int main() {
    int arr[] = {2, 4, 6, 8, 10};
    int key = 8;
    int result = binarySearch(arr, 0, 4, key);
    cout << result;
    return 0;
}

Detailed Solution: Question 17

The code implements binary search recursively on a sorted array and returns the index of the key element if found. If the key element is not found, it returns -1.

Test: Arrays - 1 - Question 18
Save

What does the following code snippet do?
#include <iostream>
using namespace std;

int binarySearch(int arr[], int n, int key) {
    int low = 0, high = n - 1;
    while (low <= high) {
        int mid = low + (high - low) / 2;
        if (arr[mid] == key)
            return mid;
        if (arr[mid] > key)
            high = mid - 1;
        else
            low = mid + 1;
    }
    return -1;
}

int main() {
    int arr[] = {2, 4, 6, 8, 10};
    int key = 6;
    int result = binarySearch(arr, 5, key);
    cout << result;
    return 0;
}

Detailed Solution: Question 18

The code implements binary search iteratively on a sorted array and returns the index of the key element if found. If the key element is not found, it returns -1.

Test: Arrays - 1 - Question 19
Save

What does the following code snippet do?
#include <iostream>
using namespace std;

int binarySearch(int arr[], int low, int high, int key) {
    if (low <= high) {
        int mid = low + (high - low) / 2;
        if (arr[mid] == key)
            return mid;
        if (arr[mid] < key)
            low = mid + 1;
        else
            high = mid - 1;
        return binarySearch(arr, low, high, key);
    }
    return -1;
}

int main() {
    int arr[] = {2, 4, 6, 8, 10};
    int key = 8;
    int result = binarySearch(arr, 0, 4, key);
    cout << result;
    return 0;
}

Detailed Solution: Question 19

The code implements linear search iteratively on an unsorted array and returns the index of the key element if found. If the key element is not found, it returns -1.

Test: Arrays - 1 - Question 20
Save

What does the following code snippet do?
#include <iostream>
using namespace std;

int binarySearch(int arr[], int left, int right, int key) {
    if (left <= right) {
        int mid = left + (right - left) / 2;
        if (arr[mid] == key)
            return mid;
        if (arr[mid] > key)
            return binarySearch(arr, left, mid - 1, key);
        return binarySearch(arr, mid + 1, right, key);
    }
    return -1;
}

int main() {
    int arr[] = {2, 4, 6, 8, 10};
    int key = 12;
    int result = binarySearch(arr, 0, 4, key);
    cout << result;
    return 0;
}

Detailed Solution: Question 20

The code implements binary search recursively on a sorted array and returns the index of the key element if found. If the key element is not found, it returns -1.

69 videos|52 docs|15 tests
Join Course
Information about Test: Arrays - 1 Page
In this test you can find the Exam questions for Test: Arrays - 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Arrays - 1, EduRev gives you an ample number of Online tests for practice
69 videos|52 docs|15 tests
Join Course
Download as PDF

About this Software Development Practice Test

This test contains 20 MCQs on Arrays - 1 with detailed solutions for each question. It is part of the Basics of C++ course on EduRev, designed to align with the current Software Development syllabus. Each solution explains not just the correct answer but also gives you an understanding of the topic — not just to attempt the question but also help you prepare for the exam with practice.

Explore more Software Development Study Resources

If you found this Arrays - 1 MCQ Test helpful, you can further enhance your Software Development preparation with in-depth courses on EduRev, for all the subjects and topics available in Basics of C++ course. The course offers:
  • Video Lectures: covering all the topics of Basics of C++
  • Notes for Revision: offering revision notes, important questions, summaries, flashcards, cheatsheets & more for Software Development preparation
  • MCQ Test: variety of questions as per the pattern of Software Development exam
Signup to see your scores go up
within 7 days!
Takes less than 10 seconds to signup