LUMS
LUMS SSE Artificial Intelligence
PKR 3000
Content
- AVL Trees
- Binary Trees
- Computational Problem Solving
- Divide And Conquer
- Dynamic Programming
- Graphs
- Greedy Algorithms
- Hashing
- Heap And Heap Sort
- Huffman Coding
- Linked Lists (Singly, Doubly, Circular)
- Lower Bound For Comparison Based Sorting
- Queues
- Recursion
- Solving Recurrence Relations (Master's Theorem)
- Stacks
- Coordinates and Basis for a vector space
- Determinants by Cofactor Expansion
- Diagonal, Triangular and Symmetric matrices
- Elementary Matrices and Method of finding matrix inverse
- Evaluating Determinants by row reduction
- Foundational of Linear Algebra
- Gaussian Elimination
- Introduction to Systems of Linear Equations
- Inverses; Algebraic properties of Matrices
- Linear Independence Dependence
- Matrices and Matrix operations
- Matrix Transformations
- More on linear systems and Invertible Matrices
- Norm, Dot Product, and Distance in Rn
- Orthogonality of vectors
- Properties of Determinants; Cramer’s rule
- Real Vector Spaces
- Subspaces
- The Geometry of Linear Systems
- Vectors in 2-space, 3-space and n-space
- Introductory Probability theory concepts
1
Computational Problem Solving
2
Foundational of Linear Algebra
3
Introductory Probability theory concepts
Ask Anything