DA Data Science and Artificial Intelligence
Section 1: Probability and Statistics
1. Counting:
o Permutations, Combinations.
o Applications: Probability computation in discrete sample
spaces.
2. Probability Basics:
o Axioms of probability, Sample space, Events.
o Independent events vs. mutually exclusive events.
3. Marginal, Conditional, and Joint Probabilities:
o Definitions and applications in Bayes’ theorem and Markov
Chains.
4. Descriptive Statistics:
o Mean, Median, Mode, Variance, Standard deviation.
o Covariance and Correlation.
5. Random Variables:
o Discrete: Probability mass functions (PMFs).
o Continuous: Probability density functions (PDFs).
6. Probability Distributions:
o Discrete: Bernoulli, Binomial, Poisson.
o Continuous: Uniform, Exponential, Normal, t-distribution, Chi-
squared distribution.
7. Theorems:
o Bayes’ Theorem: Posterior probability calculation.
o Central Limit Theorem: Importance in large sample
approximations.
8. Hypothesis Testing:
o Z-tests, t-tests, and Chi-squared tests.
o Confidence Intervals.
DA Data Science and Artificial Intelligence
Section 2: Linear Algebra
1. Vector Space:
o Subspaces, Basis, Dimension.
o Linear dependence and independence.
2. Matrices:
o Types: Projection, Orthogonal, Idempotent, Partitioned.
o Properties: Symmetry, inverse, and rank.
3. Quadratic Forms:
o Applications in optimization and eigenvalue problems.
4. Systems of Linear Equations:
o Gaussian elimination and consistency checks.
5. Eigenvalues and Eigenvectors:
o Applications in PCA, Stability analysis.
6. Matrix Decompositions:
o LU decomposition, Singular Value Decomposition (SVD).
7. Other Properties:
o Determinant, Rank, Nullity, Projections.
Section 3: Calculus and Optimization
1. Calculus Basics:
o Limits, Continuity, Differentiability.
2. Taylor Series:
o Approximation of functions near a point.
3. Optimization:
o Single-variable maxima and minima, critical points.
DA Data Science and Artificial Intelligence
Section 4: Programming, Data Structures, and
Algorithms
1. Programming in Python:
o Syntax, Libraries for data structures, and algorithmic
implementation.
2. Data Structures:
o Stacks, Queues: Applications in recursion and BFS.
o Linked Lists: Dynamic memory handling.
o Trees: Traversals and hierarchical data.
o Hash Tables: Efficient lookups and dictionaries.
3. Search Algorithms:
o Linear Search, Binary Search.
4. Sorting Algorithms:
o Selection Sort, Bubble Sort, Insertion Sort.
o Merge Sort, Quick Sort: Divide and conquer approaches.
5. Graph Theory:
o Traversals: BFS, DFS.
o Shortest Path Algorithms: Applications in AI (e.g., Dijkstra’s,
A*).
DA Data Science and Artificial Intelligence
Section 5: Database Management and Warehousing
1. Relational Models:
o ER-modeling, Relational Algebra, Tuple calculus.
o SQL Queries, Integrity Constraints.
2. Normalization:
o Functional dependencies, Normal forms (1NF, 2NF, 3NF,
BCNF).
3. File Organization and Indexing:
o B-Trees, Hash-based indexing.
4. Data Transformation:
o Normalization, Discretization, Sampling, Compression.
5. Data Warehousing:
o Schema: Star, Snowflake models.
o Concept hierarchies, Measure computations.
DA Data Science and Artificial Intelligence
Section 6: Machine Learning
1. Supervised Learning:
o Regression: Linear, Multiple Linear, Ridge, Logistic.
o Classification: k-Nearest Neighbor, Naive Bayes, SVM,
Decision Trees.
o Neural Networks: Multi-layer Perceptron, Feed-forward
models.
o Validation: Bias-variance trade-off, Cross-validation (LOO, K-
fold).
2. Unsupervised Learning:
o Clustering: K-means/K-medoids, Hierarchical clustering.
o Dimensionality Reduction: PCA.
Section 7: Artificial Intelligence
1. Search Strategies:
o Uninformed: BFS, DFS.
o Informed: Heuristics (A*).
o Adversarial: Minimax, Alpha-Beta pruning.
2. Logic:
o Propositional and Predicate logic.
3. Reasoning Under Uncertainty:
o Conditional independence representation.
o Exact Inference: Variable elimination.
o Approximate Inference: Sampling-based methods.
GATE WEIGHTAGE
Topic Sub-Topic Priority Level Weightage
(1 = Highest) (%)
General Aptitude Verbal Ability (Grammar, Sentence 1 7-8
Completion, Synonyms/Antonyms,
Reading Comprehension)
Numerical Ability (Arithmetic, Algebra, 1 7-8
Geometry, Data Interpretation)
Probability and Counting: Permutations, Combinations 2 2-3
Statistics
Probability Basics: Axioms, Sample Space, 2 4-5
Independent/Mutually Exclusive Events
Marginal, Conditional, and Joint 2 4-5
Probabilities
Descriptive Statistics: Mean, Median, 2 2-3
Mode, Variance, Standard Deviation
Random Variables: Discrete (PMF) and 2 3-4
Continuous (PDF)
Probability Distributions: Bernoulli, 2 4-5
Binomial, Poisson, Uniform, Exponential,
Normal, etc.
Bayes' Theorem and Central Limit 2 2-3
Theorem
Hypothesis Testing: Z-tests, t-tests, Chi- 3 3-4
squared, Confidence Intervals
Linear Algebra Vector Space: Subspaces, Basis, 3 3-4
Dimension, Linear Dependence
Matrices: Projection, Orthogonal, 3 3-4
Symmetry, Inverse, Rank
Quadratic Forms: Optimization, 4 3-4
Eigenvalue Problems
Systems of Linear Equations: Gaussian 3 2-3
Elimination
Eigenvalues and Eigenvectors: PCA, 3 4-5
Stability Analysis
Matrix Decompositions: LU, SVD 4 2-3
Machine Learning Supervised Learning: Regression (Linear, 4 5-6
Ridge, Logistic), Classification (SVM,
Decision Trees)
Neural Networks: Multi-layer Perceptron, 4 3-4
Feed-forward Models
Validation: Cross-validation, Bias-Variance 4 2-3
Trade-o
Unsupervised Learning: Clustering (K- 4 3-4
means, Hierarchical), Dimensionality
Reduction (PCA)
Programming, Data Python Programming: Syntax, Libraries 5 3-4
Structures, and
Algorithms
Data Structures: Stacks, Queues, Linked 5 4-5
Lists, Trees, Hash Tables
Search Algorithms: Linear, Binary 5 2-3
Sorting Algorithms: Merge Sort, Quick 5 2-3
Sort, Bubble Sort
Graph Theory: BFS, DFS, Shortest Path 5 3-4
Algorithms
Database Relational Models: ER Modeling, SQL 6 3-4
Management and Queries
Warehousing
Normalization: Functional Dependencies, 6 3-4
Normal Forms (1NF to BCNF)
File Organization and Indexing: B-Trees, 6 2-3
Hash-based Indexing
Data Transformation: Sampling, 6 2-3
Compression, Discretization
Data Warehousing: Star/Snowflake 6 3-4
Schema, Concept Hierarchies
Calculus and Limits, Continuity, Di erentiability 7 2-3
Optimization
Taylor Series: Function Approximation 7 2-3
Optimization: Single-variable Maxima and 7 2-3
Minima
Artificial Intelligence Search Strategies: BFS, DFS, A*, Minimax, 8 3-4
Alpha-Beta Pruning
Logic: Propositional and Predicate Logic 8 2-3
Reasoning Under Uncertainty: Variable 8 2-3
Elimination, Approximate Inference
