Overall Completion
0%0 / 0 topics
Lectures Watched
0
Video lectures checked
PYQs Practiced
0
Homework & GATE questions
Topics Revised
0
Formulas & notes reviewed
DM
Discrete Mathematics
GATE Weightage: 10-12 marks0% done
Module 1: Basic Proof Techniques
CoreLecture 1A - Proof Techniques Part 1 - Direct Proofs
HighLecture 1B - Proof Techniques Part 2 - Proof by Contrapositive & Contradiction
HighLecture 1C - Proof by Mathematical Induction - Proof Technique
CoreHomework 1,2 Video Solutions - Proof Techniques
HighLecture 2 - Practice Questions on Proof Techniques
Module 2: Introduction to Discrete Mathematics
CoreLecture 1 - Introduction to Discrete Mathematics
CoreSummary Lecture 1 - Introduction to Discrete Mathematics
Module 3: Propositional Logic
CoreLecture 1 - Introduction to Mathematical Logic
CoreSummary Lecture 1 - Introduction to Mathematical Logic
CoreLecture 2 - Proposition & Propositional Variable
CoreSummary Lecture 2 - Proposition & Propositional Variable, Truth Value
CoreIs it a Proposition?? - A Dumb Question!!
CoreLecture 3 - Atomic & Compound Propositions
CoreSummary Lecture 3A - Atomic Proposition. Compound Proposition
CoreSummary Lecture 3B - Logical Connectives
CoreLecture 4 - Negation Operator - Logical Connectives
CoreLecture 5 - Conjunction (AND) Operator - Logical Connectives
CoreLecture 6 - Disjunction (OR) Operator - Logical Connectives
CoreLecture 7 - Exclusive-OR Operator - Logical Connectives
CoreLecture 8 - NAND NOR Operator - Logical Connectives
HighLecture 9 - Implication Operator - Logical Connectives
HighLecture 10 - Implication Operator Continued
HighLecture 11 - Important Points about Implication Operator
HighLecture 12 - Necessary & Sufficient Condition - Implication Operator
HighLecture 13 - Various English Translations of Implication Statement
HighLecture 14 - Bi-implication Operator - Logical Connective
HighLecture 15 - Property Vs Definition - Implication Vs Bi-implication Statements
CoreLecture 16 - Propositional Variable Vs Propositional Formula
CoreHomework 1,2 Video Solution & Notes
CoreLecture 17 - Propositional Formula Revisited
CoreLecture 18 - Truth Table
CoreHomework 3 Video Solution
HighLecture 19 - Tautology, Contradiction, Contingency
HighLecture 20 - By Case Method
HighLecture 21 - By Case Method Practice
HighLecture 22 - Logical Equivalence
HighLecture 23 - Logical Equivalence Practice
HighLecture 24 - Converse, Contrapositive of Conditional Statement
HighLecture 25 - English-Logic Translation
HighLecture 26 - Unless Word - English-Logic Translation
CoreLecture 27 - Logical Laws - Commutative Property
CoreLecture 28 - Logical Laws - Associative Property
CoreLecture 29 - Logical Laws - Idempotent Property
HighLecture 30 - Logical Laws - Distributive Law
HighLecture 31 - Logical Laws - De Morgan's Laws
HighLecture 32 - Logical Laws - Implication Laws
HighLecture 33 - Simplification Using Logical Laws
HighLecture 34 - Analysis of Implication
HighLecture 35 - Logical Arguments
HighLecture 36 - Rules of Inference - Logical Arguments
HighLecture 37 - The Inference Symbol
HighPropositional Logic - Summary, GATE PYQs & Practice Questions
Module 4: First Order Logic (Predicate Logic)
Core(OPTIONAL) Lecture 1 - Overview & Need of First Order Logic
CoreLecture 2 - Objects & Domain in First Order Logic
CoreLecture 3 - Predicates in First Order Logic
CoreLecture 4 - Creating Proposition from predicate
CoreLecture 5 - Quantifiers Introduction
HighLecture 6 - Universal Quantifier
HighLecture 7 - Existential Quantifier
HighLecture 8 - Quantifiers Practice
HighLecture 9 - Quantifiers Summary
HighLecture 10 - Quantifiers Tricky Points
HighLecture 11 - English-FOL Translation Part 1
HighLecture 12 - English-FOL Translation Part 2
HighLecture 13 - English-FOL Translation Part 3
HighLecture 14 - English-FOL Translation Part 4
HighLecture 15 - English-FOL Translation Part 5
HighLecture 16 - English-FOL Translation Part 6
HighLecture 17 - English-FOL Translation Part 7
HighLecture 18 - Revision of English-FOL Translation
HighLecture 19 - A LOT of Practice of English-FOL Translation
CoreLecture 20 - Bounded Variable
CoreLecture 21 - Free Variable Vs Bounded Variable
CoreLecture 22 - Practice - Bounded Variable Free Variable
CoreLecture 23 - Important Note About Free Variables
HighLecture 24 - Scope of a Quantifier
HighLecture 25 - Nested Quantifiers Part 1 - Need of Nested Quantifiers
HighLecture 26 - Nested Quantifiers Part 2 - All Four Standard Templates
HighLecture 27 - Nested Quantifiers Part 3 - Examples, Variations
HighLecture 28 - More Practice of English - FOL Translation
HighLecture 29 - Even More Practice of English - FOL Translation
HighLecture 30 - Practice - Free Variable, Bounded Variable, Scope
HighHomework 1 - Detailed Video Solutions - First Order Logic
HighLecture 31 - Negation of quantifiers
HighLecture 32 - Validity, Satisfiability of a FOL Expression
HighLecture 33 - Validity, Satisfiability of a FOL Expression Part 2
HighLecture 34 - Validity of FOL Expression Involving Implication
HighLecture 35 - Equivalence of FOL Expressions
HighLecture 36 - Distributive Properties of Quantifiers
HighLecture 37 - Practice - First Order Logic
HighLecture 38 - Null Quantification Rule
HighLecture 39 - Arguments in First Order Logic
HighGATE PYQs Video Solutions & Practice Questions - Mathematical Logic
CoreOPTIONAL Lecture 1 - Interpretation, Model in Propositional Logic
CoreOPTIONAL Lecture 2 - Interpretation, Model in First Order Logic
CoreOPTIONAL Lecture 3 - Uniqueness Quantifier
CoreOptional Lecture 4 - Tautology in First Order Logic
HighFirst Order Logic - Complete Summary, ALL GATE PYQs & Practice Questions
Module 5: Set Theory, Relations & POSET/Lattices
CoreLecture 1 - Set Definition
CoreLecture 2 - Finite Set, Infinite Set
CoreLecture 3 - Cardinality of a Set
CoreLecture 4 - Set Representations
CoreLecture 5 - Subset
CoreLecture 6 - Powerset of a Set
CoreLecture 7 - Set Operations
CoreLecture 8 - Set Equality
CoreLecture 9 - Understanding Set Operations
CoreLecture 10 - Proofs involving Sets, Set Equality, Subset
CoreLecture 11 - Set Identities
CoreLecture 12 - Proofs involving Power Sets
CorePractice Set 1 - Video Solutions
CoreLecture 13 - Ordered Pairs
CoreLecture 14 - Cartesian Product of Sets
CoreLecture 15 - Relations
HighLecture 16 - Counting Number of Relations
CoreLecture 17 - Relation on a Set
CoreLecture 18 - Understanding Relations Part 1
CoreLecture 19 - Understanding Relations Part 2
HighLecture 20 - Types of Binary Relations
HighLecture 21 - Reflexive Relation
HighLecture 22 - Symmetric Relation
HighLecture 23 - Antisymmetric Relation
HighLecture 24 - Antisymmetric Relation Definition 2
HighLecture 25 - Asymmetric Relation
HighExample 1 - Symmetric, Antisymmetric, Asymmetric
HighExample 2 - Symmetric, Antisymmetric, Asymmetric
HighLecture 26 - Transitive Relation
HighExample 1 - Transitive Relation
HighLecture 27 - Equivalence Relation Definition
HighLecture 28 - Partition of a Set
HighSummary Lecture - Partition of a Set
HighLecture 29 - Equivalence Relation Complete Analysis Part 1
HighPractice Set 2 - Video Solutions
HighLecture 30 - Equivalence Relation Complete Analysis Part 2
HighLecture 31 - Graph of Equivalence Relation
HighLecture 32 - Practice Equivalence Relation
HighSummary Lecture - Equivalence Relations
HighPractice Set 3 - Video Solutions
HighLecture 33 - Partial Order Relation
HighLecture 34 - Total Order Relation
HighLecture 35 - Hasse Diagram of POSET
HighLecture 36 - Special Elements of POSET
HighLecture 37 - Practice Questions on Hasse Diagrams
HighLecture 38 - Upper Bound, Lower Bound, LUB, GLB
HighLecture 39 - Practice Questions on GLB, LUB
HighLecture 40 - Hasse Diagram of a Total Order Relation
HighLecture 41 - Lattice
HighLecture 42 - Hasse Diagram to Partial Order Relation
HighLecture 43 - Hasse Diagram to Partial Order Relation Part 2
HighLecture 44 - Properties of Lattices
HighLecture 45 - Sublattice
HighLecture 46 - Questions on Minimal, Maximal Elements in POSET Part 1
HighLecture 47 - Questions on Minimal, Maximal Elements in POSET Part 2
HighPractice Set 4 - Video Solutions
HighLecture 48 - Questions - Maximal, Greatest Elements in a Lattice
HighLecture 49 - Properties of Every Lattice
HighLecture 50 - Practice Questions on Sublattice
HighLecture 51 - Types of Lattices
HighLecture 52 - Bounded Lattice
HighLecture 53 - Identity Property in Lattices, Domination Law
HighLecture 54 - Complemented Lattice
HighLecture 55 - Distributive Lattice
HighLecture 56 - Practice Questions on Types of Lattice
HighLecture 57 - Boolean Lattice
HighLecture 58 - Why Boolean Lattice is called a Boolean Algebra
HighLecture 59 - Complete Analysis of Total Order Relation
HighLecture 60 - Complete Analysis of Powerset Lattice
HighLecture 61 - Complete Analysis of Divisibility Relation - Part 1
HighLecture 62 - Complete Analysis of Divisibility Relation - Part 2
HighLecture 63 - Refinement of a Partition | GATE 2007, 1998
HighLecture 64 - Constructing Total Order from Partial Order - GATE 2024, 1997
HighLecture 65A - Inverse Relation, Complementary Relation
HighLecture 65B - Relations Closures - Reflexive Closure, Symmetric Closure
HighLecture 65C - Relations Closures - Transitive Closure
HighLecture 65D - Transitive Closure - Part 2
HighLecture 65E - Equivalence Closure
Module 6: Functions
CoreLecture 1 - Function Definition & Terminology
HighLecture 2 - Number of Functions
CoreLecture 3 - Representations of Function, Image of a Subset of Domain
HighLecture 4 - Types of Functions - Injective, Surjective, Bijective
HighLecture 5 - Practice Questions on Types of Functions
HighLecture 6 - Set Operations on Relations
HighLecture 7 - Composition Operation
HighLecture 8 - Inverse of a Function
HighWeekly Quiz 1 - Functions
HighFunctions - Summary, Practice & GATE PYQs
Module 7: Group Theory (Abstract Algebra)
Core(OPTIONAL) Lecture 1 - Abstract Algebra - Introduction & Motivation
Core(OPTIONAL) Lecture 2 - Abstract Algebra Origin & The Galois Story
CoreLecture 3 - Abstract Algebra GATE Syllabus
CoreLecture 4 - Binary Operation & The Closure Property
CoreLecture 5 - The Associative Property
CoreLecture 6 - The Identity Property
CoreLecture 7 - Practice Questions on Binary Operation
CoreLecture 8 - Important Properties of Identity Element
CoreLecture 9 - The Inverse Property
CoreLecture 10 - The Commutative Property
CoreLecture 11 - Classification of Binary Algebraic Structures
CoreLecture 12 - Practice Questions on Binary Operations
CoreSummary Lecture 1 - Introduction to Algebraic Structure
CoreSummary Lecture 2 - Binary Operation, Closure Property
CoreSummary Lecture 3 - Questions on Binary Operation
CoreSummary Lecture 4 - More Questions on Binary Operation
CoreSummary Lecture 5 - Associative, Commutative Property
CoreSummary Lecture 6 - Questions on Associative, Commutative Property
HighLecture 13 - Properties of Monoid
HighLecture 14 - Group Theory Practice Set-1 Question 25 Solution
HighLecture 15 - Practice Questions on Monoid, Group
HighLecture 16 - nth Roots of Unity is an Abelian Group under Multiplication
HighLecture 17 - Addition Modulo n Group
HighLecture 18 - Group Properties
HighLecture 19 - Associativity & Parentheses
HighLecture 20 - Cayley Table
HighLecture 21 - Group Properties Part 2
HighLecture 22 - Checking Associative Property in the Cayley Table
HighLecture 23A - Cayley Table of a Group
HighLecture 23B - Practice Question Cayley Table
HighLecture 24 - Monoid Vs Group
HighLecture 25A - Groups of Small Order
HighLecture 25B - Groups of Order 4
HighLecture 25C - Practice Question - Group of Small Order
HighLecture 26 - Power of an Element in a Group
HighLecture 27A - Subgroup
HighLecture 27B - Subgroup Generated by an Element
HighLecture 28 - Relatively Prime Integers (Coprime Numbers)
HighLecture 29 - Multiplication Modulo n Group - Unit Group Un
HighLecture 30 - Practice Question - Multiplication Modulo Group Un
HighLecture 31 - Practice Question on Subgroup Generated by an Element
HighLecture 32A - Order of an Element in a Group
HighLecture 32B - Summary Lecture - Order of an Element
HighLecture 33 - Cyclic Group
HighLecture 34 - Practice Question on Subgroup
HighLecture 35A - A lot of Practice Questions on Groups
HighLecture 35B - Some More Practice Questions on Groups
HighLecture 36 - Lagrange's Theorem
HighLecture 37 - Summary - Groups of Specific Orders
HighLecture 38 - Alternative Definitions of Abelian Group
HighLecture 39 - Intersection of Subgroups
HighLecture 40 - Alternative Definitions of Subgroup
HighGATE PYQs - Detailed Video Solutions - Group Theory
Module 8: Combinatorics & Recurrences
CoreLecture 1 - Introduction to Combinatorics
CoreLecture 2 - The Sum Rule
CoreLecture 3A - The Product Rule
CoreLecture 3B - Practice Questions
CoreLecture 4 - The Subtraction Rule
CoreLecture 5 - Practice Questions
CoreLecture 6 - Counting By Case
CoreLecture 7 - The Complement Rule
CoreLecture 8A - The Division Rule
CoreLecture 8B - The Division Rule
CoreLecture 9 - Factorial, nCr, nPr
HighLecture 10 - Permutation & Combination
HighLecture 11 - Combination
HighLecture 12 - Practice Questions & the Most Common Mistake
HighLecture 13 - Two Standard Templates & More Practice Questions
HighLecture 14A - Combinatorial Arguments
HighLecture 14B - Combinatorial Arguments
HighLecture 14C - Combinatorial Arguments
HighLecture 14D - Practice Combinatorial Arguments
HighLecture 15 - Binomial Theorem
HighLecture 16 - Bijective Proofs
HighLecture 17 - Permutation with Repetition
HighLecture 18A - Many Practice Questions
HighLecture 18B - Grid Walk Problems in Combinatorics
HighLecture 19A - Distributing Objects into Boxes - DODB
HighLecture 19B - Practice Questions on DODB Template
HighLecture 20A - IODB Template - Star Bar Problem
HighLecture 20B - Combination with Repetition - IODB Template 2
HighLecture 20C - Non-Negative Integer Solutions - IODB Template 3
HighLecture 20D - Multiset Problem - IODB Template 4
HighLecture 20E - Non-Decreasing integer Sequence - IODB Template 5
HighLecture 20F - Practice Questions - IODB
HighLecture 20G - Integer Composition - IODB Template 6
HighLecture 21 - DOIB Problem
HighLecture 22 - IOIB Problem
HighLecture 23 - Summary - Distributing Objects into Boxes
HighLecture 24A - Inclusion Exclusion Principle
HighLecture 24B - Practice Questions - Inclusion Exclusion
HighLecture 24C - Derangement - Inclusion Exclusion Principle Application
HighLecture 24D - Onto Functions
HighLecture 25A - Generating Function
HighLecture 25B - Generating Function Part 2
HighLecture 25C - Generating Function Part 3
HighLecture 25D - Practice Questions - Generating Function Part 4
HighLecture 25E - AGP Series & Generating Function Part 5
HighGATE CSE 2022 Question on Generating Function
HighLecture 25F - Extended Binomial Theorem - Generating Function - Part 6
HighGATE CSE 2016 Question on Generating Function
HighGATE CSE 2017 Question on Ordinary Generating Function
HighGATE CSE 2018 Question on Generating Function
HighGATE CSE 2005 Question on Generating Function
HighTIFR CSE 2010 Question on Generating Function
HighLecture 25G - Summary of Generating Function
HighLecture 26 - Recurrence Relations
HighPractice Set-1 Solutions - Berkeley Questions - Combinatorics
HighPractice Set-2 Solutions - Recurrence Relation Questions - Combinatorics
HighLecture 27A - Pigeonhole Principle
HighLecture 27B - The Generalized Pigeonhole Principle
HighLecture 27C - Practice - Pigeonhole Principle
HighPractice Set 3 Solutions - Derangement - Combinatorics
Module 9: Graph Theory
CoreLecture 1 - Why Study Graph Theory - The Motivation
CoreLecture 2A - Basic Terminology - Graph Theory
CoreLecture 2B - Basics - Degree, Adjacency
CoreLecture 2C - Practice Questions - Basics
CoreLecture 3A - Handshaking Theorem
CoreLecture 3B - Handshaking Theorem for Directed Graphs
HighLecture 4A - Cycle, Path, Walk in Simple Graphs
HighLecture 4B - Walk, Path - Revision & Practice
HighLecture 4C - Distance and Diameter
HighLecture 5A - Special Type of Graphs
HighLecture 5B - Special Type of Graphs Part 2
HighLecture 6 - GATE & TIFR Questions on Degree Concept
HighLecture 7 - Subgraph
HighGATE CSE 2001 - Number of Simple Graphs
HighLecture 8A - Graph Isomorphism Part 1 - Definition
HighLecture 8B - GATE 2012 Question - Graph Isomorphism
HighMy OLD Video for GATE 2012 Question
HighLecture 8C - Graph Isomorphism is an Equivalence Relation
HighLecture 8D - Graph Complement and Self Complementary Graph
HighLecture 8E - Practice - Graph Isomorphism
HighLecture 9A - Connected Components
HighLecture 9B - Complement of a Disconnected graph is Connected
HighLecture 9C - TIFR CSE 2018 Question
HighLecture 9D - A Simple Practice Question
HighLecture 10A - Bipartite Graphs
HighLecture 10B - Complete Bipartite Graph
HighLecture 10C - Practice Questions - Bipartite Graphs
HighLecture 11A - Trees - Part 1 - Cyclic Graphs Acyclic Graph
HighLecture 11B - Trees - Part 2 - Tree and Forest Definitions
HighLecture 11C - Trees - Part 3 - Many Definitions of Tree
HighLecture 11D - Tree Part 4 - Every Tree has at least two vertices of degree 1
HighLecture 11E - ALL Questions - Trees, Forest
HighLecture 12A - Rooted Trees
HighLecture 12B - Rooted Tree Part 2 - Binary Tree. Full Binary Tree
HighLecture 13A - Questions Related to Components
HighLecture 13B - Questions on Rooted Trees
HighLecture 14A - Clique, Independent Set - Part 1
HighLecture 14B - UGC NET CSE 2016 Clique Question
HighLecture 14C - Clique, Independent Set - Part 3
HighLecture 15A - Vertex Cover, Edge Cover - Part 1
HighLecture 15B - Vertex Cover, Edge Cover - Part 2 - Analysis
HighLecture 15C - Relation between Vertex Cover & Independent Set
HighLecture 16A - Matching Part 1 - Perfect Matching, Matching Number
HighLecture 16B - Matching Part 2 - Matching & Covering Analysis
HighLecture 17A - Graph Coloring Part 1 - Vertex Coloring
HighLecture 17B - Graph Coloring Part 2 - Greedy Algorithm for Vertex Coloring
HighLecture 17C - Graph Coloring Part 3 - All GATE TIFR Questions
HighLecture 17D - Graph Coloring Part 4 - Brooks Theorem for Vertex Coloring
HighLecture 17E - Graph Coloring Part 5 - Edge Coloring
HighLecture 18 - Graph Realization Problem - Havel Hakimi Theorem
HighLecture 19A - Cut Vertex, Cut Edge
HighLecture 19B - Connectivity Number, Vertex Cut, Edge Cut
HighLecture 20A - Strongly Connected Components - Part 1
HighLecture 20B - Weakly Connected Graph
HighLecture 20C - Strongly Connected Components - Part 3 - Associated DAG
HighLecture 21A - Euler Circuit & Graph
HighLecture 21B - Hamiltonian Cycle & Graphs
HighEuler & Hamiltonian Cycles - ALL Previous Exam Questions
HighLecture 22A - Planar Graph Introduction
HighLecture 22B - Planar Graphs - Faces & Degree of a face
HighLecture 22C - Planar Graph - Euler Formula
HighLecture 22D - Planar Graphs - Some Important Results & Four Color Theorem
HighLecture 23A - Adjacency Matrix, Adjacency List
HighLecture 23B - GATE 1987-9d Adjacency List
HighLecture 23C - GATE 1988-2xvi Adjacency Matrix
HighLecture 23D - TIFR CSE 2015 Adjacency Matrix
HighLecture 24A - Powers of Adjacency Matrix of a Graph
HighLecture 24B - Applications of Powers of Adjacency Matrix of a Graph
HighLecture 24C - Applications of Powers of Adjacency Matrix Part 2
LA
Linear Algebra
GATE Weightage: 5-7 marks0% done
Module 1: Basics of Linear Algebra
CoreLecture 1A - Why Study Linear Algebra
CoreLecture 1B - Linear Algebra for GATE & Interviews
HighLecture 1C - Linearly Independent and Linearly Dependent
CoreLecture 2A - Filling the Space Part 1
CoreLecture 2B - Filling the Space Part 2
CoreLecture 2C - Summary so far
CoreLecture 2D - Multiplying a Matrix & a Vector
CoreLecture 3A - Homework 1 Discussion
CoreLecture 3B - Why Solve System Of Linear Equations
HighLecture 3C - Writing as Ax=b, Geometric Interpretation and Possible Solutions
HighLecture 3D - Understanding Ax=b intuitively
High4A. Multiplying 2 Matrices | My Walmart Interview Question
High4B. GATE 2016 Question
High4C. GATE 2014 Question
High4D. Two conceptual questions
High4E. Linear Combination of Independent vectors is unique
High4F. GATE 2017 Question
Module 2: Matrices and Systems of Linear Equations
CoreLecture 5 - Matrix Multiplication
HighLecture 6 - Properties of Matrix Multiplication
CoreLecture 7 - Transpose of a Matrix
HighLecture 8 - Symmetric and Skew-Symmetric Matrix
HighLecture 9 - Inverse of a Matrix
HighLecture 10 - Elementary Row Operations
HighLecture 11 - Rank of a Matrix
Module 3: Vector Spaces
CoreLecture 12 - Vector Space
HighLecture 13 - Subspace
HighLecture 14 - Basis and Dimension
HighLecture 15 - Coordinates
HighLecture 16 - Row Space and Column Space
HighLecture 17 - Null Space
HighLecture 18 - Rank-Nullity Theorem
Module 4: Linear Transformations
HighLecture 19 - Linear Transformation
HighLecture 20 - Matrix Representation of Linear Transformation
HighLecture 21 - Kernel and Range
HighLecture 22 - Rank and Nullity of Linear Transformation
HighLecture 23 - Composition of Linear Transformations
HighLecture 24 - Invertible Linear Transformation
Module 5: Eigenvalues and Eigenvectors
HighLecture 25 - Eigenvalues and Eigenvectors
HighLecture 26 - Characteristic Polynomial
HighLecture 27 - Finding Eigenvalues and Eigenvectors
HighLecture 28 - Properties of Eigenvalues
HighLecture 29 - Algebraic and Geometric Multiplicity
HighLecture 30 - Cayley-Hamilton Theorem
HighLecture 31 - Diagonalization
HighLecture 32 - Conditions for Diagonalizability
Module 6: Orthogonality & Advanced Matrix Operations
HighLecture 12. Projection and Gram–Schmidt Process
HighLecture 13. Singular Value Decomposition (SVD)
High14A. SVD as Summation of Rank-1 Matrices
HighLecture 14B. Geometry of SVD
HighLecture 15: Positive Definite Matrices
HighLecture 16: Introduction to Partition Matrix or Block Matrix
HighLecture 17: Operations using Partition Matrix or Block Matrix
HighLecture 18: Projection Matrix
HighLecture 19: Orthogonal Decomposition and Projection Matrices for Orthonormal Bases
HighLecture 20: More on Projection Matrices and 25 Questions on Projection Matrices
CALC
Calculus
GATE Weightage: 3-5 marks0% done
Calculus Core Lectures
CoreLecture 1: Finding Limit of a function
CoreLecture 2: Methods to Evaluate the Limit of a function
HighLecture 3: Limits L'Hôpital's rule and Other Indeterminate forms of powers
HighLecture 4: Continuity and Introduction to Differentiability
HighLecture 5: Maxima and Minima
HighLecture 6: Integration
Calculus – Concept Videos & Theorems
CoreAbout this series
HighLimits in Calculus | Calculus | Engineering Mathematics | GATE | GO Classes | GATE Overflow
HighContinuity in Calculus | Calculus | Engineering Mathematics | GATE | GO Classes | GATE Overflow
HighDifferentiability in Calculus | Calculus | Engineering Mathematics | GATE | GO Classes
HighMaxima Minima in Calculus | Calculus | Engineering Mathematics | GATE | GO Classes
HighIntermediate Value Theorem | Calculus | Engineering Mathematics | GATE Computer Science
HighRolle's Theorem and Examples | Calculus | Engineering Mathematics | GATE Computer Science
HighIntegration with ALL GATE PYQs | Tic Tac Toe method | Engineering Mathematics | GO Classes
Calculus – Live Problem Solving Sessions
HighLIVE Session 1: Limit and Continuity
HighLIVE Session 2: Differentiability
HighLIVE Session 3: Double Derivative and Mean Value Theorems
HighLIVE Session 4: Integration
Calculus – Practice, Quizzes & Solutions
HighHomework Limit Calculus GATE CSE PYQs
HighCalculus Quiz - Weekly Quiz 14
HighWeekly Quiz 14 - Calculus
CoreAnnotated Notes - Calculus Quiz Discussion
PROB
Probability and Statistics
GATE Weightage: 4-6 marks0% done
Probability Foundations & Random Variables
CoreLecture 1 - Introduction to Probability
HighLecture 2 - Conditional Probability, Tree Method, Bayes Theorem
CoreLecture 3 - Independent Events
HighLecture 3b - Conditional Independence
CoreLecture 4 - Random Variables
HighLecture 5 - Types of Random Variables and Expectation of RVs
HighLecture 6 - Expectation and Variance
HighLecture 7 - Discrete Probability Distribution
HighLecture 8 - Continuous RV
HighLecture 9 - Continuous RV and Mean, Mode, Median
Probability – Live Problem Solving Sessions
High[LIVE] Lecture 9a - Expectation Questions
High[LIVE] Lecture 9b - Variance Main Formula and Questions
High[LIVE] Lecture 9c - Variance Main Formula and Questions
High[LIVE] Lecture 9d - Variance Questions
Discrete Probability Distributions
High[LIVE] Lecture 10a - Discrete Random Variable (Bernoulli and Binomial RVs)
High[LIVE] Lecture 10b - MIT Question on Binomial RV
Core[LIVE] Lecture 10c - Optional and Skip - Question on Plot of PMF
High[LIVE] Lecture 10d - Poisson RV
High10d. Discrete Uniform RV Introduction
Continuous Probability Distributions
HighLecture 11a - Introduction to Continuous Distributions | Intuition about PDF
HighLecture 11b - Continuous Uniform Distribution
HighLecture 11c - Normal Distribution
HighLecture 11d - Normal Distribution - 2
HighLecture 11E - Exponential Distribution
Statistics
HighLecture 12 - Statistics - Mean Mode Median
TOC
Theory of Computation
GATE Weightage: 7-9 marks0% done
Module 1: Basics of Formal Languages
CoreLecture 1A - Introduction to Theory of Computation
CoreLecture 1B - Alphabet, String, Language
CoreLecture 1C - Operations on Strings
CoreLecture 1D - Operations on Languages
CoreLecture 2A - Basic Concepts - Alphabet, String
CoreLecture 2B - Basic Concepts - Concatenation of Strings
HighLecture 2C - Basic Concepts - Prefix, Suffix, Substring, Subsequence
CoreLecture 3A - Language
HighLecture 3B - Set Operations on Languages
HighLecture 3C - Properties of Language Operations
Module 2: Finite Automata
CoreLecture 1 - Introduction to Finite Automata
CoreLecture 2 - Deterministic Finite Automata
CoreLecture 3 - DFA Formal Definition
CoreLecture 4 - Language Accepted by DFA
HighLecture 5 - Designing DFA
HighLecture 6 - DFA Practice Questions
HighLecture 7 - Nondeterministic Finite Automata
CoreLecture 8 - NFA Formal Definition
HighLecture 9 - Language Accepted by NFA
HighLecture 10 - NFA to DFA Conversion
HighLecture 11 - Subset Construction
HighLecture 12 - ε-NFA
HighLecture 13 - ε-NFA to DFA
HighLecture 14 - DFA, NFA and ε-NFA Equivalence
HighLecture 15 - Practice Questions on NFA and DFA
Module 3: Regular Languages & Regular Expressions
CoreLecture 1 - Regular Expressions Introduction
CoreLecture 2 - Regular Expression Operators
CoreLecture 3 - Regular Expression Precedence
HighLecture 4 - Regular Expression to Finite Automata
HighLecture 5 - Finite Automata to Regular Expression
HighLecture 6 - Arden's Theorem
CoreLecture 7 - Regular Languages
HighLecture 8 - Closure Properties of Regular Languages
HighLecture 9 - Pumping Lemma
HighLecture 10 - Pumping Lemma Practice
HighLecture 11 - Proving a Language is Not Regular
HighLecture 12 - Myhill-Nerode Theorem
HighLecture 13 - DFA Minimization
HighLecture 14 - State Equivalence
HighLecture 15 - Minimization using Table Filling
HighLecture 16 - Practice Questions on Minimization
Module 4: Context Free Grammars
CoreLecture 1 - Introduction to Context Free Grammar
CoreLecture 2 - CFG Formal Definition
CoreLecture 3 - Derivation
CoreLecture 4 - Parse Tree
HighLecture 5 - Leftmost and Rightmost Derivation
HighLecture 6 - Ambiguous Grammar
HighLecture 7 - Ambiguous Grammar Practice
HighLecture 8 - Simplification of CFG
HighLecture 9 - Removing Null Productions
HighLecture 10 - Removing Unit Productions
HighLecture 11 - Removing Useless Productions
HighLecture 12 - Chomsky Normal Form
HighLecture 13 - Greibach Normal Form
HighLecture 14 - CFG and Regular Grammar
HighLecture 15 - Practice Questions on CFG
Module 5: Push Down Automata
CoreLecture 1 - Introduction to Push Down Automata
CoreLecture 2 - PDA Formal Definition
CoreLecture 3 - PDA Instantaneous Description
HighLecture 4 - Language Accepted by PDA
HighLecture 5 - Designing PDA
HighLecture 6 - PDA Practice Questions
HighLecture 7 - CFG to PDA
HighLecture 8 - PDA to CFG
HighLecture 9 - CFG and PDA Equivalence
HighLecture 10 - Deterministic PDA
HighLecture 11 - DCFL
HighLecture 12 - PDA Practice Questions
Module 6: Closure Properties & Chomsky Hierarchy
HighLecture 1 - Closure Properties of Regular Languages
HighLecture 2 - Closure Properties of Context Free Languages
HighLecture 3 - Closure Properties of DCFL
HighLecture 4 - Closure Properties Practice Questions
HighLecture 5 - Chomsky Hierarchy
CoreLecture 6 - Types of Grammars
CoreLecture 7 - Type 0 Grammar
CoreLecture 8 - Type 1 Grammar
CoreLecture 9 - Type 2 Grammar
CoreLecture 10 - Type 3 Grammar
Module 7: Turing Machines
CoreLecture 1 - Introduction to Turing Machine
CoreLecture 2 - Formal Definition of Turing Machine
CoreLecture 3 - Instantaneous Description of Turing Machine
HighLecture 4 - Language Accepted by Turing Machine
HighLecture 5 - Designing Turing Machines
HighLecture 6 - Turing Machine Practice Questions
HighLecture 7 - Variants of Turing Machine
HighLecture 8 - Multi-Tape Turing Machine
HighLecture 9 - Nondeterministic Turing Machine
HighLecture 10 - Universal Turing Machine
HighLecture 11 - Turing Machine Encoding
HighLecture 12 - Dovetailing
Module 8: Decidability & Undecidability
HighLecture 1 - Decidable Languages
HighLecture 2 - Recognizable Languages
HighLecture 3 - Decidable vs Recognizable Languages
HighLecture 4 - Closure Properties of Decidable Languages
HighLecture 5 - Closure Properties of Recognizable Languages
HighLecture 6 - Undecidability
HighLecture 7 - Reduction
HighLecture 8 - Mapping Reduction
HighLecture 9 - Turing Reduction
HighLecture 10 - Halting Problem
HighLecture 11 - Acceptance Problem
HighLecture 12 - Rice's Theorem
HighLecture 13 - Undecidability Practice Questions
Module 9: Countability
CoreLecture 1 - Finite and Infinite Sets
CoreLecture 2 - Countable Sets
CoreLecture 3 - Countably Infinite Sets
CoreLecture 4 - Uncountable Sets
CoreLecture 5 - Cardinality
HighLecture 6 - Cantor Diagonalization
HighLecture 7 - Cantor's Theorem
HighLecture 8 - Countability Practice Questions
Theory of Computation: PYQs & Practice
HighGATE PYQs - Regular Languages
HighGATE PYQs - Finite Automata
HighGATE PYQs - Regular Expressions
HighGATE PYQs - Pumping Lemma
HighGATE PYQs - CFG
HighGATE PYQs - PDA
HighGATE PYQs - Turing Machines
HighGATE PYQs - Decidability
HighGATE PYQs - Undecidability
HighGATE PYQs - Countability
HighPractice Questions - Theory of Computation
ALGO
Algorithms
GATE Weightage: 8-10 marks0% done
Module 1: Why Study Algorithms
Core1a. Why Study Algorithms
Core1b. An algorithm that changed history And Child's algorithm
Module 2: Asymptotic Analysis and Loop Complexities
CoreDS Videos: 5a. Introduction to Asymptotic Analysis
CoreDS Videos: 5b. Big oh and Big omega Asymptotic Notations
CoreDS Videos: 5c. Theta Asymptotic notation
CoreDS Videos: 5d. What is Asymptotic comparison | how LOG works | rice grain story
HighDS Videos: 5e. Comparing Different Functions Asymptotically
HighDS Videos: 5f. Little Oh Little Omega | Properties of asymptotic notation | Stirling approximation
CoreDS Videos: 6a. Formal set notation of Asymptote symbols
HighDS Videos: 6b. Asymptotic Notations GATE PYQs 1994, 96, 2000,1,3,4,8,11,17
HighDS Videos: 6c. Analysing the loops time complexity
High6d. Time Complexity of loops -2
CoreDS Videos: 7a. Brief about Best Case, Worst Case
CoreDS Videos: 7b. More about Best Case, Worst Case
HighDS Videos: 7c. Questions on Algorithmic notations
Module 3: Time Complexity of Recursive Programs
Core2a. Introduction to recurrence relations
High2b. Solving recurrence using Iteration Method
High2c. More Examples of Iteration Method
High3a. Solving recurrence using Tree Method
High3b. More Examples Tree Method
High3c. Even More Examples Tree Method
High3d. More Examples Tree Method
High4a. Masters Theorem Idea and examples
High4b. Examples On Master Theorem
High4c. Proof of Master Theorem
High5a. Generalised Master Theorem
Core5b. [Optional but watch] Extended Master Theorem
High5c. Various Examples of Master Theorem
High5d. Problems that master theorem can not solve
High6a. Introduction to change to variable method
High6b. Examples on Change of Variable
High6c. Few more examples on change of variable method
High6d. Some More variation
Module 4: Divide and Conquer Algorithms (Part 1)
Core7a. Introduction to Divide and Conquer Algorithm
Core7b. Maximum of an array using D and C
Core7c. Example 2- Sum of an array
Core7d. Example 3- Search in an array
Core7e. Example 4 - Dumb Sort
High8a. Introduction to Merge Sort algorithm
High8b. Heart of Merge Sort- Merge Procedure
High8c. Merge Procedure -2
High8d. Merge Sort Recursive tree with example
High8e. Merge Sort Analysis (Contd..)
High9a. Merge Sort questions -1
High9b. Merge Sort questions -2
High9c. More Questions on Merge sort
High10a. Iterative (or Bottom-up) Merge sort
High10b. GATE 1999 question on Bottom up Merge Sort
High10c. Time Complexity of Iterative Merge sort
Core10d. [Optional and Skip] Implementation of Iterative Merge sort
High11a. Merging k sorted arrays Part 1
High11b. Merging k sorted arrays Part 2
High11d. Definition of Stable and In-place sorting
Module 5: Maximum and Minimum of Numbers
High12a. Maximum and Second Max of an array
High12b. Second maximum using Tournament Method
Core12c. [Optional] How to keep track for candidates of Second maximum
High12d. Maximum and Minimum of an array
High13a. Tournament Method and D&C for Max Min in an array
High13b. Cormen questions
High13c. GATE 2007, 2014, 2021 Questions
HighTIFR Question
High14a. Algorithm Analysis
High14b. Questions on Algorithmic notations
Module 6: Divide and Conquer Algorithms (Part 2)
High15a. Counting inversion with Netflix and Amazon Example
High15b. Numerical questions on Counting Inversion
High15c. Counting Inversions using BruteForce method
High16a. Heart of counting Inversion
High16b. Working Example of Counting Inversion using D and C
High16c. Counting Inversion question
High17a. Closest pair in 2 D
High17b. Closest pair-2
Core17c. Exponent of a number
High17d. Matrix Multiplication
High18a. Introduction to Quick Sort
High18b. Working Example of Quick Sort
High18c. Quick sort Analysis and Randomised quick sort
High18d. GATE 2014 question
High18e. Questions on quick sort
Core18f. [Optional and Skip] Average case analysis of quick sort
High19a. The Select algorithm
High19b. Binary Search
Module 7: Sorting Algorithms
Core20a. Bubble Sort
Core20b. Insertion Sort
Core20c. Bubble Sort and Insertion Sort
High20d. Selection Sort and Heap Sort
High20e. Decision Tree
Core20f. [Optional] Counting Sort and Radix Sort
Module 8: BFS and DFS
Core21a. Introduction to Graphs | Adjacency List and Matrix
Core21b. intuition for graph search methods
Core21c. Introduction to DFS
High21d. DFS Implementation (Recursive and explicit stack) and Time complexity
High22a. DFS Parentheses Theorem | GATE 2006
High22b. DFS Edge Classifications
High22c. Questions on DFS Edge Classification
Core22d. [Optional] Back-edge and cycle question
High23a. DFS Application 1- Cycles in graph
High23b. GATE 2007 question on DAG finish time
High23c. DFS Application 2 Topological sort | GATE 2014
High23d. DFS Application 3 Articulation Point | GATE 2021
Core24a. Introduction to BFS
High24b. BFS few Observations(Properties) and BFS Edge Classification
High25. BFS Applications
Module 9: Shortest Paths Algorithms
High26a. Introduction to Greedy Algorithms | Introduction and Intuitive proof of Dijkstra
High26b. Dijkstra code and Working Example 1
High26c. Dijkstra Working Example 2
High26d. Dijkstra Working Example 3
High27a. Dijkstra on negative weights
Core27b. Video From DS Course: Priority Queues
High27c. Dijkstra Time Complexity
High27d. Dijkstra Time Complexity on more variant data structures | Dijkstra Demo
High28a. DAG Shortest Path | Shortest Path in Directed Acyclic Graph
High28b. Intuition Behind Bellman Ford Algorithm
High28c. Examples of Bellman Ford | Time complexity
High28d. Bellman ford proof and Early termination
Module 10: Minimum Spanning Tree Algorithms
Core29a. Why Minimum Spanning Trees
High29b. Cut and Cycle properties of MST
High29c. Kruskal Algorithm
High30a. Questions on MSTs
High30b. Prims Algorithm
High30c. Prims and Dijkstra Similarity
High30d. Single Example for Prims and Dijkstra both | MST vs Shortest path on Same Graph
High31a. Interesting Questions on MSTs | GATE 2000 | MIT Questions
High31b. Two Most Popular Template Questions in MSTs | TIFR 2014
High31c. Four Cases in MSTs | GATE 2020
Module 11: More Greedy Algorithms
High32a. Huffman Encoding Concept and Questions | Interesting Story
High32b. Question on Huffman Encoding
High32c. Huffman Encoding Time Complexity
High32d. Nice Questions on Huffman Encoding
High33a. Berkeley and MIT Questions on Huffman Encoding
Core33b. [Optional] Huffman Encoding Question Based on Tree Variance
High33c. Optimal Merge Pattern
High34a. Interval Scheduling Problem (Activity Selection Problem) Algorithm Ideas
High34b. Interval Scheduling Problem Algorithm
Core34c. [Optional] Proving Optimality using Exchange Techniques
High34d. Other Variants of Interview Scheduling
High34e. Job Scheduling With Deadlines
High35a. Fractional Knapsack
Core35b. [Optional] Fractional Knapsack in O(n)
Module 12: Dynamic Programming
Core36a. Introduction to DP | Two Approaches | Why we call it "Dynamic"
High36b. Example 1- Climbing Stairs
High36c. Example 2 MCQ on DP
High36d. Example 3- Climbing Stairs Cost
High37a. Example 4- One Nice question on Total Probability and DP
High37b. Order of Table Filling | MIT Questions | Top Down vs Bottom Up Difference
High37c. DP vs Divide and Conquer | Elements in DP
High38a. Longest Common Subsequence | BruteForce Method
High38b. Longest Common Subsequence using Dynamic Programming
High38c. Total Calls vs Unique Calls in LCS
High38d. GATE 2009 Easy Question
High39a. Running Example on LCS
High39b. GATE 2014 Question on LCS
High39c. LCS Applications
Core39d. [Optional] Another way of writting LCS Recursion
High40a. Introduction to Matrix Chain Multiplication
High40b. Number of Ways to Multiply n Matrices
High40c. Recursive Formulation of Matrix Chain Multiplication and GATE 2016 Question
High40d. Example on Matrix Chain Multiplication
High40e. Time Complexity of Matrix chain Multiplication
High41a. Greedy Strategy on 0-1 Knapsack Problem
High41b. Recursive Formulation of 0-1 Knapsack and Example
High41c. One More Running Example on 0-1 Knapsack
High41d. Total Calls in Knapsack, Unique Calls in Knapsack, and Time Complexity
High41e. Solving 0-1 Knapsack with Bottom Up Approach
Module 13: More Dynamic Programming Algorithms
High42a. Subset Sum Problem
High42b. Coin Change Problem
High42c. DP Vs Greedy vs Divide and Conquer
High42d. Floyd Warshall Algorithm
High42e. Travelling Salesman
Algorithms: Revision & Practice Sessions
HighAsymptotic Notations in Algorithms with ALL GATE PYQs | Revision and Practice | O(), o(), Ω(), ω()
HighSolving Recurrence Relations and Loop Time Complexities with ALL GATE PYQs | Revision and Practice
HighDFS and its Applications and ALL GATE PYQs | Revision and Practice Session | Algorithms | Graph
HighBFS and Dijkstra and GATE PYQs | Revision and Practice Session | Algorithms | Graph
HighPrims and Kruskal's and GATE PYQs | Revision and Practice Session | Algorithms | Graph
HighBellman-Ford Proof | Most Intuitive Proof WITHOUT Induction | GATE CSE and DA | Sachin Mittal
Algorithms: Live Problem Solving
HighSession 1: PYQs on DFS BFS and Sorting
DS
Data Structures
GATE Weightage: 6-8 marks0% done
Module 1: Introduction to Data Structures
Core1a. Introduction to Data Structures
Core1b. Why Data Structures
Core1c. Abstract Data Types
Module 2: Arrays
Core2a. Arrays Introduction
Core2b. Array Operations
High2c. Array Address Calculation
High2d. 2D Arrays
High2e. Multidimensional Arrays
Module 3: Linked List
Core3a. Introduction to Linked List
Core3b. Linked List Representation
High3c. Insertion in Linked List
High3d. Deletion in Linked List
High3e. Searching in Linked List
High3f. Reversing a Linked List
High3g. Doubly Linked List
High3h. Circular Linked List
High3i. Linked List Practice Questions
Module 4: Stack
Core4a. Introduction to Stack
Core4b. Stack Implementation using Array
Core4c. Stack Implementation using Linked List
High4d. Applications of Stack
High4e. Infix, Prefix and Postfix Expressions
High4f. Infix to Postfix Conversion
High4g. Evaluation of Postfix Expression
High4h. Stack Practice Questions
Module 5: Queue
Core5a. Introduction to Queue
Core5b. Queue Implementation using Array
High5c. Circular Queue
High5d. Queue Implementation using Linked List
High5e. Deque
High5f. Priority Queue
High5g. Queue Practice Questions
Module 6: Asymptotic Analysis
Core5a. Introduction to Asymptotic Analysis
Core5b. Big oh and Big omega Asymptotic Notations
Core5c. Theta Asymptotic notation
Core5d. What is Asymptotic comparison | how LOG works | rice grain story
High5e. Comparing Different Functions Asymptotically
High5f. Little Oh Little Omega | Properties of asymptotic notation | Stirling approximation
Core6a. Formal set notation of Asymptote symbols
High6b. Asymptotic Notations GATE PYQs 1994, 96, 2000,1,3,4,8,11,17
High6c. Analysing the loops time complexity
High6d. Time Complexity of loops -2
Core7a. Brief about Best Case, Worst Case
Core7b. More about Best Case, Worst Case
High7c. Questions on Algorithmic notations
Module 7: Trees
Core8a. Introduction to Trees
Core8b. Tree Terminology
Core8c. Binary Tree
High8d. Binary Tree Properties
Core8e. Binary Tree Representation
High9a. Binary Tree Traversals
High9b. Preorder Traversal
High9c. Inorder Traversal
High9d. Postorder Traversal
High9e. Level Order Traversal
High10a. Recursive Tree Traversals
High10b. Iterative Tree Traversals
High10c. Questions on Tree Traversals
Module 8: Binary Search Tree
Core11a. Introduction to Binary Search Tree
High11b. BST Search
High11c. BST Insertion
High11d. BST Deletion
High11e. BST Minimum and Maximum
High11f. BST Successor and Predecessor
High11g. BST Practice Questions
Module 9: AVL Tree
Core12a. Introduction to AVL Trees
High12b. Balance Factor
High12c. AVL Rotations
High12d. LL Rotation
High12e. RR Rotation
High12f. LR Rotation
High12g. RL Rotation
High12h. AVL Insertion
High12i. AVL Deletion
High12j. AVL Practice Questions
Module 10: Heap
Core13a. Introduction to Heap
Core13b. Min Heap and Max Heap
Core13c. Heap Representation
High13d. Insertion in Heap
High13e. Deletion from Heap
High13f. Heapify
High13g. Build Heap
High13h. Heap Sort
High13i. Priority Queue using Heap
High13j. Heap Practice Questions
Module 11: Hashing
Core14a. Introduction to Hashing
Core14b. Hash Functions
High14c. Collision in Hashing
High14d. Chaining
High14e. Open Addressing
High14f. Linear Probing
High14g. Quadratic Probing
High14h. Double Hashing
High14i. Hashing Practice Questions
Module 12: Graphs
Core15a. Introduction to Graphs
Core15b. Graph Terminology
Core15c. Adjacency Matrix
Core15d. Adjacency List
High15e. Graph Representation
Core15f. Directed and Undirected Graphs
High15g. Weighted Graphs
High15h. Graph Practice Questions
Module 13: Graph Traversal
Core16a. Introduction to Graph Search
High16b. Breadth First Search
High16c. BFS Implementation
High16d. BFS Applications
High16e. Depth First Search
High16f. DFS Implementation
High16g. DFS Applications
High16h. BFS and DFS Practice Questions
Module 14: Advanced Data Structures
High17a. Disjoint Set Data Structure
High17b. Union-Find
High17c. Path Compression
High17d. Union by Rank
High17e. Disjoint Set Practice Questions
Data Structures: Practice / PYQ Sessions
HighData Structures GATE PYQs
HighData Structures Practice Questions
HighData Structures Revision
HighData Structures – Important GATE Questions
C
C Programming
GATE Weightage: 5-7 marks0% done
Module 1: Introduction to C
CoreIntroduction to C Programming
CoreStructure of a C Program
CoreCompilation and Execution of C Program
CoreVariables and Constants
CoreData Types
CoreKeywords and Identifiers
CoreInput and Output
Module 2: Operators and Expressions
CoreArithmetic Operators
CoreRelational Operators
CoreLogical Operators
CoreAssignment Operators
HighIncrement and Decrement Operators
HighBitwise Operators
CoreConditional Operator
HighOperator Precedence and Associativity
HighType Conversion and Type Casting
Module 3: Control Flow
CoreConditional Statements
Coreif Statement
Coreif-else Statement
HighNested if-else
Highswitch Statement
CoreLoops Introduction
Corewhile Loop
Coredo-while Loop
Highfor Loop
Highbreak and continue
Coregoto Statement
Module 4: Functions
CoreIntroduction to Functions
CoreFunction Declaration and Definition
CoreFunction Arguments and Return Values
CoreCall by Value
HighRecursion
HighRecursive Functions
HighScope and Lifetime of Variables
HighStorage Classes
Module 5: Arrays
CoreIntroduction to Arrays
CoreOne Dimensional Arrays
CoreArray Initialization
HighArray as Function Argument
HighTwo Dimensional Arrays
HighMultidimensional Arrays
HighArray of Characters
HighArray Practice Questions
Module 6: Pointers
CoreIntroduction to Pointers
CoreAddress Operator and Dereference Operator
CorePointer Variables
HighPointer Arithmetic
HighPointers and Arrays
HighPointers and Functions
HighPointer to Pointer
HighArray of Pointers
HighFunction Pointers
CoreNULL Pointer
HighDangling Pointer
CoreVoid Pointer
HighPointer Practice Questions
Module 7: Strings
CoreIntroduction to Strings
CoreString Representation
CoreString Input and Output
HighString Library Functions
Highstrlen()
Highstrcpy()
Highstrcat()
Highstrcmp()
HighString Practice Questions
Module 8: Structures and Unions
CoreIntroduction to Structures
CoreStructure Declaration and Initialization
HighArray of Structures
HighPointer to Structure
HighNested Structures
HighStructure and Functions
HighUnion
HighStructure vs Union
CoreEnumeration
Module 9: Dynamic Memory Allocation
CoreDynamic Memory Allocation
Highmalloc()
Highcalloc()
Highrealloc()
Highfree()
HighDynamic Arrays
HighDynamic Memory Allocation Practice
Module 10: File Handling
CoreIntroduction to File Handling
CoreFile Opening and Closing
HighReading from Files
HighWriting to Files
CoreFile Modes
HighRandom File Access
Module 11: Preprocessor
CoreC Preprocessor
Core#include
Core#define
HighMacros
HighConditional Compilation
CoreHeader Files
Module 12: Advanced Pointer Concepts
HighPointers and Multidimensional Arrays
HighPointer to Array
HighArray of Pointers
HighFunction Pointer
HighPointer to Function
HighComplex Pointer Expressions
HighPointer Practice Questions
C Programming: GATE / Practice
HighC Programming GATE PYQs
HighC Programming Practice Questions
HighC Programming Revision
HighC Programming Important Questions
OS
Operating Systems
GATE Weightage: 8-10 marks0% done
Module 1: Introduction to Operating Systems
CoreLecture 1: Introduction to Operating Systems | What is OS and Why we need it ?
CoreLecture 2a: How Operating System create a new process | Process Control Block
HighLecture 2b: Forking the Identical Copies | GATE 2005 very nice question | Bit about logical address
HighLecture 3: Fork Questions | Process Graph | Fork Tree
HighLecture 4 exec | Creating a Process | System Calls
HighLecture 5 System Call Execution | Threads
HighLecture 6: User Level Threads and Kernel Level Threads | Threads
HighLecture 7: Thread Mapping models, and Context Switching
CoreMust Watch Marathon: Summary So Far
Module 2: Processes and CPU Scheduling
CoreLecture 8 : Process State Diagram and Schedulers
HighLecture 9 : Scheduling Algorithms: FCFS
HighLecture 10 : Scheduling Algorithms: Shortest Job First (SJF)
HighLecture 11 : Scheduling Algorithms: Round Robin
HighLecture 12 : Scheduling Algorithms: SRTF
HighLecture 13 : Scheduling Algorithms: Priority Scheduling
Module 3: Interprocess Communication
HighLecture 14 : InterProcess Communication (IPC)
Module 4: Process Synchronization
CoreLecture 15: Introduction to Synchronisation
CoreLecture 16: Critical Section Solution Requirements
HighLecture 17: Questions on Critical Section Solution Requirements
HighLecture 18: Peterson's solution and Hardware Solutions
HighLecture 19: Atomic Hardware Instructions and Semaphores
CoreRevision Session
HighLecture 20: Semaphores PYQs
HighLecture 21 Classic Synchronisation Problems: Producer Consumer, Reader Writer
HighLecture 22 Classic Synchronisation Problems: Reader Writer, Dining Philosophers
Module 5: Memory Management
CoreA Journey of the Program | The Big Picture | Compiler, Linker, Assembler, and Loader.
CoreLecture 23 Memory Management 1: Base Bound Registers, Segmentation
Core[Optional] Lecture 24 Questions on Base Bound Registers, Segmentation
CoreLecture 25: Introduction to Paging
HighLecture 26:Single level Paging questions
HighLecture 27: Multi Level Paging
HighLecture 28: Multi Level Paging -2
HighLecture 29: Multi Level Paging -3 (Reducing Page Table Size)
HighMultilevel Paging one Shot
HighLecture 30: Memory Management Summary So Far, and Hashed, Inverted Page Tables
HighLecture 31: Segmentation with Paging
HighLecture 32: Demand Paging and Page replacement Algorithms
HighLecture 33: Remaining Topics in Memory Management: Translation Lookaside Buffer, Dynamic Allocation Strategies
HighGATE 2020 TLB Page Fault Question
Module 6: Deadlock
CoreLecture 34: Deadlock in Operating Systems
HighLecture 35: Deadlock Avoidance (Banker's Algorithm), Detection & Recovery
Module 7: File Systems
CoreFile System Implementation
HighPractice questions and PYQs in File System Implementation
HighFile System Implementation One shot
Module 8: OS PYQs
HighYoutube Lectures on PYQs
DBMS
Database Management Systems
GATE Weightage: 7-9 marks0% done
Module 1: The Relational Model & Normalization
CoreAbout Lecture 1
CoreLecture 1 - Introduction to DBMS, Data Models, Design Process
CoreLecture 2A - The Relational Model - Concepts & Terminology
CoreLecture 2B - The Relational Model - Why Table is called Relation?
CoreLecture 2C - The Relational Model - Null Values
HighGATE 2023 Question
HighLecture 2D - The Relational Model - Keys - Candidate Key, Primary Key, Super Key
HighLecture 2E - Practice Questions on Keys
Core(OPTIONAL) Lecture 3 - SQL - DDL & DML
CoreLecture 4A - Integrity Constraints in Relational Model
HighLecture 4B - Referential Integrity Constraints - Foreign Key
HighLecture 4C - Actions Taken by DBMS to Enforce Referential Integrity Constraints
CoreLecture 5A - Functional Dependency
HighLecture 5B - Functional Dependency Laws, Closure of Attribute Set
HighLecture 5C - Practice - Finding Candidate Keys
HighLecture 5D - Functional Dependency - Inference & Equivalence
HighLecture 5E - Minimal Cover of Functional Dependencies
HighWeekly Quiz 1 - Relational Model - ALL NIELIT Exam PYQs
HighWeekly Quiz 2 - Functional Dependency
HighLecture 6A - Normal Forms - Partial Functional Dependency, Transitive FD
HighLecture 6B - Normal Forms - 1NF, 2NF
HighLecture 6C - Normal Forms - 3NF Third Normal Form
HighLecture 6D - Normal Forms - Practice Questions 3NF
HighLecture 6E - Normal Forms - BCNF
HighGATE IT 2005 - Normalization Question
HighGATE CSE 1987 - Functional Dependency Question
HighGATE CSE 2020 Question - 3NF But Not BCNF
HighGATE CSE 2007, 1990 - Normal Forms Questions
HighGATE CSE 2012 - 3NF, BCNF Question
HighLecture 7A - Normalization & Decomposition - Lossless, Lossy
HighLecture 7B - Practice Questions - Decomposition - Lossless, Lossy
HighLecture 7C - Decomposition - Dependency Preservation
HighLecture 7D - Non-Binary Decomposition & Chase Test
HighLecture 8A - 2NF Decomposition
HighLecture 8B - Understanding Redundancies - Due to FDs & MVDs
HighLecture 8C - 3NF, BCNF Decomposition
HighLecture 8D - GATE PYQs on 3NF, BCNF Decomposition
CoreAbout Lecture 9
Core(OPTIONAL) Lecture 9 - Physical, Logical Data Independence
HighGATE PYQs & Standard Practice Questions
HighWeekly Quizzes
Module 2: Queries – Relational Algebra
CoreLecture 1 - Relational Algebra - Selection, Projection
CoreLecture 2 - Relational Algebra - Set Operations
HighLecture 3 - Relational Algebra - Inner Join Operations
HighLecture 4 - Relational Algebra - Division Operation
HighLecture 5 - Division Operation, Outer Join in Relational Algebra
HighLecture 6 - Practice - Relational Algebra Operators
HighLecture 7 - Writing & Understanding Relational Algebra Queries
HighLecture 7 - Group By, Having, Order By Clauses
HighLecture 8 - Nested Queries
HighLecture 9 - Correlated Nested Queries in SQL
HighSQL - Summary & GATE PYQs - Complete Analysis
HighWeekly Quizzes - SQL
Module 3: Structured Query Language (SQL)
HighSQL - Summary & GATE PYQs - Complete Analysis
HighWeekly Quizzes - SQL
Module 4: Database Design / Query Material
HighGATE PYQs & Standard Practice Questions
Module 5: Magnetic Disk
CoreLecture 1 - Disk Structure & Performance
CoreLecture 2 - Disk Addressing
HighLecture 3 - Disk Scheduling Algorithms
HighLecture 4 - Disk Scheduling Algorithms Part 2
HighWeekly Quiz - Disk
Module 6: File Organization & Indexing
CoreLecture 1 - File Organization
HighLecture 2 - Practice Questions - File Organization
CoreLecture 3 - Free Disk Space Management
CoreLecture 4 - Indexing - Ordered Indexes
HighLecture 5 - Primary Index
HighLecture 6 - Clustering Index
HighLecture 7 - Secondary Index
HighLecture 8 - Practice Questions on Indexes
HighLecture 9 - Multilevel Index & ISAM
HighLecture 10 - GATE Questions on Indexing
HighLecture 11 - B Tree
HighLecture 12 - B Tree Insertion
HighLecture 13 - B Tree Order Questions
HighLecture 14 - B Tree Structure Questions
HighLecture 15 - B Tree More Questions
HighLecture 16 - B+ Tree
HighLecture 17 - B+ Tree Range Search
HighLecture 18 - B+ Tree Insertion
HighLecture 19 - B+ Tree Questions
HighWeekly Quizz - File Organisation & Indexing
Module 7: Transaction Management & Recovery
CoreAbout this Module
CoreLecture 1 - Transaction, Database Consistency
CoreLecture 2 - Transaction, Read Write Operations
CoreLecture 3 - ACID Properties
HighLecture 4 - Practice ACID Properties, Database Consistency
CoreLecture 5 - Serializability Introduction
HighLecture 6 - Serializability In General
HighLecture 7 - Conflict Serializability
HighLecture 8 - View Serializability
HighLecture 9 - Recoverability
HighLecture 10 - General Locking Protocol for Concurrency Control
HighLecture 11 - Two Phase Locking Protocol
HighLecture 12 - Two Phase Locking Protocol Variations
HighLecture 13 - Deadlock Handling
HighLecture 14 - Timestamp Based Protocols for Concurrency Control
HighLecture 15 - 50 Questions on Timestamp Protocol
HighWeekly Quiz - Transaction and Recovery
Module 8: ER Model
CoreLecture 1 - ER Model
HighLecture 2 - Weak Entity Set in ER Model
HighLecture 3 - ER Model to Relational Model Conversion
HighWeekly Quiz - ER Model
DBMS: Course Practice / PYQs
HighGATE PYQs & Standard Practice Questions
HighSQL - Summary & GATE PYQs - Complete Analysis
HighGATE Questions on Indexing
HighGATE PYQs on 3NF, BCNF Decomposition
COA
Computer Organization & Architecture
GATE Weightage: 8-10 marks0% done
Module 1: Basic Components of Computer & Main Memory
CoreAbout Lecture 1
CoreLecture 1A - Introduction to COA - Architecture Vs Organization
CoreLecture 1B - Stored Program Architecture
CoreLecture 1C - Structure of a Computer - Basic Components
CoreLecture 1D - IO Devices - Input Devices, Output Devices
CoreLecture 1E - Memory - RAM Vs ROM
HighLecture 2A - Main Memory - Addressability
HighLecture 2B - Byte Ordering - Endianness - Little Endian & Big Endian
HighLecture 2C - Practice Questions - Endianness
CoreLecture 3A - System Bus
HighLecture 3B - Memory Interfacing & Expansion
HighLecture 3C - GATE Questions - Memory Interleaving
HighWeekly Quiz and Solutions
Module 2: The CPU & Instruction Set Architecture
CoreLecture 1 - Registers & Status Flags
CoreLecture 2A - Instruction Set Architecture ISA
HighLecture 2B - RISC & CISC Architecture
HighLecture 3A - Instruction Format
HighLecture 3B - Expanding Opcode Technique
HighLecture 3C - ALL GATE PYQs on Expand Opcode Technique
HighLecture 4A - Instruction Types & ALU Operations
HighLecture 4B - Branch Instructions
HighLecture 4C - GATE PYQs on Machine Instructions
HighLecture 5 - Instruction Execution Cycle
HighLecture 6A - Addressing Modes
HighLecture 6B - Addressing Modes Part 2
HighLecture 6C - Addressing Modes Part 3
HighWeekly Quiz and Solutions
Module 3: Cache Memory
CoreLecture 1 - Cache Memory, Locality
HighLecture 2 - Direct Mapped Cache
HighLecture 3 - Set Associative Cache
HighLecture 3B - Hardware Implementation of Set Associative Cache
HighLecture 4 - Fully Associative Cache
CoreTypes of Caches - illustration by Berkeley
HighLecture 5 - Replacement Policies & Types of Misses
HighGATE PYQs - Cache Memory
HighLecture 6A - Average Memory Access Time AMAT
HighLecture 6B - Average Memory Access Time AMAT - Part 2
HighLecture 6C - Local & Global Miss Rates, Inclusion Property
HighLecture 7 - Cache Write Policies
HighWeekly Quizzes and Solutions
Optional Old Module: Cache Memory
CoreLecture 1 Introduction to Cache Direct Mapped Cache
HighLecture 2- Questions on Direct Mapped Cache Memory
HighLecture 3- Introduction to Set Associative Cache
HighLecture 4 Questions on Set Associative Cache Memory
HighLecture 5. Loop Array, and Cache Questions from Standard Universties
HighLecture 6 GATE PYQs on Loop Array and Cache Questions
HighLecture 7. GATE PYQs on Cache Memory Effective Access Time
HighLecture 8. Write Back and Write Through Policies
Module 4: Instruction Pipelining
HighPipeline Complete Playlist
HighWeekly Quiz and Solutions
Module 5: I/O Interfacing, Interrupts & DMA
HighLecture 1 - I/O Interface, Memory Mapped I/O, Isolated I/O
HighLecture 2 - Programmed I/O & Interrupt Driven I/O
HighLecture 3A - Interrupts & Interrupt Processing
HighLecture 3B - Handling Multiple Interrupts & GATE PYQs
HighLecture 4 - DMA - Direct Memory Access
HighLecture 5 - DMA ALL GATE PYQs & Practice
Module 6: Floating Point Representation
CoreLecture 1: Introduction to Fixed Point Representation
CoreLecture 2: Introduction to Floating Point Representation
HighLecture 3: Floating Point Representation GATE PYQs and Special Forms (Denorms, Nans, Infinity)
HighWeekly Quiz and Solutions
CN
Computer Networks
GATE Weightage: 7-9 marks0% done
Module 1: IP Addressing, Subnetting & Supernetting (New)
CoreLecture 1: Introduction to IP Addressing
CoreLecture 2: Classless addressing Explained
HighLecture 3: Subnetting
HighComputer Networks 2026 Quiz 1 Solution
HighLecture 4: More in Subnetting
HighLecture 5 Misconceptions in SuperNetting | Longest prefix match and Route aggregation (SuperNetting)
HighLecture 6 Practice Session on Subnetting and Supernetting
HighLecture Quiz 2 Discussion: Subnetting and Supernetting
Old IP Addressing, Subnetting & Supernetting
CoreLecture 1 Introduction and Classfull addressing
HighLecture 2 Classless Addressing and Subnetting
HighLecture 3 Misconceptions in SuperNetting | Longest prefix match and Route aggregation (SuperNetting)
HighLecture 4 Practice Session on Subnetting and Supernetting [Recording]
HighQuiz Discussion: Subnetting and Supernetting
Module 2: Data Link Layer (Part 1)
CoreLecture 5 Layering in Computer Networks
CoreLecture 6 Switching (Packet Switch and Circuit Switch) and Framing in Data Link Layer
HighLecture 7 Error Control Methods (Single Bit Parity Codes, Hamming Distance)
High8a. Idea Behind Single Error Correcting (SEC) Codes
Core8b. [Optional] Minimum Number of Parity Bits required for ANY Single Error Correcting Code
High8c. Construction of Hamming Code
High9a. Cyclic Redundency Check Method and MANY PYQs
High9b. ANALYSIS of Cyclic Redundancy Check | GATE 2009
HighLecture_10: Checksum (Error Control), Delays in Networking (Propagation Delay and Transmission Delay)
HighLecture 11: Questions Based on delays (Propagation, Transmission, Queuing, and Processing) in Packet Switched Networks
HighLecture 12: Few more Questions on Packet Switched Networks (GATE 2005, 2014, 2004)
HighLecture 13: Stop-Wait Protocol
HighLecture 14: Questions on Stop and Wait Protocol
HighLecture 15: More questions on Stop and Wait Protocol
HighLecture 16: Go Back N Protocol in Detail
HighLecture 17: Selective Repeat Protocol in Detail
HighLecture 18: Efficiency and Throughput of SR and GBN | Relationship between Sequence number Space and Window Sizes
HighLecture 19: PYQs on Selective Repeat and GO Back N
Module 3: Data Link Layer (Part 2 - Medium Access & Devices)
HighLecture 20:: Media Access Control Protocols - Aloha
HighLecture 21 Efficiency and Throughput of Aloha
HighLecture 22 CSMA CD and Backoff Algorithm
HighLecture 23 Backoff Algorithm for Random Access Protocols
HighLecture 24 Address Resolution Protocol(ARP)
HighLecture 25 Dynamic Host Configuration Protocol (DHCP)
HighSpanning Tree Protocol
CoreNetworking Devices
Network Layer
HighLecture: IP Header and Fragmentation
HighLecture: More Fragmentation Questions
HighLecture 30. ALL GATE PYQs and Some More Questions on IP Fragmentation | Stanford, CMU Questions
HighLecture 31 a. Internet Control Message Protocol (ICMP)
HighLecture 31 b Network Address Translation NAT
HighLecture 32 Distance Vector Routing Protocol
HighLecture 32 b PYQs on Distance Vector Routing Protocol and Count to Infinity
HighLink State Routing Protocol
Transport Layer
CoreLecture 33 Introduction to Transport Layer and UDP
HighLecture 34 TCP Header and Connection Establishment
HighLecture 35: TCP Flow Control
HighLecture 36 TCP Congestion Control
HighLecture 37a. More Questions on TCP Congestion From Kurose, Peterson Davie
CoreLecture 37b. [Optional But Please Watch] CWND Increment per ACK in CA Phase | Berkeley and Princeton Questions
HighLecture 37c. GATE 2004 Nice and Easy Question
HighLecture 38. More Questions on Congestion Control and TCP Connection Termination
HighLecture 39. TCP Options or Extensions
HighLecture 40. TCP Timer and How all layer work together
Additional Transport / Congestion Control
HighLeaky bucket and Token bucket with GATE PYQs. Clear Explanation
Application Layer
HighHTTP
HighDNS
HighSMTP & POP3
HighFTP
CD
Compiler Design
GATE Weightage: 4-6 marks0% done
Module 1: Compiler Overview & Lexical Analyzer
CoreLecture 1 - Computer Languages - Machine Language Vs Assembly Language
CoreLecture 2A - Compiler Overview
CoreLecture 2B - Broad Overview of Compiler Phases
CoreLecture 3A - Lexical Analysis - Tokenization
HighLecture 3B - Lexical Analyzer Implementation & Practice Questions
HighLecture 3C - Lexical Analyzer as DFA & More Practice Questions
Module 2: Syntax Analysis & Top Down Parsing
HighLecture 1 - FIRST, FOLLOW, Left Factoring, Left Recursion
HighLecture 2 - Ambiguity Elimination, Precedence & Associativity
HighLecture 3 - LL1 Parser
HighLecture 4 - Recursive Descent Parser
Module 3: Bottom Up Parsing
HighLecture 1 - Handles in Bottom Up Parsing
HighLecture 1B - Bottom Up Parser Working Idea
HighLecture 1C - Bottom Up Parser Working with Handles
HighLecture 1D - Viable Prefixes
HighLecture 2A - LR(0), SLR(1) Parsers
HighLecture 2B - LR(0), SLR(1) Parsers Working
HighLecture 3A - LR(1) Parsers
HighLecture 3B - LALR(1) Parser
Module 4: Syntax Directed Translation & SDD
HighLecture 1A - Semantic Analysis, Syntax Directed Translation Scheme SDT
HighLecture 1B - SDT - GATE PYQs
HighLecture 2A - SDD - Syntax Directed Definitions
HighLecture 2B - SDD - Syntax Directed Definitions - Part 2
HighLecture 2C - SDD - Syntax Directed Definitions - Part 3
Module 5: Intermediate Code & Code Optimization
CoreAbout Module 4, Lecture 1
CoreLecture 1 - Intermediate Representations
HighLecture 2A - Three Address Code
HighLecture 2B - Quadruple, Triple, and Indirect Triple
HighPractice & GATE PYQs of 3AC
HighLecture 3 - Static Single Assignment Form SSA
HighLecture 4 - Control Flow Graph CFG
HighPractice & GATE PYQs - 3AC, CFG
CoreLecture 5A - Code Optimization - Introduction
HighLecture 5B - Liveness Analysis
HighLecture 5C - Liveness Analysis - GATE PYQs & Practice
HighLecture 5D - Liveness Analysis Applications - Dead Code, Register Allocation
HighLecture 6A - Available Expression Analysis
HighLecture 6B - Available Expression Analysis & Common Sub-Expression Elimination
HighLecture 8 - DAG, AST | Directed Acyclic Graph, Abstract Syntax Tree
Old Module 1: Lexical & Syntax Analysis [Optional]
CoreLecture 1a. Introduction to Compiler Design
CoreLecture 1b. Token Name, Token Attribute, and Lexeme
HighLecture 1c. Recognition of Tokens and Maximal Munch
HighPractice Questions on Lexical Analysis
HighTrue False Question on Lexical Analysis
HighLecture 2a. Introduction to Syntax Analysis and Ambiguous grammars
HighLecture 2b. Elimination of Ambiguity Manually - Example 1 E-T-F Grammar
HighLecture 2c. Elimination of Ambiguity Manually - Example 2 Dangling If-Else Grammar
HighGATE 1996 Question Homework
HighLecture 2d. Elimination of Ambiguity Manually - Example 3 Balance Parentheses | And Ambiguity Summary
HighLecture 3a. Left Recursion and Left Factoring
HighLecture 3b. One more example on Left Factoring
CoreLecture 4a. Introduction to Parsing | Type of Parsers
HighLecture 4b. Types of Top Down Parsers
HighLecture 4c. Recursive Descent Parser
HighLecture 5. Questions on Recursive Descent Parsers
CoreLecture 5 - On Youtube
HighLecture 6a. Computing First
HighLecture 6b. Computing Follow
HighLecture 7a. Predictive Parsers
HighLecture 7b. Implementing LL(1)
HighLecture 7C Forty Five Questions on First, Follow, LL(1), Ambiguity, etc.
Old Module 2: Bottom-Up Parsing [Optional]
HighLecture 8a: Handles in Bottom-Up Parsing | GATE 2005 PYQ
HighLecture 8b: Questions on Handle and Working of Bottom-up parsers
CoreLecture 8b- On Youtube
HighLecture 9a. LR(0) and SLR(1) Parsing Table Examples
HighLecture 9b. More examples on LR(0) and SLR(1) Grammars
HighLecture 10. Really Understanding LR(0) Automata | Re-Run of DFA | Viable Prefixes | Bottom up Parsing Algorithm
HighLecture 11a. More Questions on LR(0) and SLR(1)
HighLecture 11b. Condition of Grammar being SLR(1)
HighLecture 11c. Relation between LL(1) LR(0) and SLR(1)
HighLecture 11d. One more Example of LR(0) SLR(1)
High12a. Limitations of SLR(1) Parser
High12b. Idea behind LR(1) Parsers
High12c. Example on LR(1) Parsing
High12d. -Example on LR(1) and LALR(1)
HighLecture 13 a-Example on LR(1) and LALR(1)
HighLecture 13 b-One More Example on LR(1) and LALR(1)
HighLecture 13 c- Tiny LR(2) grammar
HighLecture 14a Questions on LALR(1) and CLR(1)
HighLecture 14b Questions on LALR(1) and CLR(1)
Old Module 3: Syntax Directed Definitions [Optional]
HighLecture 15: Syntax Directed Definition and Translation
HighLecture 16 PYQs on Syntax Directed Definition and Translation
HighLecture 17 Inherited and Synthesize attributes with Top down and Bottom-up parsers
DL
Digital Logic
GATE Weightage: 4-6 marks0% done
Module 1: Boolean Algebra & Minimization of Boolean Functions
CoreLecture 1 - Introduction to Digital Logic & Boolean Algebra
CoreLecture 2 - Boolean Algebra
CoreLecture 3A - Binary & Decimal Number System
CoreLecture 3B - Practice - Decimal & Binary Number System
CoreLecture 4A - Boolean Algebra Continued
HighLecture 4B - Boolean Expressions & Boolean Algebra Laws
HighLecture 4C - Complement & Dual of Boolean Expressions
HighLecture 4D - Algebraic Simplification
CoreLecture 5A - Standard Forms of Boolean Expressions
HighLecture 5B - Minterm, Maxterm
HighLecture 5C - Revision - Minterm, Maxterm
HighLecture 5D - Expressing Boolean Function using Minterms, Maxterms
HighLecture 5E - Revision & Practice - Standard Forms of Boolean Functions
HighLecture 5F - Practice Questions - Sum of Minterms, Product of Maxterms
HighLecture 6A - K-Map Part 1 - Boolean Function Minimization
HighLecture 6B - K-Map Part 2 - Minimization of Boolean Expression using K-map
HighLecture 6C - K-Map Part 3 - Minimization of Boolean Expression using K-map
HighLecture 6D - K-Map Part 4 - Don't Cares, Prime Implicants
HighLecture 6E - K-Map Part 5 - Prime Implicant, Essential Prime Implicant
HighLecture 7 - Dual of a Boolean Function, Self Dual
HighLecture 8 - ExOr, ExNor Functions & Their Properties
Core(OPTIONAL) Positive Level Logic System, Negative Level Logic System
HighPractice Questions - Boolean Algebra & Logic Circuits
HighBoolean Algebra - GATE PYQs - Part 1
HighBoolean Algebra - GATE PYQs - Part 2
Module 2: Number System
CoreLecture 1A - Octal, Hexadecimal Number Systems
CoreLecture 1B - Why Octal, Hexadecimal Number Systems are Important?
CoreLecture 2 - Binary Addition
HighLecture 3A - Complement of a number, Subtraction using r's complement
HighWeekly Quiz - Minimization, Number System
Module 3: Combinational Circuits
CoreLecture 1 - Compact Truth Table Representation
HighLecture 2A - Multiplexer
HighLecture 2B - Realization of Boolean Functions using Multiplexer
HighLecture 2C - Practice Questions - Multiplexer
HighLecture 2D - Function Realization using Multiplexer
HighLecture 2E - Building Large Mux using Small Mux
HighLecture 2F - Multiplexer with Enable Input
HighLecture 3 - Demultiplexer
HighLecture 4A - Encoder - Binary Encoder
HighLecture 4B - Encoder - Priority Encoder
HighLecture 5A - Decoder
HighLecture 5B - Active Low Decoder i.e. NAND gate Decoder
HighLecture 5C - Function Realization using Decoder
HighLecture 6 - Propagation Delay & Timing Diagrams
CoreLecture 7A - Adder - Half Adder
HighLecture 7B - Full Adder
HighLecture 7C - Carry Look Ahead Adder
CoreLecture 8A - Subtractor
HighLecture 8B - Binary Adder/Subtractor
HighLecture 9A - Comparator
HighLecture 9B - Magnitude Comparator
CoreLecture 10A - Universal Gates - NAND and NOR
HighLecture 10B - Minimum NAND, NOR Gate Implementation - Part 2
HighLecture 10C - Minimum NAND/NOR Gate Implementation - Part 3
HighLecture 10D - Minimum NOR Gate Implementation
HighLecture 10E - Minimum NOR Gate Implementation - Part 2
Module 4: Functional Completeness
HighFunctional Completeness - Complete Playlist
HighPost's Functional Completeness Theorem
Module 5: Sequential Circuits
CoreLecture 1 - Introduction - Combinational Circuits Vs Sequential Circuits
CoreLecture 2A - One Bit Storage Device - Cross Coupled Inverters
CoreLecture 2B - SR Latch - Cross Coupled NOR gates
CoreLecture 2C - S'R' Latch - Cross Coupled NAND gates
HighLecture 3 - Timing Diagram of SR Latch, Clock
HighLecture 4 - Flipflops - SR Flipflop
HighLecture 5 - D Flipflop
HighLecture 6 - Clock Triggering of flipflops
HighLecture 7 - JK flipflop
HighLecture 8A - T flipflop
GA
General Aptitude
GATE Weightage: 15 marks (Mandatory)0% done
Fundamentals of Computer Science (Sachin Mittal Sir)
CoreFundamentals of Computer Science - By Sachin Mittal Sir
CoreHomework 1 - Fundamental Course - Summation
CoreHomework 2 - Fundamental Course - Sequence & Series
CoreHomework 3 - Fundamental Course - Geometric Progression
CoreHomework 4 - Fundamental Course - Modular Arithmetic
CoreHomework 5 - Fundamental Course - Modular Arithmetic
Module 1: Aptitude (Summations, Series, Modular Arithmetic, Counting)
CoreLecture 1A : Summation - Sigma notation, Shifting Indices, & Properties of Sigma
HighLecture 1B : Summation - Practice Questions
HighLecture 1C : Summation - GATE PYQs
CoreLecture 2A : Sequence and Series - Arithmetic Progression
HighLecture 2B : Arithmetic Progression - Practice Questions
HighLecture 2c : Arithmetic Progression - GATE PYQs
CoreLecture 3A : Sequence and Series - Geometric Progression
HighLecture 3B : Geometric Progression - Practice Questions
HighLecture 3C : Geometric Progression - GATE PYQs
HighLecture 4A : Arithmetic Geometric Progression (AGP)
HighLecture 4B : AGP - Practice Questions
HighLecture 4C : AGP - GATE PYQs
CoreLecture 5A : Modular Arithmetic
HighLecture 5B : Modular Arithmetic - Practice Questions
HighLecture 5C : Modular Arithmetic - GATE PYQs
CoreLecture 6A ： Logarithm - Properties and More
HighLecture 6B ： Logarithms - Practice Questions
HighLecture 6C ： Logarithms - GATE PYQs
CoreLecture 7A ： Basic Counting Principles - Sum Rule & Product Rule
HighLecture 7B ： Sum Rule & Product Rule - Practice Questions
HighLecture 7C ： Sum Rule & Product Rule - GATE PYQs
HighLecture 8A ： Subtraction Rule/ Inclusion Exclusion Principle
HighLecture 8B ： Subtraction Rule/ Inclusion Exclusion Principle - Practice Questions
Module 2: Quantitative Aptitude
CoreLecture 9A : Speed, Time & Distance - Average Speed
HighLecture 9B : Speed Time & Distance - Practice Questions on Average Speed
HighLecture 9C : Speed Time & Distance - GATE PYQs on Average Speed
CoreLecture 10A : Relative Speed
HighLecture 10B : Relative Speed - Practice Questions
HighLecture 10C : Relative Speed - GATE PYQs
HighLecture 11A : Relative Speed - Problems on Trains
HighLecture 11B : Problems on Trains - Practice Questions
HighLecture 11C : Problems on Trains - GATE PYQs
HighLecture 12A ： Boats & Stream - Upstream, Downstream
HighLecture 12B ： Boats & Streams - Practice Questions
HighLecture 12C ： Boats & Streams - GATE PYQs
CoreLecture 13A ： Percentages - How to calculate percentages？
HighLecture 13B ： Calculating Percentages - Practice Questions
HighLecture 13C ： Calculating Percentages - GATE PYQs
HighLecture 14A ： Percentage Increase and Decrease
HighLecture 14B ： Percentage change - Practice Questions
HighLecture 14C ： Percentage Change - GATE PYQs
CoreLecture 15A ： Ratio and Proportions
Quantitative Aptitude: Additional Topics
CoreAbsolute Value
CoreFloor & Ceiling Functions
Old Aptitude Lectures [Optional]
HighLecture 1 Simple Interest and Compound Interest
HighLecture 2 Percentage
HighLecture 3 Ratio & Proportion
HighLecture 4 Profit loss and Discount
HighLecture 5 Time and Work
HighLecture 6 Time Speed and Distance
HighLecture 7 Number System
HighLecture 8 Spatial Aptitude
HighLecture 9 Analytical AptitudePart 1
HighLecture 10 Analytical AptitudePart 2
Verbal Ability
HighVerbal Aptitude (English Grammar) Part 1 - Many GATE PYQs
HighVerbal Aptitude Part 2
HighVerbal Aptitude Part 3