AKTU MCA Artificial Intelligence (KCA301) Question Paper 2024-25
| University | Dr. A.P.J. Abdul Kalam Technical University (AKTU), Lucknow |
|---|---|
| Course | MCA, Semester III |
| Subject | Artificial Intelligence (KCA301) |
| Exam | Theory Examination 2024-25 (odd semester) |
| Time · Marks | 3 hours · 100 marks |
| Source | AKTU question paper, from the ABESIT question paper bank |
Note: Attempt all Sections. In case of any missing data; choose suitably.
Section A
Q1. Attempt all questions in brief · 2 × 10 = 20 marks
- What are the different branches of artificial intelligence?
- State any two foundation areas of artificial intelligence.
- Compare uninformed and informed search methods.
- What is a heuristic function, and how does it affect informed searching techniques?
- Demonstrate Modus Ponen’s rule in propositional Calculus?
- What do you mean by the knowledge representation?
- Explain naïve bayes classifier.
- What are statistical learning models.
- Write short note on Support Vector Machine (SVM)
- Differentiate concept of clustering and classification
Section B
Q2. Attempt any three of the following · 10 × 3 = 30 marks
- Explain various steps involved in natural language processing.
- Explain alpha-Beta pruning with example
- Describe the use of Hidden Markov models and explain it with suitable example
- Write short note on the following: i) Reinforcement learning ii) Unsupervised learning.
- Design principles of pattern recognition system. Explain Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA).
Section C
Q3
Attempt any one part of the following · 10 × 1 = 10 marks
- Describe intelligent agents in terms of Precepts, Actions, Goals and Environment with suitable block diagram and example.
- How can computer vision be used in autonomous vehicles? Explain the role of object detection and depth estimation.
Q4
Attempt any one part of the following · 10 × 1 = 10 marks
- Give the following graph, apply A* algorithm and find the shortest path from node (a) to node (z).
- Examine how AO* doesn’t explore all the solution paths once it got the solution with a suitable example.
Q5
Attempt any one part of the following · 10 × 1 = 10 marks
- Write down the algorithm for converting FOPL into CNF and converting Demonstrate the steps on given sentences i. John like all kinds of food. ii. Apples are food.
- Convert the following sentence into predicate logic and then prove "Was
1. Marcus was a man.2. Marcus was a Pompeian.
3. All Pompeian’s were Romans.4. Caesar was a ruler.
5. All Romans were either loyal to Caesar or hated him.6. Everyone is loyal to someone.
7. People only try to assassinate rulers they are not loyal to.8. Marcus tried to assassinate Caesar.
Q6
Attempt any one part of the following · 10 × 1 = 10 marks
- Examine ID3 algorithm to understand the concept of learning using decision tree with proper example.
- Describe the two main steps of the EM algorithm. (a) Expectation Step (E-step) (b) Maximization Step (M-step)
Q7
Attempt any one part of the following · 10 × 1 = 10 marks
- Discuss k-means clustering algorithm with an suitable example.
- You are given the following dataset of 5 points with two features (X1,
X2), and a class label (A or B):X1 X2 Class2 3 A3 3 A6 5 B7 8 B4 4 A
Now, consider a new point (X1 = 5, X2 = 6). Apply KNN with K=3 to classify this point.
Short on time? See the most repeated AKTU Artificial Intelligence questions across all years.
Other years
More AKTU Artificial Intelligence papers on LearnAIFast.
This paper is reproduced for study purposes only. Copyright belongs to AKTU. Source: the question paper bank of ABES Institute of Technology, an AKTU-affiliated college. If you own the copyright and want it removed, email learnwithskillnest@gmail.com and we will take it down.