Program Curriculum New - AIML - Complete Program Curriculum - AIML - Sheet1 (1) .CSV
The AIML Complete Curriculum covers a comprehensive range of topics in data structures, algorithms, and machine learning over 27 weeks. It includes foundational concepts such as arrays, linked lists, trees, and graphs, progressing to advanced topics like neural networks and data visualization tools like Power BI and Tableau. The course also emphasizes real-world applications and practical implementation of data structures and machine learning techniques.
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
0 ratings0% found this document useful (0 votes)
8 views4 pages
Program Curriculum New - AIML - Complete Program Curriculum - AIML - Sheet1 (1) .CSV
The AIML Complete Curriculum covers a comprehensive range of topics in data structures, algorithms, and machine learning over 27 weeks. It includes foundational concepts such as arrays, linked lists, trees, and graphs, progressing to advanced topics like neural networks and data visualization tools like Power BI and Tableau. The course also emphasizes real-world applications and practical implementation of data structures and machine learning techniques.
- Hash table implementation and analysis. - Applications of hash tables.
### Week 9-10: Graphs and Graph Algorithms
----Week 9: Graph Representations---- - Graph representations: adjacency matrix and adjacency list. - Depth-First Search (DFS) and its applications.
----Week 10: Graph Algorithms----
- Breadth-First Search (BFS) and its applications. - Shortest path algorithms: Dijkstra's and Bellman-Ford. - Minimum Spanning Trees (MST): Prim's and Kruskal's algorithms.
### Week 11-12: Advanced Data Structures
----Week 11: Disjoint Set and Trie---- - Disjoint Set (Union-Find) data structure. - Trie data structure and its applications.
----Week 12: B-trees, B+ Trees, and Skip Lists----
- B-trees and B+ trees: structure and operations. - Skip lists and their implementations.
### Week 13-14: Advanced Topics and Applications
----Week 13: Advanced Data Structures---- - Suffix trees and arrays. - Bloom filters. - Geometric data structures.
----Week 14: Real-World Applications----
- Parallel and concurrent data structures. - Using data structures in real-world applications: case studies and projects. ----Week 15-18:---- Course Introduction and Overview -- Data Science Lifecycle and Process -- Data Collection and Cleaning -- Data Visualization and Exploration -- Basic Statistics and Descriptive Analysis -- Introduction to Python for Data Science
----Week 18-21:---- Introduction to Machine Learning
-- Supervised Learning (Regression and Classification) -- Unsupervised Learning (Clustering and Dimensionality Reduction) -- Model Evaluation and Validation -- Feature Engineering -- Ensemble Methods (Random Forest, Gradient Boosting) -- Natural Language Processing (NLP)
-- Deep Learning Frameworks (TensorFlow, Keras, PyTorch) -- Backpropagation and Optimization Algorithms -- Convolutional Neural Networks (CNNs) -- Recurrent Neural Networks (RNNs) Long Short-Term Memory (LSTM) Networks -- Gated Recurrent Unit (GRU) Networks -- Sequence-to-Sequence Models -- Natural Language Processing with RNNs
----Week 24-26/27:---- Introduction to Data Visualization and BI
Concepts -- Power BI Fundamentals - Power BI Basics - Data Transformation and Modeling in Power BI ---Tableau Fundamentals - Tableau Basics - Data Preparation in Tableau - Advanced Tableau Features - Advanced Tableau Techniques - Integrating and Sharing Insights - Integration and Collaboration