sorting technique in which if we put an element in the appropriate place in a sorted list it should yield a larger sorted order list.

sorting technique in which if we put an element in the appropriate place in a sorted list it should yield a larger sorted order list.

insertion distribution selection extraction

Read More

If the number of records to be sorted is small, then ____ sorting can be efficient.

If the number of records to be sorted is small, then ____ sorting can be efficient.

Selection Merge Heap Bubble

Read More

In Binary Search , which will be the scenario for Average Case performance ?

In Binary Search , which will be the scenario for Average Case performance ?

The 'Mid key’ is present, but it’s not the middle element O(logn). The ‘input key’ is present, but it’s not the middle element O(logn). The ‘Last key’ is present, but it’s not the middle element O(logn). The ‘First key’ is present, but it’s not the middle element O(logn).

Read More

Binary Search divides the list of elements in what form

Binary Search divides the list of elements in what form

lower/2 lower -higher/2 lower+higher/2 higher/2

Read More

In Binary Search,if the middle element (mid) is less than key element then key element has to present in range of ?

In Binary Search,if the middle element (mid) is less than key element then key element has to present in range of ?

low=mid+2 low=mid+1 low=mid+2/1 low=mid+1*10

Read More

The difference between linear array and a record is

The difference between linear array and a record is

A record form a hierarchical structure but a lienear array does not An array is suitable for homogeneous data but hte data items in a record may have different data type In a record, there may not be a natural ordering in opposed to linear array. All the listed options

Read More

Each __________ data in a row of a dataset is called a Record.

Each __________ data in a row of a dataset is called a Record.

Temporal Directional Logical Relational

Read More

In Binary Search , which will be the scenario for Best Case performance ?

In Binary Search , which will be the scenario for Best Case performance ?

The middle element is equal to the ‘input key’ O(2). The middle element is equal to the ‘input key’ O(1). The middle element is equal to the ‘input key’ O(4). The middle element is equal to the ‘input key’ O(3).

Read More

Which one of them is a Generic Poiner?

Which one of them is a Generic Poiner?

void char * int double

Read More

Which of the following shows the correct syntax for an if statement?

Which of the following shows the correct syntax for an if statement?

if ( expression ) if { expression} if expression None of the listed options

Read More

Which of the following is the correct way of declaring a float pointer ?

Which of the following is the correct way of declaring a float pointer ?

float *p; float *p=1.5; None of the listed options float p[]=1.5

Read More

Which Loop will execute even when Condition is FALSE?

Which Loop will execute even when Condition is FALSE?

FOR WHILE UNTIL DO..WHILE

Read More

In Binary Search , which will be the scenario for Worst Case performance ?

In Binary Search , which will be the scenario for Worst Case performance ?

The ‘input key’ is not present in the list O(logn). The ‘First key’ is not present in the list O(logn). The ‘last key’ is not present in the list O(logn). The ‘mid key’ is not present in the list O(logn).

Read More

How many types of parameter passing technique are there in c??

How many types of parameter passing technique are there in c??

2 3 1 4

Read More

The memory address of the first element of an array is called

The memory address of the first element of an array is called

base address foundation address first address floor address

Read More

The Worst case occur in linear search algorithm when

The Worst case occur in linear search algorithm when

Item is not in the array at all Item is the last element in the array or is not there at all Item is somewhere in the middle of the array None

Read More

Which Sort is Efficient and fast?

Which Sort is Efficient and fast?

insertion selection c)quick sort d)merge sort

Read More