Scribd
Upload
21 views9 pages

Ocs351-Aimlf Univ Exam

The document outlines the practical examination requirements for the OCS351 course on Artificial Intelligence and Machine Learning at DMI College of Engineering. It includes a list of algorithms and techniques to be implemented by students, along with their respective evaluation criteria. The document also contains student attendance and marks details for the practical examinations scheduled for June 2025.

Uploaded by

rajdmice
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views9 pages

Ocs351-Aimlf Univ Exam

The document outlines the practical examination requirements for the OCS351 course on Artificial Intelligence and Machine Learning at DMI College of Engineering. It includes a list of algorithms and techniques to be implemented by students, along with their respective evaluation criteria. The document also contains student attendance and marks details for the practical examinations scheduled for June 2025.

Uploaded by

rajdmice
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

1. Implement of Breadth First Search (BFS).

Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

2. Implement of Depth First Search (DFS).


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

External
Internal Examiner Examiner

3. Analysis of Breadth First and Depth First Search in terms of Time and
Space.
Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

4. Implement Greedy search algorithm.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

5. Implement A* algorithm.
Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner


6. Demonstrate the working of the decision tree based algorithm.
Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

7. Implement the back propagation algorithm.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

8. Implement the naïve Bayesian classifier.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

9. Implement neural network using self-organizing maps.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

10. Implement k-Means algorithm to cluster a set of data.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner


11. Implement hierarchical clustering algorithm.
Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

12. Implement of non-parametric locally weighted regression algorithm.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

13. Implement of Breadth First Search (BFS).


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

14. Implement of Depth First Search (DFS).


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

1. Implement of Breadth First Search (BFS).


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner


2. Implement of Depth First Search (DFS).
Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

3. Analysis of Breadth First and Depth First Search in terms of Time and
Space.
Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

4. Implement Greedy search algorithm.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

5. Implement A* algorithm.
Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

6. Demonstrate the working of the decision tree based algorithm.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner


7. Implement the back propagation algorithm.
Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

8. Implement the naïve Bayesian classifier.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

9. Implement neural network using self-organizing maps.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

10. Implement k-Means algorithm to cluster a set of data.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

11. Implement hierarchical clustering algorithm.


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner


12. Implement of non-parametric locally weighted regression algorithm.
Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

13. Implement of Breadth First Search (BFS).


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner

14. Implement of Depth First Search (DFS).


Aim &
Program Output Result Viva Total
Requirements
10 40 25 15 10 100

Internal Examiner External Examiner


Anna University Practical Examinations
Jun-25
DMI College of Engineering, Palanchur 123

Mechanical Engineering III year VI semester


OCS351 - Artificial Intelligence and Machine Learning Fundamentals
S.No Register Number Student Name Attendance
1 210522114004 ARVINTHAN L
2 210522114006 ASHWIN M
3 210522114008 BARATH R
4 210522114009 BHUVANESH B
5 210522114011 DHANALAKSHMI P
6 210522114012 DHEENA P
7 210522114013 EBI PINCE S
8 210522114014 HUDSON SAFIN Y
9 210522114015 INDHUMATHI S
10 210522114016 JESWIN JOE D
11 210522114017 MAHAVISHNU AMARRIJITH KUMAR
12 210522114018 MANOJ KUMAR V
13 210522114021 NANDHINI A
14 210522114022 NARENDRAN A
15 210522114023 POOVARASAN S
16 210522114024 PRAVEEN RAJ P
17 210522114025 RAHEES A
18 210522114028 SANTHAKUMAR K
19 210522114029 SARAN S S
20 210522114030 SRI RAM M
21 210522114032 UDHAYA B
22 210522114034 VIKNESH B
23 210522114035 VISHAL P
24 210522114036 YUVASREE R
25 210522114501 VICTOR K
26 210522114502 YOGESH
27 210522114701 VIKRAM
28 210522114702 NAGARAJAN

Internal Examiner External Examiner


Anna University Practical Examinations
Jun-25
DMI College of Engineering, Palanchur 123

Mechanical Engineering III year VI semester


OCS351 - Artificial Intelligence and Machine Learning Fundamentals
S.No Register Number Student Name Marks Marks in Words
1 210522114004 ARVINTHAN L
2 210522114006 ASHWIN M
3 210522114008 BARATH R
4 210522114009 BHUVANESH B
5 210522114011 DHANALAKSHMI P
6 210522114012 DHEENA P
7 210522114013 EBI PINCE S
8 210522114014 HUDSON SAFIN Y
9 210522114015 INDHUMATHI S
10 210522114016 JESWIN JOE D
11 210522114017 MAHAVISHNU AMARRIJITH KUMAR
12 210522114018 MANOJ KUMAR V
13 210522114021 NANDHINI A
14 210522114022 NARENDRAN A
15 210522114023 POOVARASAN S
16 210522114024 PRAVEEN RAJ P
17 210522114025 RAHEES A
18 210522114028 SANTHAKUMAR K
19 210522114029 SARAN S S
20 210522114030 SRI RAM M
21 210522114032 UDHAYA B
22 210522114034 VIKNESH B
23 210522114035 VISHAL P
24 210522114036 YUVASREE R
25 210522114501 VICTOR K
26 210522114502 YOGESH
27 210522114701 VIKRAM
28 210522114702 NAGARAJAN

Internal Examiner External Examiner


Anna University Practical
Examinations Jun-25
DMI College of Engineering, Palanchur 123
Mechanical Engineering III year VI semester
OCS351 - Artificial Intelligence and Machine Learning Fundamentals

S.No Questions
1 Implement of Breadth First Search (BFS).
2 Implement of Depth First Search (DFS).
3 Analysis of Breadth First and Depth First Search in terms of Time and Space.
4 Implement Greedy search algorithm.
5 Implement A* algorithm.
6 Demonstrate the working of the decision tree based algorithm.
7 Implement the back propagation algorithm.
8 Implement the naïve Bayesian classifier.
9 Implement neural network using self-organizing maps.
10 Implement k-Means algorithm to cluster a set of data.
11 Implement hierarchical clustering algorithm.
12 Implement of non-parametric locally weighted regression algorithm.

Internal Examiner External Examiner

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy