## Discussion Forum

Que. | In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time |

a. | Θ(n log n) |

b. | Θ(n) |

c. | Θ(log n) |

d. | Θ(1) |

Answer:Θ(1) |

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

Que. | In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time |

a. | Θ(n log n) |

b. | Θ(n) |

c. | Θ(log n) |

d. | Θ(1) |

Answer:Θ(1) |

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.