## Discussion Forum

Que. | If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in: |

a. | O(d n k) |

b. | O(d n^k) |

c. | O((d+n)k) |

d. | O(d(n+k)) |

Answer:O(d(n+k)) |

Que. | If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in: |

a. | O(d n k) |

b. | O(d n^k) |

c. | O((d+n)k) |

d. | O(d(n+k)) |

Answer:O(d(n+k)) |

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.