Computer Science · Algorithms
निम्नलिखित में से कौन सा पुनरावृत्ति संबंध (recurrence relation) एक धनात्मक पूर्णांक n के फैक्टोरियल की सही गणना करता है, जहाँ n! फैक्टोरियल को दर्शाता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1factorial(n) = n / factorial(n-1)
- 2factorial(n) = n * factorial(n-1)✓
- 3factorial(n) = n - factorial(n-1)
- 4factorial(n) = n + factorial(n-1)
सही उत्तर देखें
factorial(n) = n * factorial(n-1)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms