# Algorithms-Worst and Average Case Analysis (GATE Computer Science): Questions 1 - 7 of 7

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to **913** questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

## Question number: 1

» Algorithms » Worst and Average Case Analysis

### Question

Which of the following sorting procedure is the slowest-?

### Choices

Choice (4) | Response | |
---|---|---|

a. | Heap sort | |

b. | Quick sort | |

c. | Bubble sort | |

d. | All of the above |

## Question number: 2

» Algorithms » Worst and Average Case Analysis

### Question

When consider n elements are to be sorted then the worst case time complexity of bubble sort is-

### Choices

Choice (4) | Response | |
---|---|---|

a. | 0 (n) | |

b. | o (1) | |

c. | 0 (n^2) | |

d. | Question does not provide sufficient data or is vague |

## Question number: 3

» Algorithms » Worst and Average Case Analysis

### Question

When consider n elements are to be sorted then the worst case time complexity of heap sort is -

### Choices

Choice (4) | Response | |
---|---|---|

a. | 0 (2logn) | |

b. | 0 (n^3) | |

c. | 0 (nlogn) | |

d. | None of the above |

## Question number: 4

» Algorithms » Worst and Average Case Analysis

### Question

When consider n elements are to be sorted then the Average case time complexity of selection sort is-

### Choices

Choice (4) | Response | |
---|---|---|

a. | 0 (log2n) | |

b. | 0 (n) | |

c. | 0 (n^2) | |

d. | None of the above |

## Question number: 5

» Algorithms » Worst and Average Case Analysis

### Question

When consider n elements are to be sorted then the worst case time complexity of merge sort is

### Choices

Choice (4) | Response | |
---|---|---|

a. | 0 (logn) | |

b. | 0 (nlogn) | |

c. | 0 (2nlogn) | |

d. | All of the above |

## Question number: 6

» Algorithms » Worst and Average Case Analysis

### Question

When consider n elements are to be sorted then the worst case time complexity of quick sort is-

### Choices

Choice (4) | Response | |
---|---|---|

a. | 0 (1) | |

b. | 0 (n) | |

c. | 0 (n^2) | |

d. | Question does not provide sufficient data or is vague |

## Question number: 7

» Algorithms » Worst and Average Case Analysis

### Question

When consider n elements are to be sorted then the worst case time complexity of insertion sort is -

### Choices

Choice (4) | Response | |
---|---|---|

a. | 0 (n^2) | |

b. | 0 (nlog3n) | |

c. | 0 (n) | |

d. | None of the above |