Scribd
Upload
14 views

Gate DA Syllabus

The document provides an overview of topics covered in data science and artificial intelligence including: probability and statistics such as probability distributions, random variables, and hypothesis testing; linear algebra concepts like vectors, matrices, eigenvalues, and linear systems; calculus including limits, derivatives, and optimization; programming and data structures; database management; machine learning algorithms for supervised and unsupervised learning; and artificial intelligence techniques like search, logic, and reasoning under uncertainty.

Uploaded by

Bhageerath
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

Gate DA Syllabus

The document provides an overview of topics covered in data science and artificial intelligence including: probability and statistics such as probability distributions, random variables, and hypothesis testing; linear algebra concepts like vectors, matrices, eigenvalues, and linear systems; calculus including limits, derivatives, and optimization; programming and data structures; database management; machine learning algorithms for supervised and unsupervised learning; and artificial intelligence techniques like search, logic, and reasoning under uncertainty.

Uploaded by

Bhageerath
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DA Data Science and Arti cial Intelligence

Probability and Statistics: Counting (permutation and combinations), probability axioms, Sample space, events,
independent events, mutually exclusive events, marginal, conditional and joint probability, Bayes Theorem,
conditional expectation and variance, mean, median, mode and standard deviation, correlation, and covariance,
random variables, discrete random variables and probability mass functions, uniform, Bernoulli, binomial
distribution, Continuous random variables and probability distribution function, uniform, exponential, Poisson,
normal, standard normal, t-distribution, chi-squared distributions, cumulative distribution function, Conditional
PDF, Central limit theorem, con dence interval, z-test, t-test, chi-squared test.

Linear Algebra: Vector space, subspaces, linear dependence and independence of vectors, matrices, projection
matrix, orthogonal matrix, idempotent matrix, partition matrix and their properties, quadratic forms, systems of
linear equations and solutions; Gaussian elimination, eigenvalues and eigenvectors, determinant, rank, nullity,
projections, LU decomposition, singular value decomposition.

Calculus and Optimization: Functions of a single variable, limit, continuity and di erentiability, Taylor series,
maxima and minima, optimization involving a single variable.

Programming, Data Structures and Algorithms: Programming in Python, basic data structures: stacks, queues,
linked lists, trees, hash tables; Search algorithms: linear search and binary search, basic sorting algorithms:
selection sort, bubble sort and insertion sort; divide and conquer: mergesort, quicksort; introduction to graph
theory; basic graph algorithms: traversals and shortest path.

Database Management and Warehousing: ER-model, relational model: relational algebra, tuple calculus, SQL,
integrity constraints, normal form, le organization, indexing, data types, data transformation such as
normalization, discretization, sampling, compression; data warehouse modelling: schema for multidimensional
data models, concept hierarchies, measures: categorization and computations.

Machine Learning: (i) Supervised Learning: regression and classi cation problems, simple linear regression,
multiple linear regression, ridge regression, logistic regression, k-nearest neighbour, naive Bayes classi er,
linear discriminant analysis, support vector machine, decision trees, bias-variance trade-o , cross-validation
methods such as leave-one-out (LOO) cross-validation, k-folds cross-validation, multi-layer perceptron, feed-
forward neural network; (ii) Unsupervised Learning: clustering algorithms, k-means/k-medoid, hierarchical
clustering, top-down, bottom-up: single-linkage, multiple-linkage, dimensionality reduction, principal
component analysis.

AI: Search: informed, uninformed, adversarial; logic, propositional, predicate; reasoning under uncertainty
topics — conditional independence representation, exact inference through variable elimination, and
approximate inference through sampling.

GATE 2024, IISc, Bengaluru 56


fi
fi
fi
fi
ff
ff
fi

You might also like