Scribd
Upload
6 views2 pages

Daa Course File

The document outlines the course plan for the Artificial Intelligence and Data Science department at Asan Memorial College for the academic year 2025-2026, specifically for the second year, third semester, section A. It includes a list of experiments to be conducted, their cumulative and proposed periods, and the total number of students involved. The plan covers various algorithms and techniques such as recursive algorithms, divide and conquer, dynamic programming, and greedy techniques.

Uploaded by

BanuRamasamy
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
6 views2 pages

Daa Course File

The document outlines the course plan for the Artificial Intelligence and Data Science department at Asan Memorial College for the academic year 2025-2026, specifically for the second year, third semester, section A. It includes a list of experiments to be conducted, their cumulative and proposed periods, and the total number of students involved. The plan covers various algorithms and techniques such as recursive algorithms, divide and conquer, dynamic programming, and greedy techniques.

Uploaded by

BanuRamasamy
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

ASAN MEMORIAL COLLEGE OF ENGINEERIN AND TECHNOLOGY

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

COURSE PLAN

SUBJECT CODE & NAME :


BATCH : 2024-2028 DEPARTMENT: AIDS

ACADEMICYEAR : 2025-2026 YEAR: II

SEMESTER : III SECTION: A


NAME OF THE FACULTY: TOTAL NO OF STUDENTS:25

[Link] Cumulative Proposed Completed


No. of Date date
EXPERIMENTS No. of
Periods Periods
1. Implement recursive and non-recursive 1-2 2
algorithms and study the order of growth
from log2n to n!.

2. Divide and Conquer - Strassen’s Matrix 1-2 4


Multiplication

3. Decrease and Conquer - Topological 1-2 6


Sorting

4. Transform and Conquer - Heap Sort 1-2 8


5. Dynamic programming - Coin change 1-2 10
Problem, Warshall’s and Floyd‘s
algorithms, Knapsack Problem

6. Greedy Technique – Dijkstra’s 1-2 20


algorithm, Huffman Trees and codes

7. Iterative improvement - Simplex Method 1-2 25

8. Backtracking – N-Queen problem, Subset 1-2 28


Sum Problem

9 Branch and Bound - Assignment 1-2 30


problem, Traveling Salesman Problem

No. of
No. of
Hours
Hours
30
Taken: 30

Prepared by Approved by

Signature

Name Dr. VK. GNANAVEL

Designation Assistant Professor PRINCIPAL / DEAN

SubmittedDate

You might also like