Question
Download Solution PDFWhich of the program has the highest run time complexity ?
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFThe correct answer is option 1: Tower of Hanoi
Key Points
- Tower of Hanoi has exponential time complexity:
- This is because solving the problem for disks involves:
- Moving disks to an auxiliary peg,
- Moving the largest disk, and
- Then moving the disks again.
- Thus, total moves = , which grows exponentially.
Additional Information
- Fibonacci Series: Recursive approach has , but optimized methods (e.g. DP) reduce it to
- Prime Number Series: Can be computed in using Sieve of Eratosthenes
- Triangular Series: Direct formula used, so it is or in basic iterative form
Hence, the correct answer is: option 1: Tower of Hanoi
Last updated on Jun 26, 2025
-> NIELIT Scientific Assistant admit card 2025 has been released.
-> NIELIT Scientific Assistant city intimation slip 2025 has been released at the official website.
-> NIELIT Scientific Assistant exam 2025 is scheduled to be conducted on June 28.
-> A total number of 113 revised vacancies have been announced for the post of Scientific Assistant in Computer Science (CS), Information Technology (IT), and Electronics & Communication (EC) streams.
-> Online application form, last date has been extended up to from 17th April 2025.
->The NIELT has revised the Essential Qualifications for the post of Scientific Assistant. Candidates must possess (M.Sc.)/ (MS)/ (MCA) / (B.E.)/ (B.Tech) in relevant disciplines.
-> The NIELIT Scientific Assistant 2025 Notification has been released by the National Institute of Electronics and Information Technology (NIELIT).