You are on page 1of 30

ARTIFICAL INTELIGENCE AND

DATA SCIENCE

LABORARTORY
1. Implement simple ADTs as Python classes.

AIM :
Create a Python Program Implement simple ADTs as Python classes.

PROGRAM:
OUTPUT:
2. Implement recursive algorithms in Python
AIM :
Create a Python Program to Implement recursive algorithms in Python

PROGRAM:
OUTPUT:
3. Implement List ADT using Python arrays

AIM:
Create a Python Program to Implement List ADT using Python arrays

PROGRAM:
OUTPUT:
4. Linked list implementations of List

AIM:
Create a Python Program to Linked list implementations of List

PROGRAM:

OUTPUT:
5. Implementation of Stack and Queue ADTs

AIM:
Create a Program to Implementation of Stack and Queue ADTs

PROGRAM:
OUTPUT:
6. Applications of List, Stack and Queue ADTs

AIM:
Create a Python Program Applications of List, Stack and Queue ADTs

PROGRAM:
OUTPUT:
7. Implementation of sorting and searching algorithms
AIM:
Create a Python Program to Implementation of sorting and searching algorithms

PROGRAM:
OUTPUT:
8. Implementation of Hash tables
AIM :
Create a Python Program to Implementation of Hash tables.

PROGRAM:
OUTPUT:
9. Tree representation and traversal algorithms

AIM :
Create a Python Program to Tree representation and traversal algorithms

PROGRAM:
OUTPUT:
10. Implementation of Binary Search Trees

AIM:
Create a Python Program to Implementation of Binary Search Trees
Program:
OUTPUT:
11. Implementation of Heaps

AIM:
Create a Python Program to Implementation of Heaps
PROGRAM:
OUTPUT:
12. Graph representation and Traversal algorithms

AIM:
Create a Python Program to Graph representation and Traversal algorithms

PROGRAM:
OUTPUT:
13. Graph representation and Traversal algorithms

AIM:
Create a Python Program to Graph representation and Traversal algorithms

PROGRAM:
OUTPUT:
14: Implementation of minimum spanning tree algorithms
AIM:
Create a Python Program to Implementation of minimum spanning tree algorithms
PROGRAM:
OUTPUT:

You might also like