FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download PTU B.Tech 2021 Jan IT 5th Sem 78265 Artificial Intelligence Question Paper

Download PTU (Punjab Technical University) B.Tech (Bachelor of Technology) / BE (Bachelor of Engineering) 2021 January IT 5th Sem 78265 Artificial Intelligence Previous Question Paper

This post was last modified on 26 June 2021

This download link is referred from the post: PTU B.Tech 5th Semester Last 10 Years 2011-2021 Previous Question Papers|| Punjab Technical University


FirstRanker.com

Total No. of Pages : 02

Total No. of Questions : 18

--- Content provided by FirstRanker.com ---

B.Tech. (IT) (Sem.-5)

ARTIFICIAL INTELLIGENCE

Subject Code : BTIT-3511-18

M.Code : 78265

Time : 3 Hrs. Max. Marks : 60

--- Content provided by FirstRanker.com ---

INSTRUCTIONS TO CANDIDATES :

  1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
  2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
  3. SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.

SECTION-A

--- Content provided by FirstRanker.com ---

Write briefly :

  1. Are there agent functions that cannot be implemented by any agent program?
  2. List the criteria to measure the performance of different search strategies.
  3. What is heuristic search?
  4. What is a rational agent?
  5. --- Content provided by FirstRanker.com ---

  6. What is utility function?
  7. What is Reinforcement learning?
  8. What is conditional probability?
  9. What is uncertainty?
  10. List the factors that make reinforcement learning difficult.
  11. --- Content provided by FirstRanker.com ---

  12. What is a partially observable markov decision process?

SECTION-B

  1. The n-queens problem is to place n queens on an n-by-n chessboard, such that no queen attacks another, as per chess rules. Pose the problem as a search problem.
  2. Differentiate tree-based breadth-first and depth-first search strategies based on completeness, time and space complexities.
  3. Using the axioms of probability, prove that any probability distribution on a discrete random variable must sum to 1.
  4. --- Content provided by FirstRanker.com ---

  5. Explain the process of decision-making using utility functions.
  6. What is meant by passive and active reinforcement learning and how do we compare the two?

SECTION-C

  1. What is Artificial Intelligence? Explain how an AI system is different from a conventional computing system? Discuss application areas of AI
  2. Explain the A* search algorithm with the help of an example and also give the proof of optimality of A*.
  3. --- Content provided by FirstRanker.com ---

  4. What is Bayesian-Network? Briefly discuss how a Bayesian Network is constructed and how inference is accomplished in a Bayesian Network.

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.



--- Content provided by FirstRanker.com ---

This download link is referred from the post: PTU B.Tech 5th Semester Last 10 Years 2011-2021 Previous Question Papers|| Punjab Technical University