1. Introduction

1. Number Systems - Introduction

2. Factors- Divisors

3. Odd and Even Factors

4. Units Place

5. Units Place for Factorial

6. Factorial- Highest Power

7. Number of Zeros in Factorial

8. Number of Zeros in Product

9. Remainder - Introduction

10. Remainder for Factorial

11. Remainder - Two Powers Addition

12. Successive Divisors

13. LCM - Introduction

14. LCM Applications - Level I

15. LCM Applications - Level 2

16. LCM - Greatest- Smallest n-digit Number

17. HCF - Introduction

18. HCF - Basics

19. HCF Applications - Level I

20. HCF Applications - Level 2

21. LCM & HCF Properties

22. Unit Place - Summary

23. Unit Place - Problem

24. Remainder - Concept

25. Remainder - Concept Problem

1. Averages - Introduction & Concept I

2. Averages Concept I - Examples

3. Averages Concept II

4. Averages Concept II - Examples

5. Averages Concept III

6. Averages - Including & Excluding

7. Including & Excluding - Examples I

8. Averages - Replacement

9. Averages - Combined Average

10. Averages - Exercise I

11. Averages - Exercise II

12. Averages - Exercise III

13. Averages - Exercise IV

14. Averages - Exercise V

15. Averages - Exercise VI

16. Averages - Exercise VII

17. Averages - Exercise VIII

18. Averages - Exercise IX

19. Averages - Exercise X

1. Ratio - Introduction

2. Ratio - Exercise I

3. Ratio - Exercise II

4. Ratio - Exercise III

5. Ratio - Exercise IV

6. Ratio - Exercise V

7. Ratio - Exercise VI

8. Ratio - Exercise VII

9. Ratio - Exercise VIII

10. Ratio - Exercise IX

11. Ratio - Exercise X

12. Ratio - Exercise XI

1. Partnership

1. Introduction

2. Basics -1

3. Basics -2

4. Pass-Fail

5. Voters Concept

6. Net Effect

7. Perecentage Change & Comparison - Introduction

8. Perecentage Change Questions

9. Perecentage Comparison Questions

10. Remaining-Left-Rest-Balance

11. Product Constant

1. Introduction to Profit & Loss

2. Basics

3. Quantities

4. Dishonest Salesman

5. Profit on SP

6. Profit & Loss Level 2 Questions

7. Two or more SP is given

8. Two or more CP is given

9. Introduction to Discount

10. Discount Questions

1. Introduction to Compound Interest

2. Introduction to Simple Interest

3. Simple Interest Questions-1

4. Simple Interest Questions-2

5. Compound Interest Questions-1

6. Compound Interest Questions-2

7. SI & CI

8. Difference between SI & CI

1. Introduction to Mixtures & Allegations

2. Model 1 & Model 2 - Level 1 Questions

3. Model 1 & Model 2 - Level 2 Questions

4. Model 1 & Model 2 - Level 3 Questions

5. Mixing 3 Varieties

6. Remove & Replacement-1

7. Remove & Replacement-2

1. Time & Work - Introduction

2. Basic Questions

3. Alternate Days

4. Join- Left

5. Work & Wages

6. Efficiency Method

7. Chain Rule

8. Chain Rule - Problems

9. Men Days

10. Time & Work - Men Days

1. Pipes & Cisterns - Introduction

2. Fill- Empty

3. Time to Empty

4. Tank Capacity

5. More Fill Pipes - Less Time

6. Efficient- Fast

7. Alternate Hours

8. Open- Close

1. Time Speed & Distance - Introduction

2. Distance is Constant

3. Time Saving

4. Time is Constant

5. Without Stoppages

1. Problems on Train - Introduction

2. Distance - Pole- Platform

3. Relative Speed

4. Level I - Examples (Stationary Objects)

5. Level II - Examples (Moving Objects)

6. Trains Meeting

7. Train 1 2 & Bird

1. Average Speed

1. Boats & Streams

1. Circular Motion & Race - Introduction

1. Circular Race Problem - I

2. Circular Race Problem - II

3. Circular Race Problem - III

4. Circular Race Problem - IV

5. Circular Race Problem - V

6. Circular Race Problem - VI

7. Circular Race Problem - VII

1. Races and Games Introduction

2. Races & Games Problem -I

3. Races & Games Problem - II

4. Races & Games Problem - III

5. Races & Games Problem - IV

6. Races & Games Problem - V

7. Races & Games Problem - VI

8. Races & Games Problem - VII

1. Introduction

2. Quadrilateral

3. Triangle

4. Trapezium

5. Trapezium - I

6. Parallelogram

7. Hexagon

8. Angles

9. Square

10. Circle

11. Cylinder

12. Cylinder - I

13. Cube & Cuboids

14. Sphere

15. Sphere - I

16. Problems on Perimeter

17. Problems on Perimeter - I

18. Perimeter & Area Problems

19. Perimeter Problems

20. Area Problems

21. Mensuration Geometry_2D Level 1 Previous Questions

22. Mensuration Geometry_2D Level 2 Previous Questions

23. Mensuration Geometry_2D Level 3 Previous Questions

24. Mensuration Geometry_2D Level 4 Previous Questions

25. Mensuration Geometry_3D

26. Mensuration Geometry_Angles

1. Area & Volumes Problem - 1

2. Area & Volumes Problem - 2

3. Area & Volumes Problem - 3

4. Area & Volumes Problem - 4

5. Area & Volumes Problem - 5

6. Area & Volumes Problem - 6

7. Area & Volumes Problem - 7

8. Area & Volumes Problem - 8

9. Area & Volumes Problem - 9

10. Area & Volumes Problem - 10

11. Area & Volumes Problem - 11

12. Area & Volumes Problem - 12

13. Area & Volumes Problem - 13

14. Area & Volumes Problem - 14

1. Permutation and Combination - Introduction

2. nPr and nCr Formula

3. Permutation (n-digit number) - Level 1 Questions

4. Permutation (n-digit number) - Level 2 Questions

5. Permutation (Alternate Together) - Level 1 Questions

6. Permutation (Word - Letter) - Level 2 Questions

7. Permutation (Alternate Together) - Level 2 Questions

8. Circular Permutation

9. Combinations

10. Combinations - Applications

1. Probability_Introduction & Level 1 Questions

2. Probability_Level 2 Questions

3. Probability_Previous Questions

1. Blood Relations - Introduction

2. Mixed Blood Relations

3. Coded Blood Relations

4. Single Person Blood Relations

1. Model I - Relation between 3 Words

2. Model II - Questions based on given Venn Diagrams

3. Model III - Venn Diagram using Data I

4. Model III - Venn Diagram using Data II

1. Analytical Reasoning - Introduction

2. Steps in Data Arrangements

3. Row Arrangement - Single Row

4. Row Arrangement - Parallel Rows

5. Circle Arrangement

6. Square Arrangement

7. Puzzles - Level I

8. Puzzles - Level II

1. Angel between the Hands

2. Coincide Together

3. Opposite

4. Right Angle

5. Angle (at a specified time)

6. Number of Times in a Day

7. Mirror Image in Clocks

8. Incorrect Clock

9. Reflex Angle

1. Calendar - Introduction

2. Leap Year & Odd Days

3. Same Calendar

4. Last Day of Century

5. Find a day of a week using reference date

6. After x days (or) Before x days

7. Find the day of a week

1. Coded Inequalities - Introduction

2. Level I - Examples

3. Level II - Examples

4. Level III - Examples

1. Syllogism - Introduction

2. Level I - Example

3. Level II - Example

1. Dice - Introduction

2. Folded Dice

3. Unfolded (or) Opened Dice

4. Cuboid

5. Cube & Cuboid

1. Counting Number of Squares

2. Counting Number of Rectangles

3. Counting Number of Triangles - I

4. Counting Number of Triangles - II

5. Triangles Count using Combinations

6. Counting Number of Parallelograms

7. Counting Number of Straight Lines

1. Coding & Decoding - Introduction

2. Number Coding

3. Letter Coding

4. Matrix Coding

5. Mixed Coding

6. Substitution Coding

7. Condition based Coding

1. Number Series - Introduction

2. Number Series - Examples

3. Wrong Number Series

4. Alphabet & Alphanumeric Series

5. Repeated Series

1. Analogy - Introduction

2. Number Analogy

3. Letter- Alphabet Analogy

4. Verbal Analogy

1. Number Classification

2. Letter Classification

1. Inserting Missing Character

1. Directions - Introduction

2. Clock- Time

3. Shadow Concept

4. Directions & Distance - I

5. Directions & Distance - II

6. Miscellaneous

1. Arthmetical Reasoning - 1

2. Arithmetical Reasoning - 2

3. Arithmetical Reasoning - 3

4. Arthmetical Reasoning - 4

1. Logical conclusions

1. Logical puzzles -1

2. Logical puzzles - 2

3. Logical puzzles - 3

4. logical puzzles - 4

5. logical puzzle - 5

6. Logical puzzle - 6

7. Logical puzzle -7

8. Logical puzzle 8

9. logical puzzle - 9

1. Data Interpretation Introduction

2. Table exercise -1

3. Table exercise - 2

4. 4.Line graph exercise -1

5. Line graph exercise -2

6. Bar graph exercise -1

7. Pie chart exercise -1

8. Pie chart exercise -2

9. Miscellaneous exercise

1. Progressions - Introduction

2. Progressions - AP Series Introduction

3. Progressions - AP Problems -1

4. Progressions - AP Problems -2

5. Progressions - AP Problems -3

6. Progressions- HP series

7. Progression - GP Series Introduction

8. Progression - GP Problems -1

9. Progressions - GP Problems - 2

10. Progression - AGP Problems - 1

11. Progression - AGP Problems - 2

12. Progression - AGP Problems - 3

1. Logarithms - Introduction

2. Logarithms - Problems - 1

3. Logarithms - Problems - 2

4. Logarithms - Previous GATE questions

5. Logarithms - Antilog

6. Logarithms - Problems 3

7. Logarithms - Problems - 4

8. Logarithmms - Number of digits

9. Logarithms - Number of zeros

10. Logarithms - Problems - 5

1. Introduction

2. Indices problems - 1

3. Indices problems - 2

4. Surds problems - 1

5. Surds problem - 2

6. Surds problems - 3

1. Problems on ages

1. Introduction

2. Series - 1

3. Series - 2

4. Series - 3

5. Pattern completion

6. Spotting out Embedded figure

7. Classification

8. Mirror & water images

9. Analogy

10. Paper folding

11. Paper Cutting

12. Grouping of figures

13. Figure formation- Assembling

14. Figure matrix

15. Rotation

16. Diagramatical logical thinking

17. Previous Year Questions -1

18. Previous Year Questions -2

19. Previous Year Questions -3

1. Introduction to Verbal Ability

2. Overview of Verbal Ability in GATE

3. Vocabulary (Homophones and Homographs)

4. Contextual in Meaning Analogy and Verbal Phrases

5. Usage and Grammar

1. Syntax of Articles - 1

2. Syntax of Articles - 2

3. Exercise and Quiz on Articles - 1

4. Exercise and Quiz on Articles and Key - 2

1. Usage of Articles - 1

2. Usage of Articles - 2

3. Usage of Articles - 3

4. Other usages of Articles and Determiners - 1

5. Other usages of Articles and Determiners - 2

6. Other usages of Articles and Determiners - 3

7. Other usages of Articles and Determiners - 4

8. Other usages of Articles and Determiners - 5

9. List of Uncountable Nouns

1. Collective Nouns

1. Abstract Noun(Concept of Vocabulary) - 1

2. Abstract Noun (Concept of Vocabulary) - 2

3. Abstract Noun(Concept of Vocabulary) - 3

4. Abstract Noun Grammar

5. Adjectives and Verb Suffixes

6. Abstract Noun (Grammar Analogy Sentence Completion)

1. The Noun - Gender

1. The Noun Number(Subject- Verb Agreement) - 1

2. The Noun Number(Subject- Verb Agreement) - 2

3. The Noun Number(Subject- Verb Agreement) - 3

4. Subject- Verb Agreement Exercise - 1

5. Subject- Verb Agreement Exercise - 2

6. Subject- Verb Agreement Exercise - 3

1. The Noun- Possessive Case

1. Infinitive & Gerund

1. The Noun Exercise with Key

1. Personal Pronoun

2. Sequence of Pronoun

3. Nominative Case or Objective Case (I or Me)

1. Relative Pronoun (who-whom) - 1

2. Relative Pronoun (who which that) - 2

3. Relative Pronoun (who-which-that) - 3

4. Relative Pronoun (who-which-that) - 4

5. Restrictive and Non-Restrictive Relative Clause (who-which-that) - 5

6. Relative Pronoun (as but) - 6

1. Indefinite Pronoun

1. Reflexive Pronoun

1. Pronoun Agreement-Sub Verb Agreement - 1

2. Pronoun Agreement-Sub Verb Agreement - 2

3. Pronoun Agreement-Sub Verb Agreement - 3

1. Correlatives and Connectors

2. Exercise and Quiz on Correlatives

1. Exercise and Quiz on Pronoun Agreement

2. Exercise and Quiz on Pronoun

1. Introduction to Analogy - I

2. Introduction to Analogy - II

1. Kinds of Analogical Relationships - I

2. Kinds of Analogical Relationships - II

3. Kinds of Analogical Relationships - III

1. Exercise and Quiz on Analogy

1. Active Voice and Passive Voice - I

2. Active Voice and Passive Voice - II

3. Transitive Verb and Intransitive Verb

4. Active Voice and Passive Voice Miscellaneous - I

5. Active Voice and Passive Voice Miscellaneous - II

1. Misplaced Participles

1. 24 Anomalous Finite Verbs (Modal Verbs)

1. Special Functions of Modal Verbs - I

2. Special Functions of Modal Verbs - II

3. Special Functions of Modal Verbs - III

1. Additions to Remarks

2. The Question Tag

3. The Question Tag - I

1. Conditional Tense - I

2. Conditional Tense - II

3. Conditional Tense - III

4. Exercise on Conditional Tense

1. Reported Speech (Direct and Indirect Speech) - I

2. Reported Speech (Direct and Indirect Speech) - II

3. Reported Speech(Direct and Indirect Speech) - III

4. Reported Speech (Direct and Indirect Speech) - IV

5. Exercise and Quiz on Auxillary Verbs

1. Tenses (Usage of Simple Present)

2. Tenses (Usage of Present Continuous)

3. Present Perfect

4. Present Perfect and Present Perfect Continuous Tense

5. Simple Past Past Continuous Past Perfect Past Perfect Continuous

6. Simple Future Future Continuous Future Perfect Future Perfect Continuous Tense

7. Key to Tenses

1. Three Degrees of Comparison and its Application - I

2. Three Degrees of Comparison and its Application - II

1. Transformation of Positive Degree to Comparative Degree

2. Transformation of Comparative Degree to Positive Degree

3. Transformation of Superlative Degree to Comparative Degree to Positive Degree

1. Other Usages of Adjectives - I

2. Other Usages of Adjectives - II

3. Exercise and Quiz on Adjective

1. Kinds of Adverbs

2. Position of Adverbs - I

3. Position of Adverbs - II

4. Position of Adverbs - III

5. Position of Adverbs - IV

1. Preposition

2. Kinds of Prepositions

3. Techniques to Learn preposition

4. Confused Preposition - I

5. Confused Preposition - II

1. Excercise and Quiz on Prepositions

2. Excercise on Phrasal Verbs - I

3. Excercise on Phrasal Verbs - II

4. Excercise on Phrasal Verbs - III

5. Excercise on Phrasal Verbs - IV

6. Excercise on Phrasal Verbs - V

7. Excercise on Phrasal Verbs - VI

8. Excercise on Phrasal Verbs - VII

1. Sentence Completion - I

2. Sentence Completion - II

1. Vocabulary - Root List - I

2. Vocabulary - Root List - II

3. Vocabulary - Root List - III

4. Vocabulary - Root List - IV

5. Vocabulary - Root List - V

6. Vocabulary - Root List - VI

7. Vocabulary - Root List - VII

8. Vocabulary - Root List - VIII

9. Vocabulary - Root List - IX

10. Vocabulary - Root List - X

11. Vocabulary - Root List - XI

12. Vocabulary - Root List - XII

13. Vocabulary - Root List - XIII

14. Vocabulary - Root List - XIV

15. Vocabulary - Root List - XV

16. Vocabulary - Root List - XVI

17. Vocabulary - Root List - XVII

1. Confused Words - I

2. Confused Words - II

3. Confused Words - III

4. Confused Words - IV

5. Confused Words - V

6. Confused Words - VI

7. Confused Words - VII

8. Confused Words - VIII

9. Confused Words - IX

10. Confused Words - X

11. Confused Words - XI

12. Confused Words - XII

13. Confused Words - XIII

14. Confused Words - XIV

1. Critical Reasoning Basics

2. Basic Requirements

3. Concepts

4. Principles

5. Types of Questions - I

6. Types of Questions - II

1. Example Questions - I

2. Example Questions - II

3. Example Questions - III

4. Example Questions - IV

5. Example Questions - V

6. Example Questions - VI

7. Example Questions - VII

8. Example Questions - VIII

9. Example Questions - IX

10. Example Questions - X

1. Course Introduction

1. Different Types of Matrices

2. Algebra of Matrices

3. Determinant and Inverse

4. Vectors

5. Problems on Basics of Matrices

1. Elementary Matrices

2. Definition of Rank of a Matrix

3. Properties of Rank of a Matrix

4. Linearly Independent and Dependent Vectors

5. Problems on Rank of Matrix

1. Terminology

2. Geometrical Interpretation of Non Homogenous system of Linear Equations

3. Matrix Inverse Method

4. Cramers Rule

5. Gauss-Elimination Method

6. Homogenous System of Linear Equations

7. Null Space of Homenous System of Equations

8. Problems on System of Linear Equations

1. Definition of Eigen Value and Eigen Vector

2. Algebraic and Geometric Multiplicity

3. Properties of Eigen Values and Eigen vectors

4. Diagonalization

5. Cayley- Hamilton Theorem

6. Problems on Eigen Values and Eigen Vectors

1. Quadratic Forms

1. Lu Decomposition

1. Common Doubts Asked by the Students on Linear Algebra

1. Solutions for Linear Algebra Problems GATE 2022

1. Calculus Course Introduction

2. Standard Functions

3. Limit of a Function

4. Understanding Left and Right Limits

5. Continuity

6. Problems on Continuity

7. Differentiability

8. Problems on Differentiability

9. Indeterminate Forms

10. Problems on Indeterminate Forms

1. Rolles Theorems

2. Lagranges Theorem

3. Cauchys Theorem

4. Problems

1. Introduction to Maxima and Minima

2. Maxima and Minima for Single Variable Case

3. Problems

4. Maxima and Minima for Function of Two Variables

1. Fundamental Theorems of Integral Calculus

2. Mean Value Theorem

3. Definite Integrals and Their Properties

4. Problems on Definite Integrals

5. Improper Integrals

6. Problems

7. Gamma and Beta Function

8. Applications of Definite Integral

1. Introduction

1. Basic Counting Principle

2. Permutations

3. Combinations

4. Integer solutions of an Equation

1. Introduction to Probability

2. Definition of Probability

3. Complement Rule

4. Addition Rule

5. Problems

6. Conditional Probability

7. Problems

8. Bayes Rule

9. Problems

10. Sampling

11. Problems Related to Series

1. Introduction to Random Variables

2. Discrete Random Variable

3. Continuous Random Variable

4. Expectation of a Random Variable

5. Variance of a Random Variable

6. Problems

7. Uniform Random Variable

8. Problems

9. Exponential Random Variable

10. Gaussian Random Variable

11. Problems

12. Poisson Random Variable

13. Binomial Random Variable

14. Problems

15. Approximation of Binomial Random Variable

16. Sum of Independent Random Variable

17. Central Limit Theorem

1. Mean

2. Median

3. Mode

4. Problems

5. Standard Deviation

1. Introduction

1. Implication and Biconditional

1. Tautology Contingency & Satisfiability

1. Tautological Implication

1. Worked out example

1. GATE Questions

1. Argument

1. Rules of Inference

2. Rules of Inference Worked out Example - 1

3. Rules of Inference Worked out Example - 2

4. Rules of Inference Worked out Example - 3

1. First order logic introduction - I

2. First order logic introduction - II

3. First order logic introduction - III

4. First order logic Examples - 1

5. First order logic Examples - 2

6. First order logic Examples - 3

7. First order logic Examples - 4

8. First order logic Examples - 5

9. First order logic Examples - 6

10. First order logic Examples - 7

11. First order logic Examples - 8

12. First order logic Examples - 9

13. First order logic Examples - 10

1. GATE Questions - 1

2. GATE Questions - 2

3. GATE Questions - 3

4. GATE Questions - 4

5. GATE Questions - 5

1. Introduction Set Theory - I

2. Introduction Set Theory - II

1. Basic Concepts of Sets

2. Power Set

3. Power Set GATE Question - I

4. Power Set GATE Question - II

5. Power Set GATE Question - III

6. Power Set - Worked out Examples

7. Power Set - Worked out Examples - I

8. Power Set - Worked out Examples - II

1. Venn Diagram

2. Venn Diagram - GATE Questions

3. Venn Diagram - GATE Questions - I

4. Venn Diagram - GATE Questions - II

1. Relation

2. Reflexive Relation

3. Reflexive Relation - GATE Question

4. Irreflexive Relation

5. Symmetric Relation

6. Antisymmetric Relation

7. Asymmetric Relation

8. Transitive Relation

9. Equivalence Relation

10. Equivalence Relation - I

11. Partial Order Relation

12. GATE Questions on Relations - 1

13. GATE Questions on Relations - 2

14. GATE Questions on Relations - 3

15. GATE Questions on Relations - 4

16. GATE Questions on Relations - 5

17. GATE Questions on Relations - 6

18. GATE Questions on Relations - 7

19. GATE Questions on Relations - 8

20. GATE Questions on Relations - 9

21. GATE Questions on Relations - 10

1. Properties of Relations

2. Properties of Relation - I

3. Relationship between Reflexive and Symmetric

4. Relationship between Reflexive and Irreflexive

5. Relationship between Reflexive and Antisymmetric

6. Relationship between Reflexive and Asymmetric

7. Relationship between Irreflexive and Symmetric

8. Relationship between Irreflexive and Antisymmetric

9. Relationship between Irreflexive and Asymmetric

10. Relationship between Symmetric and Antisymmetric

11. Relationship between Antisymmetric and Asymmetric

12. Question (Relations) - 1

13. Questions (Relations) - 2

14. Equivalence Relations - GATE Questions

15. Equivalence Class - Questions

16. Partition Set Theory

17. Examples of Partion Set

18. Set Refinement

19. Reflexive Closure Symmetric Closure Trans

20. GATE Questions (Closure)

21. POSET Examples - 1

22. POSET Examples - 2

1. HasseDiagram

2. Max & Min Element

3. Lattice - I

4. Lattice - II

5. Complemented Lattice

6. Distributive Lattice

7. Boolean Algebra

1. Function Definition

2. GATE Questions - Functions - 1

3. GATE Questions - Functions - 2

4. One - One Function

5. GATE Questions on One - One Function

6. Onto Function

7. Bijective Constant Identity Inverse

8. GATE Question Inverse Function

9. Function Composition

10. Properties of Function Composition

11. GATE Questions - I

12. GATE Questions - II

13. Worked Out Examples - I

14. Worked Out Examples - II

1. Quasigroup

2. Semi Group

3. Monoid

4. Group

5. Finite Group Examples

6. Infinite Group Examples

7. Properties of Group

8. Addition Modulo

9. Multiplication Modulo

10. Order of an Element

11. Subgroup

12. Cycle Group

13. GATE Questions - I

14. GATE Questions - II

15. GATE Questions - III

16. GATE Questions - IV

17. GATE Questions - V

1. Introduction

2. Principle of Inclusion & Exclusion

3. Worked Out Principle

4. GATE Questions

1. Euler Function

2. GATE Questions

3. GATE Questions

1. Sum Rule & Product Rule

2. Worked Out Examples

3. Worked Out Examples

4. Worked Out Examples

1. Permutation & Combination

2. Worked out Examples on Model - 1

3. Worked out Examples on Model - 2

4. Worked out Examples on Model - 3

5. Worked out Examples on Model - 3

6. Worked out examples on Model - 4

7. Worked out examples

8. Worked out examples

9. Worked out examples

10. Worked out examples

11. Worked out examples

12. Worked out examples

13. Worked out examples

14. Worked out examples

15. Worked out examples

16. Worked out examples

17. Worked out examples

18. Worked out examples

19. Worked out examples

20. Worked out examples

21. Worked out examples

1. Pigeon Hole Principle

2. Pigeon Hole Principle

1. Derangement - 1

2. Derangement - 2

3. Worked Out Examples

4. GATE Questions

1. Recurrence Relation & Master Theorem

2. GATE Questions - Master Theorem

3. Substitution Method

4. GATE Questions - Substitution Method

5. Master theorem - Subtraction

6. Method of Charactertic Roots

7. Worked out examples

8. Worked out examples

9. Methods of Undetermined Coefficient

10. Worked out examples

11. Formation of Reccurence Relation

12. Formation of Recurrence Relation

1. Generating Function - I

2. Generating Function - II

3. Generation Function - III

4. Generation Function - IV

5. Worked Out Examples

6. Worked Out Example

7. Worked Out Example

8. Worked Out Example

1. Basic Concepts

2. Simple Graph

3. Sum of Degrees Theorem

4. Graphical Sequence-1

5. Graphical Sequence-2

6. Havel Hakimi Result

7. Types of Graphs-I

8. Types of Graphs-II

9. Types of Graphs -III

10. Worked out example-1

11. Worked out example-2

12. Worked out example-3

13. GATE Question-1

14. GATE Question-2

15. GATE Question-4

16. GATE Question-5

17. GATE Question-6

18. GATE Question-7

19. GATE Question-8

20. GATE Question-9

21. GATE Question-10

22. GATE Question-11

23. GATE Question-12

24. GATE Question-13

25. GATE Question-14

26. GATE Question-15

27. GATE Question-16

28. GATE Question-17

29. GATE Question-18

30. GATE Question-19

1. Coloring

2. Coloring Worked out example-1

3. Coloring Worked out example-2

4. Coloring Worked out example-3

5. Coloring Worked out example-4

6. Coloring Worked out example-5

7. Coloring Worked out example-6

8. Coloring Worked out example-7

9. Coloring Worked out example-8

10. Coloring Worked out example-9

11. Coloring Worked out example-10

12. Coloring Worked out example-11

13. Continution

14. GATE Question-1

15. GATE Question-2

16. GATE Question-3

1. Matching

2. Matching Worked out examples-1

3. Matching Worked out examples-2

4. Matching Worked out examples-3

5. Matching Worked out examples-4

6. GATE Questions-1

1. Connectivity-I

2. Connectivity -II

3. Connectivity worked out examples

4. Connectivity workedout examples

5. Connectivity worked out examples

6. Connectivity worked out examples

7. Connectivity_GATE Question-1

8. Connectivity_GATE Question-2

1. Euler Circuit and Euler Path

2. Worked out examples

3. Euler Circuit-GATE Question-1

4. Euler Circuit-GATE Question-2

1. Covering GATE Question-1

2. Covering GATE Question-2

1. Isomorphism GATE Question-1

1. Course Introduction

1. Introduction to Digital Logic

1. Introduction

2. Number System Conversion for Integers

3. Number System Conversion for Fractional Numbers

4. Number System Conversion for Mixed Numbers

5. Binary to Octal

6. Binary to Hexadecimal

7. Exercise - I

8. Exercise - II

9. Exercise - III

10. Exercise - IV

1. Binary Addition

2. Octal Addition

3. Hexadecimal Addition

4. Binary Subtraction

5. Octal Subtraction

6. Hexadecimal Subtraction

7. Arithmetic - Exercise

1. Introduction to Complements

2. Decimal 9s & 10s Complement

3. Binary Complements

4. Octal Complements

5. Signed Complements

6. Signed Extension

7. Signed Extension - Examples

8. Representation of -3 to 3

9. Exercise - I

10. Exercise - II

11. Exercise - III

12. Exercise - IV

1. Binary Code

2. BCD Code

3. 3321 Code

4. Weighted and Non - Weighted Codes

5. Excess - 3 Code

6. Gray Code

7. ASCII Code

1. Boolean Algebra - Introduction

2. Postulates in Boolean Theory

3. Boolean Algebra - Exercise I

4. Boolean Algebra - Exercise II

5. Duality Theorem

6. Duality Theorem - Examples

7. Self Duality

8. Demorgans Theorem

9. Demorgans Theorem - Examples

10. Boolean Function Forms

11. Complement of Boolean Function

12. Previous Years Questions - I

13. Previous Years Questions - II

14. Previous Years Questions - III

15. Previous Years Questions - IV

16. Previous Years Questions - V

17. Previous Years Questions - VI

1. Introduction to Logic Gates

2. Basic Gates

3. Universal Logic Gates

4. XOR XNOR Gates

5. Buffer Logic Gate

6. Bubbled Gates

7. Properties of XOR Gate

8. Properties of XOR Gate - Example

9. Relation between XOR & XNOR

10. Design (or) Implement all Logic Gates using NAND (or) NOR

11. Venn Diagrams

12. Design n input NAND using 2 input NAND

13. Design n input NOR using 2 input NOR

14. Design Logic Functions using NAND Gates

15. Design Logic Functions using NOR Gates

16. Exercise - I

17. Exercise - II

18. Exercise - III

19. Exercise - IV

20. Exercise - V

1. Introduction to K-Maps

1. 2 Variable K-Map

1. 3 Variable K-Map

2. 3 Variable K-Map - Example

1. 4 Variable K-Map - Introduction

2. 4 Variable K-Map - Example I

3. 4 Variable K-Map - Example II

1. Dont Care - Introduction

2. Dont Care - Example I

3. Dont Care - Example II

1. K-Map Simplification for SPOS

1. 5 Variable K-Map

1. Consensus Theorem

1. Relation between Sigma m & Pie M

1. Prime Implicant - Introduction

2. Prime Implicant - Examples

1. Exercise - I

2. Exercise - II

3. Exercise - III

4. Exercise - IV

5. Exercise - V

1. Combination Logic Circuits - Introduction

1. Half Adder

2. Full Adder

1. Half Subtractor

2. Full Subtractor

1. Design Full Adder using Half Adder

1. Design Full Subtractor using Half Subtractor

1. Design Adders Subtractors using Universal Logic Gates

1. Binary Parallel Adder

1. Parallel Adder - Examples

1. Carry Look Ahead Adder

1. Overflow in Unsigned Arithmetic

2. Overflow in Signed Arithmetic

3. Signed Arithmetic - Cases

4. Overflow - Examples

5. Overflow - Previous Years Questions

1. Magnitude Comparator

1. Encoders & Decoders

2. Design 4 by 2 Encoder

3. Decoder

4. Types of Decoders - I

5. Types of Decoders - II

6. Decoders - Examples I

7. Decoders - Examples II

1. Multiplexer - Introduction

2. De-Multiplexer

3. Multiplexer Design

4. Multiplexer - Exercise I

5. Multiplexer - Exercise II

6. MUX as Universal Gates

7. Multiplexer - Exercise III

8. Multiplexer - Exercise IV

9. Multiplexer - Exercise V

1. Sequential Logic Circuits - Introduction

2. Comparision between Combinational & Sequential Logic Circuits

3. Clock

4. Synchronous Sequential Circuit

5. Asynchronous S.L.C

6. Comparison between Synchronous and Asynchronous

1. Latch - Introduction

2. SR Latch using NOR Gates

3. SR Latch using NAND Gates

1. Flip Flops - Introduction

2. Types of Flip Flops

3. SR Flip Flop

4. JK Flip Flop

5. T - Flip Flop

6. D Flip Flop

7. Flip Flop Conversions - Examples

8. Propagation Delay

9. Race Around Condition

10. Master-Slave Flip Flop

1. Register - Introduction

2. Register - Examples

3. Register - Applications

1. Counters - Introduction

2. Relation between N & n in a Counter

3. Up and Down Counters

4. Cascading of Counters

1. Types of Counters

2. Asynchronous Up Counters

3. Asynchronous Down Counters

4. Difference between Up and Down Counters

5. Effects of Propagation Dealy in Asynchronous Counters

6. Synchronous Counters

7. Shift Register Counters

8. Ring Counters

9. Johnson Counters

1. Exercise - I

2. Exercise - II

3. Exercise - III

4. Exercise - IV

1. Introduction & Weightage Analysis

1. Introduction

1. Signed Binary Data Representation (Integer)

2. Signed Magnitude Representation

3. Signed 1s Complement Representation

4. Signed 2’s Complement Representation

5. Sign bit extension

6. Question & Answer

7. Overflow in Signed 2s Complement Representation

8. Question & Answer

9. Question & Answer

1. Different Arithmetical Operations

2. Unsigned Binary Data Addition

3. Signed Binary Data Addition

4. Signed Binary Data Subtraction

1. Different Multiplication Techniques

2. Multiplication Using Repetitive Addition

3. Multiplication Using Shift and Add Technique

4. Booths Multiplication

1. Features of Booths Algorithm

2. Booths Code Generation

3. Question & Answer

4. Question & Answer

5. Question & Answer

6. Question & Answer

1. Floating Point Representation

2. Fraction Representation

3. Expression Value of Floating Data

4. Biasing

5. Normalization

6. Question & Answer

7. Question & Answer

8. Question & Answer

9. Limitations of normalized mantissa

1. IEEE Standards for Floating point Representation

2. IEEE Standard for 32 bit Representation

3. Question & Answer

4. Question & Answer

5. Question & Answer

6. Question & Answer

7. Question & Answer

8. IEEE 754 Standard for 64 bit Representation

9. Floating Data Range Increment Explanation

1. Carry Look ahead Generator and Adder

2. Full Adder

3. Ripple Carry Adder

4. Question & Answer

5. Question & Answer

6. Carry Lookahead Generator Application Merits and Demerits

7. Design of Carry Lookahead Generator (C.L.G)

8. Design of Carry Lookahead Adder (C.L.A)

9. Question & Answer

10. Question & Answer

1. Memory Organization Introduction

1. Memorys Function in a Digital Computer

1. Memory Basics

1. Memory Addressing

2. Question & Answers

1. Memory Size Expansion

2. Question & Answer

3. Question & Answers

1. Memory Classification

2. Primary Memory

3. Secondary Memory

4. Electronic Memory

5. Magnetic Memory

6. Optical Memory

1. Electronic Memory Classification

2. Electronic ROM Classification

3. ROM Design

4. Question & Answer

5. Design a Full Adder ROM with Decoder and Resistors

6. ROM Applications

7. Question & Answer

8. ROM design for Squarer operation

1. Electronic RAM Classification

2. Dynamic RAM Design

3. Dynamic RAM Applications

1. Static RAM Design

2. Static RAM Applications

1. Memory Hierarchy

1. Cache Memory Basics

1. Cache Hit and Cache Miss

2. Serial Connection

3. Problem

4. Problem

5. Problem

6. Problem

7. Three Level Memory Hierarchy

8. Problem

9. Locality of reference

1. Different mapping Techniques

1. Tag Memory Directory

1. Direct Mapping

2. Tag Directory Computation in Direct Mapped Cache

3. Direct Map Demerits

4. Tag Field Expression in Direct Map

5. Question & Answer

6. Question & Answer

7. Question & Answer

8. Question & Answer

1. Block Set Associative Mapping

2. Difference between Direct and 2-way Block Set Associative

3. Tag Directory Computation in N-way set associative Mapped Cache

1. Fully Associative Mapping

2. Question & Answer

3. Question & Answer

4. Question & Answer

5. Question & Answer

6. Question & Answer

7. Question & Answer

8. Question & Answer

9. Question & Answer

10. Question & Answer

11. Question & Answer

12. Question & Answer

1. Different misses occurred during program execution

2. Compulsory miss

3. Conflict miss

4. Capacity miss

5. Question & Answer

6. Question & Answer

1. Different block Replacement Techniques

2. FIFO

3. LRU

4. Optimal

5. Question & Answer

6. Question & Answer

7. Question & Answer

8. Question & Answer

9. Question & Answer

10. Question & Answer

11. Question & Answer

12. Question & Answer

13. Question & Answer

14. Question & Answer

15. Question & Answer

16. Question & Answer

1. Different Writing Techniques

2. Question & Answer

3. Question & Answer

4. Question & Answer

5. Question & Answer

6. Question & Answer

1. Hardware circuit required for searching Hits or Miss during word reading operation in direct mapped cache

1. Hardware circuit required for searching Hits or Miss during word reading operation in Block set Associative mapped cache

2. Question & Answer

3. Question & Answer

4. Question & Answer

5. Question & Answer

1. Associative Memory

1. Introduction

1. Role of Secondary memories in a system

2. Secondary memories Classification

3. Floppy

4. Hard Disk

5. Magnetic Tape

6. CD and DVD

1. Magnetic Surface

2. Different Data Recording methods in Magnetic Surface

3. Data Storage capacity in a Magnetic Surface

4. Addressing of a Sector or Byte in one Surface

5. Question & Answer

6. Magnetic Surface operation

7. Average Latency

8. Disk Motor Operation and Time Computation

9. Word Access Time Computation

10. Question & Answer

11. Disk System Connection

1. Magnetic Hard Disk

2. Data Storage Capacity in Magnetic Hard Disk

3. Addressing of a Sector or Byte in a Hard Disk

4. Question & Answer

5. Question & Answer

6. Question & Answer

7. Question & Answer

8. Question & Answer

9. Question & Answer

10. Question & Answer

11. Question & Answer

12. Question & Answer

13. Question & Answer

14. Cylinder

15. Question & Answer

16. Question & Answer

1. Introduction

1. CPU Basics

2. CPU Registers

3. Accumulator

4. Program Counter

5. Address and Data Register

6. Memory Address Register

7. Memory Data Register

8. Instruction Register

9. General Purpose Registers

10. Base Register & Index Register

11. Stack Pointer

1. Stack Memory and its Operation

2. Technique

3. Stack growing Down technique

4. Flag Register

1. Instruction Set Classification that depends on the type of Reference

2. Register Reference Instructions

3. Memory Reference Instructions

4. I O Reference Instructions

1. Instruction Set Classification

2. Instruction Code generation for ACE Processor

3. of operations in the instruction code

4. Three Address Instructions

5. Two Address Instructions

6. One Address Instructions

7. Zero Address Instructions

8. Question & Answer

9. Question & Answer

10. Question & Answer

11. Question & Answer

12. Question & Answer

13. Question & Answer

14. Question & Answer

15. Question & Answer

16. Question & Answer

17. Question & Answer

18. Question & Answer

19. Question & Answer

20. Question & Answer

21. Question & Answer

1. Instruction Set Classification that depends on the Operation to be performed

2. Data Movement Instructions

3. Data Manipulation Instructions

4. Program Control Instructions

5. CALLXXXX & RET

6. Software Interrupts (RSTN)

7. Difference between JUMP & CALL Instructions

8. CALL XXXX & RET

9. Machine Control Instructions

10. Question & Answer

11. Question & Answer

1. Instruction Cycle

2. Fetch Cycle

3. Execute Cycle

4. Instruction Cycle Example for Fetch & Execute Cycles

5. Instruction Cycle for Push R3

6. Interrupt Cycle

7. Question & Answer

1. Addressing Modes

2. Non-Computable Addressing Modes

3. Implicit Addressing Mode

4. Immediate Addressing Mode

5. Register Addressing Mode

6. Memory Direct Addressing Mode

7. Register Indirect Addressing Mode

8. Memory Indirect Addressing Mode

9. Special Addressing Modes

10. Question & Answer

1. Computable Addressing Mode

2. Base Register Addressing Mode

3. Index Register Addressing Mode

4. Based-Indexed Addressing Mode

5. PC Relative Addressing Mode

6. Scaled Addressing Mode

7. Question & Answer

8. Question & Answer

9. Question & Answer

10. Question & Answer

11. Question & Answer

12. Question & Answer

13. Question & Answer

14. Question & Answer

15. Question & Answer

16. Question & Answer

17. Question & Answer

18. Question & Answer

1. Introduction

1. Parallel Processing

1. Flynns Classification

1. Pipeline Processing

1. Segment Delay (when all segments are operated with uniform intervals)

2. Segment Delay (when different segments are operated with different intervals)

1. Non-Pipeline Time required for executing program

1. Pipeline Classification

2. Arithmetical Pipeline

3. Instruction Pipeline

1. Pipeline time for executing a program

1. Speedup and Maximum Speedup

2. Efficiency & Throughput

1. Stall Cycle (bubble)

2. Computation of the fCLK when segment delays are different from one to another

3. Question & Answer

4. Question & Answer

5. Question & Answer

6. Question & Answer

7. Question & Answer

8. Question & Answer

9. Question & Answer

10. Question & Answer

11. Question & Answer

12. Question & Answer

13. Question & Answer

14. Question & Answer

15. Delay Time Computation for a program

16. Question & Answer

17. Question & Answer

18. Question & Answer

19. Question & Answer

20. Question & Answer

1. Pipeline Conflicts

1. Resource Conflicts

1. Data dependency Conflicts

2. Hardware Interlocks

3. Operand Forwarding

4. Delayed Load

5. Classification of Data dependency conflicts

6. Read After Read (RAR)

7. Read After Write (RAW)

8. Write After Read (WAR)

9. Write After Write (WAW)

10. Question & Answer

11. Question & Answer

12. Question & Answer

1. Branch Conflicts

2. Pre fetch target Instruction

3. Branch Prediction

4. Delayed Branch

5. Question & Answer

6. Question & Answer

7. Question & Answer

8. Question & Answer

9. Question & Answer

1. Introduction

1. Control Unit Function

2. Control Word

3. Control Unit Design

4. Basic Diagram for Control Signal Generation

1. Classification of Control Unit

1. Hardwired Control Unit

2. Hardwired Control Unit basic diagram for executing ‘N’ instruction

1. Microprogrammed Control Unit

1. Design of Hardwired Control Unit

2. Question & Answer

1. Design of Microprogrammed Control Unit

2. Horizontal Microprogramming Control Unit

3. Vertical Microprogramming

4. Question & Answer

5. Question & Answer

6. Question & Answer

7. Question & Answer

1. RISC PROCESSOR

1. CISC PROCESSOR

2. Question & Answers

1. Introduction

1. Interfacing and Need for Interfacing

1. Different Methods used for Connecting IO devices to the Processor

2. IO Mapped IO

3. Memory Mapped IO

1. Different Data Communications Methods between IO devices and processor

2. Synchronous Communication

3. Asynchronous Communication

4. Question and Answer

1. Mode of Data Transfer in between IO devices and CPU

2. Programmed IO

3. Interrupt Driven IO

4. Direct Memory Access

5. Question & Answer

6. Question & Answer

7. Different Modes in DMA

8. Burst DMA Method

9. Cycle starling DMA Method

10. Interleaved DMA Method

11. Question & Answer

12. Question & Answer

1. Interrupts

2. Role of interrupt in a system

3. Interrupts Classification

4. Hardware Interrupts

5. Software Interrupts

6. Maskable Interrupts

7. Non-Maskable Interrupt

8. Vectored Interrupt

9. Non-Vectored Interrupt

10. Interrupt Priority

11. Question & Answer

12. Question & Answer

13. Question & Answer

1. Introduction to C Programming

2. Memory Organization of C Programming

1. Storage Classes - I

2. Storage Classes - II

1. Storage Classes - Auto

2. Storage Classes - Static

3. Global Variable Properties

4. Register Variable Properties

1. Storage Classes - Exercise I

2. Storage Classes - Exercise II

3. Storage Classes - Exercise III

4. Storage Classes - Exercise IV

5. Storage Classes - Exercise V

6. Storage Classes - Exercise VI

7. Storage Classes - Exercise VII

8. Storage Classes - Exercise VIII

9. Storage Classes - Exercise IX

10. Storage Classes - Exercise X

11. Storage Class - Excercise - XI

12. Storage Class - Excercise - XII

13. Storage Class - Excercise - XIII

14. Storage Class - Excercise - XIV

15. Storage Class - Excercise - XV

16. Storage Class - Excercise - XVI

17. Storage Class - Excercise - XVII

18. Storage Class - Excercise - XVIII

1. External Variable Properties

1. Recursion - Exercise I

2. Recursion - Exercise II

3. Recursion - Exercise III

4. Recursion - Exercise IV

5. Recursion - Exercise V

6. Recursion - Exercise VI

7. Recursion - Exercise VII

8. Recursion - Exercise VIII

9. Recursion - Exercise IX

10. Recursion - Exercise X

11. Recursion - Exercise XI

12. Recursion - Excercise

13. Recursion - Excercise - XII

14. Recursion - Excercise - XIII

15. Recursion - Excercise - XIV

16. Recursion - Excercise - XV

17. Recursion - Excercise - XVI

18. Recursion - Excercise - XVII

1. Introduction to Pointers - I

2. Introduction to Pointers - II

3. Pointers - Examples I

4. Pointers - Examples II

5. Pointers - Examples - III

6. Pointers - Examples - IV

1. Dangling Pointer

2. Memory Leak

3. Memory Leak - GATE Question I

4. Memory Leak - GATE Question II

1. Pointer - GATE Question I

2. Pointer - GATE Question II

3. Pointer - GATE Question III

4. Pointer - GATE Question IV

5. Pointer - GATE Question V

6. Pointer - GATE Question VI

7. Pointer - GATE Question VII

8. Pointer - GATE Question VIII

1. Pointer to Pointer - Introduction

2. Pointer to Pointer - Exercise I

3. Pointer to Pointer - Exercise II

4. Pointer to Pointer - Exercise III

5. Pointer to Pointer - Excercise - IV

6. Pointer to Pointer - Excercise - V

1. Pointer Array - I

2. Pointer Array - Exercise I

3. Pointer Array - Exercise II

4. Pointer Array - Exercise III

5. Pointer Array - Exercise IV

6. Pointer Array - Exercise V

1. Array of Pointer - Introduction

2. Array of Pointer - Exercise I

3. Array of Pointer - Exercise II

4. Array of Pointer - Exercise III

5. Array of Pointer - I

6. Array of Pointers - II

1. Pointer to String - Introduction

2. String Constant

3. Pointer to String - Exercise I

4. Pointer to String - Exercise II

5. Pointer to String - Exercise III

6. Pointer to String - Exercise IV

7. Pointer to String - Exercise V

8. Pointer to String - Exercise VI

9. Pointer to String - Exercise VII

10. Pointer to String - Exercise VIII

11. Pointer to String - Exercise IX

12. Pointer to String - Exercise X

13. Pointer to String - Exercise XI

1. Declaration of Structure

2. Nesting of Structures

3. Pointer to Structures - Array of Structures

4. Array of Structures - Exercise I

5. Array of Structures - Exercise II

6. Array of Structures - Exercise III

7. Array of Structures - Exercise IV

8. Array of Structures - Exercise V

9. Array of Structures - Exercise VI

1. Pointer to Function - Introduction

2. Pointer to Function - Exercise I

3. Pointer to Function - Exercise II

4. Pointer to Function - Exercise III

5. Pointer to Function - Exercise IV

6. Pointer to Function - Exercise V

7. Pointer to Function - Exercise VI

1. Call by Value - Introduction

2. Call by Reference - Introduction

3. Exercise - I

4. Exercise - II

5. Exercise - III

6. Exercise - IV

7. Exercise - V

1. parameter passing techniques call by reference-1

2. parameter passing techniques call by reference-2

3. Parameter passing techniques call by reference-3

1. Static Scope - I

2. Static Scope - II

1. Dynamic Scope - I

2. Dynamic Scope - II

3. Dynamic Scope - III

4. Dynamic Scope - IV

1. Statis Scope and Dynamic Scope

2. Statis Scope and Dynamic Scope - I

3. Statis Scope and Dynamic Scope - II

4. Statis Scope and Dynamic Scope - III

5. Statis Scope and Dynamic Scope - IV

6. Static and Dynamic Scope (d.s+.c ref)

7. Static and Dynamic Scope call by reference

8. Static Scope access link

9. Static Scope access link - I

1. Control Statements

2. Selection Control Statements - I

3. Selection Control Statements - II

4. Selection Control Statements - III

5. Selection Control Statements - IV

1. Switch - Introduction

2. Switch - Exercise I

3. Switch - Exercise II

4. Switch - Exercise III

5. Switch - Exercise IV

1. Basic Arithmetic Operators

2. Assignment Operators

3. Increment and Decrement Operators

4. Relational Operators

5. Logical Operators

6. Conditional Operators

7. Size of Operators

8. Bitwise Operators

9. Comma Operators

10. Operators - Exercise I

11. Operators - Exercise II

12. Operators - Exercise III

13. Operators - Exercise IV

14. Operators - Exercise V

15. Operators - Exercise VI

16. Operators - Exercise VII

17. Operators - Exercise VIII

18. Operators - Exercise IX

19. Operators - Exercise X

20. Operators - Exercise XI

21. Operators - Exercise XII

22. Operators - Exercise XIII

1. Loop Based Questions - I

2. Loop Based Questions - II

3. Loop Based Questions - III

4. Loop Based Questions - IV

5. Loop Based Questions - V

1. Introduction to Data Structures

2. Definition of Data Structures

1. Arrays - Introduction

2. One Dimensional Array

3. Two Dimensional Array

4. Sparse Matrix - I

5. Sparse Matrix - II

6. Arrays - Exercise I

7. Arrays - Exercise II

8. Arrays - Exercise III

9. Arrays - Exercise IV

10. Arrays - Exercise V

11. Arrays - Exercise VI

12. S-Matrix

13. Toeplitz Matrix - I

14. Toeplitz Matrix - II

15. Squareband Matrix

1. Stack & Queue - I

2. Stack & Queue - II

3. Stack & Queue - III

1. Stack Permutation

2. Stack Permutation - Problems I

3. Stack Permutation - Problems II

1. Recursion - Exercise I

2. Recursion - Exercise II

3. Recursion - Exercise III

4. Recursion - Exercise IV

5. Recursion - Exercise V

6. Recursion - Exercise VI

7. Head Recursion

8. Tail Recursion

9. Head-Tail Recursion

10. Recursion - Ackermann Function

11. Towers of Hanoi

12. Recursive Program to Solve Towers of Hanoi - I

13. Recursive Program to Solve Towers of Hanoi - II

14. Program on Towers of Hanoi

1. Converting Infix to Postfix Expression - I

2. Converting Infix to Postfix Expression - II

3. Infix to Postfix Expression - Problems I

1. Converting Infix to Prefix Expression - I

2. Converting Infix to Prefix Expression - II

3. Infix to Prefix Expression - Problems I

4. Infix to Prefix Expression - Problems II

5. Infix to Prefix Expression - Problems III

1. Constructing Expression Tree Using Postfix - I

2. Constructing Expression Tree Using Postfix - II

3. Expression Tree - Postfox - GATE Question

4. Postfix and Infix Expression - GATE Question

5. Constructing Expression Tree Using Postfix - Examples

1. Constructing Expression Tree Using Prefix

2. Constructing Expression Tree Using Prefix - GATE Question

1. Operations on Stack

1. Multiple Stack Implementation - I

2. Multiple Stack Implementation - II

3. Multiple Stack Implementation - Exercise

1. Linear Queue

2. Circular Queue & Deque

1. Linked List - Introduction

2. Linked List - Exercise I

3. Linked List - Exercise II

4. Linked List - Exercise III

5. Linked List - Exercise IV

6. Linked List - Exercise V

7. Linked List - Exercise VI

8. Linked List - Exercise VII

9. Linked List - Exercise VIII

10. Linked List - Exercise IX

1. Tree - Introduction

1. Binary Tree - Introduction

2. K-ary Tree - Problems I

3. K-ary Tree - Problems II

4. K-ary Tree - Problems III

5. K-ary Tree - Problems IV

6. Binary Tree - Mathematical Statment I

7. Binary Tree - Mathematical Statment II

8. Binary Tree - Mathematical Statment III

9. Binary Tree - Mathematical Statment IV

10. Binary Tree - Mathematical Statment V

1. Tree Traversal - Introduction

2. Tree Traversal - Node

3. Tree Traversal - Inorder Traversal I

4. Tree Traversal - Inorder Traversal II

5. Preorder Traversal Technique - I

6. Preorder Traversal Technique - II

7. Postorder Traversal

8. Tree Traversal - Examples I

9. Tree Traversal - Examples II

10. Constructing Unique Binary Tree using Inorder and Postorder - I

11. Constructing Unique Binary Tree using Inorder and Postorder - II

12. Constructing Unique Binary Tree using Inorder and Preorder - I

13. Constructing Unique Binary Tree using Inorder and Preorder - II

14. Tree Traversal - GATE Questions I

15. Tree Traversal - GATE Questions II

16. Tree Traversal - GATE Questions III

17. Tree Traversal - GATE Questions IV

18. Tree Traversal - GATE Questions V

1. Binary Search Tree - I

2. Binary Search Tree - II

3. Operations on Binary Search Tree - I

4. Operations on Binary Search Tree - II

5. Binary Search Tree - GATE Questions I

6. Binary Search Tree - GATE Questions II

7. Binary Search Tree - GATE Questions III

8. Deletion Operation on BST - I

9. Deletion Operation on BST - II

1. AVL Introduction

2. AVL Introduction - I

3. AVL Tree Insertion

4. Construction of AVL Tree

5. AVL Tree Operations

6. AVL Tree Operations - I

7. GATE Questions on AVL Tree

8. GATE Questions on AVL Tree - I

9. AVL Tree - Max No.Of Nodes

10. AVL Tree - Minimum No.Of Nodes of AVL

11. GATE Questions

1. Heap Tree - Definition

2. GATE Questions - I

3. GATE Questions - II

4. GATE Questions - III

5. Construction of Heap

6. Analysis of Construction of Heap

7. GATE Questions - IV

8. GATE Questions - V

9. GATE Questions - VI

10. GATE Questions - VII

11. GATE Questions - VIII

12. Heapify Algorithm

13. Worked Out Example

14. GATE Question - IX

15. Analysis of Heapify Alogorithm

16. GATE Questions - X

17. Finding Max and Min Element of Heap

18. GATE Questions - XI

1. Introduction - Hashing

2. Collision Resolving Techniques

3. Linear Probing

4. Quadratic Probing

5. Double Hashing

6. GATE Question

7. Separate Chaining

8. Comparison of Resolving Techniques

9. Comparison of Resolving Techniques

1. Hashing - I

2. Hashing - II

3. Hashing - III

1. Graph Traversal - Introduction

2. Depth First Search & Breadth First Search - I

3. Depth First Search & Breadth First Search - II

4. Depth First Search & Breadth First Search - III

1. Introduction

1. Algorithic Analyis

2. Ramdom Access Machine Model

3. Types of Analayis

4. Time complexity as Step Count

1. Asymptotic Notation: Increasing function

2. Big O Notation Part-I

3. Big O Notation Part-II

4. Omega and Theta Notation

5. Littel o and Omega Notation

6. Properties of Asymptotic Notation

7. Relation Between Best Worst and Average case

8. Problem Solving Asymptotic Notation Part-I

9. Problem Solving Asymptotic Notation Part-II

10. Problem Solving Asymptotic Notation Part-III

1. Mathematical Background Part-I

2. Mathematical Background Part-II

1. for-while loop Analysis Part-I

2. for-while loop Analysis Part-II

3. Problem Solving Part-I

4. Problem Solving Part-II

1. Recurrence Relation Part-I

2. Recurrence Relation Part-II

3. Recurrence Relation Part-III

4. Recurrence Relation Part-IV

5. Recurrence Relation Summary

6. Program to Recurrence Relation: Problem Solving

1. Recurrence Tree Part-I

2. Recurrence Tree Part-II

1. Basic Algorithm Design Part-I

2. Basic Algorithm Design Part-II

3. Basic Algorithm Design Part-III

4. Array Algorithm Part-I

5. Array Algorithm Part-II

1. Algebric Transformation

1. Loop and Summation

1. Space Complexity

1. Problem Solving Part-I

2. Problem Solving Part-II

3. Problem Solving Part-V

1. Divide & Conquer Introduction Part-I

2. Divide & Conquer Introduction Part-II

1. Master Method Case-I and Case-II

2. Master Method Case-I and Case-III

3. Extended form and Regularity condition

4. Practice Problem

1. Stright Max Min & Tournament Method

2. GATE Question Problem Solving

3. Divide & Conquer Approach

4. Leet Code Interview Question: Second Largest Element

1. Quick Sort Discreption

2. Quick Sort Algorithm

3. Quick Sort Complexity

4. Quick Sort Unbalanced Partitioning

5. Problem Solving

1. Merge Sort Introduction

2. Merge Sort Analysis

3. 2-Way Merge sort

4. Problem Solving Merge Sort Part-I

5. Problem Solving Merge Sort Part-II

1. Binary Search

1. Matrix Multiplication

2. Recurive Matrix Multiplication

3. Stressens Formula

1. GATE Question Part-I

2. GATE Question Part-II

1. Introduction

1. Fractional Knapsack

1. Job Scheduling with Deadline

1. Optimal Merge Patthern

2. Optimal Merge Pattern Greedy Approach

3. Optimal Merge Pattern Algorithm

1. Huffman Code Introduction

2. Problem Solving

3. Huffman Code Example & Problem Solving

1. Graph Introduction Representation & Handshaking Algorithm

2. Spanning Tree Introcuction

3. Counting Spanning Tree

4. Prims Algorithm

5. Prims Algorithm Complexity

6. Kruskal Algorithm

7. Comparison Between Prims and Kruskal

8. Union Find Part-I

9. Kruskal Algorithm Analysis

10. Problem Solving

11. Problem Solving

12. Problem Solving

13. Problem Solving

14. Problem Solving

1. Dijkstras Algorithm

2. Dijkstras Algorithm Analysis

3. Problem Solving

4. Problem Solving

1. Dynamic Programming Introduction

2. Memorization & Tabulation Method

1. Mulptistage Graph Introduction

2. Multistage Graph Example

3. Algorithm and a Problem

1. 0-1 Knapsack Problem Recursive Structure

2. 0-1 Knapsack Problem

3. 0-1 Knapsack Problem Algorithm

1. LCS problem Introduction

2. LCS Example and Algorithm

1. Matrix Chain Multiplication Part-I

2. Matrix Chain Multiplication Part-II

1. Travelling Sales Person Problem Part-I

2. Travelling Sales Person Problem Part-II

1. All Pair Shortest Path

2. All Pair Shortest Path: Example and Complexity

3. Transitive Closure of a Relation

1. Optimal Binary Search Tree

2. Optimal Binary Search Tree Formulation

3. Optimal Binary Search Tree Example

1. Bellman ford Algorithm

1. Subset Sum LCS and Matrix Chain

2. Matrix Chain Multiplication

3. Shortest Path & Rod Cutting

4. 0-1 Knapsack Problem

5. LCS Problem

1. Binary Heap Introduction

2. Operation Performed on Binary Heap

3. Build Heap

4. Counting Heaps

5. nth Largest Element - Largest Element

6. Problem Solving

7. Heap Sort Algorithm

8. Problem Solving Part-I

9. Problem Solving Part- II

1. Graph Traversal

2. Problem Solving Part-I

3. Problem Solving Part-II

4. DFS for Directed Graph

5. Classification of Edges

6. Problem Solving

1. Topological Sorting

2. Connected Component

3. Strongly Connected Component

1. Inversion

1. Sorting Properties

1. Selection Sort and Bubble Sort

1. Lower Bound on Comparison Based Sort and Counting & Radix Sort

1. Problem Solving

1. Introduction

1. Alphabet & Strings

1. Power Alphabet & Languages

1. Part 1-Language Operations

1. Part 2-Language Operations

1. Part 3-Language Operations

1. Set Operations

1. Summary

1. MCQ-P1

2. MCQ-P2

3. MCQ-P3

1. PQ-P1

2. PQ-P2

3. PQ-P3

4. PQ-P4

5. PQ-P5

6. PQ-P6

7. PQ-P7

8. PQ-P8

9. PQ-P9

1. Definitions

2. Derivations

3. Example-P1

4. Example-P2

5. Example-P3

6. Example-P4

1. Example-P1

2. Example-P2

3. Example-P3

4. Example-P4

5. Example-P5

6. Example-P6

7. Classification of Grammars

1. Definition

1. Example-P1

1. Example-P2

1. Example-P3

1. Finite Automata Block Diagram

1. Definition

2. Example-P1

3. Example -P2

1. Types of Finite Automata

1. NFA vs DFA

1. Example-P1

2. Example-P2

3. Example-P3

4. Example-P4

5. Example-P5

6. Example-P6

7. Example-P7

8. Example-P8

9. Example-P9

10. Example-P10

11. Example-P11

12. Example-P12

13. Example-P13

1. PQ-P1

2. PQ-P2

3. PQ-P3

4. PQ-P4

5. PQ-P5

6. PQ-P6

7. PQ-P7

1. Definition

2. Example-P1

3. Example-P2

1. Procedure

2. Example-P1

3. Example-P2

4. Method 2-P1

5. Method 2-P2

6. Method 2-P3

7. Method 2-P4

8. Method 2-P5

1. NFA with Epsilon (ε-NFA)

1. Epsilon Closure

1. Epsilon NFA to NFA Conversion

1. PQ-P1

2. PQ-P2

3. PQ-P3

4. PQ-P4

5. PQ-P5

6. PQ-P6

7. PQ-P7

1. Definition

2. Simple Languages

3. Standard Languages

4. Complex Languages

5. Set Former Notation Languages

1. Regular Expression Identities

1. Simplification of Regular Expressions

1. PQ-P1

2. PQ-P2

3. PQ-P3

4. PQ-P4

5. PQ-P5

6. PQ-P6

7. PQ-P7

8. PQ-P8

9. PQ-P9

1. Regular Expression Vs Finite Automata

1. State Elimination Method

2. Example-P1

3. Example-P2

4. Ardens Theorem

5. Example-P1

6. Example-P2

7. Example-P3

8. Example-P4

9. Example-P5

1. Regular Expression to Finite Automata Conversion

2. Synthesis & Decompositions Methods

3. Example-P1

4. Example-P2

5. Example-P3

1. PQ-P1

2. PQ-P2

3. PQ-P3

4. PQ-P4

5. PQ-P5

6. PQ-P6

7. PQ-P7

8. PQ-P8

9. PQ-P9

10. PQ-P10

11. PQ-P11

1. Tabular Method with Example

2. Partition Algorithm With Example

3. Example-P1

4. Example-P2

5. Example-P3

1. Example-P1

2. Example-P2

3. Example-P3

4. Example-P4

5. Example-P5

6. Example-P6

7. Example-P7

8. Example-P8

9. Example-P9

10. Example-P10

1. PQ-P1

2. PQ-P2

3. PQ-P3

4. PQ-P4

5. PQ-P5

6. PQ-P6

7. PQ-P7

1. MCQ-P1

2. MCQ-P2

3. MCQ-P3

1. Quick Review on FA without Output

1. Definition and Examples

1. Typesof FSM

1. Design of FSM with Examples

1. Equivalence of Mealy and Moore Machine

1. GPQ-P1

2. GPQ-P2

3. GPQ-P3

4. GPQ-P4

5. GPQ-P5

6. GPQ-P6

7. GPQ-P7

1. Definitions

1. Regular Grammar Vs Finite Automata

1. Regular Grammar Vs Regular Expression

1. Multiple Choice Questions (MCQ)

1. General Properties of Regular Set

1. Closure Under Other Operation

1. Pumping Lemma for Regular Languages

1. Examples for Pumping Lemma Application

1. Guidelines for Finding One Symbol Regular Languages

1. Examples for Single Symbol Languages

1. Guidelines for Finding Multi Symbol Regular Languages

1. Examples for Multiple Symbol Languages

1. Complex Regular Languages

1. Quick Recap on Regularity and Non Regularity

1. PQ-P1

2. PQ-P2

3. PQ-P3

4. PQ-P4

5. PQ-P5

6. PQ-P6

7. PQ-P7

8. PQ-P8

1. Overview of FA and RL

1. Chomsky Hierarchy

1. Multiple Choice Questions

1. Overview of Chomsky

1. Context Free Languages (CFL)

1. Example-P1

2. Example-P2

3. Example-P3

4. Example-P4

5. Example-P5

6. Example-P6

7. Example-P7

8. Example-P8

9. Example-P9

10. Example-P10

11. Example-P11

12. Example-P12

13. Example-P13

1. Types of Derivations with Example

2. Example-P1

3. Example-P2

4. Example-P3

5. Example-P4

6. Example-P5

7. Example-P6

1. Ambiguous Grammar with Example

2. Example-P1

3. Example-P2

4. Example-P3

5. Example-P4

6. Example-P5

7. Example-P6

8. Example-P7

9. Example-P8

10. Example-P9

11. Key Points and Inherently Ambiguity

1. Simplification of CFG

1. Elimination of Null

2. Elimination of Production

1. Finding Reduced Grammar with Example

2. Example-P1

3. Example-P2

4. Example-P3

5. Example-P4

6. Example-P5

7. Example-P6

8. Example-P7

9. Example-P8

10. Example-P9

11. Example-P10

1. Definition

2. Chomsky Normal Form(CNF)

3. Greibach Normal Form(GNF)

1. Summary of CFL

1. Multiple Choice Questions (MCQ)

1. Previous Questions (PQ)

1. Introduction to PDA

1. Instantaneous Description of PDA

1. Acceptance of Strings by PDA

1. Acceptance of Language with Examples

1. Design of PDA with Example

2. Example-P1

3. Example-P2

4. Example-P3

5. Example-P4

6. Example-P5

7. Example-P6

8. Example-P7

9. Example-P8

10. Example-P9

1. Types of PDA with Example

1. Design of NPDA with Example

2. Example-P1

3. Example-P2

4. Example-P3

1. Languages Accepted by PDA with Null Stack

1. Pushdown Automata to CFG

1. More Problems Solving on PDA

2. Example-P1

3. Example-P2

4. Example-P3

5. Example-P4

6. Example-P5

7. Example-P6

8. Example-P7

9. Example-P8

10. Example-P9

1. Pumping Lemma for CFL

1. Application of Pumping Lemma

1. Closure properties of CFLs

1. Other Closure Properties of CFLs

1. Identification of CFLs-DCFL

2. Example-CFLs

3. Example-DCFLs

4. Example-Non DCFLs

5. Example-Non CFLs

1. Quick Review on PDA and CFL

1. PQ-P1

2. PQ-P2

3. PQ-P3

4. PQ-P4

5. PQ-P5

6. PQ-P6

7. PQ-P7

8. PQ-P8

9. PQ-P9

10. PQ-P10

11. PQ-P11

12. PQ-P12

13. PQ-P13

14. PQ-P14

15. PQ-P15

16. PQ-P16

17. PQ-P17

18. PQ-P18

19. PQ-P19

20. PQ-P20

1. TM Introduction

1. Instantaneous Description of TM

1. Acceptance of W by TM

1. Acceptance of W with Examples

1. Design of TM

1. TM as Language Accepters

1. TM as a Computer of Integer Functions

1. TM as Transducer

1. TM as Any Problem Solver

1. Problem Solving on TM

1. Types of TM-Variants of TM

1. Definitions

1. Problem Solving on REC-REL

1. Closure Properties of REC-REL

1. Unstricted Grammars

1. LBA and CSG

1. Relations between Classes of Languages

1. Quick Review of TM REC and REL

1. Previous Questions(PQ)

1. Decision Algorithms and Family of Languages

2. Decision Algorithms for CFL

3. Decision Algorithms for CFL

4. Decision Algorithms for CFL

5. Decision Algorithms for Regular Sets

6. Decision Algorithms for Regular Sets

7. Decision Algorithms for Regular Sets

8. Halting Problem

9. Closure Properties of Family of Languages

1. Decidable Languages Concept

2. Decidable Problems about FA and Regular Set

3. Decidable Problems about CFGs

4. Acceptance Vs Decidable

1. Undecidable Languages Concept

2. Undecidable Problems about CFGs

3. Undecidable Languages about TM & UG

1. Reducibility

1. Summary of Decision Properties

1. Quick Review of Decidable and Undecidable Problems

1. Previous Questions (PQ)

1. Preparation Strategy for TOC

1. Syllabus & Weightage Analysis

2. Introduction

3. Language Processing System

4. Interpreter

5. Cross Compiler

6. Boot Strapping

1. Logical phases of a compiler

1. Lexical Analysis

1. Problems on lexical analysis

1. Design of a lexical Analysis

1. LEX

1. Lexical errors

1. Error recovery in Lexical Analysis

1. Phases of a compiler

1. Excersices-1

2. Excersices-2

1. Previous GATE Questions

1. Syntax Analysis

1. Context free grammar

1. Derivation

1. Types of derivation

1. Qestion on LMD and RMD

1. Ambiguous grammar

1. Question on Ambiguity

1. Gate 2007 Question an Ambiguity

1. Converting Ambiguous grammar into unAmbiguous grammar

1. Questions on converting ambiguous to unambiguous grammar

2. Exercise - 1

3. Exercise - 2

1. CFG based on number of strings

1. Left recursion

1. Indirect left recursion

2. Exercise

3. Exercise

1. Left factoring

1. Parsing introduction

1. Top-down parsed (Brute force m-d)

1. Recursive descent parser

1. Predictive parser

1. First set

1. Questions on first set

1. Follow set

1. Questions on follow set

1. Construction of predictive parse table

1. Predictive Parsing algorithm

1. Exercise on Predictive Parsing

1. Questions of parse table construction

1. LL(1) grammar

1. Exercise quertions on LL(1) grammar

1. Bottom-up parser

1. Shift Reduce parser

2. Exercise

1. Operator precedence parser

1. Lead and Trail set

1. Computing precedence relations

1. Constructing parse table

1. Parsing algorithm

1. Precedence relations using precedence and associativity

2. Exercise

1. LR(k) parser introduction

1. LR(k) parser structure

1. LR(0) Items-Rules

1. Question to find LR(0) items

1. LR(0) parsing table construction

1. Constructing parse tree using LR(0) parse table

1. Exercise Questions - 1

1. parser conflicts in LR(0)

1. Exercise Question - 1

2. Exercise Question - 2

3. Exercise Question - 3

1. SLR(1) parser introduction

1. SLR(1) Parsing table

1. SLR(1) Parsing algorithm

1. parser conflicts in SLR(1)

1. Questions on SLR(1)

1. LR(1) items

1. 52 LR(1) states

1. CLR(1) Parser

1. 54 CLR(1) Parsing algorithm

1. Parser conflicts in CLR(1)

1. LALR(1) parser

1. 57.Question on LALR(1)

1. 58.Important note points

1. Conclusions on LR(k)

1. Numerical 1

2. Numerical 2

3. Numerical 3

4. Numerical 4

5. Numerical 5

6. Numerical 6

7. Numerical 7

8. Numerical 8

9. Numerical 9

10. Numerical 10

11. Numerical 11

12. Numerical 12

1. Previous Questions - 1

2. Previous Questions - 2

1. Syntax Directed Translation

1. Syntax Directed Definition

1. S and L attributed Definition

1. Translation Scheme

1. Example Question 1

2. Example Question 2

3. Example Question 3

1. Numerical 1

2. Numerical 2

3. Numerical 3

4. Numerical 4

5. Numerical 5

6. Numerical 6

7. Numerical 7

1. Previous GATE Questions 1

2. Previous GATE Questions 2

3. Previous GATE Questions 3

1. Intermediate Code Generation

1. Three Address Code

1. Implementation of Three Address Code

1. Static Single Assignment

1. Numerical 1

2. Numerical 2

3. Numerical 3

4. Numerical 4

5. Numerical 5

1. Previous GATE Questions - 1

2. Previous GATE Questions - 2

3. Previous GATE Questions - 3

4. Previous GATE Questions - 4

1. Code Optimization

1. Basic Blocks & Flow Graphs

1. Classification of Code Optimization

1. Local Optimization

1. Loop Optimization

1. Global Optimization (Data Flow Analysis)

1. Previous GATE Questions - 1

1. Previous GATE Questions - 2

1. Preparation Strategy for OS

1. Need & various Definitions of an OS

1. Discussion on Systemcall

1. Goals of OS

1. Location of OS

1. History of OS

1. Types of OS Batch Systems

2. Types of OS Multiprogrammed Systems

3. Types of OS Multitasking Systems

4. Types of OS Multiprocessors Systems

5. Types of OS Real Time Systems

1. Functions of OS

1. Q & A Session on Introduction to OS

1. Miscellaneous

1. Process Vs Program

2. Image of a Process

3. Attributes of a Process

4. Two State Process Diagram

5. Five State Process Diagram

6. Seven State Process Diagram

7. Context Switching

1. Process Scheudling - 5Ws

2. Classification of Process Scheduling

3. Goals of Process Scheduling

4. Scheduling Criteria

5. Schedulers

6. Scheduling Queues

7. Scheduling Queuing Diagram

8. Q & A on PM - II

9. FCFS

10. Non Preemptive SJF

11. Preemptive SJF (SRTF- SRTN)

12. Q & A on SRTF - I

13. Q & A on SRTF - II

14. Prediction of Next CPU Burst

15. Round Robin Scheduling

16. Q & A on RR Scheduling

17. Q & A on RR Scheduling

18. Non - Preemptive Priority

19. Preemptive Priority

20. Q & A on Preemptive Priority

21. Non Preemptive LJF

22. Preemptive LJF

23. Q & A on Preemptive LJF

24. HRRN - HRRF

25. Multi Level Queue Scheduling

26. Multi Level Feedback Queue Scheduling

27. Operations on a process (Fork() Exit())

28. Q & A on Operations on a Process (Fork())

29. Miscellaneous

1. Introduction to Inter Process Synchronization (IPS)

2. Need of Synhcronization (Loss of Data & Wrong Results)

3. Definition of Race Condition

4. Structure of a Co operative Process

5. Critical Section Problem (CSP) - Statement

6. S-w Solutions to the CSP (Dekkers Algorithm - I)

7. Q & A on Dekkers Algorithm - I

8. S-w Solutions to the CSP (Dekkers Algorithm - II)

9. Q & A on Dekkers Algorithm - II

10. Dekkers Algorithm - I Vs Dekkers Algorithm - II

11. S-w Solutions to the CSP (Petersons Solution)

12. Q & A on Petersons Solution

13. Lock Variable

14. Summary on Software Solutions to the CSP

15. Busy Waiting Process

16. H-w Solutions to the CSP - Introduction

17. H-w Solutions to the CSP (TSL Instruction)

18. H-w Solutions to the CSP (Swap Instruction)

19. Summary on S-w & H-w Solutions to the CSP

20. OS Based solution to the CSP (Semaphores)

21. Usage of Semaphores

22. Q & A on Semaphores - Part I

23. Q & A on Semaphores - Part II

24. Spin Lock

25. Classical examples of IPS (Producer - Consumer Problem)

26. Q & A on Producer - Consumer Problem

27. Classical examples of IPS (Dining Philosophers Problem)

28. Classical examples of IPS (Readers - Writers Problem)

29. Inter Process Communication (IPC Mechanisms)

30. Threads

31. Classification of threads (Single Threaded Process Multithreaded Process)

32. Threads (ULT Vs KLT)

33. Models in Multithreading

34. Q & A on Threads

35. Priority Inversion Problem & Live Lock

36. Monitors

1. Previous GATE Questions -I

2. Previous GATE Questions -II

1. Introduction to Concurrency

2. Parbegin - Parend Construct

3. Fork - Join Construct

1. Introduction

2. System Model

3. Resource Allocation Graph

4. Necessary conditions for Occurrence of Deadlock

5. Methods to handle the deadlock (Deadlock Prevention)

6. Methods to handle the deadlock (Deadlock Recovery)

7. Methods to handle the deadlock (Deadlock Avoidance - 1)

8. Q & A on Deadlock Avoidance (Model 1 Questions)

9. Methods to handle the deadlock (Deadlock Avoidance - 2)

10. Q & A on Deadlocks (Model 2 Questions)

11. Methods to handle the deadlock (Deadlock Detection - Case - 1)

12. Methods to handle the deadlock (Deadlock Detection - Case - 2)

13. Methods to handle the deadlock (Deadlock Ignorance)

1. Previous GATE Questions -I

2. Previous GATE Questions -II

1. Introduction to Memory Management

2. Calculation of Memory Capacity

3. RAM Chip Implementation

4. Contiguous MMT

5. Compaction

6. Partition Allocation Techniques - 1

7. Partition Allocation Techniques - 2

8. Basic Terminology to understand Paging

9. Simple Paging Technique - Part 1

10. Simple Paging Technique - Part 2

11. Problems on simple Paging - Part I

12. Problems on simple Paging - Part II

13. Paging with TLB

14. Paging with TLB & Physcally Addressed Cache

15. Calculation of Optimal Page Size

16. Multi (2 - Level) Level Paging

17. Performance of Multi (2 - level) Paging

18. Multi (2 - Level) Paging with TLB

19. Multi (2 - level) Paging with TLB & PAC

20. Problems on Multi (2 - Level) Level Paging

21. Inverted Paging

22. Segmentation

23. Segmented Paging

24. Problems on Segmented Paging

25. Memory Protection

26. Overlays

27. Buddy System

28. Linking Loading & Address Binding

1. Introduction to Virtual Memory

2. Performance of Demand Paging

3. Page Replacement Algorithms - I (FIFO LRU Optimal)

4. Q & A on Page Replacement Algorithms

5. Page Replacement Algorithms - II (LFU MFU)

6. Page Replacement Algorithms - III (LRU Approxmation Algorithms)

7. Frame Allocation Techniques (Equal & Proportional)

8. Thrashing

9. Working Set Window

1. Previous GATE Questions -I

2. Previous GATE Questions -II

3. Previous GATE Questions -III

4. Previous GATE Questions -IV

5. Previous GATE Questions -V

6. Previous GATE Questions -VI

7. Previous GATE Questions -VII

1. Introduction & File Allocation Techniques

1. File Access Methods

1. I - node Structure

1. Directory Structure

1. Free Space Management

1. I-O or Disk Scheduling

1. Previous GATE Questions -I

2. Previous GATE Questions -II

1. Introduction to DBMS

2. Weightage Analysys and Preparation Strategy

1. E-R Model EntitySet & Relationship Set

2. Types of Attributes

3. Descriptive Attribute - GATE Question

4. Relationship Degree

5. E-R Model - Key Constraint

6. E-R Model - Participation Constraint

7. Cardinality Ratios

8. Weak Entity Set

9. Class Hierarchy

10. Aggregation

11. E-R Notions Together

12. Practice Questions on E-R model

1. Relational Model - Introduction

2. Relational Model - Key Constraint

3. Questions on Keys

4. Foreign Key Constraint

5. Questions on Foreign Keys

6. Translating Entity Set to Relation

7. Translating Entity set with MVA to Relation

8. Translating Relationship set to a relation

9. Translating Relationship set with key constraint to a relation

10. Translating relationship set with Key Constraint

11. Translating Cardinality Ratios

12. Translating Weak Entity Set

13. Translating Class Hierarchy

14. Translating Aggregation

15. Case Study of E-R and Relational Model

16. Questions on ER to Relational model-1

17. Questions on ER to Relational model-2

18. NPTEL-MSQ on ER-Model

1. Problems due to Redundancy

2. Functional Dependency

3. Practice and NPTEL Questions on FD

4. Properties of Functional Dependency

5. Closure Set of Functional Dependency

6. Attribute Closure - GATE Question

7. Attribute Closure

8. Applications of Attribute Closure

9. Finding keys of a Relations

10. Finding the Keys of a Relation - 2

11. Finding the Keys of a Relation - 3

12. NPTEL and PYQs on Keys

13. Additional Functional Dependency

14. Aditional Functional Dependency - GATE Question

15. NPTEL-MSQ on Additional FDs

16. Minimal Set of Functional Dependency

17. NPTEL-MSQ on Minimal Set

18. Equivalence of FDs

19. Equivalence of FDs

20. Questions on Equivalence

1. Properties of Decomposition

2. Dependency Preserving Decomposition

3. Problem on Decomposition Properties

4. Previous Gate Questions on Properties of decomposition

5. Normalization 1NF

6. 2NF

7. Practice Questions on 2NF

8. 3NF

9. Practice Questions on 3NF

10. Lossless Join and Dependency Preserving decomposition into 3NF

11. BCNF

12. Previous Gate Questions on Normal Forms

13. NPTEL Questions on Normal Forms

14. INFOSYS - INFYTQ - Question

1. Relational Algebra (Basic Operators)

2. Previous GATE Questions-1

3. Cross Product & Join

4. Previous GATE Questions-2

5. Previous GATE Questions-3 (Query Optimization)

6. Previous GATE Questions-4

7. Previous GATE Questions-5

8. Previous GATE Questions-6

9. Division Operator

10. Previous GATE Questions-7

11. Previous GATE Questions-8 (Multi Subject Questions)

12. Relational Calculus

13. TRC and DRC Example - I

14. TRC and DRC Example - II

15. TRC and DRC Example - III

16. TRC and DRC Example - IV

17. TRC and DRC Example - V

18. Previous GATE Questions

19. UnSafe Query

20. Previous GATE Questions on Un safe Query

1. Introduction to SQL

2. Basic SQL Statements

3. Select....Where

4. Order by

5. Set Manipulation Operators

6. Aggregate Functions

7. Practice Questions

8. Group by and Having

9. Group by Clause

10. Having Clause

11. Previous GATE Questions

12. Join and Natural Join

13. Practice Questions - 1

14. Outer Join

15. Previous GATE Questions 2

16. Nested Query

17. Practice Questions - 2

18. Previous GATE Questions - 3

19. Set Comparision Operators

20. Practice and Previous GATE Questions - 4

21. Correlated Sub Query

22. Previous GATE Questions - 4

23. Exists Clause

24. Exists Example

25. Contains Clause

26. INFOSYS - INFYTQ - Question1

27. INFOSYS - INFYTQ - Question2

28. INFOSYS - INFYTQ - Question3

29. INFOSYS - INFYTQ - Question 4

1. Transactions and Its properties

2. Transaction States

3. Serial and Concurrent Schedules

4. of Concurrent Schedules

5. Problems due to concurrent schedules

6. Example on Problems due to cocurrent schedules

7. Recoverable Schedules

8. Cascading Rollback Schedule