1. Lecture 1A - Why Study Linear Algebra

2. Lecture 1B - Linear Algebra for GATE & Interviews

3. Annotated Notes - Lecture 1A-1B

4. Lecture 1C - Linearly Independent and Linearly Dependent

5. Annotated Notes - Lecture 1C

6. Lecture 2A - Filling the Space Part 1

7. Lecture 2B - Filling the Space Part 2

8. Lecture 2C - Summary So far

9. Lecture 2D - Multiplying a Matrix & a Vector

10. Annotated Notes - Lecture 2

11. Homework 1 - Linear Dependence & Independence

12. Live Session 1 - Homework 1 Discussion

13. Annotated Notes - Live Session 1

14. Lecture 3A - Why Solve System Of Linear Equations

15. Lecture 3B - Writing as Ax=b, Geometric Interpretation and Possible Solutions

16. Lecture 3C - Understanding Ax=b intuitively

17. Lecture 3 Annotated Notes

18. 4a. Multiplying 2 Matrices | My Walmart Interview Question

19. 4b. GATE 2016 Question

20. 4c. GATE 2014 Question

21. 4d. Two conceptual questions

22. 4e. Linear Combination of Independent vectors is unique

23. 4f. GATE 2017 Question

24. Lecture 4 Annotated Notes

25. (New) Practice Questions based on Concepts covered upto lecture 4F

26. Annotated Notes Practice Questions based on Concepts covered upto lecture 4F

27. (New) Practice Questions based on Concepts covered upto lecture 4F - Part2

28. Annotated Notes Practice Questions based on Concepts covered upto lecture 4F Part2

29. Weekly Quiz 3 - Fundamental Course and Linear Algebra

30. (New) Weekly Quiz 3 GATE 2025 Solution

31. Annotated Notes Weekly Quiz 3 Linear Algebra

32. Homework 2

33. 5a. Echelon Form and Pivot Columns

34. 5b. Gaussian Elimination

35. Live Session -2

36. Live Session 2 Annotated Notes

37. 5c. Rank | GATE 1994 Question | Rank Nullity Theorem

38. 5d. Finally Solving Ax=b | Five Different Questions

39. 5e. More than one free variable in 𝐴𝑥=0 solution

40. Lecture 5 Annotated Notes

41. Live Session -3

42. Live Session 3 Annotated Notes

43. 6a. GATE 2021 Question | Free variables in Non homogeneous

44. 6b. Solutions based on Rank(A) and Rank(A|b)

45. 6c. Few Questions related to rank(A) and Number of solutions

46. 6d. [OPTIONAL] Linearly Independent Columns with Gaussian Elimination

47. 6e. [Optional] Row Reduced Echelon Form

48. Lecture 6 Annotated Notes

49. Homework Questions Set 2

50. Lecture 7 Determinant

51. Lecture 7b Inverse of a Matrix

52. Lecture 7c. Crammers rule

53. Lecture 7 Annotated Notes

54. Live Session -4

55. Live Session 4 Annotated Notes

56. Lecture 8a. Introduction to Eigenvalues and Eigenvectors

57. Lecture 8b. Characterstic Equation

58. Lecture 8c. Solving for Eigenvalues and Eigenvectors

59. Lecture 8 Annotated Notes

60. Lecture 9a. Linearly Independent eigen vectors with repeating eigenvalues

61. Lecture 9b. Three Different Examples With Repeating Lambda

62. Lecture 9c. Symmetric Matrices has n LI Eigen Vectors

63. Lecture 9d. Two Magical Properties

64. Lecture 9 Annotated Notes

65. Live Session -5

66. Live Session 5 Annotated Notes

67. 10a. Rank and Eigen Values

68. 10b. Examples on Rank and Eigen Values

69. 10c. CAYLEY-HAMILTON THEOREM

70. 10d. Eigen Values of AB and BA

71. 10e. Eigen Values of Powers of A

72. Lecture 10 Annotated Notes

73. Live Session 6 (Three Tough-Interesting GATE PYQs)

74. Live Session 6 Annotated Notes

75. Weekly Quiz 6 - Linear Algebra

76. Lecture 11a. LU Decomposition

77. Lecture 11b. Type Of Matrices

78. Lecture 11 Annotated Notes

79. Weekly Quiz 7 - Linear Algebra

80. Live Session -7 Weekly Quiz Solutions

81. Live Session 7 Annotated Notes

82. Live Session -8 Weekly Quiz 7 LA Solutions

83. Live Session 8 Annotated Notes

84. Annotated Notes Scholarship test Linear Algebra Solution

1. Lecture 1a Probability Definition, Sample Space and Events

2. Lecture 1b. Inclusion Exclusion Principle, Demorgans Law

3. Lecture 1 Annotated Notes

4. Lecture 2a. Conditional Probability Introduction

5. Lecture 2b. Conditional Probability Examples

6. Lecture 2c. Introduction to Tree Diagram

7. Lecture 2 Annotated Notes

8. Lecture 3a. Total Probability

9. LIVE Session 1: GATE PYQs Tree Method

10. Live Session 1 Annotated Notes

11. Lecture3b. Conditional Probability Examples

12. Lecture 3 Annotated Notes

13. Lecture3c. GATE PYQs and Bayes Theorem

14. Annotated Notes Lecture3c. GATE PYQs and Bayes Theorem

15. [Optional] My LinkedIn Interview

16. [Optional] My Linkedin Interview

17. Lecture 4a. independence of events

18. Lecture 4b. Conditional Independence

19. Lecture 4 a,b Annotated Notes

20. Lecture 4c. Independence Does not imply Conditional Independence

21. Lecture 4c Annotated Notes

22. Lecture 4d: Random Variables Introduction

23. Annotated Notes Lecture 4d: Random Variables Introduction

24. Lecture 5a. Practice Questions on Random Variables

25. Lecture 5a. Independence of events

26. LIVE Session 4: Practice Questions on Random Variables

27. Live Session 4 Annotated Notes

28. Weekly Quiz 8 - Conditional Probability

29. LIVE Session 5: Weekly Quiz 8 (Conditional Prob) Discussion

30. Live Session 5 Annotated Notes

31. Lecture 6a. Types of Random Variables

32. Lecture 6b. Probability Mass Function Questions Part 1

33. Lecture 6c. Probability Mass Function Questions Part 2

34. Lecture 6 Annotated Notes

35. Lecture 7a. Expectation of Discrete Random Variable

36. Lecture 7b Expectation vs Average

37. Lecture 7c.[Optional] Expectation as center of mass

38. Lecture 7d. MIT Question and GATE 2021 Question

39. Lecture 7e. Expectation of Random Variable which is a Function of Random Variable

40. Lecture 7 Annotated Notes

41. LIVE Session 6

42. Live Session 6 Annotated Notes

43. Lecture 8a. Question number 8

44. Lecture 8b. Question number 9, 10, 11

45. Lecture 8c. Question number 12, 13

46. Lecture 8 Annotated Notes

47. Lecture 9a. Cumulative Distribution Function

48. [LIVE] Lecture 9b - Variance Intuition and Formula

49. [LIVE] Lecture 9c- Variance Main Formula and Questions

50. [LIVE] Lecture 9d- Variance Questions

51. Lecture 9 Annotated Notes

52. [LIVE] Lecture 10a: Discrete random variable (Bernoulli and Binomial RVs)

53. [LIVE] Lecture 10b. MIT Question on Binomial RV

54. [LIVE] Lecture 10c. Optional and Skip - Question on Plot of PMF

55. [LIVE] Lecture 10d. Poisson RV

56. 10d. Discrete Uniform RV Introduction

57. [LIVE] Lecture 10 Annotated Notes

58. Lecture 11a. Introduction to Continuous Distributions | Intuition about PDF

59. Lecture 11b. Continuous Uniform Distribution

60. Lecture 11c. Normal Distribution

61. Lecture 11d. Normal Distribution - 2

62. Lecture 11E. Exponential Distribution

63. Lecture 11 Annotated Notes

64. Lecture 12. Statistics - Mean Mode Median

65. Lecture 12 Annotated Notes

66. LIVE: Weekly Quiz 11 Discussion :- Random Variables and Probability Distributions

67. Annotated Notes - Weekly Quiz 11 Discussion - Random Variables & Probability Distributions

68. Weekly Quiz 11 - Probability Distributions

1. Limits in Calculus | Calculus | Engineering Mathematics | GATE | GO Classes | GATE Overflow

2. Continuity in Calculus | Calculus | Engineering Mathematics | GATE | GO Classes | GATE Overflow

3. Differentiability in Calculus | Calculus | Engineering Mathematics | GATE | GO Classes

4. Maxima Minima in Calculus | Calculus | Engineering Mathematics | GATE | GO Classes

5. Intermediate Value Theorem | Calculus | Engineering Mathematics | GATE Computer Science

6. Rolles Theorem and Examples | Calculus | Engineering Mathematics | GATE Computer Science

7. Integration with ALL GATE PYQs | Tic Tac Toe method | Engineering Mathematics | GO Classes

8. Limits Annotated Notes

9. Continuity Annotated Notes

10. Differentiability Annotated Notes

11. Maxima and Minima Annotated Notes

12. Integration Annotated Notes

13. Intermediate Value Theorems Annotated Notes

14. LIVE Session 1: Limit and Continuity

15. LIVE Session 1 Annotated Notes

16. LIVE Session 2: Differentiability

17. LIVE Session 2 Annotated Notes

18. LIVE Session 3: Double Derivative and Mean Value Theorems

19. LIVE Session 3 Annotated Notes

20. LIVE Session 4: Integration

21. LIVE Session 4 Annotated Notes

22. Calculus Quiz - Weekly Quiz 14

23. Weekly Quiz 14 - Calculus

24. Annotated Notes - Calculus Quiz Discussion

1. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Engineering Mathematics Notes

2. Linear Algebra Notes - by Aditya

3. Probability Notes - by Aditya

4. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Linear Algebra

5. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Probability

1. Lecture 1 - Summation - Sigma notation, Shifting Indices, & Properties of Sigma

2. Annotated Notes - Lecture 1 - Summation

3. Homework 1 - Fundamental Course - Summation

4. Lecture 2 - Sequence & Series

5. Annotated Notes - Lecture 2 - Sequence & Series

6. Homework 2 - Fundamental Course - Sequence & Series

7. Lecture 3 - Geometric Progression

8. Annotated Notes - Lecture 3 - Geometric Progression

9. Homework 3 - Fundamental Course - Geometric Progression

10. Lecture 4A - Modular Arithmetic

11. Annotated Notes - Lecture 4A - Modular Arithmetic

12. Homework 4 - Fundamental Course - Modular Arithmetic

13. Lecture 4B - Modular Arithmetic Part 2

14. Annotated Notes - Lecture 4B - Modular Arithmetic Part 2

15. Homework 5 - Fundamental Course - Modular Arithmetic

16. Lecture 5A - Logarithm Definition and All Properties

17. Lecture 5B - Logarithm Exercise Questions

18. Lecture 5C - Logarithm Questions, Graph, and Log in Computer science

19. Annotated Notes - Lecture 5A-5C - Logarithms and Properties

20. (NEW) Lecture 6 - GATE PYQs on Fundamental Topics (Series and Logarithms)

21. Annotated Notes - Lecture 6 - GATE PYQs on Fundamental Topics

22. Lecture 7A - Proof Techniques Part 1 - Direct Proofs

23. Annotated Notes - Lecture 7A - Proof Techniques Part 1 - Direct Proofs

24. Homework 6 - Proof Techniques Part 1 - Direct Proof

25. Lecture 7B - Proof Techniques Part 2 - Proof by Contrapositive & Contradiction

26. Annotated Notes - Lecture 7B - Proof Techniques Part 2 - Proof by Contrapositive & Contradiction

27. Homework 7 - Proof Techniques Part 2 - Contraposition & Contradiction

28. Lecture 7C - Proof by Mathematical Induction - Proof Technique

29. Annotated Notes - Lecture 7C - Proof by Mathematical Induction

30. Lecture 8 - Proof Techniques Homework 6,7 Solutions

31. Annotated Notes - Lecture 8 - Proof Techniques Homework 6,7 Solutions

32. (NEW) Lecture 9 - Practice Questions on Proof Techniques

33. Annotated Notes - Lecture 9 - Practice Questions on Proof Techniques

34. Weekly Quiz 1 - Fundamental Course - Sequence, Series & Modular Arithmetic

35. Weekly Quiz 2 - Proof Techniques - Fundamental Course

1. Lecture 1 - Introduction to Discrete Mathematics

2. Summary Lecture 1 - Introduction to Discrete Mathematics

1. Lecture 1 - Introduction to Mathematical Logic

2. Annotated Notes - Lecture 1 - Introduction to Mathematical Logic

3. Summary Lecture 1 - Introduction to Mathematical Logic

4. Lecture 2 - Proposition & Propositional Variable

5. Annotated Notes - Lecture 2 - Proposition & Propositional Variable

6. Summary Lecture 2 - Proposition & Propositional Variable, Truth Value

7. Lecture 3 - Atomic & Compound Propositions

8. Annotated Notes - Lecture 3 - Atomic & Compound Propositions

9. Summary Lecture 3 - Atomic Proposition. Compound Proposition

10. Summary Lecture 4 - Logical Connectives

11. Lecture 4 - Negation Operator - Logical Connectives

12. Lecture 5 - Conjunction(AND) Operator - Logical Connectives

13. Lecture 6 - Disjunction(OR) Operator - Logical Connectives

14. Annotated Notes - Lecture 4,5,6 - Logical Connectives

15. Lecture 7 - Exclusive-OR Operator - Logical Connectives

16. Lecture 8 - NAND NOR Operator - Logical Connectives

17. Annotated Notes - Lecture 7,8 - Logical Connectives

18. Lecture 9 - Implication Operator - Logical Connectives

19. Lecture 10 - Implication Operator Continued

20. Annotated Notes - Lecture 9,10 - Implication Operator

21. Lecture 11 - Important Points about Implication Operator

22. Lecture 12 - Necessary & Sufficient Condition - Implication Operator

23. Lecture 13 - Various English Translations of Implication Statement

24. Annotated Notes - Lecture 11,12,13 - Implication Operator Continued

25. Lecture 14 - Bi-implication Operator - Logical Connective

26. Annotated Notes - Lecture 14 - Bi-implication Operator

27. Lecture 15 - Property Vs Definition - Implication Vs Bi-implication Statements

28. Annotated Notes - Lecture 15 - Property Vs Definition

29. Is it a Proposition?? - A Dumb Question!!

30. Lecture 16 - Propositional Variable Vs Propositional Formula

31. Annotated Notes - Lecture 16 - Propositional Variable Vs Propositional Formula

32. Homework 1 - Logical Connectives - Propositional Logic

33. Homework 2 - Implication Bi-implication - Propositional Logic

34. Homework 1,2 Video Solution & Notes

35. Lecture 17 - Propositional Formula Revisited

36. Lecture 18 - Truth Table

37. Annotated Notes - Lecture 17,18 - Propositional Formula Revisited, Truth Table

38. Homework 3 - Standard Questions - Propositional Logic

39. Homework 3 Video Solution & Notes

40. Lecture 19 - Tautology, Contradiction, Contingency

41. Lecture 20 - By Case Method

42. Lecture 21 - By Case Method Practice

43. Lecture 22 - Logical Equivalence

44. Lecture 23 - Logical Equivalence Practice

45. Annotated Notes - Lecture 19-23 - Tautology, Equivalence

46. Weekly Quiz 1 - Propositional Logic

47. Homework 4 - Tautology, Equivalence - Propositional Logic

48. Lecture 24 - Converse, Contrapositive of Conditional Statement

49. Lecture 25 - English-Logic Translation

50. Lecture 26 - Unless Word - English-Logic Translation

51. Annotated Notes - Lecture 24-26 - English-Logic Translation, Converse, Unless Word

52. Lecture 27 - Logical Laws - Commutative Property

53. Lecture 28 - Logical Laws - Associative Property

54. Lecture 29 - Logical Laws - Idempotent Property

55. Lecture 30 - Logical Laws - Distributive Law

56. Lecture 31 - Logical Laws - De Morgans Laws

57. Lecture 32 - Logical Laws - Implication Laws

58. Lecture 33 - Simplification Using Logical Laws

59. Lecture 34 - Analysis of Implication

60. Annotated Notes - Lecture 27-34 - Logical Laws

61. Lecture 35 - Logical Arguments

62. Lecture 36 - Rules of Inference - Logical Arguments

63. Annotated Notes - Lecture 35,36 - Logical Arguments

64. Lecture 37 - The Inference Symbol

65. Annotated Notes - Lecture 37 - The Inference Symbol

66. Weekly Quiz 2 - Propositional Logic

67. Weekly Quiz 3 - Propositional Logic

1. Lecture 1 - First Order Logic Motivation & Overview

2. Annotated Notes - Lecture 1 - First Order Logic Motivation & Overview

3. Lecture 2 - Objects & Domain in First Order Logic

4. Lecture 3 - Predicates in First Order Logic

5. Lecture 4 - Creating Proposition from predicate

6. Annotated Notes - Lecture 2,3,4 - Objects & Predicates

7. Lecture 5 - Quantifiers Introduction

8. Lecture 6 - Universal Quantifier

9. Lecture 7 - Existential Quantifier

10. Lecture 8 - Quantifiers Practice

11. Lecture 9 - Quantifiers Summary

12. Annotated Notes - Lecture 5-9 - Quantifiers

13. Lecture 10 - Quantifiers Tricky Points

14. Lecture 11 - English-FOL Translation Part 1

15. Lecture 12 - English-FOL Translation Part 2

16. Lecture 13 - English-FOL Translation Part 3

17. Lecture 14 - English-FOL Translation Part 4

18. Lecture 15 - English-FOL Translation Part 5

19. Lecture 16 - English-FOL Translation Part 6

20. Lecture 17 - English-FOL Translation Part 7

21. Annotated Notes - Lecture 10-17 - English-FOL Translation

22. Lecture 18 - Revision of English-FOL Translation

23. Lecture 19 - A LOT of Practice of English-FOL Translation

24. Lecture 20 - Bounded Variable

25. Lecture 21 - Free Variable Vs Bounded Variable

26. Lecture 22 - Practice - Bounded Variable Free Variable

27. Lecture 23 - Important Note About Free Variables

28. Lecture 24 - Scope of a Quantifier

29. Annotated Notes - Lecture 20-24 - Free Variable, Bounded Variable, Scope of a Quantifier

30. Lecture 25 - Nested Quantifiers Part 1 - Need of Nested Quantifiers

31. Lecture 26 - Nested Quantifiers Part 2 - All Four Standard Templates

32. Lecture 27 - Nested Quantifiers Part 3 - Examples, Variations

33. Annotated Notes - Lecture 25-27 - Nested Quantifiers

34. Lecture 28 - More Practice of English - FOL Translation

35. Lecture 29 - Even More Practice of English - FOL Translation

36. Annotated Notes - Lecture 18, 19, 28, 29 - English-FOL Translation Examples Part 1-4

37. Lecture 30 - Practice - Free Variable, Bounded Variable, Scope

38. Annotated Notes - Lecture 30 - Practice - Free Variable, Bounded Variable, Scope

39. Homework 1 - Quantifiers - First Order Logic

40. Live Doubts, Practice Session 1 - Homework 1 Solutions - First Order Logic

41. Annotated Notes - Live Doubts, Practice Session 1 - Homework 1 Solutions FOL

42. Lecture 31 - Negation of quantifiers

43. Annotated Notes - Lecture 31 - Negation of quantifiers

44. Lecture 32 - Validity, Satisfiability of a FOL Expression

45. Lecture 33 - Validity, Satisfiability of a FOL Expression Part 2

46. Annotated Notes - Lecture 32,33 - Validity, Satisfiability of a FOL Expression

47. Lecture 34 - Validity of FOL Expression Involving Implication

48. Lecture 35 - Equivalence of FOL Expressions

49. Lecture 36 - Distributive Properties of Quantifiers

50. Annotated Notes - Lecture 34-36 - Distributive Properties of Quantifiers

51. Weekly Quiz 9 - First Order Logic

52. Lecture 37 - Practice - First Order Logic

53. Lecture 38 - Null Quantification Rule

54. Annotated Notes - Lecture 37,38 - Null Quantification Rule

55. Lecture 39 - Arguments in First Order Logic

56. Annotated Notes- Lecture 39 - Arguments in First Order Logic

57. NOTE About Next Lectures

58. OPTIONAL Lecture 1 - Interpretation, Model in Propositional Logic

59. OPTIONAL Lecture 2 - Interpretation, Model in First Order Logic

60. Annotated Notes - OPTIONAL Lecture 1,2 - Interpretation, Model in Propositional Logic, FOL

61. OPTIONAL Lecture 3 - Uniqueness Quantifier

62. Annotated Notes - OPTIONAL Lecture 3 - Uniqueness Quantifier

63. Optional Lecture 4 - Tautology in First Order Logic

64. Annotated Notes - Optional Lecture 4 - Tautology in First Order Logic

65. Weekly Quiz 10 - First Order Logic

1. Lecture 1 - Set Definition

2. Lecture 2 - Finite Set, Infinite Set

3. Lecture 3 - Cardinality of a Set

4. Lecture 4 - Set Representations

5. Annotated Notes - Lecture 1-4 - Set

6. Lecture 5 - Subset

7. Annotated Notes - Lecture 5 - Subset

8. Lecture 6 - Powerset of a Set

9. Lecture 7 - Set Operations

10. Lecture 8 - Set Equality

11. Annotated Notes - Lecture 6-8 - Set Operations

12. Weekly Quiz 1 - Set Theory

13. Lecture 9 - Understanding Set Operations

14. Annotated Notes - Lecture 9 - Understanding Set Operations

15. Lecture 10 - Proofs involving Sets, Set Equality, Subset

16. Lecture 11 - Set Identities

17. Lecture 12 - Proofs involving Power Sets

18. Annotated Notes - Lecture 10-12 - Proofs involving Sets

19. Practice Set 1 - Set, Subset - Set Theory (Video Solution Below)

20. Practice Set 1 - Video Solutions

21. Lecture 13 - Ordered Pairs

22. Lecture 14 - Cartesian Product of Sets

23. Annotated Notes - Lecture 13,14 - Cartesian Product

24. Weekly Quiz 2 - Set Theory

25. Lecture 15 - Relations

26. Lecture 16 - Counting Number of Relations

27. Lecture 17 - Relation on a Set

28. Annotated Notes - Lecture 15-17 - Relations

29. Lecture 18 - Understanding Relations Part 1

30. Lecture 19 - Understanding Relations Part 2

31. Lecture 20 - Types of Binary Relations

32. Lecture 21 - Reflexive Relation

33. Annotated Notes - Lecture 18-21 - Understanding Relations & Reflexive Relation

34. Lecture 22 - Symmetric Relation

35. Lecture 23 - Antisymmetric Relation

36. Annotated Notes - Lecture 22,23 - Symmetric Relation

37. Lecture 24 - Antisymmetric Relation Definition 2

38. Lecture 25 - Asymmetric Relation

39. Example 1 - Symmetric, Antisymmetric, Asymmetric

40. Example 2 - Symmetric, Antisymmetric, Asymmetric

41. Lecture 26 - Transitive Relation

42. Example 1 - Transitive Relation

43. Annotated Notes - Lecture 24-26 - Transitive Relation

44. Lecture 27 - Equivalence Relation Definition

45. Annotated Notes - Lecture 27 - Equivalence Relation Definition

46. Lecture 28 - Partition of a Set

47. Annotated Notes - Lecture 28 - Partition of a Set

48. Summary Lecture - Partition of a Set

49. Annotated Notes - Summary Lecture - Partition of a Set

50. Lecture 29 - Equivalence Relation Complete Analysis Part 1

51. Annotated Notes - Lecture 29 - Equivalence Relation Complete Analysis Part 1

52. Practice Set 2 - Relations - Set Theory (Video Solution Below)

53. Practice Set 2 - Video Solutions

54. Lecture 30 - Equivalence Relation Complete Analysis Part 2

55. Lecture 31 - Graph of Equivalence Relation

56. Lecture 32 - Practice Equivalence Relation

57. Annotated Notes - Lecture 30-32 - Equivalence Relation Complete Analysis Part 2

58. Summary Lecture - Equivalence Relations

59. Annotated Notes - Summary Lecture - Equivalence Relations

60. Practice Set 3 - Equivalence Relations - Set Theory (Video Solution Below)

61. Practice Set 3 - Video Solutions

62. Lecture 33 - Partial Order Relation

63. Annotated Notes - Lecture 33 - Partial Order Relation

64. Lecture 34 - Total Order Relation

65. Lecture 35 - Hasse Diagram of POSET

66. Lecture 36 - Special Elements of POSET

67. Annotated Notes - Lecture 34-36 - Total Order Relation, Hasse Diagram, Elements of POSET

68. Lecture 37 - Practice Questions on Hasse Diagrams

69. Lecture 38 - Upper Bound, Lower Bound, LUB, GLB

70. Annotated Notes - Lecture 37,38 - Upper Bound, Lower Bound, LUB, GLB

71. Lecture 39 - Practice Questions on GLB, LUB

72. Lecture 40 - Hasse Diagram of a Total Order Relation

73. Annotated Notes - Lecture 39,40 - Hasse Diagram of a Total Order Relation

74. Lecture 41 - Lattice

75. Annotated Notes - Lecture 41 - Lattice

76. Lecture 42 - Hasse Diagram to Partial Order Relation

77. Lecture 43 - Hasse Diagram to Partial Order Relation Part 2

78. Annotated Notes - Lecture 42,43 - Hasse Diagram to Partial Order Relation

79. Lecture 44 - Properties of Lattices

80. Annotated Notes - Lecture 44 - Properties of Lattices

81. Lecture 45 - Sublattice

82. Lecture 46 - Questions on Minimal, Maximal Elements in POSET Part 1

83. Annotated Notes - Lecture 45,46 - Sublattice

84. Lecture 47 - Questions on Minimal, Maximal Elements in POSET Part 2

85. Annotated Notes - Lecture 47 - Questions on Minimal, Maximal Elements in POSET Part 2

86. Practice Set 4 - Partial Order Relations & Lattices - Set Theory (Video Solution Below)

87. Practice Set 4 - Video Solutions

88. Lecture 48 - Questions - Maximal, Greatest Elements in a Lattice

89. Annotated Notes - Lecture 48 - Questions - Maximal, Greatest Elements in a Lattice

90. Lecture 49 - Properties of Every Lattice

91. Annotated Notes - Lecture 49 - Properties of Every Lattice

92. Lecture 50 - Practice Questions on Sublattice

93. Annotated Notes - Lecture 50 - Practice Questions on Sublattice

94. Lecture 51 - Types of Lattices

95. Lecture 52 - Bounded Lattice

96. Annotated Notes - Lecture 51, 52 - Bounded Lattice

97. Lecture 53 - Identity Property in Lattices, Domination Law

98. Lecture 54 - Complemented Lattice

99. Annotated Notes - Lecture 53,54 - Identity Property in Lattices, Complemented Lattice

100. Weekly Quiz 13 - Equivalence Relation

101. Lecture 55 - Distributive Lattice

102. Annotated Notes - Lecture 55 - Distributive Lattice

103. Lecture 56 - Practice Questions on Types of Lattice

104. Lecture 57 - Boolean Lattice

105. Lecture 58 - Why Boolean Lattice is called a Boolean Algebra

106. Lecture 59 - Complete Analysis of Total Order Relation

107. Lecture 60 - Complete Analysis of Powerset Lattice

108. Annotated Notes - Lecture 56-60 - Boolean Lattice

109. Lecture 61 - Complete Analysis of Divisibility Relation - Part 1

110. Lecture 62 - Complete Analysis of Divisibility Relation - Part 2

111. Annotated Notes - Lecture 61,62 - Division Lattice Dn Complete Analysis

112. (NEW) Refinement of a Partition | GATE 2007, 1998

113. Annotated Notes - Refinement of a Partition

114. (NEW) Constructing Total Order from Partial Order - GATE 2024, 1997

115. Annotated Notes - Constructing Total Order from Partial Order

1. Lecture 1 - Function Definition & Terminology

2. Lecture 2 - Number of Functions

3. Lecture 3 - Representations of Function, Image of a Subset of Domain

4. Lecture 4 - Types of Functions - Injective, Surjective, Bijective

5. Annotated Notes - Lecture 1-4 - Functions

6. Lecture 5 - Practice Questions on Types of Functions

7. Lecture 6 - Set Operations on Relations

8. Lecture 7 - Composition Operation

9. Annotated Notes - Lecture 5-7 - Operations on Functions

10. Lecture 8 - Inverse of a Function

11. Annotated Notes - Lecture 8 - Inverse of a Function

12. Weekly Quiz 1 - Functions

13. Functions - Summary, Practice & GATE PYQs

1. (OPTIONAL) Lecture 1 - Abstract Algebra - Introduction & Motivation

2. (OPTIONAL) Lecture 2 - Abstract Algebra Origin & The Galois Story

3. Lecture 3 - Abstract Algebra GATE Syllabus

4. Lecture 4 - Binary Operation & The Closure Property

5. Lecture 5 - The Associative Property

6. Lecture 6 - The Identity Property

7. Annotated Notes - Lecture 1-6 - Abstract Algebra & Binary Operation

8. Lecture 7 - Practice Questions on Binary Operation

9. Lecture 8 - Important Properties of Identity Element

10. Lecture 9 - The Inverse Property

11. Lecture 10 - The Commutative Property

12. Lecture 11 - Classification of Binary Algebraic Structures

13. Lecture 12 - Practice Questions on Binary Operations

14. Annotated Notes - Lecture 7-12 - Classification of Binary Algebraic Structures

15. Summary Lecture 1 - Introduction to Algebraic Structure

16. Summary Lecture 2 - Binary Operation, Closure Property

17. Summary Lecture 3 - Questions on Binary Operation

18. Summary Lecture 4 - More Questions on Binary Operation

19. Summary Lecture 5 - Associative, Commutative Property

20. Summary Lecture 6 - Questions on Associative, Commutative Property

21. Annotated Notes - Summary Lectures 1-6 - Group Theory

22. Practice Set 1 - Group Theory

23. Lecture 13 - Properties of Monoid

24. Lecture 14 - Group Theory Practice Set-1 Question 25 Solution

25. Lecture 15 - Practice Questions on Monoid, Group

26. Lecture 16 - nth Roots of Unity is an Abelian Group under Multiplication

27. Lecture 17 - Addition Modulo n Group

28. Lecture 18 - Group Properties

29. Annotated Notes - Lecture 13-18 - Some Important Groups & Group Properties

30. Lecture 19 - Associativity & Parentheses

31. Lecture 20 - Cayley Table

32. Annotated Notes - Lecture 19, 20 - Cayley Table

33. Lecture 21 - Group Properties Part 2

34. Annotated Notes - Lecture 21 - Group Properties Part 2

35. Lecture 22 - Checking Associative Property in the Cayley Table

36. Annotated Notes - Lecture 22 - Checking Associative Property in the Cayley Table

37. Lecture 23A - Cayley Table of a Group

38. Annotated Notes - Lecture 23A - Cayley Table of a Group

39. Lecture 23B - Practice Question Cayley Table

40. Annotated Notes - Lecture 23B - Practice Question Cayley Table

41. Lecture 24 - Monoid Vs Group

42. Annotated Notes - Lecture 24 - Monoid Vs Group

43. Lecture 25A - Groups of Small Order

44. Lecture 25B - Groups of Order 4

45. Lecture 25C - Practice Question - Group of Small Order

46. Annotated Notes - Lecture 25 - Groups of Small Order

47. Lecture 26 - Power of an Element in a Group

48. Lecture 27A - Subgroup

49. Lecture 27B - Subgroup Generated by an Element

50. Annotated Notes - Lecture 26,27 - Subgroup

51. Lecture 28 - Relatively Prime Integers (Coprime Numbers)

52. Lecture 29 - Multiplication Modulo n Group - Unit Group Un

53. Lecture 30 - Practice Question - Multiplication Modulo Group Un

54. Annotated Notes - Lecture 28-30 - Multiplication Modulo n Group - Unit Group Un

55. Lecture 31 - Practice Question on Subgroup Generated by an Element

56. Lecture 32A - Order of an Element in a Group

57. Lecture 32B - Summary Lecture - Order of an Element

58. Lecture 33 - Cyclic Group

59. Lecture 34 - Practice Question on Subgroup

60. Annotated Notes - Lecture 31-34 - Order of an Element & Cyclic Group

61. Lecture 35A - A lot of Practice Questions on Groups

62. Lecture 35B - Some More Practice Questions on Groups

63. Lecture 36 - Lagranges Theorem

64. Lecture 37 - Summary - Groups of Specific Orders

65. Lecture 38 - Alternative Definitions of Abelian Group

66. Lecture 39 - Intersection of Subgroups

67. Lecture 40 - Alternative Definitions of Subgroup

68. Annotated Notes - Lecture 35-40 - Lagranges Theorem

69. GATE Question - GATE CSE 1989 - Number of Commutative Binary Operations

70. GATE Question - GATE CSE 1994 | Associative Non-Commutative Operation on N

71. GATE Question - GATE CSE 2013 - Binary operation ⊕ Question

72. GATE Question - GATE CSE IT 2006 - Identity Element

73. GATE Question - GATE CSE 2003 - Binary Operators + and

74. GATE Question - GATE CSE 1988 - Abelian Group

75. GATE Question - GATE CSE 1992 - Group of Even Order

76. Weekly Quiz 16 - Group Theory - With Video Solution Available

1. Lecture 1 - Introduction to Combinatorics

2. Lecture 2 - The Sum Rule

3. Lecture 3A - The Product Rule

4. Lecture 3B - Practice Questions

5. Lecture 4 - The Subtraction Rule

6. Annotated Notes - Lecture 1-4 - Basic Counting Principles

7. Lecture 5 - Practice Questions

8. Lecture 6 - Counting By Case

9. Lecture 7 - The Complement Rule

10. Lecture 8A - The Division Rule

11. Annotated Notes - Lecture 5-8A - The Complement, By Case Rule

12. Lecture 8B - The Division Rule

13. Lecture 9 - Factorial, nCr, nPr

14. Lecture 10 - Permutation & Combination

15. Lecture 11 - Combination

16. Annotated Notes - Lecture 8B-11 - Permutation & Combination

17. Lecture 12 - Practice Questions & the Most Common Mistake

18. Lecture 13 - Two Standard Templates & More Practice Questions

19. Lecture 14A - Combinatorial Arguments

20. Annotated Notes - Lecture 12-14A - Two Standard Templates & Combinatorial Arguments

21. Lecture 14B - Combinatorial Arguments

22. Lecture 14C - Combinatorial Arguments

23. Lecture 14D - Practice Combinatorial Arguments

24. Lecture 15 - Binomial Theorem

25. Lecture 16 - Bijective Proofs

26. Lecture 17 - Permutation with Repetition

27. Annotated Notes - Lecture 14B-17 - Binomial Theorem, Permutation with repetition

28. Annotated Notes - Lecture 14D - Practice Combinatorial Arguments

29. Lecture 18 - Many Practice Questions

30. Lecture 19A - Distributing Objects into Boxes - DODB

31. Lecture 19B - Practice Questions on DODB Template

32. Lecture 20A - IODB Template - Star Bar Problem

33. Annotated Notes - Lecture 18-20A - Distributing Objects into Boxes - DODB & IOIB

34. Annotated Notes - Lecture 19B - Practice Questions on DODB Template

35. Lecture 20B - Combination with Repetition - IODB Template 2

36. Lecture 20C - Non-Negative Integer Solutions - IODB Template 3

37. Lecture 20D - Multiset Problem - IODB Template 4

38. Lecture 20E - Non-Decreasing integer Sequence - IODB Template 5

39. Annotated Notes - Lecture 20B-20E - IODB Templates

40. Lecture 20F - Practice Questions - IODB

41. Lecture 20G - Integer Composition - IODB Template 6

42. Lecture 21 - DOIB Problem

43. Lecture 22 - IOIB Problem

44. Lecture 23 - Summary - Distributing Objects into Boxes

45. Annotated Notes - Lecture 20F-23 - DOIB, IOIB Problems

46. Lecture 24A - Inclusion Exclusion Principle

47. Lecture 24B - Practice Questions - Inclusion Exclusion

48. Annotated Notes - Lecture 24A,24B - Inclusion Exclusion Principle

49. Lecture 24C - Derangement - Inclusion Exclusion Principle Application

50. Lecture 24D - Onto Functions

51. Annotated Notes - Lecture 24C,24D - Derangement, Onto Functions

52. Lecture 25A - Generating Function

53. Lecture 25B - Generating Function Part 2

54. Lecture 25C - Generating Function Part 3

55. Annotated Notes - Lecture 25A-25C - Generating Function

56. Lecture 25D - Practice Questions - Generating Function Part 4

57. Lecture 25E - AGP Series & Generating Function Part 5

58. GATE CSE 2022 Question on Generating Function

59. Lecture 25F - Extended Binomial Theorem - Generating Function - Part 6

60. GATE CSE 2016 Question on Generating Function

61. GATE CSE 2017 Question on Ordinary Generating Function

62. GATE CSE 2018 Question on Generating Function

63. GATE CSE 2005 Question on Generating Function

64. TIFR CSE 2010 Question on Generating Function

65. Lecture 25G - Summary of Generating Function

66. Annotated Notes - Lecture 25D-25F - Extended Binomial Theorem & Generating Function

67. Lecture 26 - Recurrence Relations

68. Annotated Notes - Lecture 26 - Recurrence Relations

69. Practice Set 1 - Combinatorics - Berkeley University Questions

70. Practice Set-1 Solutions - Berkeley Questions - Combinatorics

71. Annotated Notes - Practice Set 1 Solutions - Berkeley Questions

72. Practice Set 2 - Recurrence Relations ALL Standard Questions - Combinatorics

73. Practice Set-2 Solutions - Recurrence Relation Questions - Combinatorics

74. Annotated Notes - Practice Set 2 Solution - Recurrence Relations

75. Lecture 27A - Pigeonhole Principle

76. Annotated Notes - Lecture 27A - Pigeonhole Principle

77. Lecture 27B - The Generalized Pigeonhole Principle

78. Annotated Notes - Lecture 27B - The Generalized Pigeonhole Principle

79. Lecture 27C - Practice - Pigeonhole Principle

80. Annotated Notes - Lecture 27C - Practice Pigeon Hole Principle

81. Practice Set 3 - Derangement ALL Standard Questions - Combinatorics

82. Practice Set 3 Solutions - Derangement - Combinatorics

83. Annotated Notes - Practice Set 3 Solutions - Derangement All Questions

84. Weekly Quiz 19 - Combinatorics

1. Lecture 1 - Why Study Graph Theory - The Motivation

2. Lecture 2 - Basic Terminology - Graph Theory

3. Lecture 2B - Basics - Degree, Adjacency

4. Annotated Notes - Lecture 1-2B - Introduction & Terminology

5. Lecture 2C - Practice Questions - Basics

6. Lecture 3A - Handshaking Theorem

7. Lecture 3B - Handshaking Theorem for Directed Graphs

8. Lecture 4A - Cycle, Path, Walk in Simple Graphs

9. Annotated Notes - Lecture 2C-4A - Handshaking Theorem

10. Lecture 4B - Walk, Path Revise & Practice

11. Lecture 4C - Distance and Diameter

12. Lecture 5A - Special Type of Graphs

13. Lecture 5B - Special Type of Graphs Part 2

14. Lecture 6 - GATE & TIFR Questions on Degree Concept

15. Lecture 7 - Subgraph

16. Annotated Notes - Lecture 4B-7 - Walk, Path, Subgraph, Diameter

17. GATE CSE 2001 - Number of Simple Graphs

18. Lecture 8A - Graph Isomorphism Part 1 - Definition

19. Lecture 8B - GATE 2012 Question - Graph Isomorphism

20. My OLD Video for GATE 2012 Question

21. Lecture 8C - Graph Isomorphism is an Equivalence Relation

22. Lecture 8D - Graph Complement and Self Complementary Graph

23. Lecture 8E - Practice - Graph Isomorphism

24. Lecture 9A - Connected Components

25. Annotated Notes - Lecture 8A-9A - Graph Isomorphism, Complement, Components

26. Lecture 9B - Complement of Disconnected Graph

27. Lecture 9C - TIFR CSE 2018 Question

28. Lecture 9D - A Simple Practice Question

29. Lecture 10A - Bipartite Graphs

30. Lecture 10B - Complete Bipartite Graph

31. Annotated Notes - Lecture 9B-10B - Bipartite Graphs, Graph Complement

32. Lecture 10C - Practice Questions - Bipartite Graphs

33. Lecture 11A - Trees - Part 1 - Cyclic Graphs Acyclic Graph

34. Lecture 11B - Trees - Part 2 - Tree and Forest Definitions

35. Lecture 11C - Trees - Part 3 - Many Definitions of Tree

36. Lecture 11D - Tree Part 4 - Every Tree has at least two vertices of degree 1

37. Annotated Notes - Lecture 10C-11D - Trees, Rooted Tree

38. Lecture 11E - ALL Questions - Trees, Forest

39. Lecture 12A - Rooted Trees

40. Lecture 12B - Rooted Tree Part 2 - Binary Tree. Full Binary Tree

41. Lecture 13A - Questions Related to Components

42. Annotated Notes - Lecture 11E-13A - Rooted Trees, Binary Tree

43. Lecture 13B - Questions on Rooted Trees

44. Lecture 14A - Clique, Independent Set - Part 1

45. Lecture 14B - UGC NET CSE 2016 Clique Question

46. Lecture 14C - Clique, Independent Set - Part 3

47. Annotated Notes - Lecture 13B-14C - Clique, Independent Set

48. Lecture 15A - Vertex Cover, Edge Cover - Part 1

49. Lecture 15B - Vertex Cover, Edge Cover - Part 2 - Analysis

50. Lecture 15C - Relation between Vertex Cover & Independent Set

51. Meme - Relation between Vertex Cover & Independent Set

52. Annotated Notes - Lecture 15A-15C - Vertex Cover, Edge Cover

53. Lecture 16A - Matching Part 1 - Perfect Matching, Matching Number

54. Lecture 16B - Matching Part 2 - Matching & Covering Analysis

55. Annotated Notes - Lecture 16A-16B - Matching

56. Lecture 17A - Graph Coloring Part 1 - Vertex Coloring

57. Lecture 17B - Graph Coloring Part 2 - Greedy Algorithm for Vertex Coloring

58. Lecture 17C - Graph Coloring Part 3 - All GATE TIFR Questions

59. Annotated Notes - Lecture 17A-17C - Graph Coloring - Vertex Coloring

60. Lecture 17D - Graph Coloring Part 4 - Brooks Theorem for Vertex Coloring

61. Lecture 17E - Graph Coloring Part 5 - Edge Coloring

62. Annotated Notes - Lecture 17D-17E - Edge Coloring

63. Lecture 18 - Graph Realization Problem - Havel Hakimi Theorem

64. Annotated Notes - Lecture 18 - Graph Realization Problem - Havel Hakimi Theorem

65. Lecture 19A - Cut Vertex, Cut Edge

66. Lecture 19B - Connectivity Number, Vertex Cut, Edge Cut

67. Annotated Notes - Lecture 19A-19B - Connectivity Number, Cut

68. Lecture 20A - Strongly Connected Components - Part 1

69. Lecture 20B - Weakly Connected Graph

70. Lecture 20C - Strongly Connected Components - Part 3 - Associated DAG

71. Annotated Notes - Lecture 20A-20C - Strongly Connected Components

72. Lecture 21A - Euler Circuit & Graph

73. Lecture 21B - Hamiltonian Cycle & Graphs

74. Annotated Notes - Lecture 21A-21B - Euler Graph & Hamiltonian Graph

75. Euler & Hamiltonian Cycles - ALL Previous Exam Questions

76. Lecture 22A - Planar Graph Introduction

77. Lecture 22B - Planar Graphs - Faces & Degree of a face

78. Annotated Notes - Lecture 22A-22B - Planar Graphs

79. Lecture 22C - Planar Graph - Euler Formula

80. Lecture 22D - Planar Graphs - Some Important Results & Four Color Theorem

81. Annotated Notes - Lecture 22C-22D - Planar Graph - Euler Formula

82. Lecture 23A - Adjacency Matrix, Adjacency List

83. Lecture 23B - GATE 1987-9d Adjacency List

84. Lecture 23C - GATE 1988-2xvi Adjacency Matrix

85. Lecture 23D - TIFR CSE 2015 Adjacency Matrix

86. Annotated Notes - Lecture 23 - Adjacency Matrix, Adjacency List

87. Lecture 24A - Powers of Adjacency Matrix of a Graph

88. Lecture 24B - Applications of Powers of Adjacency Matrix of a Graph

89. Annotated Notes - Lecture 24A-24B - Powers of Adjacency Matrix of a Graph

90. Lecture 24C - Applications of Powers of Adjacency Matrix Part 2

91. Annotated Notes - Lecture 24C - Applications of Powers of Adjacency Matrix Part 2

1. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Discrete Mathematics Notes

2. Propositional Logic Notes - Students Notes by Abhishek Patel

3. First Order Logic Notes - Students Notes by Abhishek Patel

4. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Discrete Mathematics

1. Lecture 1a- Why we need to study C programming | Why we need to study ALL GATE CSE subjects ?

2. Lecture 1b - First C Program

3. Lecture 1c. Detour - Number System

4. Lecture 1d. Detour - Number System

5. Lecture 1 Annotated Notes

6. Home Work -1

7. LIVE: HomeWork -1 Solution Discussion

8. LIVE Session 1 Annotated Notes

9. Lecture 2a.Signed and Unsigned Numbers in Memory

10. Lecture 2b. Integer Promotion

11. Lecture 2c. Integer Promotion more questions

12. Lecture 2d. Beautiful Intution Behind 2s Complement

13. Lecture 2e. Type Conversion in C Programming

14. Lecture 2 Annotated Notes

15. Homework 2

16. Lecture 3a. If -Else Statements

17. Lecture 3b. Switch-Case Statements

18. Lecture 3c. While and For Loops

19. Lecture 3d. Do-While Loop, Break, and Continue Statement

20. Lecture 3 Annotated Notes

21. LIVE: HomeWork -2 Solution Discussion and WQ12 Discussion

22. LIVE Session 2 Annotated Notes

23. Lecture 4a. Operators in C Programming

24. Lecture 4b. Bitwise Operators in C Programming

25. Lecture 4c. Assignment, Conditional, and Comma Operators | GATE 2015, 2008

26. Lecture 4d.Sequence Points

27. Lecture 4e. Short Circuiting, Order of evaluation, and Associativity for logical and-or

28. Lecture 4 Annotated Notes

29. Homework 3

30. LIVE Homework 3 Solution

31. LIVE Session 3 Annotated Notes

32. Weekly Quiz 12 - Programming

1. Lecture 5a. Functions in C programming

2. Lecture 5b. GATE 2019 Question

3. Lecture 5c. A Journey of the Program | The Big Picture | Compiler, Linker, Assembler, and Loader

4. 5d. How Compiler Generates relocatable code ?

5. Lecture 5 Annotated Notes

6. Lecture 6a.Memory Layout

7. Lecture 6b. auto and register Storage classes

8. Lecture 6c. Static Storage Class

9. Lecture 6d. Extern Storage Class

10. Lecture 6e. OPTIONAL Extern with 2 files

11. Lecture 6f. Practice Examples with extern keyword

12. Lecture 6 Annotated Notes

13. Homework 4 Extern Variable

14. LIVE Session 4: Extern Homework

15. LIVE Session 4 Annotated Notes

1. Lecture 7a. Introduction to Recursion

2. Lecture 7b.Examples on Recursion

3. Lecture 7c.More Examples on Recursion

4. Lecture 7 Annotated Notes

5. LIVE Session 5: Questions on Recursion

6. LIVE Session 5 Annotated Notes

7. Lecture 8a. Introduction to Pointers

8. Lecture 8b.Accessing the variable through the Pointer

9. Lecture 8c.Passing Pointer to Function

10. Lecture 8d.Introduction to Array

11. Lecture 8 Annotated Notes

12. Homework 5 Easy Pointer Questions

13. LIVE Session 6: Homework 5 Solution

14. LIVE Session 6 Annotated Notes

15. Lecture 9a.Array and Pointer together

16. Lecture 9b.Sizeof Operator in C

17. LIVE: Solving Few Questions

18. Lecture 9c.Any Pointer can point anywhere

19. Lecture 9d.Valid Arithmetic Pointer Operations

20. Lecture 9 + LIVE Annotated Notes

21. Optional Homework 6

22. OPTIONAL LIVE Homework 6 Discussion

23. Optional LIVE Session Annotated Notes

24. Optional and Skip 10a. Little Endian and Big Endian COA concept

25. Lecture 10b. Passing One D array to the Function

26. Lecture 10c.Character array and strings

27. Lecture 10d. Double Pointer | GATE 2008

28. Lecture 10 Annotated Notes

29. Lecture 11a. 2 D Arrays in C programming

30. Practice Questions on char pointers, Double Pointers, and 2D arrays

31. LIVE: Solution of Practice Questions on char pointers, Double Pointers, and 2D arrays

32. LIVE Session Annotated Notes

33. Lecture 11b. Pointer to an Array

34. Lecture 11c. Array of pointers

35. Lecture 11D. Passing 2D array to the function

36. Lecture 11 Annotated Notes

37. Lecture 12. Optional and Advance - Pointer Arithmetic on 2D and 3D arrays

38. Lecture 12 Annotated Notes

39. Lecture 13a. Reading Complex Declarations

40. Practice Set 30 Pointer questions

41. LIVE: Solution of above Practice Questions

42. Annotated Notes - LIVE Solution Practice Set 30 Pointer questions

43. Lecture 13b. Void Pointer

44. Lecture 13c.You think you know pointers ?

45. Lecture 13d.Malloc and Free

46. Lecture 13e. Memory leak and Dangling Pointer

47. Lecture 13 Annotated Notes

48. Pointer Summary Playlist

49. Structures in C Playlist

50. Struct Annotated Notes

51. 25 Questions Practice Set

52. LIVE: Solution of above 25 Practice Questions

53. Annotated Notes- LIVE- Solution of above 25 Practice Questions

54. Lecture 14. Miscellaneous topics - getchar, putchar, Static and Dynamic scoping, call by value, call by reference

55. Lecture 14 Annotated Notes

56. GATE 2004 Question

57. Weekly Quiz 15 - Programming

58. Weekly Quiz 15 Discussion

59. Annotated Notes Weekly Quiz 15 Discussion

60. Weekly Quiz 17 - Programming

61. Weekly Quiz 17 Discussion

62. Weekly Quiz 17 Discussion Annotated Notes

63. Weekly Quiz 18 - Programming

1. C Programming Markdown Notes - By Euler

2. C Programming Handwritten Notes of a GO Classes Previous Topper - Neel Rayal GATE CSE 2023 AIR 85

3. Neel Rayal Interview (AIR 85, GATE CSE 2023, GO Classes Complete Course Student)

4. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - C Programming

5. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - C Programming Notes

1. Lecture 1: Introduction to Operating Systems | What is OS and Why we need it ?

2. Annotated Notes Lecture 1

3. Lecture 2a: How Operating System create a new process | Process Control Block

4. Lecture 2b: Forking the Identical Copies | GATE 2005 very nice question | Bit about logical address

5. Annotated Notes Lecture 2

6. Lecture 3: Fork Questions | Process Graph | Fork Tree

7. Annotated Notes Lecture 3

8. Lecture 4 exec | Creating a Process | System Calls

9. Annotated Notes Lecture 4

10. Lecture 5 System Call Execution | Threads

11. Annotated Notes Lecture 5

12. Lecture 6: User Level Threads and Kernel Level Threads | Threads

13. Annotated Notes Lecture 6

14. Lecture 7: Thread Mapping models, and Context Switching

15. Annotated Notes Lecture 7

16. Must Watch Marathon: Summary So Far

17. Lecture 8 : Process State Diagram and Schedulers

18. Annotated Notes Lecture 8

19. Lecture 9 : Scheduling Algorithms: FCFS

20. Annotated Notes Lecture 9

21. Lecture 10 : Scheduling Algorithms: Shortest Job First (SJF)

22. Annotated Notes Lecture 10

23. Lecture 11 : Scheduling Algorithms: Round Robin

24. Annotated Notes Lecture 11

25. Lecture 12 : Scheduling Algorithms: SRTF

26. Annotated Notes Lecture 12

27. Lecture 13 : Scheduling Algorithms: Priority Scheduling

28. Annotated Notes Lecture 13

29. Lecture 14 : InterProcess Communication (IPC)

30. Annotated Notes Lecture 14

31. Lecture 15: Introduction to Synchronisation

32. Annotated Notes Lecture 15

33. Lecture 16: Critical Section Solution Requirements

34. Annotated Notes Lecture 16

35. Lecture 17: Questions on Critical Section Solution Requirements

36. Annotated Notes Lecture 17

37. Lecture 18: Petersons solution and Hardware Solutions

38. Annotated Notes Lecture 18

39. Lecture 19: Atomic Hardware Instructions and Semaphores

40. Annotated Notes Lecture 19

41. Revision Session

42. Lecture 20: Semaphores PYQs

43. Annotated Notes Lecture 20

44. Lecture 21 Classic Synchronisation Problems: Producer Consumer, Reader Writer

45. Annotated Notes Lecture 21

46. Lecture 22 Classic Synchronisation Problems: Reader Writer, Dining Philosophers

47. Annotated Notes Lecture 22

48. Please Rate us to help us

49. A Journey of the Program | The Big Picture | Compiler, Linker, Assembler, and Loader

50. Lecture 23 Memory Management 1: Base Bound Registers, Segmentation

51. Annotated Notes Lecture 23

52. [Optional] Lecture 24 Questions on Base Bound Registers, Segmentation

53. Annotated Notes Lecture 24

54. Lecture 25: Introduction to Paging

55. Annotated Notes Lecture 25

56. Lecture 26:Single level Paging questions

57. Annotated Notes Lecture 26

58. Lecture 27: Multi Level Paging

59. Annotated Notes Lecture 27

60. Lecture 28: Multi Level Paging -2

61. Annotated Notes Lecture 28

62. Lecture 29: Multi Level Paging -3 (Reducing Page Table Size)

63. Annotated Notes Lecture 29

64. Lecture 30: Memory Management Summary So Far, and Hashed, Inverted Page Tables

65. Annotated Notes Lecture 30 Multilevel Paging Revision, Hashed, and Inverted Page Table

66. Lecture 31: Segmentation with Paging

67. Annotated Notes Lecture 31 Segmentation with Paging

68. Lecture 32: Demand Paging and Page replacement Algorithms

69. Annotated Notes Lecture 32 Demand Paging and Page replacement Algorithms

70. Lecture 33: Remaining Topics in Memory Management: Translation Lookaside Buffer, Dynamic Allocation Strategies

71. GATE 2020 TLB Page Fault Question

72. Annotated Notes GATE 2020 Question

73. Annotated Notes Lecture 33 TLB, Dynamic Allocation Strategies

74. Please Rate us on course page

75. Lecture 34: Deadlock in Operating Systems

76. Annotated Notes Lecture 34 Deadlock in OS

77. Lecture 35: Deadlock Avoidance (Bankers Algorithm), Detection & Recovery

78. Annotated Notes Lecture 35 Deadlock Avoidance, Detection & Recovery

1. File System Implementation

2. Practice questions and PYQs in File System Implementation

3. File System Annotated Notes

4. Feedback of the course

1. Youtube Lectures on PYQs

1. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Operating System

2. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Operating Systems Notes

1. Lecture 1 Simple Interest and Compound Interest

2. SI & CI

3. Lecture 2 Percentage

4. Percentage

5. Lecture 3 Ratio & Proportion

6. Ratio & Proportion

7. Lecture 4 Profit loss and Discount

8. Profit Loss and Discount

9. Time and Work

10. Time & Work

11. Time Speed and Distance

12. Time Speed and Distance

13. Number System

14. Number System

15. Spatial Aptitude

16. Spatial Aptitude

17. Analytical Aptitude(Part-1)

18. Analtical Aptitude(Part-1)

19. Analytical Aptitude Part-2

20. Analtical Aptitude(Part-2)

1. Absolute Value

2. Annotated Notes - Absolute Value

3. Floor & Ceiling Functions

4. Annotated Notes - Floor & Ceiling Functions

1. Verbal Aptitude (English Grammar) Part 1 - Many GATE PYQs

2. Verbal Aptitude Part 2

3. Verbal Aptitude Part 3

1. About Lecture 1

2. (OPTIONAL) Lecture 1 - Theory of Computation Introduction, Motivation, Overview

3. Annotated Notes - Lecture 1 - Theory of Computation Introduction

4. Lecture 2A - Basic Concepts - Alphabet, String

5. Lecture 2B - Basic Concepts - Concatenation of Strings

6. Lecture 2C - Basic Concepts - Prefix, Suffix, Substring, Subsequence

7. Lecture 3A - Language

8. Lecture 3B - Set Operations on Languages

9. Lecture 3C - Exponentiation of Language, Kleene Closure

10. Lecture 4 - Practice Questions - Basic Concepts

11. Annotated Notes - Lecture 2-4 - Basic Concepts

12. Lecture 5 - Complement of a Language

13. Homework 1 - Basic Concepts - Peter Linz Exercise 1.2 Questions

14. Homework 1 - Video Solution

15. Annotated Notes - Homework 1 - Basic Concepts

16. Lecture 6 - What we study in Theory of Computation & Why?

17. Lecture 7A - Finite Automata - Introduction

18. Annotated Notes - Lecture 5-7A - Complement of Language & Finite Automata Introduction

19. Lecture 7B - Finite Automata - Part 2

20. Lecture 7C - Finite Automata Formal Definition & Rules

21. Lecture 8A - Deterministic Finite Automata DFA

22. Lecture 8B - Designing DFA Part 1

23. Lecture 8C - Designing DFA Part 2

24. Lecture 8D - Regular Language

25. Annotated Notes - Lecture 7B-8D - Finite Automata, DFA & Designing DFA

26. Lecture 8E - Designing DFA Part 3

27. Lecture 8F - Designing DFA Part 4

28. Lecture 8G - Designing DFA Part 5

29. Lecture 8H - Designing DFA Part 6

30. Lecture 9 - Extended Transition Function in DFA

31. Lecture 10A - DFA for Complement of a Regular Language

32. Lecture 10B - Practice Questions

33. Annotated Notes - Lecture 8E-10B - Designing DFAs & Complement

34. Homework 2 - Basics & DFA - Boston University Questions

35. Homework 2 - Video Solution

36. Annotated Notes - Homework 2 - Basics & DFA - Boston University Questions

37. Lecture 10C - Recap - DFA for Complement of a Regular Language

38. Lecture 11 - The Product Construction of DFAs

39. Annotated Notes - Lecture 10C-11 - The Product Construction of DFAs

40. Lecture 12A - DFA Minimization - Part 1

41. Lecture 12B - DFA Minimization Part 2 - State Equivalence

42. Lecture 12C - DFA Minimization Part 3 - Practice Questions

43. Lecture 12D - DFA Minimization Part 4 - Practice Questions State Equivalence

44. Lecture 12E - DFA Minimization Part 5 - Partition Algorithm for DFA Minimization

45. Lecture 12F - DFA Minimization Part 6 - Practice Partition Algorithm

46. Annotated Notes - Lecture 12A-12F - DFA Minimization

47. Lecture 13A - Configuration in DFA

48. Lecture 13B - Our First Non-Regular Language

49. Lecture 14A - NFA Introduction

50. Lecture 14B - NFA Definition & Rules

51. Lecture 14C - Understanding Non-Determinism

52. Lecture 14D - Designing NFA

53. Annotated Notes - Lecture 13A-14D - NFA

54. Lecture 14E - Practice Questions

55. Lecture 14F - Null Moves in NFAs

56. Lecture 14G - Peter Linz Question on NFA

57. Lecture 14H - NFA Practice & NFA Extended Transition Function

58. Lecture 14i - NFA Formal Definition & Rules

59. Annotated Notes - Lecture 14E-14i - NFAs

60. Lecture 15A - Extended Transition Function

61. Annotated Notes - Lecture 15A - Extended Transition Function

62. Lecture 15B - Equivalence of DFA & NFA

63. Annotated Notes - Lecture 15B - Equivalence of DFA & NFA

64. Weekly Quiz 24 - Finite Automata - Theory of Computation

65. Lecture 16A - Regular Expression Part 1

66. Lecture 16B - Example Regular Expression

67. Annotated Notes - Lecture 16A-16B - Regular Expressions

68. Lecture 16C - A Lot of Practice - Regular Expression

69. Lecture 16D - Regular Expression Analysis

70. Lecture 16E - Practice Questions - Regular Expression

71. Lecture 16F - Regular Expression - Analysis

72. Annotated Notes - Lecture 16C-16F - Regular Expression

73. Lecture 16G - Important Properties of Regular Expressions

74. Lecture 16H - Some Basic Properties of Regular Expressions

75. Annotated Notes - Lecture 16G-16H - Important Properties of Regular Expressions

76. Homework 3 - Regular Expression & FA - University Assignments Questions

77. Homework 3 - Video Solutions

78. Annotated Notes - Homework 3 - Regular Expression & FA - University Assignments Questions

79. Lecture 17A - Equivalence of RE and FA - Part 1 - Somethings About NFAs

80. Lecture 17B - Equivalence of RE and FA - Part 2 - Converting RE to FA

81. Lecture 17C - Equivalence of RE and FA - Part 3 - FA to RE

82. Annotated Notes - Lecture 17A-17C - Equivalence of RE and FA

83. Lecture 17D - Equivalence of RE and FA - Part 4 - FA to RE

84. Lecture 17E - Equivalence of RE and FA - Part 5 - Unary Alphabet DFA Analysis

85. Lecture 17F - Equivalence of RE and FA - Part 6 - The Two Templates

86. Annotated Notes - Lecture 17D-17F - Equivalence of RE and FA

87. Weekly Quiz 25 - Finite Automata & Regular Expression - Theory of Computation

88. Lecture 18A - Pumping Lemma for Regular Languages - Part 1

89. Annotated Notes - Lecture 18A - Pumping Lemma for Regular Languages

90. Lecture 18B - Pumping Lemma for Regular Languages - Part 2

91. Annotated Notes - Lecture 18B - Pumping Lemma for Regular Languages - Part 2

92. Lecture 18C - Pumping Lemma for Regular Languages - Part 3

93. Annotated Notes - Lecture 18C - Pumping Lemma for Regular Languages - Part 3

94. Lecture 18D - Pumping Lemma for Regular Languages - Part 4 - Proof

95. Annotated Notes - Lecture 18D - Pumping Lemma for Regular Languages - Part 4

96. Lecture 18E - Pumping Lemma for Regular Languages - Part 5 - Practice

97. Annotated Notes - Lecture 18E - Pumping Lemma for Regular Languages - Part 5 - Practice

98. Lecture 19A - Myhill Nerode Theorem Part 1

99. Annotated Notes - Lecture 19A - Myhill Nerode Theorem Part 1

100. Lecture 19B - Myhill Nerode Theorem Part 2 - Distinguishable Strings

101. Lecture 19C - Myhill Nerode Theorem Part 3 - Practice

102. Lecture 19D - Myhill Nerode Theorem Part 4 - The Theorem

103. Annotated Notes - Lecture 19B-19D - Myhill Nerode Theorem - Distinguishable Strings

104. Lecture 19E - Revision & Practice - Myhill Nerode Theorem

105. Annotated Notes - Lecture 19E - Revision & Practice - Myhill Nerode Theorem

106. Lecture 19F - Finding Number of States in Minimal DFA - Myhill Nerode Theorem

107. Annotated Notes - Lecture 19F - Finding Number of States in Minimal DFA - Myhill Nerode Theorem

108. Lecture 19G - GATE PYQs on Minimal DFA - Myhill Nerode Theorem

109. Annotated Notes - Lecture 19G - GATE PYQs on Minimal DFA - Myhill Nerode Theorem

110. Weekly Quiz 26 - Finite Automata & Regular Expression - Theory of Computation

111. Feedback & Review

1. Lecture 1A - Context Free Grammars

2. Annotated Notes - Lecture 1A - Context Free Grammars

3. Lecture 1B - Practice & Standard Examples of CFGs

4. Annotated Notes - Lecture 1B - Practice & Standard Examples of CFGs

5. Lecture 1C - Regular Grammars

6. Annotated Notes - Lecture 1C - Regular Grammar

7. Lecture 1D - Every Regular Language is CFL - Proof

8. Annotated Notes - Lecture 1D - Every Regular Language is CFL - Proof

9. Lecture 1E - Regular Grammar to NFA & Vice Versa

10. Annotated Notes - Lecture 1E - Regular Grammar to NFA & Vice Versa

11. Lecture 1F - Ambiguity of CFGs - Part 1 - Derivations, Parse Tree, LMD, RMD

12. Annotated Notes - Lecture 1F - Ambiguity of CFGs - Part 1 - Derivations, Parse Tree, LMD, RMD

13. Lecture 1G - Practice Questions - Parse Tree & Derivations

14. Annotated Notes - Lecture 1G - Practice Questions - Parse Tree & Derivations

15. Lecture 1H - Ambiguity of CFGs & CFLs

16. Annotated Notes - Lecture 1H - Ambiguity of CFGs & CFLs

17. Lecture 2A - Push Down Automata PDA - Definition & Rules

18. Lecture 2B - PDA Practice Questions

19. Annotated Notes - Lecture 2A-2B - Push Down Automata PDA

20. Lecture 2C - PDA Analysis - Understanding PDA Transitions & Non-Determinism

21. PDA Design Example 1 - a^nb^n Language

22. PDA Design Example 2 - a^nb^n+1 Language

23. PDA Design Example 3 - a^nb^m Language

24. PDA Design Example 4 - a^nb^m Language

25. PDA Design Example 5 - a^nb^m Language

26. PDA Design Example 6 - a^nb^2n Language

27. PDA Design Example 7 - a^2nb^n Language

28. Annotated Notes - Lecture 2C - PDA Analysis & Design

29. Lecture 2D - PDA Design More Examples

30. Lecture 2E - PDA Analysis, Empty Stack Acceptance

31. Annotated Notes - Lecture 2D-2E - PDA Design More Examples, Analysis

32. Lecture 2F - Correction in a Question

33. Lecture 2G - Practice - PDA with Empty Stack Acceptance

34. Annotated Notes - Lecture 2F-2G - PDA with Empty Stack Acceptance

35. Lecture 3A - DPDA Part 1 - What is Nondeterminism?

36. Lecture 3B - DPDA and DCFL

37. Annotated Notes - Lecture 3A-3B - DPDA and DCFL

38. Feedback & Review

1. Lecture 1A - Identification of Regular Languages

2. Lecture 1B - Practice - Identification of Regular Languages

3. Lecture 1C - GATE CSE 2014 - Identification of Regular Languages

4. Annotated Notes - Lecture 1A-1C - Identification of Regular Languages

5. Lecture 2A - Identification of CFL, DCFL Languages

6. Lecture 2B - Identification of CFL, DCFL Languages

7. Annotated Notes - Lecture 2A-2B - Identification of CFL, DCFL Languages

8. Feedback & Review

1. Lecture 1A - Closure Properties of Regular Languages

2. Lecture 1B - Closure Properties of Regular Languages - Part 2

3. Annotated Notes - Lecture 1A-1B - Closure Properties of Regular Languages

4. Lecture 2A - Closure Properties of CFLs

5. Annotated Notes - Lecture 2A - Closure Properties of CFLs

6. Lecture 2B - Closure Properties of DCFLs

7. Lecture 3 - Closure Properties of Nonregular Languages

8. Annotated Notes - Lecture 2B-3 - Closure Properties of DCFLs, Nonregular Languages

9. Lecture 4 - Chomsky Hierarchy & Types of Grammars

10. Annotated Notes - Lecture 4 - Chomsky Hierarchy & Types of Grammars

11. Lecture 5 - Non-Closure of Regular Languages

12. Annotated Notes - Lecture 5 - Non-Closure of Regular Languages

13. Lecture 6 - Closure Properties of Finite Languages

14. (OPTIONAL) DCFLs are Not Closed under Concatenation and Kleene Closure

15. GATE CSE 2021 - Number of States in Minimal DFA for L and L-Complement

16. Homework 4 - PDA, CFG, Closure Properties - University Midterm Questions

17. Feedback & Review

1. Lecture 1 - Introduction of Turing Machines

2. Annotated Notes - Lecture 1 - Introduction of Turing Machines

3. About Lecture 2

4. Lecture 2 - Turing Machine Design

5. Lecture 3 - Turing Machine - Formal Definition

6. Lecture 4 - Some Conjectures

7. Annotated Notes - Lecture 2-4 - Turing Machine Design, Definition

8. Lecture 5 - Practice & Revision - Turing Machines

9. Annotated Notes - Lecture 5 - Practice & Revision - Turing Machines

10. Lecture 6 - Understanding Infinite Looping

11. Annotated Notes - Lecture 6 - Understanding Infinite Looping

12. Lecture 7 - Decider, Decidable

13. Annotated Notes - Lecture 7 - Decider, Decidable

14. Lecture 8 - Revision - Story So Far - Turing Machines

15. Lecture 9 - Dovetailing, Variants of TM

16. Annotated Notes - Lecture 8-9 - Dovetailing, Variants of TM

17. Lecture 10 - Encoding and Decidability

18. Annotated Notes - Lecture 10 - Encoding and Decidability

19. Lecture 11 - Language Vs Decision Problem

20. Annotated Notes - Lecture 11 - Language Vs Decision Problem

21. Lecture 12A - Revision & Practice of Encoding

22. Annotated Notes - Lecture 12A - Revision & Practice of Encoding

23. Lecture 12B - Revision & Practice of Decision Problems & Languages

24. Lecture 13 - Logically Solving Decision Problems related to Language of TMs

25. Annotated Notes - Lecture 12B-13 - Revision & Practice of Decision Problems & Languages

26. Lecture 14A - Decision Problems of Regular Languages

27. Lecture 14B - Practice Questions on Decision Problems of Regular Languages

28. Annotated Notes - Lecture 14A-14B - Decision Problems of Regular Languages

29. Lecture 15A - Simplification of Context Free Grammars - Useless Symbols Removal

30. Annotated Notes - Lecture 15A - Simplification of Context Free Grammars - Useless Symbols Removal

31. Lecture 15B - Simplification of CFGs - Null Production, Unit Production Removal

32. Lecture 15C - Normal Forms of CFGs - CNF, GNF

33. Annotated Notes - Lecture 15B-15C - Simplification of CFGs Part 2, Normal Forms

34. Lecture 15D - Decision Problems of Context Free Languages

35. Annotated Notes - Lecture 15D - Decision Problems of Context Free Languages

36. Lecture 16A - Universal TM, Membership Problem of TM

37. Lecture 16B - Halting Problem of TM, Existence of Non-RE Language

38. Annotated Notes - Lecture 16A-16B - Universal TM, Acceptance & Halting Problem of TM, Non-RE Language

39. Lecture 16C - Rice Theorem

40. Annotated Notes - Lecture 16C - Rice Theorem

41. Lecture 16D - Practice and Revision - Rice Theorem

42. Lecture 16E - Rice Theorem Part 3 - Machine Property Vs Language Property

43. Lecture 16F - Rice Theorem for Programs

44. Annotated Notes - Lecture 16D-16F - Practice, Rice Theorem for Programs

45. Lecture 17 - GATE Questions on Undecidability

46. Annotated Notes - Lecture 17 - GATE Questions on Decidability

47. Lecture 18 - Closure Properties of RE, REC Languages, Complement Theorem

48. Annotated Notes - Lecture 18 - Closure Properties of RE,REC Languages, Complement Theorem

49. Feedback & Review

1. Lecture 1 - Functions Revision, Cardinality & Understanding Infinity

2. Annotated Notes - Lecture 1 - Functions Revision, Cardinality

3. Lecture 2 - Countable Sets

4. Lecture 3 - Uncountable Sets & Cantors Diagonalization Proof

5. Annotated Notes - Lecture 2,3 - Countable Sets, Uncountable Sets & Cantors Diagonalization Proof

6. Lecture 4 - Three Definitions of Countable Sets

7. Annotated Notes - Lecture 4 - Three Definitions of Countable Sets

8. Lecture 5 - Theorems for Countable Sets

9. Annotated Notes - Lecture 5 - Theorems for Countable Sets

10. Lecture 6 - Cantors Theorem & Consequences

11. Annotated Notes - Lecture 6 - Cantors Theorem & Consequences

12. Lecture 7 - Countability Results in Theory of Computation

13. Annotated Notes - Lecture 7 - Countability Results in Theory of Computation

14. Countability - GATE, TIFR, NET - ALL Previous Exams Questions

15. Lecture 8 - Previous Exams Questions Discussion - GATE, TIFR, NET

16. Annotated Notes - Lecture 8 - Previous Exams Questions Discussion - GATE, TIFR, NET

17. Feedback & Review

1. Remaining Homeworks

2. Homework 5 - More Questions on Basic Concepts

3. Homework 5 - Video Solution

4. Practice Set 1 - 45 Questions from UC Sen Diego University - Theory of Computation

5. Feedback & Review

1. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Theory of Computation Notes

1. 1a. Introduction to Data Structures

2. 1b. Introduction to Linked list

3. 1c. Why we need Linked list | Array vs Linked list

4. 1d. Printing and Finding Length of Linked List

5. Lecture 1 Annotated notes

6. 2a. Insertions in linked list

7. 2b.Deletion in Linked list

8. OPTIONAL : Linked list C code

9. linkedList

10. 2c. Recursion in Linked list: Printing the linked list

11. 2d. Recursion in Linkedlist- Sum and length of linked list

12. Lecture 2 Annotated Notes

13. 3a. Recursion in Linkedlist- insert at the end

14. 3b. Recursion in Linkedlist- Question 2 based on recursion

15. 3c. Recursion in Linkedlist- Question 3 based on recursion

16. 3d. Recursion in Linkedlist- Question based on recursion

17. 3e. Recursion in Linkedlist- Swap pairwise Leetcode question

18. Lecture 3 Annotated Notes

19. Lecture 4a. GATE 2022 Reverse a Linked List

20. Lecture 4b. Reverse a Linked List using Recursion | Four Variations on recursion

21. 4c. Circular Linked List

22. 4d. Doubly Linked List

23. Lecture 4 Annotated Notes

24. Practice Set Linked List

25. Practice Set Linked List

26. LIVE: Linked List Practice Set Discussion

27. LIVE Session Annotated Notes

28. Weekly Quiz 20 - Linked List

1. Fundamental Section Lecture: Logarithms Definition and All Properties

2. Fundamental Section Lecture: Logarithm Exercise Questions

3. Fundamental Section Lecture: Logarithm Questions, Graph, and Log in Computer science

4. Annotated Notes Lograrithms

1. 5a. Introduction to Asymptotic Analysis

2. 5b. Big oh and Big omega Asymptotic Notations

3. 5c. Theta Asymptotic notation

4. 5d. What is Asymptotic comparison | how LOG works | rice grain story

5. 5e. Comparing Different Functions Asymptotically

6. 5f. Little Oh Little Omega | Properties of asymptotic notation | Stirling approximation

7. 6a.Formal set notation of Asymptote symbols

8. 6b. Asymptotic Notations GATE PYQs 1994, 96, 2000,1,3,4,8,11,17

9. 6c. Analysing the loops time complexity

10. 6d. Time Complexity of loops -2

11. Annotated Notes: Lecture 5, 6 - Asymptotic Analysis

12. Practice Set Loop Complexities

13. LIVE: Loop Time Complexity Practice Set Discussion

14. LIVE Session Loop Time Complexity Annotated Notes

15. 7a. Brief about Best Case, Worst Case

16. 7b. More about Best Case, Worst Case

17. 7c. Questions on Algorithmic notations

18. Annotated Notes Lecture 7

19. Practice Set Asymptotic Notations

20. LIVE: Asymptotic Notations Practice Set Discussion -1

21. LIVE: Asymptotic Notations Practice Set Discussion-2

22. LIVE Session Asymptotic Notations Annotated Notes

1. 8a. Introduction to Stack and Stack Permutations

2. 8b. Implementation of Stack using Array and Linked list

3. 9a. Introduction to Queue

4. 9b. Implementation of Queue using Array

5. 9c. Queue another Implementation using Array with F=R=0 | GATE 2012

6. 9d. Implementing Queue using Linked List

7. 9e. Queue using two stacks

8. 10a. Stack using two queues

9. 10b. Balancing parentheses and Two Stacks in one array

10. 10c. Infix, Prefix & Postfix and Conversion to each other

11. 10d. Infix to Postfix using Stack and Postfix evaluation using Stack

12. Stack and Queue Anottated Notes

13. Practice Set Stack and Queue

14. LIVE: Stack and Queue Practice Set Discussion

15. LIVE Stack and Queue Practice Set Discussion 2

16. LIVE Session Stack and Queue Annotated Notes

1. 11a. Introduction to Binary trees

2. 11b. Some questions and representation of tree

3. 11c. Questions on Binary trees

4. 11d. Questions on Binary trees 2

5. 12a. Binary Tree Traversals

6. 12b. Binary tree construction using preorder postorder and inorder

7. 12c. Binary tree construction using preorder postorder and inorder 2

8. 13a. Introduction to Binary Search Tree

9. 13b. Range Search in Binary Search Tree | GATE 2014 | GATE 2020

10. PDF: Range Search Binary Search Tree Animations (Stanford Slides)

11. 13c. BST Deletion

12. 14a. GATE 1996 Possible probe sequences

13. 14b. BST PYQs 1997, 2001, 06, 07, 16

14. 14c. BST Time Complexities

15. Annotated Notes Binary Tree and BST

16. Practice Set Binary Trees and Binary Search Tree

17. LIVE Binary Tree and Binary Search Tree Practice Set Discussion - 1

18. LIVE Binary Tree and Binary Search Tree Practice Set Discussion - 2

19. LIVE Session Binary Tree and Binary Search Tree Annotated Notes

1. 15. ALL IN ONE AVL TREE

2. Practice Set AVL Trees

3. AVL Tree Annotated Notes

4. Practice Set AVL Trees

5. LIVE AVL tree Practice Set Discussion

6. Annotated Notes LIVE Session AVL Tree

7. Please Rate us on Course Page

1. 16 a. Introduction to Heaps

2. 16 b. Kth Minimum in min heap | GATE 2020

3. 16 c. Insertion in Heap and Top Down build heap

4. 17 a. Heapify Method

5. 17 b. Build Heap Procedure

6. 17 c. Build Heap (Bottom-up) time complexity

7. 17 d. Delete Min in min Heap

8. Elements movement in Heap

9. 18 a. Number of Min Heaps | GATE 2018 | TIFR 2014

10. 18 b. Number of Binary tees

11. 18 c. [Optional] Average Time complexity in heap insertion

12. 19 a. Heap Time Complexities

13. 19 b. Heap Sort

14. 19 c. Heap vs BST | Merging two heaps

15. 19 d. Priority Queues

16. Heap Anottated Notes

17. Practice Set Heap

18. LIVE Heap: Practice Set Discussion

19. LIVE Heap: Practice Set Discussion (Part 2)

20. LIVE Heap: Practice Set Discussion (Part 3)

21. Annotated Notes LIVE Session Heap

22. Please Rate us...It will Help Drastically

1. 20a. Motivation to hashing and Direct address table

2. 20b. Introduction to hashing

3. 20c. Collision resolution techniques

4. 20d. Avg case performance chaining

5. 21a. Linear Probing

6. 21 b. Quadratic probing and Double hashing

7. 21c. Possible Number of probes

8. 22a. [Optional but please watch ] UnSucessfull search time open addressing

9. 22b. [Optional but please watch ] Successful search time open addressing

10. 23 a. Probability Background (video from Probability course) Bernoulli and Binomial RVs

11. 23b. Three popular expectation questions in hashing

12. Hashing Anottated Notes

1. 24a. Row major and Column major 2D Arrays

2. 24b. ND Arrays

3. 24c. Examples and GATE PYQs 1998, 94

4. Row and Column Major Array Anottated Notes

1. Stack and Queue PYQs Part 1

2. Stack and Queue PYQs Part 2

3. Annotated Notes Stack Queue PYQs

4. DS Test Series Test 4 Discussion

5. DS Test Series Test 1 Discussion Linked List

1. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Data Structures

2. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Data Structures Notes

1. About Lecture 1

2. Lecture 1A - Introduction to COA - Architecture Vs Organization

3. Lecture 1B - Stored Program Architecture

4. Lecture 1C - Structure of a Computer - Basic Components

5. Lecture 1D - IO Devices - Input Devices, Output Devices

6. Lecture 1E - Memory - RAM Vs ROM

7. Annotated Notes - Lecture 1 - Overview of COA

8. Lecture 2A - Main Memory - Addressability

9. Annotated Notes - Lecture 2A - Main Memory - Addressability

10. Lecture 2B - Byte Ordering - Endianness - Little Endian & Big Endian

11. Annotated Notes - Lecture 2B - Byte Ordering - Endianness

12. Lecture 2C - Practice Questions - Endianness

13. Annotated Notes - Lecture 2C - Practice Questions - Endianness

14. Lecture 3A - System Bus

15. Annotated Notes - Lecture 3A - System Bus

16. Lecture 3B - Memory Interfacing & Expansion

17. Annotated Notes - Lecture 3B - Memory Interfacing & Expansion

18. Lecture 3C - GATE Questions - Memory Interleaving

19. Annotated Notes - Lecture 3C - GATE Questions - Memory Interleaving

1. Lecture 1 - Registers & Status Flags

2. Annotated Notes - Lecture 1 - Registers & Status Flags

3. Lecture 2A - Instruction Set Architecture ISA

4. Lecture 2B - RISC & CISC Architecture

5. Annotated Notes - Lecture 2 - Instruction Set Architecture ISA, RISC & CISC

6. Lecture 3A - Instruction Format

7. Lecture 3B - Expanding Opcode Technique

8. Annotated Notes - Lecture 3A-3B - Instruction Format & Expanding Opcode

9. Lecture 3C - ALL GATE PYQs on Expand Opcode Technique

10. Annotated Notes - Lecture 3C - ALL GATE PYQs on Expanding Opcode

11. Lecture 4A - Instruction Types & ALU Operations

12. Annotated Notes - Lecture 4A - Instruction Types & ALU Operations

13. Lecture 4B - Branch Instructions

14. Lecture 4C - GATE PYQs on Machine Instructions

15. Annotated Notes - Lecture 4B-4C - Branch Instructions & GATE 2003 Question

16. Lecture 5 - Instruction Execution Cycle

17. Annotated Notes - Lecture 5 - Instruction Execution Cycle

18. Lecture 6A - Addressing Modes

19. Annotated Notes - Lecture 6A - Addressing Modes

20. Lecture 6B - Addressing Modes Part 2

21. Annotated Notes - Lecture 6B - Addressing Modes Part 2

22. Lecture 6C - Addressing Modes Part 3

23. Annotated Notes - Lecture 6C - Addressing Modes Part 3

1. Lecture 1 Introduction to Cache Direct Mapped Cache

2. Annotated Notes -1 Cache Memory Introduction and Direct Mapped Cache

3. Lecture 2- Questions on Direct Mapped Cache Memory

4. Annotated Notes -2 Questions on Direct Mapped Cache Memory

5. Lecture 3- Introduction to Set Associative Cache

6. Annotated Notes - Set Associative Memory

7. Lecture 4 Questions on Set Associative Cache Memory

8. Annotated Notes - Questions on Set Associative Memory and Fully Associative Memory

9. Lecture 5. Loop Array, and Cache Questions from Standard Universties

10. Annotated Notes Lecture 5- Loop, Array, and Cache Questions from Standard Universities

11. Lecture 6 GATE PYQs on Loop Array and Cache Questions

12. Annotated Notes Lecture 6- GATE PYQs on Loop Array, and Cache Questions

13. Lecture 7. GATE PYQs on Cache Memory Effective Access Time

14. Annotated Notes Lecture 7- Questions on Cache Effective Access Time

15. Lecture 8. Write Back and Write Through Policies

16. Annotated Notes Lecture 8- Write Back and Write Through Policies

1. Pipeline Complete Playlist

1. Lecture 1: Introduction to Fixed Point Representation

2. Annotated Notes -Fixed Point Representation

3. Lecture 2: Introduction to Floating Point Representation

4. Annotated Notes -Floating Point Representation

5. Lecture 3: Floating Point Representation GATE PYQs and Special Forms (Denorms, Nans, Infinity)

6. Annotated Notes -Denorm Floats

1. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Computer Organization & Architecture Notes

1. About Lecture 1

2. Lecture 1 - Introduction to DBMS, Data Models, Design Process

3. Annotated Notes - Lecture 1 - Introduction to DBMS, Data Models

4. Lecture 2A - The Relational Model - Concepts & Terminology

5. Lecture 2B - The Relational Model - Why Table is called Relation?

6. Lecture 2C - The Relational Model - Null Values

7. Lecture 2D - The Relational Model - Keys - Candidate Key, Primary Key, Super Key

8. Annotated Notes - Lecture 2 - The Relational Model

9. Lecture 2E - Practice Questions on Keys

10. Annotated Notes - Lecture 2E - Practice Questions on Keys

11. Lecture 3 - SQL - DDL & DML

12. Annotated Notes - Lecture 3 - SQL - DDL & DML

13. Lecture 4A - Integrity Constraints in Relational Model

14. Lecture 4B - Referential Integrity Constraints - Foreign Key

15. Lecture 4C - Actions Taken by DBMS to Enforce Referential Integrity Constraints

16. Annotated Notes - Lecture 4A - Integrity Constraints in Relational Model

17. Lecture 5A - Functional Dependency

18. Annotated Notes - Lecture 5A - Functional Dependency

19. Lecture 5B - Functional Dependency Laws, Closure of Attribute Set

20. Annotated Notes - Lecture 5B - Functional Dependency Laws, Closure of Attribute Set

21. Lecture 5C - Practice - Finding Candidate Keys

22. Annotated Notes - Lecture 5C - Practice - Finding Candidate Keys

23. Lecture 5D - Functional Dependency - Inference & Equivalence

24. Annotated Notes - Lecture 5D - Functional Dependency - Inference & Equivalence

25. Lecture 6A - Normal Forms - Partial Functional Dependency, Transitive FD

26. Annotated Notes - Lecture 6A - Normal Forms - Partial, Transitive FD

27. Lecture 6B - Normal Forms - 1NF, 2NF

28. Annotated Notes - Lecture 6B - Normal Forms - 1NF, 2NF

29. Lecture 6C - Normal Forms - 3NF Third Normal Form

30. Lecture 6D - Normal Forms - Practice Questions 3NF

31. Annotated Notes - Lecture 6C-6D - Normal Forms - 3NF

32. Lecture 6E - Normal Forms - BCNF

33. GATE IT 2005 - Normalization Question

34. GATE CSE 1987 - Functional Dependency Question

35. GATE CSE 2007, 1990 - Normal Forms Questions

36. GATE CSE 2012 - 3NF, BCNF Question

37. Annotated Notes - Lecture 6E - Normal Forms - BCNF

38. Lecture 7A - Normalization & Decomposition - Lossless, Lossy

39. Lecture 7B - Practice Questions - Decomposition - Lossless, Lossy

40. Lecture 7C - Decomposition - Dependency Preservation

41. Annotated Notes - Lecture 7A-7C - Decomposition

42. Lecture 7D - Non-Binary Decomposition & Chase Test

43. Annotated Notes - Lecture 7D - Non-Binary Decomposition & Chase Test

44. Lecture 8 - Minimal Cover of Functional Dependencies

45. Annotated Notes - Lecture 8 - Minimal Cover of Functional Dependencies

46. Lecture 9A - 2NF Decomposition

47. Annotated Notes - Lecture 9A - 2NF Decomposition

48. Lecture 9B - Understanding Redundancies - Due to FDs & MVDs

49. Lecture 9C - 3NF, BCNF Decomposition

50. Annotated Notes - Lecture 9B-9C - Understanding Redundancies, 3NF, BCNF Decomposition

51. About Lecture 10

52. Lecture 10 - Physical, Logical Data Independence

53. Annotated Notes - Lecture 10 - Physical, Logical Data Independence

1. Lecture 1 - Relational Algebra - Selection, Projection

2. Lecture 2 - Relational Algebra - Set Operations

3. Annotated Notes - Lecture 1,2 - Relational Algebra

4. Lecture 3 - Relational Algebra - Inner Join Operations

5. Lecture 4 - Relational Algebra - Division Operation

6. Annotated Notes - Lecture 3,4 - Relational Algebra - Join, Division

7. Lecture 5 - Division Operation, Outer Join in Relational Algebra

8. Annotated Notes - Lecture 5 - Division Operation, Outer Join in Relational Algebra

9. Lecture 6 - Practice - Relational Algebra Operators

10. Lecture 7 - Writing & Understanding Relational Algebra Queries

11. Lecture 8 - GATE Questions - Relational Algebra

12. Annotated Notes - Lecture 6,7,8 - Relational Algebra Queries

1. Lecture 1 - Tuple Relational Calculus TRC

2. Lecture 2 - Tuple Relational Calculus TRC

3. Lecture 3 - Tuple Relational Calculus TRC

4. Annotated Notes - Lecture 1-3 - Tuple Relational Calculus TRC

5. Lecture 4 - TRC Practice Questions

6. Annotated Notes - Lecture 4 - TRC Practice Questions

7. GATE CSE 1999 - Tuple Relational Expression Question

8. GATE CSE 2002 - Tuple Relational Calculus Question

9. GATE CSE 2007 - Tuple Relational Calculus Question

10. GATE CSE 2008 - Tuple Relational Calculus Question

11. GATE IT 2006 - TRC Question

1. Lecture 1 - SQL Basics

2. Lecture 2 - Writing SQL Queries, Union, Except

3. Annotated Notes - Lecture 1-2 - SQL Basics

4. Lecture 3 - SQL Queries using Union, Except, Intersect

5. Annotated Notes - Lecture 3 - SQL Queries using Union, Except, Intersect

6. Lecture 4 - Some Notes on Select, Where Clause

7. Lecture 5 - Aggregate Operators

8. Lecture 6 - Null Values in SQL

9. Annotated Notes - Lecture 4-6 - Aggregate Operators

10. Lecture 7 - Group By, Having, Order By Clauses

11. Annotated Notes - Lecture 7 - Group By, Having, Order By Clauses

12. Lecture 8 - SQL Practice Questions

13. Annotated Notes - Lecture 8 - SQL Practice Questions

14. Lecture 9 - Nested Queries

15. Lecture 10 - Correlated Nested Queries in SQL

16. Annotated Notes - Lecture 9-10 - Nested Queries

17. Lecture 11 - SQL GATE Questions

18. Annotated Notes - Lecture 11 - SQL GATE Questions

1. About Module 5 - Magnetic Disk

2. Lecture 1 - Disk Structure & Performance

3. Lecture 2 - Disk Addressing

4. Annotated Notes - Lecture 1,2 - Disk Structure, Performance, Addressing

5. Lecture 3 - Disk Scheduling Algorithms

6. Lecture 4 - Disk Scheduling Algorithms Part 2

7. Annotated Notes - Lecture 3,4 - Disk Scheduling Algorithms

1. Lecture 1 - File Organization

2. Lecture 2 - Practice Questions - File Organization

3. Annotated Notes - Lecture 1,2 - File Organization

4. Lecture 3 - Free Disk Space Management

5. Lecture 3 Annotated Notes

6. Slides - Lecture 3 - Disk Free Space Management

7. Lecture 4 - Indexing - Ordered Indexes

8. Lecture 5 - Primary Index

9. Lecture 6 - Clustering Index

10. Annotated Notes - Lecture 4 ,5,6- Indexing - Ordered Indexes

11. Lecture 7 - Secondary Index

12. Lecture 8 - Practice Questions on Indexes

13. Annotated Notes - Lecture 7,8 - Secondary Index

14. Lecture 9 - Multilevel Index & ISAM

15. Lecture 10 - GATE Questions on Indexing

16. Annotated Notes - Lecture 9,10 - Multilevel Index & ISAM

17. Lecture 11 - B Tree

18. Lecture 12 - B Tree Insertion

19. Lecture 13 - B Tree Order Questions

20. Lecture 14 - B Tree Structure Questions

21. Lecture 15 - B Tree More Questions

22. Annotated Notes - Lecture 11-15 - B Tree

23. Lecture 16 - B+ Tree

24. Annotated Notes - Lecture 16 - B+ Tree

25. Lecture 17 - B+ Tree Range Search

26. Lecture 18 - B+ Tree Insertion

27. Lecture 19 - B+ Tree Questions

28. Annotated Notes - Lecture 17-19 - B+ Tree

1. About this Module

2. Lecture 1 - Transaction, Database Consistency

3. Lecture 2 - Transaction, Read Write Operations

4. Lecture 3 - ACID Properties

5. Annotated Notes - Lecture 1-3 - Transaction, ACID Properties, Database Consistency

6. Lecture 4 - Practice ACID Properties, Database Consistency

7. Annotated Notes - Lecture 4 - Practice ACID Properties, Database Consistency

8. Lecture 5 - Serializability Introduction

9. Annotated Notes - Lecture 5 - Serializability Introduction

10. Lecture 6 - Serializability In General

11. Annotated Notes - Lecture 6 - Serializability In General

12. Lecture 7 - Conflict Serializability

13. Annotated Notes - Lecture 7 - Conflict Serializability

14. Lecture 8 - View Serializability

15. Annotated Notes - Lecture 8 - View Serializability

16. Lecture 9 - Recoverability

17. Annotated Notes - Lecture 9 - Recoverability

18. Lecture 10 - General Locking Protocol for Concurrency Control

19. Annotated Notes - Lecture 10 - General Locking Protocol for Concurrency Control

20. Lecture 11 - Two Phase Locking Protocol

21. Annotated Notes - Lecture 11 - Two Phase Locking Protocol

22. Lecture 12 - Two Phase Locking Protocol Variations

23. Lecture 13 - Deadlock Handling

24. Annotated Notes - Lecture 12,13 - Two Phase Locking Variations, Deadlock Handling

25. Lecture 14 - Timestamp Based Protocols for Concurrency Control

26. Annotated Notes - Lecture 14 - Timestamp Based Protocols for Concurrency Control

27. Lecture 15 - 50 Questions on Timestamp Protocol

28. Annotated Notes - Lecture 15 - Timestamp Protocol 50 Questions

1. Lecture 1 - ER Model

2. Lecture 2 - Weak Entity Set in ER Model

3. Annotated Notes - Lecture 1,2 - ER Model

4. Lecture 3 - ER Model to Relational Model Conversion

5. Annotated Notes - Lecture 3 - ER Model

1. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Databases

2. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - DBMS Notes

1. Lecture 1a. Introduction to Compiler Design

2. Lecture 1b. Token Name, Token Attribute, and Lexeme

3. Lecture 1c. Recognition of Tokens and Maximal Munch

4. Lecture 1 Annotated Notes Lexical Analysis

5. Practice Questions on Lexical Analysis

6. Annotated Notes Practice Questions on Lexical Analysis

7. True False Question on Lexical Analysis

8. Lecture 2a. Introduction to Syntax Analysis and Ambiguous grammars

9. Lecture 2b. Elimination of Ambiguity Manually - Example 1 E-T-F Grammar

10. Lecture 2c. Elimination of Ambiguity Manually - Example 2 Dangling If-Else Grammar

11. GATE 1996 Question Homework

12. Lecture 2d. Elimination of Ambiguity Manually - Example 3 Balance Parentheses | And Ambiguity Summary

13. Lecture 2 Annotated Notes- Dealing with Ambiguity and Ambiguous Grammars

14. Lecture 3a. Left Recursion and Left Factoring

15. Lecture 3b. One more example on Left Factoring

16. Annotated Notes Lecture 3 - Left Recursion and Left Factoring

17. Lecture 4a. Introduction to Parsing | Type of Parsers

18. Lecture 4b. Types of Top Down Parsers

19. Lecture 4c. Recursive Descent Parser

20. Annotated Notes Lecture 4- Parsing Introduction and Recursive Descent Parser

21. Lecture 5. Questions on Recursive Descent Parsers

22. Lecture 5 - On Youtube

23. Annotated Notes Practice Questions on Recursive Descent

24. Lecture 6a. Computing First

25. Lecture 6b. Computing Follow

26. Lecture 7a. Predictive Parsers

27. Lecture 7b. Implementing LL(1)

28. Lecture 6a annotated Notes

29. Lecture 6b Annotated notes

30. Lecture 7a Annotated Notes

31. Lecture 7b Annotated Notes

32. Forty Five Questions on First, Follow, LL(1), Ambiguity, etc

33. Annotated Notes Practice Questions on LL(1)

1. Lecture 8a: Handles in Bottom-Up Parsing | GATE 2005 PYQ

2. Lecture 8b: Questions on Handle and Working of Bottom-up parsers

3. Annotated Notes Lecture 8b: Questions on Handle and Working of Bottom-up parsers

4. Lecture 8b- On Youtube

5. Lecture 9a. LR(0) and SLR(1) Parsing Table Examples

6. Lecture 9b. More examples on LR(0) and SLR(1) Grammars

7. Annotated Notes For lecture 9

8. Lecture 10. Really Understanding LR(0) Automata | Re-Run of DFA | Viable Prefixes | Bottom up Parsing Algorithm

9. Annotated Notes Really Understanding LR(0) Automata and Viable Prefixes

10. Lecture 11a. More Questions on LR(0) and SLR(1)

11. Lecture 11b. Condition of Grammar being SLR(1)

12. Lecture 11c. Relation between LL(1) LR(0) and SLR(1)

13. Lecture 11d. One more Example of LR(0) SLR(1)

14. Annotated Notes Lecture 11. LR(0) and SLR(1)

15. 12a. Limitations of SLR(1) Parser

16. 12b. Idea behind LR(1) Parsers

17. 12c. Example on LR(1) Parsing

18. 12d. -Example on LR(1) and LALR(1)

19. Annotated Notes Lecture 12 LR(1) and LALR(1)

20. Lecture 13 a-Example on LR(1) and LALR(1)

21. Lecture 13 b-One More Example on LR(1) and LALR(1)

22. Lecture 13 c- Tiny LR(2) grammar

23. Annotated Notes Lecture 13 More About LR(1) and LALR(1)

24. Lecture 14a Questions on LALR(1) and CLR(1)

25. Lecture 14b Questions on LALR(1) and CLR(1)

26. Annotated Notes Lecture 14 Questions on LR(1) and LALR(1)

1. Lecture 15: Syntax Directed Definition and Translation

2. Lecture 16 PYQs on Syntax Directed Definition and Translation

3. Lecture 17 Inherited and Synthesize attributes with Top down and Bottom-up parsers

4. SDT Annotated Notes

1. Lecture 1 - Computer Languages - Machine Language Vs Assembly Language

2. Annotated Notes - Lecture 1 - Machine Vs Assembly Language

3. Lecture 2 - Broad Overview of Phases of Compiler

4. Annotated Notes - Lecture 2 - Broad Overview of Compiler Phases

5. Lecture 3A - Intermediate Representations

6. Annotated Notes - Lecture 3A - Intermediate Representations

7. Lecture 3B - Three Address Code

8. Notes for Lecture 3B - Three Address Code

9. Slides - Lecture 3B - Three Address Code

10. Lecture 3C - Static Single Assignment Form SSA

11. Annotated Notes - Lecture 3C - Static Single Assignment Form SSA

12. Lecture 3D - Control Flow Graph CFG

13. Annotated Notes - Lecture 3D - Control Flow Graph CFG

14. Lecture 4 - Code Optimization - Introduction

15. Annotated Notes - Lecture 4 - Code Optimization - Introduction

16. Lecture 5A - Dead Code Elimination & Liveness Analysis - Part 1

17. Lecture 5B - Liveness Analysis & Dead Code Elimination

18. Annotated Notes - Lecture 5A,5B - Liveness Analysis & Dead Code Elimination

19. Lecture 5C - Practice Questions - Liveness Analysis

20. Lecture 6 - Available Expression Analysis, Common Subexpression Elimination, Copy Propagation

1. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Compiler Design Notes

1. 1a. Why Study Algorithms

2. 1b.An algorithm that changed history And Childs algorithm

1. DS Videos: 5a. Introduction to Asymptotic Analysis

2. DS Videos: 5b. Big oh and Big omega Asymptotic Notations

3. DS Videos: 5c. Theta Asymptotic notation

4. DS Videos: 5d. What is Asymptotic comparison | how LOG works | rice grain story

5. DS Videos: 5e. Comparing Different Functions Asymptotically

6. DS Videos: 5f. Little Oh Little Omega | Properties of asymptotic notation | Stirling approximation

7. DS Videos: 6a.Formal set notation of Asymptote symbols

8. DS Videos: 6b. Asymptotic Notations GATE PYQs 1994, 96, 2000,1,3,4,8,11,17

9. DS Videos: 6c. Analysing the loops time complexity

10. 6d. Time Complexity of loops -2

11. Annotated Notes: Lecture 5, 6 - Asymptotic Analysis

12. Practice Set Loop Complexities

13. LIVE: Loop Time Complexity Practice Set Discussion

14. LIVE Session Loop Time Complexity Annotated Notes

15. DS Videos: 7a. Brief about Best Case, Worst Case

16. DS Videos: 7b. More about Best Case, Worst Case

17. DS Videos: 7c. Questions on Algorithmic notations

18. Annotated Notes Lecture 7

19. Practice Set Asymptotic Notations

20. LIVE: Asymptotic Notations Practice Set Discussion -1

21. LIVE: Asymptotic Notations Practice Set Discussion-2

22. LIVE Session Asymptotic Notations Annotated Notes

1. 2a. Introduction to recurrence relations

2. 2b. Solving recurrence using Iteration Method

3. 2c. More Examples of Iteration Method

4. 3a. Solving recurrence using Tree Method

5. 3b. More Examples Tree Method

6. 3c. Even More Examples Tree Method

7. 3d. More Examples Tree Method

8. 4a. Masters Theorem Idea and examples

9. 4b. Examples On Master Theorem

10. 4c. Proof of Master Theorem

11. 5a. Generalised Master Theorem

12. 5b. [Optional but watch] Extended Master Theorem

13. 5c. Various Examples of Master Theorem

14. 5d. Problems that master theorem can not solve

15. 6a. Introduction to change to variable method

16. 6b. Examples on Change of Variable

17. 6c. Few more examples on change of variable method

18. 6d. Some More variation

19. Annotated Notes Module 1 Solving Reccurance relation

1. 7a. Introduction to Divide and Conquer Algorithm

2. 7b. Maximum of an array using D and C

3. 7c. Example 2- Sum of an array

4. 7d. Example 3- Search in an array

5. 7e. Example 4 - Dumb Sort

6. A Note: Viewing Recurrence as Induction

7. 8a. Introduction to Merge Sort algorithm

8. 8b.Heart of Merge Sort- Merge Procedure

9. 8c. Merge Procedure -2

10. 8d. Merge Sort Recursive tree with example

11. 8e. Merge Sort Analysis (Contd..)

12. 9a. Merge Sort questions -1

13. 9b. Merge Sort questions -2

14. 9c. More Questions on Merge sort

15. 10a. Iterative (or Bottom-up) Merge sort

16. 10b. GATE 1999 question on Bottom up Merge Sort

17. 10c. Time Complexity of Iterative Merge sort

18. 10d. [Optional and Skip] Implementation of Iterative Merge sort

19. 11a. Merging k sorted arrays Part 1

20. 11b. Merging k sorted arrays Part 2

21. 11d. Definition of Stable and In-place sorting

22. [DELETED] In Place and Space Complexity

23. Annotated Notes Divide and Conquer Algorithms (Part-1)

1. 12a. Maximum and Second Max of an array

2. 12b. Second maximum using Tournament Method

3. 12c. [Optional] How to keep track for candidates of Second maximum

4. 12d. Maximum and Minimum of an array

5. 13a. Tournament Method and D&C for Max Min in an array

6. 13b. Cormen questions

7. 13c. GATE 2007, 2014, 2021 Questions

8. TIFR Question

9. 14a. Algorithm Analysis

10. 14b. Questions on Algorithmic notations

11. Annotated Notes Maximum & Minimum and Algorithm Analysis

1. 15a. Counting inversion with Netflix and Amazon Example

2. 15b. Numerical questions on Counting Inversion

3. 15c. Counting Inversions using BruteForce method

4. 16a. Heart of counting Inversion

5. 16b. Working Example of Counting Inversion using D and C

6. 16c. Counting Inversion question

7. 17a. Closest pair in 2 D

8. 17b. Closest pair-2

9. 17c. Exponent of a number

10. 17d. Matrix Multiplication

11. 18a. Introduction to Quick Sort

12. 18b. Working Example of Quick Sort

13. 18c. Quick sort Analysis and Randomised quick sort

14. 18d. GATE 2014 question

15. 18e. Questions on quick sort

16. 18f. [Optional and Skip] Average case analysis of quick sort

17. 19a. The Select algorithm

18. 19b. Binary Search

19. Annotated notes Divide and Conquer part 2

1. 20a .Bubble Sort

2. 20b .Insertion Sort

3. 20c .Bubble Sort and Insertion Sort

4. 20d. Selection Sort and Heap Sort

5. 20e. Decision Tree

6. 20f. [Optional] Counting Sort and Radix Sort

7. Annotated Notes Sorting Algorithms

1. 21a. Introduction to Graphs | Adjacency List and Matrix

2. 21b. intuition for graph search methods

3. 21c. Introduction to DFS

4. 21d. DFS Implementation (Recursive and explicit stack) and Time complexity

5. 22a. DFS Parentheses Theorem | GATE 2006

6. 22b. DFS Edge Classifications

7. 22c. Questions on DFS Edge Classification

8. 22d. [Optional] Back-edge and cycle question

9. 23a. DFS Application 1- Cycles in graph

10. 23b. GATE 2007 question on DAG finish time

11. 23c. DFS Application 2 Topological sort | GATE 2014

12. 23d. DFS Application 3 Articulation Point | GATE 2021

13. Please Rate us on course page

14. 24a. Introduction to BFS

15. 24b. BFS few Observations(Properties) and BFS Edge Classification

16. 25c. BFS Applications

17. Annotated Notes DFS BFS

1. 26a. Introduction to Greedy Algorithms | Introduction and Intuitive proof of Dijkstra

2. 26b. Dijkstra code and Working Example 1

3. 26c. Dijkstra Working Example 2

4. 26d. Dijkstra Working Example 3

5. 27a. Dijkstra on negative weights

6. 27b. Video From DS Course: Priority Queues

7. 27c. Dijkstra Time Complexity

8. 27d. Dijkstra Time Complexity on more variant data structures | Dijkstra Demo

9. 28a. DAG Shortest Path | Shortest Path in Directed Acyclic Graph

10. 28b. Intuition Behind Bellman Ford Algorithm

11. 28c. Examples of Bellman Ford | Time complexity

12. 28d. Bellman ford proof and Early termination

13. Annotated Notes Dijkstra, DAG Shortest Path Algo, and Bellman Ford

1. 29a. Why Minimum Spanning Trees

2. 29b. Cut and Cycle properties of MST

3. 29c. Kruskal Algorithm

4. 30a. Questions on MSTs

5. 30b. Prims Algorithm

6. 30c. Prims and Dijkstra Similarity

7. 30d. Single Example for Prims and Dijkstra both | MST vs Shortest path on Same Graph

8. 31a.Interesting Questions on MSTs | GATE 2000 | MIT Questions

9. 31b. Two Most Popular Template Questions in MSTs | TIFR 2014

10. 31c. Four Cases in MSTs | GATE 2020

11. (In Complete) Annotated Notes Spanning Trees

12. Annotated Notes Spanning Tree

13. Please Rate us on course page

1. 32a. Huffman Encoding Concept and Questions | Interesting Story

2. 32b. Question on Huffman Encoding

3. 32c. Huffman Encoding Time Complexity

4. 32d. Nice Questions on Huffman Encoding

5. 33a. Berkeley and MIT Questions on Huffman Encoding

6. 33b. [Optional] Huffman Encoding Question Based on Tree Variance

7. 33c. Optimal Merge Pattern

8. 34a. Interval Scheduling Problem (Activity Selection Problem) Algorithm Ideas

9. 34b. Interval Scheduling Problem Algorithm

10. 34c. [Optional] Proving Optimality using Exchange Techniques

11. 34d. Other Variants of Interview Scheduling

12. 34e. Job Scheduling With Deadlines

13. 35a.Fractional Knapsack

14. 35b. [Optional] Fractional Knapsack in O(n)

15. Annotated Notes Huffman Encoding and Optimal Merge Pattern

16. Annotated Notes Interval Scheduling Problem, Job Scheduling With Deadline, Fractional Knapsack

1. 36a.Introduction to DP | Two Approaches | Why we call it "Dynamic"

2. 36b. Example 1- Climbing Stairs

3. 36c. Example 2 MCQ on DP

4. 36d. Example 3- Climbing Stairs Cost

5. 37a. Example 4- One Nice question on Total Probability and DP

6. 37b. Order of Table Filling | MIT Questions | Top Down vs Bottom Up Difference

7. 37c. DP vs Divide and Conquer | Elements in DP

8. 38a. Longest Common Subsequence | BruteForce Method

9. 38b. Longest Common Subsequence using Dynamic Programming

10. 38c. Total Calls vs Unique Calls in LCS

11. 38d. GATE 2009 Easy Question

12. 39a. Running Example on LCS

13. 39b. GATE 2014 Question on LCS

14. 39c. LCS Applications

15. 39d. [Optional] Another way of writting LCS Recursion

16. 40a. Introduction to Matrix Chain Multiplication

17. 40b. Number of Ways to Multiply n Matrices

18. 40c. Recursive Formulation of Matrix Chain Multiplication and GATE 2016 Question

19. 40d.Example on Matrix Chain Multiplication

20. 40e. Time Complexity of Matrix chain Multiplication

21. 41a. Greedy Strategy on 0-1 Knapsack Problem

22. 41b. Recursive Formulation of 0-1 Knapsack and Example

23. 41c. One More Running Example on 0-1 Knapsack

24. 41d. Total Calls in Knapsack, Unique Calls in Knapsack, and Time Complexity

25. 41e. Solving 0-1 Knapsack with Bottom Up Approach

26. Annotated Notes Introduction to DP

27. Annotated Notes Longest Common Subsequence

28. Annotated Notes Matrix Chain and 0-1 Knapsack

29. Please Rate us on course page

1. 42a. Subset Sum Problem

2. 42b. Coin Change Problem

3. 42c. DP Vs Greedy vs Divide and Conquer

4. 42d. Floyd Warshall Algorithm

5. 42e. Travelling Salesman

6. Annotated Notes More Dynamic Programming Algorithms

1. Algorithms Notes - By Quantum City

1. Asymptotic Notations in Algorithms with ALL GATE PYQs | Revision and Practice | O(), o(), Ω(), ω()

2. Annotated Notes -1 Revision and Practice Asymptotic Notations

3. Solving Recurrence Relations and Loop Time Complexities with ALL GATE PYQs | Revision and Practice

4. Annotated Notes -2 Reccurrance Relations Practice

5. DFS and its Applications and ALL GATE PYQs | Revision and Practice Session | Algorithms | Graph

6. Annotated Notes -3 Revision and Practice DFS

7. BFS and Dijkstra and GATE PYQs | Revision and Practice Session | Algorithms | Graph

8. Annotated Notes -4 Revision and Practice BFS Dijkstra

9. Prims and Kruskals and GATE PYQs | Revision and Practice Session | Algorithms | Graph

10. Annotated Notes -5 Revision and Practice Prims and Kruskals

11. Bellman-Ford Proof | Most Intuitive Proof WITHOUT Induction | GATE CSE and DA | Sachin Mittal

12. Annotated Notes -6 Revision and Practice Bellman-Ford Proof and Questions

1. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024)- Algorithms

2. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Algorithms Notes

1. Set Theory - Summary, GATE PYQs, Practice

1. Functions - Summary, GATE PYQs, Practice

1. Group Theory - Summary, GATE PYQs, Practice

1. Lecture 1 - Introduction to Digital Logic & Boolean Algebra

2. Lecture 2 - Boolean Algebra

3. Annotated Notes - Lecture 1-2 - Boolean Algebra

4. Lecture 3A - Binary & Decimal Number System

5. Lecture 3B - Practice - Decimal & Binary Number System

6. Annotated Notes - Lecture 3A-3B - Binary & Decimal Number System

7. Lecture 4A - Boolean Algebra Continued

8. Annotated Notes - Lecture 4A - Boolean Algebra Continued

9. Lecture 4B - Boolean Expressions & Boolean Algebra Laws

10. Lecture 4C - Complement & Dual of Boolean Expressions

11. Annotated Notes - Lecture 4B-4C - Boolean Expressions, Laws, Dual, Complement

12. Lecture 4D - Algebraic Simplification

13. Annotated Notes - Lecture 4D - Algebraic Simplification

14. Lecture 5A - Standard Forms of Boolean Expressions

15. Lecture 5B - Minterm, Maxterm

16. Annotated Notes - Lecture 5A-5B - Standard Forms of Boolean Expressions, Minterm

17. Lecture 5C - Revision - Minterm, Maxterm

18. Lecture 5D - Expressing Boolean Function using Minterms, Maxterms

19. Annotated Notes - Lecture 5C-5D - Expressing Boolean Function using Minterms, Maxterms

20. Lecture 5E - Revision & Practice - Standard Forms of Boolean Functions

21. Lecture 5F - Practice Questions - Sum of Minterms, Product of Maxterms

22. Annotated Notes - Lecture 5E-5F - Revision & Practice - Standard Forms of Boolean Functions

23. Lecture 6A - K-Map Part 1 - Boolean Function Minimization

24. Annotated Notes - Lecture 6A - K-Map Part 1 - Boolean Function Minimization

25. Lecture 6B - K-Map Part 2 - Minimization of Boolean Expression using K-map

26. Lecture 6C - K-Map Part 3 - Minimization of Boolean Expression using K-map

27. Annotated Notes - Lecture 6B-6C - K-Map Part 2 - Minimization of Boolean Expression

28. Lecture 6D - K-Map Part 4 - Dont Cares, Prime Implicants

29. Annotated Notes - Lecture 6D - K-Map Part 4 - Dont Cares, Prime Implicants

30. Lecture 6E - K-Map Part 5 - Prime Implicant, Essential Prime Implicant

31. Annotated Notes - Lecture 6E - K-Map Part 5 - Prime Implicant, Essential Prime Implicant

32. Lecture 7 - Dual of a Boolean Function, Self Dual

33. Annotated Notes - Lecture 7 - Dual of a Boolean Function, Self Dual

34. Lecture 8 - ExOr, ExNor Functions & Their Properties

35. Annotated Notes - Lecture 8 - ExOr, ExNor Functions & Their Properties

36. (OPTIONAL) Positive Level Logic System, Negative Level Logic System

37. Practice Sessions

1. Lecture 1A - Octal, Hexadecimal Number Systems

2. Lecture 1B - Why Octal, Hexadecimal Number Systems are Important?

3. Lecture 2 - Binary Addition

4. Annotated Notes - Lecture 1A,1B,2 - Octal, Hexadecimal Number Systems

5. Lecture 3A - Complement of a number, Subtraction using rs complement

6. Lecture 3B - Practice Questions - Subtraction using rs complement

7. Lecture 3C - Subtraction using r-1s complement

8. Lecture 3D - Signed Binary Numbers Representations

9. Annotated Notes - Lecture 3A-3D - Complement of a number, Subtraction

10. Lecture 3E - Range of Signed Binary Numbers in Various Representations

11. Annotated Notes - Lecture 3E - Range of Signed Binary Numbers in Various Representations

12. Lecture 4A - Addition of Signed Binary Numbers in Various Representations

13. Annotated Notes - Lecture 4A - Addition of Signed Binary Numbers

14. Lecture 4B - Addition, Subtraction of Signed Binary Numbers in Signed Complement Systems

15. Annotated Notes - Lecture 4B - Addition, Subtraction of Signed Binary Numbers

16. Lecture 5A - Overflow Definition, Overflow Detection in Signed Magnitude Representation

17. Lecture 5B - Overflow in Addition of Signed Binary Numbers in 2s, 1s Complement Representation

18. Annotated Notes - Lecture 5 - Overflow for Addition Operation

19. Lecture 6 - Sign Extension in Various Representations

20. Annotated Notes - Lecture 6 - Sign Extension in Various Representations

21. Lecture 7A - Binary Codes Introduction

22. Annotated Notes - Lecture 7A - Binary Codes Introduction

23. Lecture 7B - BCD Code, 2421 Code, Self Complementary Binary Codes

24. Annotated Notes - Lecture 7B - BCD Code, 2421 Code, Self Complementary Binary Codes

25. Lecture 7C - Gray Codes

26. Lecture 7D - Finding Gray Code - An Easy Alternate Way

27. Annotated Notes - Lecture 7C-7D - Gray Codes

28. Weekly Quiz 30 - Boolean Algebra, Minimization, Number System - Digital Logic

29. Annotated Notes - Weekly Quiz 30 - Boolean Algebra, Minimization, Number System - Digital Logic

1. Lecture 1 - Compact Truth Table Representation

2. Annotated Notes - Lecture 1 - Compact Truth Table Representation

3. Lecture 2A - Multiplexer

4. Lecture 2B - Realization of Boolean Functions using Multiplexer

5. Annotated Notes - Lecture 2A-2B - Multiplexer

6. Lecture 2C - Practice Questions - Multiplexer

7. Annotated Notes - Lecture 2C - Practice Questions - Multiplexer

8. Lecture 2D - Function Realization using Multiplexer

9. Lecture 2E - Building Large Mux using Small Mux

10. Annotated Notes - Lecture 2D-2E - Building Multiplexer

11. Lecture 2F - Multiplexer with Enable Input

12. Weekly Quiz 31 - Multiplexer GATE EC-EE-IN PYQs - Digital Logic

13. Lecture 3 - Demultiplexer

14. Lecture 4A -Encoder - Binary Encoder

15. Lecture 4B - Encoder - Priority Encoder

16. Annotated Notes - Lecture 2F-4B - Multiplexer with Enable Input

17. Lecture 5A - Decoder

18. Lecture 5B - Active Low Decoder i.e. NAND gate Decoder

19. Lecture 5C - Function Realization using Decoder

20. Annotated Notes - Lecture 5 - Decoder

21. Lecture 6 - Propagation Delay & Timing Diagrams

22. Annotated Notes - Lecture 6 - Propagation Delay & Timing Diagrams

23. Lecture 7A - Adder - Half Adder

24. Annotated Notes - Lecture 7A - Adder - Half Adder

25. Lecture 7B - Adder - Full Adder

26. Annotated Notes - Lecture 7B - Adder - Full Adder

27. Lecture 7C - Adder - Ripple Carry Adder

28. Annotated Notes - Lecture 7C - Adder - Ripple Carry Adder

29. Lecture 7D - Carry Look Ahead Adder Part 1 - Carry Generation & Carry Propagation

30. Lecture 7E - Carry Look Ahead Adder Part 2 - Carry Generator Circuit

31. Annotated Notes - Lecture 7D-7E - Carry Look Ahead Adder

32. Lecture 7F - Carry Look Ahead Adder Part 3 - Few Questions

33. GATE CSE 2007 Question 35 - Look-Ahead Carry Generator Circuit

34. GATE CSE 2016 Question 33 - Carry Look-Ahead Adder

35. Annotated Notes - Lecture 7F - Carry Look Ahead Adder

36. GRE Computer Science - Ripple Carry Adder Delay Question

37. Lecture 8 - Adder for Signed Addition

38. Annotated Notes - Lecture 8 - Adder for Signed Addition

1. Functional Completeness - Complete Playlist

2. Annotated Notes - Functional Completeness

3. Annotated Notes - Posts Functional Completeness Theorem

1. Lecture 1 - Introduction - Combinational Circuits Vs Sequential Circuits

2. Lecture 2A - One Bit Storage Device - Cross Coupled Inverters

3. Lecture 2B - SR Latch - Cross Coupled NOR gates

4. Lecture 2C - SR Latch - Cross Coupled NAND gates

5. Annotated Notes - Lecture 1-2 - Sequential Circuits, SR Latch

6. Lecture 3 - Timing Diagram of SR Latch, Clock

7. Lecture 4 - Flipflops - SR Flipflop

8. Annotated Notes - Lecture 3,4A - Clock, SR Flipflop

9. Lecture 5 - D Flipflop

10. Lecture 6 - Clock Triggering of flipflops

11. Lecture 7 - JK flipflop

12. Lecture 8A - T flipflop

13. Lecture 8B - Few Important Notes for Flipflops

14. Annotated Notes - Lecture 5-8 - D, JK, T Flipflops

15. Lecture 9A - Flipflop Conversion

16. Lecture 9B - Morris Mano PN Flip-flop Question

17. GATE IT 2008 - JK Flipflop Question

18. Annotated Notes - Lecture 9A-9C - Flipflop Conversion

19. Lecture 9D - Flipflop Conversion - SR to T flipflop

20. Annotated Notes - Lecture 9D - Flipflop Conversion - SR to T flipflop

21. Lecture 10A - Direct Inputs in flipflops - Preset & Clear Inputs

22. Lecture 10B - Practice Questions on Flipflops

23. Annotated Notes - Lecture 10 - Direct Inputs in flipflops - Preset & Clear Inputs

24. Lecture 11A - Master Slave Flipflops to Implement Edge Triggering

25. Lecture 11B - Race Around Condition in JK Flipflops

26. Annotated Notes - Lecture 11 - Master Slave Flipflops & Race Condition

27. Lecture 12 - Timing Issues in Flipflops - Setup Time, Hold Time, Frequency

28. Annotated Notes - Lecture 12 - Timing Issues in Flipflops - Hold Time, Setup Time

29. Lecture 13 - Registers

30. Annotated Notes - Lecture 13 - Registers

31. Lecture 14 - Finite State Machines(FSM) - Mealy & Moore Machines

32. Annotated Notes - Lecture 14 - FSM Finite State Machines - Mealy & Moore Machine

33. Next Topic: Counters

34. Lecture 15A - Counters Introduction - Asynchronous Counters, Synchronous Counters

35. Lecture 16A - Asynchronous Counters Part 1 - Divide by 2 Counter, Frequency Division

36. Lecture 16B - Asynchronous Counters Part 2 - Mod-4 Asynchronous Counters, Transient States

37. Annotated Notes - Lecture 15-16B - Counters, Asynchronous Counters Part 1,2

38. Lecture 16C - Asynchronous Counters Part 3 - Binary Ripple Counters, Transient States, Maximum Frequency

39. Lecture 16D - Asynchronous Counters Part 4 - Binary Up Ripple Counter, Mod-M Ripple Counter

40. Lecture 16E - Asynchronous Counters Part 5 - Cascading Counters

41. Lecture 16F - Asynchronous Counters Part 6 - Counting from Anywhere to Anywhere

42. GATE ECE 1987 - Ripple Counter Question

43. GATE ECE 1990 - Ripple Counter Question

44. GATE ECE 1993 - Ripple Counter Question

45. GATE ECE 1999 - Ripple Counter Question

46. Annotated Notes - Lecture 16C-16F - Asynchronous Counters Part 3-6

47. Lecture 17A - Synchronous Counters - The Analysis

48. Lecture 17B - GATE CSE 1990 Synchronous Counter Question - Modulus of Counter

49. GATE CSE 2021 - Synchronous Counter Question

50. Lecture 17C - Synchronous Counters - Design

51. Annotated Notes - Lecture 17 - Synchronous Counters

52. Lecture 18A - Ring Counter - Synchronous Counters

53. Lecture 18B - Johnson Counter - Synchronous Counters

54. Annotated Notes - Lecture 18 - Ring Counter, Johnson Counter

1. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Digital Logic

2. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Digital Logic Notes

1. Boolean Algebra & K-Map Minimization GATE PYQs Playlist

1. Lecture 1 Introduction and Classfull addressing

2. Annotated Notes Lecture 1 Introduction and Classfull addressing

3. Lecture 2 Classless Addressing and Subnetting

4. Annotated Notes Lecture 2 Class less Addressing and Subnetting

5. Lecture 3 Misconceptions in SuperNetting | Longest prefix match and Route aggregation (SuperNetting)

6. Annotated Notes Lecture 3 Route Aggregation

7. Lecture 4 Practice Session on Subnetting and Supernetting [Recording]

8. Annotated Notes Lecture 4 Practice Questions on Subnetting and Supernetting

9. Quiz Discussion: Subnetting and Supernetting

10. Annotated Notes Quiz Subnetting

1. Lecture 5 Layering in Computer Networks

2. Annotated Notes Lecture 5 Laying and Headers

3. Lecture 6 Switching (Packet Switch and Circuit Switch) and Framing in Data Link Layer

4. Annotated Notes Lecture 6 Packet & Circuit Switching, Data link Layer Framing

5. Lecture 7 Error Control Methods (Single Bit Parity Codes, Hamming Distance)

6. Annotated Notes Lecture 7 Error Handling in Computer Networks

7. 8a. Idea Behind Single Error Correcting (SEC) Codes

8. 8b. [Optional] Minimum Number of Parity Bits required for ANY Single Error Correcting Code (Proof is optional but final Result should be remembered )

9. 8c. Construction of Hamming Code

10. Annotated Notes Lecture 8 Hamming Codes (Idea, Proof, Construction)

11. 9a. Cyclic Redundency Check Method and MANY PYQs

12. 9b. ANALYSIS of Cyclic Redundancy Check | GATE 2009

13. Annotated Notes Lecture 9 Cyclic Redundancy Codes

14. Lecture_10: Checksum (Error Control), Delays in Networking (Propagation Delay and Transmission Delay) CLEAR Explanation

15. Annotated Notes Lecture 10 Checksum, Delays in Networking (Propagation Delay and Transmission Delay)

16. Lecture 11: Questions Based on delays (Propagation, Transmission, Queuing, and Processing) in Packet Switched Networks

17. Annotated Notes Lecture 11 Questions Based on delays in Packet Switched Networks

18. Lecture 12: Few more Questions on Packet Switched Networks (GATE 2005, 2014, 2004)

19. Annotated Notes Lecture 12 More questions

20. Lecture 13: Stop-Wait Protocol

21. Annotated Notes Lecture 13 Stop and Wait

22. Lecture 14: Questions on Stop and Wait Protocol

23. Annotated Notes Lecture 14 Stop and Wait Questions

24. Lecture 15: More questions on Stop and Wait Protocol

25. Annotated Notes Lecture 15 More Questions on Stop and Wait

26. Lecture 16: Go Back N Protocol in Detail

27. Annotated Notes Lecture 16 GO Back N Prototcol Working

28. Lecture 17: Selective Repeat Protocol in Detail

29. Annotated Notes Lecture 17 Selective Repeat

30. Lecture 18: Efficiency and Throughput of SR and GBN | Relationship between Sequence number Space and Window Sizes

31. Lecture 19:PYQs on Selective Repeat and GO Back N

32. Annotated Notes Lecture 18,19 Efficiency, Throughput, and PYQs of Selective Repeat and GO Back N

1. Lecture 20:: Media Access Control Protocols - Aloha

2. Annotated Notes Lecture 20 Aloha

3. Lecture 21 Efficiency and Throughput of Aloha

4. Annotated Notes Lecture 21 Efficiency and Throughput of Aloha

5. Lecture 22 CSMA CD and Backoff Algorithm

6. Annotated Notes Lecture 22 CSMA CD

7. Lecture 23 Backoff Algorithm for Random Access Protocols

8. Annotated Notes Lecture 23 Exponential Bakoff Algorithm

9. Lecture 24 Address Resolution Protocol(ARP)

10. Annotated Notes Lecture 24 ARP

11. Lecture 25 Dynamic Host Configuration Protocol (DHCP)

12. Annotated Notes Lecture 25 RARP BOOTP DHCP

13. Spanning Tree Protocol

14. Networking Devices

1. Lecture: IP Header and Fragmentation

2. Annotated Notes Lecture IP Header and Fragmentation

3. Lecture: More Fragmentation Questions

4. Annotated Notes Lecture More Fragmentation Questions

5. PYQs on Fragmentation

6. Lecture 30. ALL GATE PYQs and Some More Questions on IP Fragmentation | Stanford, CMU Questions

7. Annotated Notes Lecture ALL GATE PYQs and Even More questions on Fragmentation

8. Lecture 31 a. Internet Control Message Protocol (ICMP)

9. Lecture 31 b Network Address Translation NAT

10. Annotated Notes Lecture 31 ICMP and NAT

11. Lecture 32 Distance Vector Routing Protocol

12. Annotated Notes Lecture 32 Distance Vector Routing

13. Lecture 32 b PYQs on Distance Vector Routing Protocol and Count to Infinity

14. Annotated Notes Lecture 32 b. DVR PYQs and Count to Infinity

15. Link State Routing Protocol

16. Annotated Notes Link State Routing Protocol

1. Lecture 33 Introduction to Transport Layer and UDP

2. Annotated Notes Lecture 33 Transport Layer and UDP

3. Lecture 34 TCP Header and Connection Establishment

4. Annotated Notes Lecture 34 TCP Header

5. Lecture 35: TCP Flow Control

6. Annotated Notes Lecture 35 TCP Connection Establishment

7. Lecture 36 TCP Congestion Control

8. Annotated Notes Lecture 36 TCP Congestion Control

9. Lecture 37a. More Questions on TCP Congestion From Kurose, Peterson Davie

10. Lecture 37b. [Optional But Please Watch] CWND Increment per ACK in CA Phase | Berkeley and Princeton Questions

11. Lecture 37c. GATE 2004 Nice and Easy Question

12. Annotated Notes Lecture 37 Questions on TCP Congestion Control

13. Lecture 38. More Questions on Congestion Control and TCP Connection Termination

14. Annotated Notes Lecture 38 More Questions on Congestion Control and TCP Connection Termination

15. Lecture 39. TCP Options or Extensions

16. Annotated Notes Lecture 39 TCP Options or Extensions

17. Lecture 40. TCP Timer and How all layer work together

18. Annotated Notes Lecture 40 TCP Timers

19. Please give us feedback on course page

20. Leaky bucket and Token bucket with GATE PYQs. Clear Explanation

1. HTTP

2. DNS

3. SMTP & POP3

4. FTP

5. Annotated Notes Application layer

1. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Computer Networks

2. Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Computer Networks Notes

1. Orientation Session for GATE CSE 2025

1. Weekly Quizzes for GATE CSE 2025

1. Useful Links

1. Mentorship by Anshika Modi AIR 21, GATE CSE 2024, GO Classes Course Student

1. 1. Fundamentals of CS & Introduction (Karan Agrawal)

2. 2. Propositional Logics (Karan Agrawal)

3. 3. First Order Logics (Karan Agrawal)

4. 4. Combinatorics (Karan Agrawal)

5. 5. Graph Theory (Karan Agrawal)

6. Discrete Mathematics - All Modules (Karan Agrawal)

7. Short Notes Discrete Mathematics (Karan Agrawal)

8. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Discrete Mathematics

1. 1. LA M1 - Introduction (Karan Agrawal)

2. 2. LA M2 - System of Linear Equations (Karan Agrawal)

3. 3. LA M3 - Determinants (Karan Agrawal)

4. 4. LA M4 - Eigen Values and Eigen Vectors (Karan Agrawal)

5. 5. LA M5 - Types of Matrices (Karan Agrawal)

6. Linear Algebra - All Modules (Karan Agrawal)

7. Short Notes Linear Algebra (Karan Agrawal)

8. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Linear Algebra

1. 1. Probability M1 - Introduction, Conditional Probability and Independent Probability (Karan Agrawal)

2. 2. Probability M2 - Random Variables, Expectation and Variance (Karan Agrawal)

3. 3. Probability M3 - Discrete and Continuous RVs, Famous Distributions and Statistics (Karan Agrawal)

4. Probability - All Modules (Karan Agrawal)

5. Short Notes Probability (Karan Agrawal)

6. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Probability

1. 1. C Programming M1 - Introduction, Datatypes, Operators, Conditional Statements and Loops (Karan Agrawal)

2. 2. C Programming M2 - Functions, Memory Layout and Storage Classes (Karan Agrawal)

3. 3. C Programming M3 - Recursion, Pointers, Arrays and Structures (Karan Agrawal)

4. C Programming - All Modules (Karan Agrawal)

5. Short Notes C Programming (Karan Agrawal)

6. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - C Programming

1. 1. DS M1 - Linked List (Karan Agrawal)

2. 2. DS M2 - Asymptotic Notations (Karan Agrawal)

3. 3. DS M3 - Stacks and Queues (Karan Agrawal)

4. 4. DS M4 - BSTs and AVL Trees (Karan Agrawal)

5. 5. DS M5 - Heaps (Karan Agrawal)

6. 6. DS M6 - Hashing (Karan Agrawal)

7. 7. DS M7 - Row Major and Column Major in Array (Karan Agrawal)

8. Data Structures - All Modules (Karan Agrawal)

9. Short Notes Data Structures (Karan Agrawal)

10. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Data Structures

1. 1. Algo M1 - Asymptotic Analysis and Time Complexities (Karan Agrawal)

2. 2. Algo M2 - Divide and Conquer (Karan Agrawal)

3. 3. Algo M3 - Other Sorting Algorithms (Karan Agrawal)

4. 4. Algo M4 - Graphs in Algorithms and BFS, DFS (Karan Agrawal)

5. 5. Algo M5 - Greedy Algorithms (Karan Agrawal)

6. 6. Algo M6 - Dynamic Programming (Karan Agrawal)

7. Algorithms - All Modules (Karan Agrawal)

8. Short Notes Algorithms (Karan Agrawal)

9. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024)- Algorithms

1. 1. DBMS M1 - Relational Model & Normalization (Karan Agrawal)

2. 2. DBMS M2 - Queries (Karan Agrawal)

3. 3. DBMS M3 - ER Model (Karan Agrawal)

4. 4. DBMS M4 - Magnetic Disk (Karan Agrawal)

5. 5. DBMS M5 - File Organisation & Indexing (Karan Agrawal)

6. 6. DBMS M6 - Transaction Management & Recovery (Karan Agrawal)

7. Databases - All Modules (Karan Agrawal)

8. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Databases

1. 1. OS M1 - Introduction, System Calls and Scheduling Algorithms (Karan Agrawal)

2. 2. OS M2 - Synchronisation (Karan Agrawal)

3. 3. OS M3 - Memory Management (Karan Agrawal)

4. 4. OS M4 - Deadlock (Karan Agrawal)

5. 5. OS M5 - File Systems (Karan Agrawal)

6. Operating System - All Modules (Karan Agrawal)

7. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Operating System

1. 1. CN M1 - IP Addressing, Subnetting and Supernetting (Karan Agrawal)

2. 2. CN M2,3 - Data Link Layer (Karan Agrawal)

3. 3. CN M4 - Network Layer (Karan Agrawal)

4. 4. CN M5 - Transport Layer (Karan Agrawal)

5. 5. CN M6 - Application Layer (Karan Agrawal)

6. Computer Networks - All Modules (Karan Agrawal)

7. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Computer Networks

1. 1. DL M1 - Boolean Algebra and Minimisation (Karan Agrawal)

2. 2. DL M2 - Number System (Karan Agrawal)

3. 3. DL M3 - Combinational Circuits (Karan Agrawal)

4. 4. DL M4 - Functional Completeness (Karan Agrawal)

5. 5. DL M5 - Sequnetial Circuit (Karan Agrawal)

6. Digital Logic - All Modules (Karan Agrawal)

7. Handwritten Notes by Karan Agrawal (AIR 102 GATE CS 2024) - Digital Logic