## Discussion Forum

Que. | If the array is already sorted, which of these algorithms will exhibit the best performance |

a. | Merge Sort |

b. | Insertion Sort |

c. | Quick Sort |

d. | Heap Sort |

Answer:Insertion Sort |

Que. | If the array is already sorted, which of these algorithms will exhibit the best performance |

a. | Merge Sort |

b. | Insertion Sort |

c. | Quick Sort |

d. | Heap Sort |

Answer:Insertion Sort |

Questions from Previous year GATE question papers

UGC NET Previous year questions and practice sets

UGC NET Previous year questions and practice sets

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.