# Data Structures and Algorithms - Sorting and Searching

> > > > > > > > Sorting and Searching

• A

serial  • B

random  • C

parallel  • D

binary  • Option : B
• Explanation :
• Dynamic structure (Memory Allocated at run-time).
• We can have more than one data type.
• Re-arrange of linked list is easy (Insertion-Deletion).
• It doesn’t waste memory.

• A

1/2 * i (i + 1) j  • B

i + j  • C

i (i + 1) + j  • D

none of these  • A

n/2  • B

(n-1)/2  • C

(n+1)/2  • D

None of these  • Option : C
• Explanation : If search key matches the very first item, with one comparison we can terminate. If it is second, two comparisons, etc. Average =[ n (n + 1) ] / 2

• A

Is far less than one  • B

equals one  • C

is far greater than one  • D

none of these  • Option : A
• Explanation : The load factor is the ratio of the number of records that are currently present and the total number of records that can be present. If the load factor is less, free space will be more. This means the probability of collision is less. So, the search time will be less.