Explain Reinforcement Learning with examples.
Please rotate your device horizontally for split view
Access and download Reinforcement Learning - Elective VI question papers from Savitribai Phule Pune University (SPPU). Our collection includes INSEM (Internal Semester) and ENDSEM (End Semester) exam papers.
We offer 4 question papers for Reinforcement Learning - Elective VI, covering various exam patterns and years. All papers are in PDF format for easy viewing and download.
Prepare for mid-term evaluations with Reinforcement Learning - Elective VI INSEM papers, aligned with the SPPU exam pattern and syllabus.
Access Reinforcement Learning - Elective VI ENDSEM papers covering the entire syllabus, essential for final exam preparation.
Our question-paper viewer enables you to:
SPPU Question Papers Hub is focused entirely on SPPU previous year papers, with cleaner discovery by branch, semester, and subject.
Reinforcement Learning - Elective VI is a key subject in the SPPU curriculum. Our question paper collection helps students understand exam patterns, practice effectively, and improve academic performance.
Explore Reinforcement Learning - Elective VI resources including SPPU question papers from Savitribai Phule Pune University. Find INSEM and ENDSEM papers for effective examination preparation. Our platform offers academic resources, a PDF viewer for online study, university question papers, and materials for semester examinations.
Download all INSEM question papers as ZIP
Download all ENDSEM question papers as ZIP
Download all question papers (INSEM + ENDSEM) as ZIP
Pre-rendered question cards from available structured metadata.
Explain Reinforcement Learning with examples.
List out the scope and limitations of reinforcement learning.
‘What are the elements of Reinforcement learning
Give few applications where reinforcement learning can be combined with different machine learning algorithms.
Explain the Markov Property in detail.
What is Bellman equation? Write the process to solve Bellman equation.
Explain in detail the concept of The infinite Horizons and Utility of Sequences?
Explain the concept of Partially Observable Markov Decision Proccss with the help of suitable example.
| Subject Name | Reinforcement Learning - Elective VI |
|---|---|
| Semester | VIII |
| Pattern Year | 2019 |
| Subject Code | 417533(D) |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6411]-193 |
| Academic Year | B.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2025 Mar INSEM |
| Watermark | ['CEGP013091', '49.248.216.237 15/03/2025 13:42:00 static-237'] |
What is reinforcement learning? Compare RL with other ML techniques.
How has reinforcement learning evolved over time, from its early theoretical roots to practical applications in various domains?
Explain limitation of reinforcement learning.
What is reinforcement learning? Explain one practical example.
Explain how reinforcement learning influenced robotics and autonomous systems development?
Explain various practical applications of reinforcement learning.
What are the key components of a Markov decision process (MDP), and how do they formalize a reinforcement learning problem?
Discuss the difference between policy evaluation and policy improvement in the context of Markov decision process (MDP).
Explain the concept of infinite horizons in reinforcement learning.
Describe the Bellman equation for both the state-value function and the action-value function in MDPs, and discuss their significance in reinforcement learning algorithms.
Explain sequence of rewards assumption in reinforcement learning.
Discuss the Markov Properties.
| Subject Name | Reinforcement Learning - Elective VI |
|---|---|
| Semester | VIII |
| Pattern Year | 2019 |
| Subject Code | 417533(D) |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6270]-202 |
| Academic Year | B.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2024 Mar INSEM |
| Watermark | ['CEGP013091', '49.248.216.238 27/03/2024 13:41:39 static-238'] |
Discuss dynamic programming for the Markov decision process and define formulation of planning in MDPs.
List and Explain the principles of optimality.
Elaborate Iterative policy evaluation and policy iteration.
Elaborate proof of contraction mapping property of Bellman expectation and optimality operators.
Discuss Banach fixed point theorem.
Explain a proof of convergence of policy evaluation and value iteration algorithms.
Discuss the role of Monte Carlo methods for model-free Reinforcement Learning and Monte Carlo control.
Explain on-policy and off-policy learning techniques.
Elaborate first visit and every visit to Monte Carlo in Reinforcement Learning.
Discuss Discounting-aware Importance Sampling and Per-decision Importance Sampling with examples.
Elaborate Monte Carlo tree search along with examples.
Elaborate Deep Q-networks with convolution neural networks and single-layer neural networks.
Compare Model based learning and model-free learning with applications.
Elaborate Temporal difference learning technique.
Explain the Separate target network and discuss the role of the Separate target network in computing the target Q-values.
Elaborate Double DQN and Dueling DQN in reinforcement learning.
Elaborate Multi-agent Reinforcement Learning with Rollout and Policy Iteration.
Discuss Trajectory Sampling and Real-time Dynamic Programming with respect to learning.
Comment on Planning at Decision Time along with its importance.
Elaborate Heuristic Search and Rollout Algorithms in reinforcement learning.
Discuss Integrated Planning, Acting and Learning in Planning and Learning.
Explain Trajectory Sampling, and Real-time Dynamic Programming.
| Subject Name | Reinforcement Learning - Elective VI |
|---|---|
| Semester | VIII |
| Pattern Year | 2019 |
| Subject Code | 417533D |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6404]-394 |
| Academic Year | B.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2025 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 31/05/2025 13:46:33 static-237'] |
What is dynamic programming, And how does it apply to solving Markov Decision Processes?
State the Banach Fixed point Theorem and its significance in dynamic programming.
Explain the contraction mapping property of Bellman expectation and optimality operators.
State and explain the principle of optimality in the context of MDPs.
What are monte Carlo Methods, and how are they used in reinforcement learning.
Explain the idea behind per-decision Importance Sampling and its significance in off-policy learning.
What is the difference between On-policy and Off-policy learning in reinforcement learning.
What is Monte Carlo Tree Search (MCTS), and where is it commonly used?
Enlist the advantages and disadvantages of using model-based and model- free approaches in reinforcement learning.
Describe the Q-learning algorithm and its main components.
Discuss the double DQN algorithm and its advantages over traditional DQNs.
Explain the concept of Temporal difference (TD) learning in reinforcement learning.
How can an agent adapt when the model used for planning is inaccurate?
How do Rollout Algorithms help in approximating the value function and improving decision-making?
Explain the Dyna architecture and how it integrates planning, acting, and learning.
Discuss the advantages and limitations of using real-time Dynamic programming.
| Subject Name | Reinforcement Learning - Elective VI |
|---|---|
| Semester | VIII |
| Pattern Year | 2019 |
| Subject Code | 417533 D |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6263]-399 |
| Academic Year | B.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2024 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.238 21/05/2024 14:04:13 static-238'] |