Scribd
Upload
2 views3 pages

University Lab Questions

The document outlines a series of programming tasks focused on implementing various search algorithms and machine learning models. Each task includes a breakdown of evaluation criteria, with a total score of 100 points allocated across different components such as aim, procedure, results, and viva. The tasks cover algorithms like BFS, DFS, A*, Bayesian Networks, regression models, decision trees, random forests, support vector machines, and neural networks.

Uploaded by

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

University Lab Questions

The document outlines a series of programming tasks focused on implementing various search algorithms and machine learning models. Each task includes a breakdown of evaluation criteria, with a total score of 100 points allocated across different components such as aim, procedure, results, and viva. The tasks cover algorithms like BFS, DFS, A*, Bayesian Networks, regression models, decision trees, random forests, support vector machines, and neural networks.

Uploaded by

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

1. Develop a code by implementing the Uninformed search algorithm- BFS.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-


Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

2. Develop a code by implementing the Uninformed search algorithm- DFS


Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

3. Develop a code by implementing the Informed search algorithm- A*


Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

4. Develop a code by implementing the Informed search algorithm- Memory Bounded


A*
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

5. Develop a code by implementing the Analyzation of data set using naïve Bayes
models
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100
6. Develop a code by implementing the probability relationship check between two
dataset using Bayesian Networks
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

7. Develop a code to understand and predict an outcome variable based on the input
Regression models.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

8. Develop a code to Build the decision trees to predict the expected output from the
desired input.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

9. Develop a code to build random forests for the dataset by understand the
difference between Random and Decision Tree.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

10. Develop a code to Build support vector machine models for classification Task.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100
11. Implement an application that imposes the ensembling techniques
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

12. Implement an application that clustering algorithms


Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

13. Write a EM code for implementing the Bayesian Networks.


Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

14. Develop a neural network model to optimize the pattern.


Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

15. Develop a deep-learning Neural Network for experiencing different architectural


model.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-
Record Total
required/Procedure Program/Drawing & Results Voce
20 30 30 10 10 100

You might also like