Searching & Merging In One Dimensional Array

Which of the following is not a limitation of binary search algorithm?
Must use a sorted array
Requirement of sorted array is expensive when a lot of insertion and deletions are needed
There must be a mechanism to access middle element directly
Binary search algorithm is not efficient when the data elements more than 1500.
Data structure in which all elements have similar name is considered as
String structure
Positive structure
Array
Data structure
If the number of records to be sorted is small, then …… sorting can be efficient.
Merge
Insersion
Selection
Bubble
In C Programming, If we need to store word “INDIA” then syntax is as below –
char name[];
name = “INDIA”
Char name[6] = {'I','N','D','I','A'};
Char name[6] = {'I','N','D','I','A','\0'}
Char name[6] = {"I","N","D","I","A"}
Name = "INDIA"
What will be printed after execution of the following code?
void main()
{
      int arr[10] = {1,2,3,4,5};
      cout<< arr[5];
}
Garbage Value
5
6
0
What will be the output of the program ?
#include"stdio.h"
int main()
{
    	int a[5] = {51, 1, 5, 20, 25};
    	int x, y, z;
    	x = ++a[1];
    	y = a[1]++;
    	z = a[x++];
    	cout<<x<<y<<z;
	return 0;
}
2, 3, 20
2, 1, 5
1, 2, 5
3, 2, 5
Let x be an array. Which of the following operations are illegal?
I. ++x
II. x+1
III. x++
IV. x*2
I and II
I, II and III
II and III
I, III and IV
III and IV
{"name":"Searching & Merging In One Dimensional Array", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Which of the following is not a limitation of binary search algorithm?, Data structure in which all elements have similar name is considered as, If the number of records to be sorted is small, then …… sorting can be efficient.","img":"https://www.quiz-maker.com/3012/images/ogquiz.png"}
Powered by: Quiz Maker