Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    CS3491 Set4

    Uploaded by

    hari99hkm2004
    It's a model question paper

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    CS3491 Set4

    Uploaded by

    hari99hkm2004
    5 views3 pages
    It's a model question paper

    Original Title

    CS3491 SET4

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    It's a model question paper

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    5 views3 pages

    CS3491 Set4

    Uploaded by

    hari99hkm2004
    It's a model question paper

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    B.E / B.Tech.

    PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2023

    Fourth Semester

    CS3491 - ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

    (Regulations 2021)

    Time : 3 Hours Answer any one Question Max. Marks 100

    Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total


    required/Procedure Program/Drawing & Results
    20 30 30 10 10 100

    1. A---B
    |\ |
    | \ |
    | \|
    C---D
    Write a Python program to perform a Breadth-First Search on the above graph starting from
    vertex ‘A’.

    2. A
    / \
    B C
    / \ \
    D E F
    Write a Python program to perform a Breadth-First Search on this graph starting from vertex
    ‘A’.

    3. Write a Python program to implement Depth-First Search using a tree.

    4. Write a Python program to perform a DFS traversal starting in a graph and show the order of
    visited vertices.

    5. Write a Python program to find the articulation points of the graph using Depth-First Search.

    6. Given the following adjacency matrix:


    0110
    1001
    1001
    0110
    Perform a Depth-First Search on this graph starting from vertex ‘0’.

    Page 1 of 3
    7. Consider the following grid map, where each cell is either passable (0) or blocked (1):
    000100000
    000100000
    000100000
    000100000
    000000000
    000000000
    Write the program to find the shortest path from the start to the goal using A* algorithm.
    Note: Moves can in any of the four cardinal directions (up, down, left, right) but not diagonally.
    The start position is (0, 0) and the goal position is (5, 8).

    8. Write the program to find the shortest path from `start` to `goal` in a `graph` by means of A*
    algorithm.

    9. Write a python program to EM algorithm to learn parameters for a Bayesian network using the
    pgmpy library

    10. Write a python program to implement a Naive Bayes classifier using scikit-learn library

    11. Write a python program to create a simple Bayesian network using pgmpy.

    12. Write a python program to build linear regression using scikit-learn library

    13. Write a python program to build decision tree regression using scikit-learn library

    14. Write a python program to build decision trees and random forests

    15. Write a python program to build SVM (Support Vector Machine) models using scikit-learn

    16. Write a python program to implement ensemble techniques, such as voting and bagging, using
    scikit-learn

    17. Write a python program to implement clustering algorithms, specifically K-means and
    DBSCAN, using scikit-learn

    18. Write a python program using the K2 algorithm for learning the structure of a Bayesian network

    Page 2 of 3
    19. Write a python program to build a simple neural network model using the Keras library

    20. Write a python program to build a deep learning neural network model using the Keras library

    Page 3 of 3

    You might also like