Data Structure · all questions

Arrays in Data Structures
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

176

Questions

9/9

Page

Pick an option on a question to see the right answer and solution.

Q161

How many swaps are required for reversing an array having n elements where n is an even number?

Select an option to see the answer and solution.

Q162

Consider the following piece of code in C++, how many elements will be stored in the array 'arr' if the user enters the values of a, b, c and d as 10, 20, 30, and 40 respectively?

#include<iostream>                                                  
using namespace std;                                                    
int main() 
{                                                                               
    int a, b, c, d;                                                        
    cout<<”Enter the value of a, b, c, d: “;                       
    cin>>a>>b>>c>>d;                
    int arr[a - b/c + d];                                                 
}

Select an option to see the answer and solution.

Q163

Suffix array is space efficient than the suffix tree.

Select an option to see the answer and solution.

Q164

Predefined function reverse() in C++ is available under which header file?

Select an option to see the answer and solution.

Q165

Which of the following is a disadvantage of parallel array over the traditional arrays?

Select an option to see the answer and solution.

Q166

What will be the resulting array after rotating arr[]={1, 2, 3, 4, 5} by 2?

Select an option to see the answer and solution.

Q167

What will be the output of the following code?

#include <iostream>
using namespace std;
int main()
{   
    int arr[] = {1,2,3,4,5,6};
    int n = sizeof(arr)/sizeof(arr[0]);
    int d=4;
    int temp[10];
 
    for(int i=0;i<d;i++)
    temp[i]=arr[i];
 
    int j=0;
    for(int i=d;i<n;i++,j++)
    arr[j]=arr[i];
 
    int k=0;
    for(int i=n-d;i<n;i++,k++)
    arr[i]=temp[k];
 
    for(int i=0;i<n;i++)
    cout<<arr[i]<<" ";
    return 0;
}

Select an option to see the answer and solution.

Q168

Which of the following bitwise operator will you use to invert all the bits in a bit array?

Select an option to see the answer and solution.

Q169

In which of the following cases dynamic arrays are not preferred?

Select an option to see the answer and solution.

Q170

What will be the minimum number of jumps required to reach the end of the array arr[] ={0,1,3,6,3,6,8,5}?

Select an option to see the answer and solution.

Q171

What is sparsity of a matrix?

Select an option to see the answer and solution.

Q172

Which class in Java can be used to represent bit array?

Select an option to see the answer and solution.

Q173

What will be the minimum number of jumps required to reach the end of the array arr[] = {1,3,6,3,6,8,5}?

Select an option to see the answer and solution.

Q174

What will be the output of the following code?

#include <bits/stdc++.h> 
using namespace std; 
void func(int a[], int n, int k) 
{ 
	if (k <= n) 
	{ 
		for (int i = 0; i < k/2; i++) 
		swap(a[i], a[k-i-1]); 
	} 
 
} 
int main() 
{ 
	int a[] = {1, 2, 3, 4, 5}; 
	int n = sizeof(a) / sizeof(int), k = 3; 
	func(a, n, k); 
	for (int i = 0; i < n; ++i) 
		cout << a[i]<<" ";
	return 0; 
}

Select an option to see the answer and solution.

Q175

The time complexity of the code that determines the number of inversions in an array using merge sort is lesser than that of the code that uses loops for the same purpose.

Select an option to see the answer and solution.

Q176

Which of the following form inversion in the array arr = {1,5,4,2}?

Select an option to see the answer and solution.