About Course
GATE Computer Science Engineering (CSE) is one of the most sought-after courses in engineering. The field of GATE CSE integrates computer engineering and computer science
What I will learn?
- 400+ Hrs Live Recorded Lectures
- Free Test Series, CTQ Videos and Ebooks Included
- Recorded by Best Mentors across the country from IIT/IISc
Course Curriculum
Quantitative Aptitude
Chapter 1: Numbers System
-
1.1 Types of numbers
00:00 -
1.2 Divisibility rules
00:00 -
1.3 Cyclicity or fundamental to find the last digit
00:00 -
1.4 Concept of HCF/LCM and its application
00:00 -
1.5 Remainders
00:00 -
1.6 Highest power and trailing zeros
00:00 -
1.7 Factors
00:00 -
1.8 Number System Exam Questions
00:00 -
1.9 Cyclicity – Last Digit (Unit Place)
00:00 -
1.10 Cyclicity – Last 2 Digits
00:00 -
1.11 Remainder Theorem
00:00 -
1.12 Base System
00:00 -
1.13 Right Most Non-Zero Digit
00:00
Chapter 2: Percentages and Application
-
2.1 Introduction to Percentage
00:00 -
2.2 Change of base
00:00 -
2.3 Profit, loss, and discount concept
00:00 -
2.4 Simple Interest and Compound Interest
00:00 -
2.5 Faulty Weights
00:00 -
2.6 Successive Percentage Change
00:00 -
2.7 Percentage Exam Questions
00:00
Chapter 3: Ratio, Proportion, and Mixtures
-
3.1 Introduction to Ratio
00:00 -
3.2 Introduction to Proportion
00:00 -
3.3 Partnership
00:00 -
3.4 Alligation & Mixture
00:00 -
3.5 Ratio & Proportion Exam Questions
00:00
Chapter 4: Time, Speed, and Distance
-
4.1 Relation between Time, Speed & Distance
00:00 -
4.2 Average Speed
00:00 -
4.3 Relative Speed
00:00 -
4.4 Boats & Stream
00:00 -
4.5 Races
00:00 -
4.6 Time, Speed & Distance Exam Questions
00:00
Chapter 5: Time and Work
-
5.1 Introduction to Time & Work
00:00 -
5.2 Different types of questions of Time & Work
00:00 -
5.3 Time & Work Exam Questions
00:00
Chapter 6: Geometry
-
6.1 Angles
00:00 -
6.2 Triangles & Properties
00:00 -
6.3 Quadrilateral
00:00 -
6.4 Circle
00:00 -
6.5 Polygon
00:00 -
6.6 Trigonometry
00:00 -
6.7 Geometry & Mensuration (Higher Concept)
00:00 -
6.8 Mensuration
00:00 -
6.9 Geometry Exam Questions
00:00
Chapter 7: Permutation and Combination
-
7.1 Arrangement based on Alphabets
00:00 -
7.2 Arrangement based on Numbers
00:00 -
7.3 Rank in Dictionary
00:00 -
7.4 Combination
00:00 -
7.5 Application of Combination
00:00 -
7.6 Permutation
00:00 -
7.7 Permutation & Combination Exam Questions
00:00
Chapter 8: Probability
-
8.1 Introduction to Probability
00:00 -
8.2 Types of Questions of Probability
00:00 -
8.3 Probability Exam Questions
00:00
Chapter 9: Algebra
-
9.1 Linear Equation
00:00 -
9.2 Quadratic Equation
00:00 -
9.3 Introduction to Progression
00:00 -
9.4 Logarithm
00:00 -
9.5 Logarithm Practice
00:00 -
9.6 Modulus
00:00 -
9.7 Inequality
00:00 -
9.8 Algebra Exam Questions
00:00
Chapter 10: Set Theory
-
10.1 Set Theory
00:00
Chapter 11: Previous Year Aptitude GATE Questions
-
11.1 Aptitude GATE Questions 2018 ME
00:00 -
11.2 Aptitude GATE Questions 2018 EC
00:00 -
11.3 Aptitude GATE Questions 2018 CE
00:00 -
11.4 Aptitude GATE Questions 2018 CS
00:00 -
11.5 Aptitude GATE Questions 2017 CH
00:00 -
11.6 Aptitude GATE Questions 2016 EE
00:00 -
11.7 Aptitude GATE Questions 2016 EC
00:00 -
11.8 Aptitude GATE Questions 2019 All Branches
00:00 -
11.9 Aptitude GATE Questions 2015 CS
00:00 -
11.10 Aptitude GATE Questions 2015 ME
00:00 -
11.11 Aptitude GATE Questions 2015 EC + IN
00:00
Chapter 12: Spatial Aptitude
-
12.1 Spatial Aptitude
00:00
E-Book – Quantitative Aptitude
-
E-Book
Practice Set – Quantitative Aptitude
-
Practice Set 1
-
Practice Set 2
Engineering Mathematics
Chapter 1: Limit
-
1.1 Introduction to Limit
00:00 -
1.2 Indeterminate Forms
00:00 -
1.3 Methods to Solve Limit
00:00 -
1.4 Factoring Method
00:00 -
1.5 Rationalisation Method
00:00 -
1.6 Expansion Method
00:00 -
1.7 L-Hospital Rule
00:00 -
1.8 Failure of L-Hospital Rule
00:00 -
1.9 Approximation Method
00:00 -
1.10 Limit involving Modulus Function
00:00 -
1.11 Limit involving Riemann Integration
00:00 -
1.12 Limit involving Greatest Integer Function
00:00 -
1.13 Various Exams and Practice Questions
00:00
Chapter 2: Continuity
-
2.1 Introduction to Continuity
00:00 -
2.2 Types of Continuity
00:00 -
2.3 Types of Discontinuity
00:00 -
2.4 Continuity in an Interval [a,b]
00:00 -
2.5 Continuity of P(X)/Q(X)
00:00 -
2.6 Continuity of Modulus Function
00:00 -
2.7 Various Exam Questions and Practice Questions
00:00
Chapter 3: Differentiability
-
3.1 Introduction to Differentiability
00:00 -
3.2 Differentiability of Modulus Function
00:00 -
3.3 Various Exam Questions
00:00
Chapter 4: Properties of Function
-
4.1 Monotone Function
00:00 -
4.2 Increasing and Decreasing Function
00:00 -
4.3 Concave Upward and Downward
00:00 -
4.4 Point of Inflection
00:00
Chapter 5: Maxima & Minima
-
5.1 Local Maxima & Local Minima
00:00 -
5.2 Absolute Maximum and Absolute Minimum
00:00 -
5.3 Maximum & Minimum Value in a Given Interval
00:00
Chapter 6: Mean Value Theorem
-
6.1 Intermediate MVT
00:00 -
6.2 Integral Form of Intermediate MVT
00:00 -
6.3 Rolle’s MVT
00:00 -
6.4 Lagrange’s MVT
00:00 -
6.5 Integral Form of Lagrange’s MVT
00:00 -
6.6 Cauchy’s MVT
00:00 -
6.7 Various Exam Questions
00:00
Chapter 7: Integration
-
7.1 Integration
00:00 -
7.2 Arc Length
00:00
Chapter 8: Linear Algebra
-
8.1 Linear Transformation
00:00 -
8.2 Introduction to Matrices
00:00 -
8.3 Rank & Nullity
00:00 -
8.4 System of Linear Equations
00:00 -
8.5 Eigenvalues & Eigenvectors
00:00 -
8.6 Number of Linearly Independent Eigenvectors
00:00 -
8.7 Diagonalization of Matrix
00:00 -
8.8 Properties of Special Matrices
00:00 -
8.9 GATE Questions
00:00
Chapter 9: Probability Distribution
-
9.1 Discrete Probability Distribution
00:00 -
9.2 Binomial Distribution
00:00 -
9.3 Poisson Distribution
00:00 -
9.4 Continuous Probability Distribution
00:00 -
9.5 Uniform Distribution
00:00 -
9.6 Exponential Distribution
00:00 -
9.7 Normal Distribution
00:00 -
9.8 Mean, Median, and Mode
00:00 -
9.9 Expectation, Second Moment, and Variance
00:00 -
9.10 Cumulative Distribution
00:00 -
9.11 Joint Probability Distribution
00:00 -
9.12 GATE Questions
00:00
Chapter 10: Statistics
-
10.1 Statistics
00:00
Chapter 11: Differential Equation
-
11.1 Introduction to Differential Equations
00:00 -
11.2 Order and Degree
00:00 -
11.3 Ordinary and Partial Differential Equations
00:00 -
11.4 Linear and Nonlinear Differential Equations
00:00 -
11.5 Homogeneous and Nonhomogeneous Equations
00:00 -
11.6 Methods for First Order First Degree
00:00 -
11.7 Variable Separable Method
00:00 -
11.8 Leibnitz Differential Equations
00:00 -
11.9 Bernoulli’s Differential Equations
00:00 -
11.10 Homogeneous Function Differential Equations
00:00 -
11.11 Equations with dy/dx = f(ax + by + c)
00:00 -
11.12 Higher Order with Constant Coefficients
00:00 -
11.13 Higher Order with Variable Coefficients
00:00 -
11.14 Partial Differential Equations
00:00 -
11.15 GATE Questions
00:00
Chapter 12: Numerical Methods
-
12.1 Numerical Integration
00:00 -
12.2 Numerical Differentiation
00:00 -
12.3 Roots of Equations
00:00
Chapter 13: Complex Analysis
-
13.1 Introduction to Complex Numbers
00:00 -
13.2 Limit, Continuity, and Differentiability
00:00 -
13.3 Analytic Functions
00:00 -
13.4 Entire Functions
00:00 -
13.5 Complex Differentiation
00:00 -
13.6 Zeros & Singularity
00:00 -
13.7 Residues at Poles
00:00 -
13.8 Complex Integration (Open & Closed Path)
00:00 -
13.9 GATE Questions
00:00
Chapter 14: Vector Analysis
-
14.1 Vector Analysis
00:00
Chapter 15: Laplace Transform
-
15.1 Laplace Transform
00:00
E-Book – Engineering Mathematics
-
E-Book
Practice Set – Engineering Mathematics
-
Practice Set 1
-
Practice Set 2
Logical Reasoning
Chapter 1: Series
-
1.1 Series
00:00
Chapter 2: Coding and Decoding
-
2.1 Coding and Decoding
00:00
Chapter 3: Analytical Reasoning (AR) or Data Arrangement
-
3.1 Data Arrangement
00:00
Chapter 4: Blood Relations
-
4.1 Blood Relations
00:00
Chapter 5: Clocks and Calendars
-
5.1 Clock
00:00 -
5.2 Calendars
00:00
Chapter 6: Data Interpretation
-
6.1 Data Interpretation
00:00
Chapter 7: Directions
-
7.1 Directions
00:00
Chapter 8: Syllogism
-
8.1 Syllogism
00:00
E-Book – Logical Reasoning
-
E-Book
Practice Set – Logical Reasoning
-
Practice Set 1
-
Practice Set 2
Verbal Ability
Chapter 1: Noun
-
1.1 Noun
00:00
Chapter 2: Pronoun
-
2.1 Pronoun
00:00
Chapter 3: Subject and Verb Agreement
-
3.1 Subject and Verb Agreement
00:00
Chapter 4: Tenses
-
4.1 Tenses
00:00
Chapter 5: Modifiers
-
5.1 Modifiers Part 1
00:00 -
5.2 Modifiers Part 2
00:00
Chapter 6: Vocabulary Building
-
6.1 Vocabulary I – Root Words
00:00 -
6.2 Vocabulary I (VA)
00:00
Chapter 7: Verbal Logic
-
7.1 Course of Action
00:00 -
7.2 Critical Reasoning
00:00 -
7.3 Summary Type Questions
00:00 -
7.4 Deductive Logic & Logical Consistency
00:00
Chapter 8: Reading Comprehension (RC)
-
8.1 Introduction to Reading Comprehension (VA)
00:00 -
8.2 Reading Comprehension – Eclectic Reading (VA)
00:00 -
8.3 Reading Comprehension – Tones (VA)
00:00 -
8.4 Reading Comprehension – How to Solve Questions (VA)
00:00
Chapter 9: Articles & Prepositions
-
9.1 Articles & Prepositions
00:00
E-Book – Verbal Ability
-
E-Book
Practice Set – Verbal Ability
-
Practice Set 1
-
Practice Set 2
Algorithms
Chapter 1: Basics – Asymptotic Notation
-
1.1 Introduction of Algorithm
00:00 -
1.2 Basics – Asymptotic Notation Part 1
00:00 -
1.3 Basics – Asymptotic Notation Part 2
00:00
Chapter 2: Divide and Conquer
-
2.1 Divide & Conquer Part 1
00:00 -
2.2 Divide & Conquer Part 2
00:00 -
2.3 Divide & Conquer Part 3
00:00 -
2.4 Divide & Conquer Part 4
00:00 -
2.5 Divide & Conquer Part 5
00:00
Chapter 3: Sorting Techniques
-
3.1 Sorting Techniques Part 1
00:00 -
3.2 Sorting Techniques Part 2
00:00 -
3.3 Sorting Techniques Part 3
00:00
Chapter 4: Greedy Techniques
-
4.1 Greedy Techniques Part 1
00:00 -
4.2 Greedy Techniques Part 2
00:00 -
4.3 Greedy Techniques Part 3
00:00 -
4.4 Greedy Techniques Part 4
00:00 -
4.5 Greedy Techniques Part 5
00:00
Chapter 5: Dynamic Programming
-
5.1 Dynamic Programming
00:00
E-Book – Algorithms
-
E-Book
Practice Set – Algorithms
-
Practice Set 1
-
Practice Set 2
Compiler Design
Chapter 1: Introduction of Compiler and Lexical Analysis (Compiler)
-
1.1 Introduction of Compiler
00:00 -
1.2 Lexical Analysis
00:00 -
1.3 GATE Questions
00:00
Chapter 2: Parsing & Shift Reduce Parser
-
2.1 Introduction of Parsing
00:00 -
2.2 Recursive Predictive Parser
00:00 -
2.3 First Follow
00:00 -
2.4 Predict Parsing Table
00:00 -
2.5 GATE Questions (Top Down Parsing)
00:00 -
2.6 Shift Reduce Parser
00:00 -
2.7 Handle
00:00 -
2.8 Operator Precedence Parser
00:00 -
2.9 GATE Questions
00:00
Chapter 3: Semantic Analysis (Compiler)
-
3.1 Semantic Analyser
00:00 -
3.2 Attributed Grammar
00:00 -
3.3 Dependency Graph
00:00 -
3.4 Abstract Syntax Tree
00:00 -
3.5 GATE Questions
00:00
Chapter 4: Intermediate Code Generator (Compiler)
-
4.1 Intermediate Code Generator
00:00 -
4.2 Directed Acyclic Graph (DAG)
00:00 -
4.3 Basic Block
00:00 -
4.4 Control Graph
00:00 -
4.5 GATE Questions
00:00
Chapter 5: Run Time Environment (Compiler)
-
5.1 Runtime Environment
00:00 -
5.2 Scope Resolution Technique
00:00
Chapter 6: Local Optimization & Data Flow Analysis
-
6.1 Local Optimization & Data Flow Analysis
00:00 -
6.2 Constant Propagation
00:00 -
6.3 Liveness Analysis
00:00 -
6.4 Common Subexpression Elimination
00:00
E-Book – Compiler Design
-
E-Book
Practice Set – Compiler Design
-
Practice Set 1
-
Practice Set 2
Computer networks
Chapter 1: ISO OSI Physical Layer, LAN Technologies
-
1.1 Introduction Connecting Devices, Layering Principle (CN)
00:00 -
1.2 Introduction Connecting Devices, Layering Principle (CN)
00:00 -
1.3 GATE Questions
00:00
Chapter 2: Datalink Layer and SWP
-
2.1 Physical Layer and Data Link Layer (CN)
00:00 -
2.2 Physical Layer and Data Link Layer (CN)
00:00 -
2.3 Physical Layer and Data Link Layer (CN)
00:00 -
2.4 Physical Layer and Data Link Layer (CN)
00:00 -
2.5 Physical Layer and Data Link Layer (CN)
00:00 -
2.6 Physical Layer and Data Link Layer (CN)
00:00 -
2.7 Physical Layer and Data Link Layer (CN)
00:00 -
2.8 Physical Layer and Data Link Layer (CN)
00:00
Chapter 3: Network Layer
-
3.1 Network Layer
00:00 -
3.2 Network Layer
00:00 -
3.3 Network Layer
00:00 -
3.4 Network Layer
00:00 -
3.5 Network Layer
00:00 -
3.6 Network Layer
00:00 -
3.7 Network Layer
00:00 -
3.8 Network Layer
00:00
Chapter 4: Transport Layer
-
4.1 Transport Layer
00:00
Chapter 5: Application Layer and Network Security
-
5.1 Application Layer and Network Security (Full)
00:00
Chapter 6: Computer Network
-
6.1 Computer Network – 12 Videos
00:00
E-Book – Computer Networks
-
E-Book
Practice Set – Computer Networks
-
Practice Set 1
-
Practice Set 2
Computer Organization and Architecture
Chapter 1: Introduction
-
1. Introduction
00:00
Chapter 2: Instruction Format
-
2.1 Instruction Cycle
00:00 -
2.2 Classification of Instruction Format
00:00 -
2.3 Flags
00:00 -
2.4 Addressing Modes
00:00 -
2.5 Transfer of Flow Graph
00:00 -
2.6 Types of Instruction
00:00 -
2.7 GATE Questions
00:00
Chapter 3: CPU Organization
-
3.1 Control Unit
00:00 -
3.2 Gate Questions
00:00 -
3.3 Piping
00:00 -
3.4 Dependency in the Pipeline
00:00
Chapter 4: Memory Organization
-
4.1 Mapping Techniques
00:00 -
4.2 Updating Techniques
00:00 -
4.3 GATE Questions
00:00
Chapter 5: Input and Output Unit
-
5. Input & Output Organization
00:00
E-Book – Computer Organization and Architecture
-
E-Book
Practice Set – Computer Organization and Architecture
-
Practice Set 1
-
Practice Set 2
Database Management System
Chapter 1: Normalization
-
1.1 Normalization Part 1
00:00 -
1.2 Normalization Part 2
00:00 -
1.3 Normalization Part 3
00:00
Chapter 2: Database Design – ER Model
-
2.1 ER Model – Full
00:00
Chapter 3: Transaction Management & Concurrency Control
-
3.1 Transaction Management & Concurrency Control Part 1
00:00 -
3.2 Transaction Management & Concurrency Control Part 2
00:00 -
3.3 Transaction Management & Concurrency Control Part 3
00:00
Chapter 4: File Structures & Indexing
-
4.1 File Structures & Indexing – Full
00:00
Chapter 5: Structured Query Language
-
5.1 SQL Part 1
00:00 -
5.2 SQL Part 2
00:00
E-Book – Database Management System
-
E-Book
Practice Set – Database Management System
-
Practice Set 1
-
Practice Set 2
Digital Logic
Chapter 1: Number Systems
-
1.1 Introduction
00:00 -
1.2 Complements
00:00 -
1.3 Binary Codes
00:00 -
1.4 Gate Questions
00:00
Chapter 2: Boolean Algebra & Logic Gates
-
2.1 Introduction
00:00 -
2.2 Boolean Algebra
00:00 -
2.3 SOP & POS Expressions
00:00 -
2.4 Logic Gates
00:00 -
2.5 Gate Questions
00:00
Chapter 3: Combination Circuits
-
3.1 Introduction
00:00 -
3.2 Adders and Subtractors
00:00 -
3.3 Multiplexer and Demultiplexer
00:00 -
3.4 Decoder, Encoder, and Gate Questions
00:00
Chapter 4: Logic Families
-
4.1 Introduction
00:00 -
4.2 Characteristics of Digital ICs
00:00 -
4.3 Transistor-Transistor Logic
00:00 -
4.4 Emitter-Coupled Logic and CMOS Logic, Gate Questions
00:00
Chapter 5: Sequential Circuits
-
5.1 Introduction
00:00 -
5.2 Flip-Flops and Registers
00:00 -
5.3 Finite State Machines
00:00 -
5.4 Clock Pulses
00:00 -
5.5 Counters – Part 1
00:00 -
5.6 Counters – Part 2
00:00 -
5.7 Synchronous Counters
00:00
Chapter 6: A/D & D/A Converters
-
6.1 Introduction to ADC & DAC
00:00 -
6.2 Types of ADC
00:00 -
6.3 Types of DAC & Gate Questions
00:00
Chapter 7: Semiconductor Memories
-
7.1 Semiconductor Memories
00:00
Chapter 8: Microprocessor
-
8.1 Microprocessor 8085
00:00
E-Book – Digital Logic
-
E-Book
Practice Set – Digital Logic
-
Practice Set 1
-
Practice Set 2
Discrete Mathematics and Graph Theory
Chapter 1: Set Theory
-
1.1 Basics of Set Part 1
00:00 -
1.2 Basics of Set Part 2
00:00 -
1.3 Basics of Set Part 3
00:00 -
1.4 Basics of Set GATE Questions
00:00 -
1.5 Set Relations
00:00 -
1.6 Posets, Hasse Diagram, and Lattices Part 1
00:00 -
1.6.1 Posets, Hasse Diagram, and Lattices Part 2
00:00 -
1.6.2 Posets, Hasse Diagram, and Lattices Part 3
00:00 -
1.7 Function Part 1
00:00 -
1.8 Function Part 2
00:00 -
1.9 Function GATE Questions
00:00
Chapter 2: Graph Theory
-
2.1 Basics of Graph
00:00 -
2.2 Types of Graph – 1
00:00 -
2.3 Types of Graph – 2
00:00 -
2.4 Types of Graph – 3
00:00 -
2.5 Types of Graph GATE Questions – 1
00:00 -
2.6 Types of Graph GATE Questions – 2
00:00 -
2.7 Advanced Graph
00:00 -
2.8 GATE Questions
00:00
Chapter 3: Group Theory
-
3.1 Basics of Algebraic Theory & Group Properties
00:00 -
3.2 GATE Questions
00:00 -
3.3 Types of Group, Subgroup & Other Algebraic Structures
00:00 -
3.4 GATE Questions
00:00
Chapter 4: Predicate & First Order Logic
-
4.1 Proposition Basic Concepts
00:00 -
4.2 GATE Questions & First Order Logic
00:00
Chapter 5: Boolean Algebra
-
5.1 Boolean Logic Laws and Basic Concepts & GATE Questions
00:00
Chapter 6: Combinatorics
-
6.1 Basics of Combinatorics
00:00 -
6.2 GATE Questions Combinatorics
00:00 -
6.3 Combinatorics Part 2 and GATE Questions
00:00
E-Book – Discrete Mathematics and Graph Theory
-
E-Book
Practice Set – Discrete Mathematics and Graph Theory
-
Practice Set 1
-
Practice Set 2
Operating System
Chapter 1: Introduction of OS
-
1.1 Introduction, Goals of OS, Types of OS
00:00
Chapter 2: Process Management
-
2.1 Process Concepts
00:00 -
2.2 CPU Scheduling
00:00 -
2.3 Synchronization
00:00 -
2.4 Concurrent Programming
00:00 -
2.5 Deadlock
00:00 -
2.6 Thread
00:00
Chapter 3: Memory Management
-
3.1 Introduction of RAM Chip
00:00 -
3.2 Loading, Linking & Address Binding
00:00 -
3.3 Memory Management Techniques
00:00 -
3.4 Virtual Memory
00:00
Chapter 4: File & Device Allocation
-
4.1 File & Device Management – 1
00:00 -
4.2 File & Device Management – 2
00:00
E-Book – Operating System
-
E-Book
Practice Set – Operating System
-
Practice Set 1
-
Practice Set 2
Programming and Data Structures
Chapter 1: Introduction & Scoping (PROGRAMMING)
-
1.1 Introduction & Scoping
00:00 -
1.2 GATE Questions on Scoping
00:00
Chapter 2: Pointer (PROGRAMMING)
-
2.1 Local & Global Variables / Parameter Parsing Techniques
00:00 -
2.2 GATE Questions on Static Variables
00:00
Chapter 3: Static Variable & Parameter Parsing Techniques (PROGRAMMING)
-
3.1 Local & Global Variables / Parameter Parsing Techniques
00:00 -
3.2 GATE Questions on Static Variables
00:00
Chapter 4: C Programming (PROGRAMMING)
-
4.1 C Programming
00:00
Chapter 5: Programming Languages (PROGRAMMING)
-
5.1 Types of Programming Language
00:00 -
5.2 GATE Questions on Programming-I
00:00 -
5.3 GATE Questions on Programming-II
00:00 -
5.4 GATE Questions on Programming-III
00:00
Chapter 6: Tree (DS)
-
6.1 Binary Tree
00:00 -
6.2 Binary Search Tree
00:00 -
6.3 AVL Tree
00:00 -
6.4 B Tree
00:00 -
6.5 GATE Questions-I
00:00 -
6.6 GATE Questions-II
00:00
Chapter 7: Hashing (DS)
-
7.1 Hashing
00:00
Chapter 8: Stack (DS)
-
8.1 Stack
00:00 -
8.2 Recursion
00:00 -
8.3 Expression Evaluation
00:00
Chapter 9: Array (DS)
-
9.1 Array
00:00 -
9.2 String
00:00 -
9.3 Terminologies & Concepts
00:00
Chapter 10: Graph (DS)
-
10.1 Graph
00:00
Chapter 11: Structure, Union & Linked List (DS)
-
11.1 Structure & Union
00:00 -
11.2 Linked List
00:00
E-Book – Programming and Data Structures
-
E-Book
Practice Set – Programming and Data Structures
-
Practice Set 1
-
Practice Set 2
Theory of Computation
Chapter 1: Regular Language
-
1.1 Introduction of TOC
00:00 -
1.2 Chomsky Classification of Grammar
00:00 -
1.3 Regular Grammar, Regular Expression
00:00 -
1.4 Finite State Automata
00:00 -
1.5 Minimization of DFA
00:00 -
1.6 GATE Questions
00:00 -
1.7 Conversions Between FSA-RE-RG
00:00 -
1.8 Is Language Regular or Not
00:00 -
1.9 NFA-e to DFA Conversion
00:00 -
1.10 GATE Questions
00:00 -
1.11 Properties of Regular Language
00:00 -
1.12 GATE Questions
00:00 -
1.13 Mealy Moore Machine
00:00
Chapter 2: Context Free Grammar
-
2.1 Context Free Grammar
00:00 -
2.2 Simplification of CFG
00:00 -
2.3 Normal Form
00:00 -
2.4 CYK Algorithm
00:00 -
2.5 GATE Questions
00:00
Chapter 3: CFL & PDA
-
3.1 CFL to PDA
00:00 -
3.2 NPDA & DPDA
00:00 -
3.3 CFL or Not
00:00 -
3.4 CFG to PDA
00:00 -
3.5 Closure Properties of CFL
00:00 -
3.6 GATE Questions
00:00
Chapter 4: Turing Machine
-
4.1 Unrestricted Grammar (Type-0)
00:00 -
4.2 Turing Machine
00:00 -
4.3 Turing Machine as a Transducer
00:00 -
4.4 Types of Turing Machine
00:00 -
4.5 RL, REL & Closure Properties
00:00 -
4.6 GATE Questions
00:00
Chapter 5: Decidability & Countability
-
5.1 Decidability & Countability
00:00
E-Book – Theory of Computation
-
E-Book
Practice Set – Theory of Computation
-
Practice Set 1
-
Practice Set 2
Practice and Doubt Session
Chapter 1: Quantitative Aptitude
-
1.1 Quantitative Aptitude
00:00 -
1.2 Quantitative Aptitude
00:00
Chapter 2: Engineering Mathematics
-
2.1 Engineering Mathematics
00:00 -
2.2 Engineering Mathematics
00:00 -
2.3 Engineering Mathematics
00:00 -
2.4 Engineering Mathematics
00:00
Chapter 3: Programming and Data Structures
-
3.1 Programming and Data Structures
00:00
Chapter 4: Operating System
-
4.1 Operating System
00:00
Chapter 5: Theory of Computation
-
5.1 Theory of Computation
00:00
Chapter 6: Digital Electronics
-
6.1 Digital Electronics
00:00 -
6.2 Digital Electronics
00:00
Chapter 7: COA
-
7.1 COA
00:00
Chapter 8: Compiler Design
-
8.1 Compiler Design
00:00
Chapter 9: Discrete Maths (PS)
-
9.1 Discrete Maths (PS)
00:00
E-Book – Practice and Doubt Session
-
E-Book
Practice Set – Practice and Doubt Session
-
Practice Set 1
-
Practice Set 2
Revision for GATE with Most Important Topics
Chapter 1: Concept of Gateflix Revision
-
1.1 – Concept of Gateflix Revision
00:00
Chapter 2: Programming & Data Structure
-
2.1 – Introduction & Scoping
00:00 -
2.2 – Pointers
00:00 -
2.3 – Static Variable & Parameter Parsing Techniques
00:00 -
2.4 – C Programming
00:00 -
2.5 – Programming Language
00:00 -
2.6 – Binary Tree
00:00 -
2.7 – Binary Search Tree
00:00 -
2.8 – AVL Tree
00:00 -
2.9 – B Tree
00:00 -
2.10 – Hashing
00:00 -
2.11 – Stack
00:00 -
2.12 – Recursion
00:00 -
2.13 – Expression Evaluation
00:00 -
2.14 – Array
00:00 -
2.15 – String
00:00 -
2.16 – Graph
00:00
Chapter 3: Digital Logic For CS
-
3.1 – Number System Introduction
00:00 -
3.2 – Number System Complement
00:00 -
3.3 – Binary Codes
00:00 -
3.4 – Boolean Algebra
00:00 -
3.5 – Logic Circuit 1
00:00 -
3.6 – Logic Circuit 2
00:00 -
3.7 – Logic Circuit 3 (K-map)
00:00 -
3.8 – Combinational Circuit
00:00 -
3.9 – Sequential Circuit
00:00
Chapter 4: Operating System
-
4.1 – CPU Scheduling 1
00:00 -
4.2 – CPU Scheduling 2
00:00 -
4.3 – Synchronization 1
00:00 -
4.4 – Synchronization 2
00:00 -
4.5 – Synchronization 3
00:00 -
4.6 – Synchronization 4
00:00 -
4.7 – Deadlock
00:00 -
4.8 – Threads
00:00 -
4.9 – Contiguous Memory Management Techniques
00:00 -
4.10 – Paging
00:00 -
4.11 – Inverted Paging & Segmentation
00:00 -
4.12 – Virtual Memory
00:00 -
4.13 – File & Device Management
00:00 -
4.14 – Process Concepts
00:00 -
4.15 – Process Scheduling
00:00
Chapter 5: Set Theory
-
5.1 – Basic Of Set
00:00 -
5.2 – Basic Of Set Part 2
00:00 -
5.3 – Basic Of Set Part 3
00:00 -
5.4 – Set Relation
00:00 -
5.5 – Relation Poset and Lattice Part 1
00:00 -
5.6 – Relation Poset and Lattice Part 2
00:00 -
5.7 – Posets Hasse Diagram and Lattices Part 3
00:00 -
5.8 – Functions Part 1
00:00 -
5.9 – Functions Part 2
00:00
Chapter 6: Graph Theory
-
6.1 – Basics of Graph
00:00 -
6.2 – Types of Graph Part 1
00:00 -
6.3 – Types of Graph Part 2
00:00 -
6.4 – Types of Graph Part 3
00:00 -
6.5 – Advanced Graph
00:00
Chapter 7: Computer Networks Important Topics
-
7.1 – Introduction Connecting Devices, Layering Principle
00:00 -
7.2 – Physical Layer and Data Link Layer Part 1
00:00 -
7.3 – Physical Layer and Data Link Layer Part 2
00:00 -
7.4 – Network Layer Part 1
00:00 -
7.5 – Network Layer Part 2
00:00 -
7.6 – Transport Layer
00:00
Chapter 8: Compiler Design
-
8.1 – Introduction of Compiler
00:00 -
8.2 – Introduction of Parsing
00:00 -
8.3 – Recursive Predictive Parser
00:00 -
8.4 – First Follow
00:00 -
8.5 – Predict Parsing Table
00:00 -
8.6 – Shift Reduce Parser
00:00 -
8.7 – Handle
00:00 -
8.8 – Operator Precedence Parser
00:00 -
8.9 – Semantic Analyzer
00:00 -
8.10 – Attributed Grammar
00:00 -
8.11 – Dependency Graph
00:00 -
8.12 – Abstract Syntax Tree
00:00
Chapter 9: Database Management System
-
9.1 – Normalization Part 1
00:00 -
9.2 – Normalization Part 2
00:00 -
9.3 – Normalization Part 3
00:00 -
9.4 – Transaction Management & Concurrency Control 1
00:00 -
9.5 – Transaction Management & Concurrency Control 2
00:00 -
9.6 – Transaction Management & Concurrency Control 3
00:00 -
9.7 – Structured Query Language Part 1
00:00 -
9.8 – Structured Query Language Part 2
00:00
Chapter 10: Theory of Computation
-
10.1 – Introduction of TOC
00:00 -
10.2 – Regular Language, Grammar, Expression
00:00 -
10.3 – Finite State Automata
00:00 -
10.4 – Minimization of DFA
00:00 -
10.5 – Conversion Between FSA-RE-RG
00:00 -
10.6 – NFA-ε to DFA Conversion
00:00 -
10.7 – Properties of Regular Language
00:00 -
10.8 – Context Free Grammar
00:00 -
10.9 – Simplification of CFG
00:00 -
10.10 – CFL to PDA
00:00 -
10.11 – NPDA & DPDA
00:00 -
10.12 – CFL or Not
00:00 -
10.13 – CFG to PDA
00:00 -
10.14 – Closure Properties of CFL
00:00 -
10.15 – Unrestricted Grammar (Type-0)
00:00 -
10.16 – Turing Machine
00:00 -
10.17 – Turing Machine as a Transducer
00:00 -
10.18 – RL, REL & Closure Property
00:00 -
10.19 – Decidability & Countability
00:00
Chapter 11: Computer Organization and Architecture
-
11.1 – Introduction
00:00 -
11.2 – Instruction Cycle
00:00 -
11.3 – Classification of Instruction Format
00:00 -
11.4 – Flags
00:00 -
11.5 – Addressing Modes
00:00 -
11.6 – Transfer Flow Graph
00:00 -
11.7 – Types of Instruction
00:00 -
11.8 – Pipelining
00:00 -
11.9 – Dependency in the Pipelining
00:00 -
11.10 – Mapping Techniques
00:00 -
11.11 – Updating Techniques
00:00
E-Book – Revision for GATE with Most Important Topics
-
E-Book
Practice Set – Revision for GATE with Most Important Topics
-
Practice Set 1
-
Practice Set 2
GATE – NEW ADDED SYLLABUS
Chapter 1: Concept of Gateflix Revision
-
1.1 Concept of Gateflix Revision
00:00
Chapter 2: Programming & Data Structure
-
2.1 Introduction & Scoping
00:00 -
2.2 Pointers
00:00 -
2.3 Static Variable & Parameter Parsing Techniques
00:00 -
2.4 C Programming
00:00 -
2.5 Programming Language
00:00 -
2.6 Binary Tree
00:00 -
2.7 Binary Search Tree
00:00 -
2.8 AVL Tree
00:00 -
2.9 B Tree
00:00 -
2.10 Hashing
00:00 -
2.11 Stack
00:00 -
2.12 Recursion
00:00 -
2.13 Expression Evaluation
00:00 -
2.14 Array
00:00 -
2.15 String
00:00 -
2.16 Graph
00:00
Chapter 3: Digital Logic For CS
-
3.1 Number System Introduction
00:00 -
3.2 Number System Complement
00:00 -
3.3 Binary Codes
00:00 -
3.4 Boolean Algebra
00:00 -
3.5 Logic Circuit 1
00:00 -
3.6 Logic Circuit 2
00:00 -
3.7 Logic Circuit 3 (K-map)
00:00 -
3.8 Combinational Circuit
00:00 -
3.9 Sequential Circuit
00:00
Chapter 4: Operating System
-
4.1 CPU Scheduling 1
00:00 -
4.2 CPU Scheduling 2
00:00 -
4.3 Synchronization 1
00:00 -
4.4 Synchronization 2
00:00 -
4.5 Synchronization 3
00:00 -
4.6 Synchronization 4
00:00 -
4.7 Deadlock
00:00 -
4.8 Threads
00:00 -
4.9 Contiguous Memory Management Techniques
00:00 -
4.10 Paging
00:00 -
4.11 Inverted Paging & Segmentation
00:00 -
4.12 Virtual Memory
00:00 -
4.13 File & Device Management
00:00 -
4.14 Process Concepts
00:00 -
4.15 Process Scheduling
00:00
Chapter 5: Set Theory
-
5.1 Basic Of Set
00:00 -
5.2 Basic Of Set Part 2
00:00 -
5.3 Basic Of Set Part 3
00:00 -
5.4 Set Relation
00:00 -
5.5 Relation Poset and Lattice Part 1
00:00 -
5.6 Relation Poset and Lattice Part 2
00:00 -
5.7 Posets Hasse Diagram and Lattices Part 3
00:00 -
5.8 Functions Part 1
00:00 -
5.9 Functions Part 2
00:00 -
5.10 Basics of Graph
00:00 -
5.11 Types of Graph Part 1
00:00 -
5.12 Types of Graph Part 2
00:00 -
5.13 Types of Graph Part 3
00:00 -
5.14 Advanced Graph
00:00 -
5.15 Basic of Algebraic Theory & Group Properties
00:00 -
5.16 Types of Group, Subgroup & Other Algebraic Structure
00:00 -
5.17 Proposition Basic Concepts
00:00
Chapter 6: Computer Networks Important Topics
-
6.1 Introduction, Connecting Devices, Layering Principle
00:00 -
6.2 Physical Layer and Data Link Layer
00:00 -
6.3 Physical Layer and Data Link Layer
00:00 -
6.4 Physical Layer and Data Link Layer
00:00 -
6.5 Physical Layer and Data Link Layer
00:00 -
6.6 Physical Layer and Data Link Layer
00:00 -
6.7 Physical Layer and Data Link Layer
00:00 -
6.8 Physical Layer and Data Link Layer
00:00 -
6.9 Network Layer
00:00 -
6.10 Network Layer
00:00 -
6.11 Network Layer
00:00 -
6.12 Network Layer
00:00 -
6.13 Network Layer
00:00 -
6.14 Network Layer
00:00 -
6.15 Network Layer
00:00 -
6.16 Transport Layer
00:00
Chapter 7: Compiler Design
-
7.1 Introduction of Compiler
00:00 -
7.2 Introduction of Parsing
00:00 -
7.3 Recursive Predictive Parser
00:00 -
7.4 First Follow
00:00 -
7.5 Predict Parsing Table
00:00 -
7.6 Shift Reduce Parser
00:00 -
7.7 Handle
00:00 -
Draft Lesson7.8 Operator Precedence Parser
00:00 -
7.9 Semantic Analyzer
00:00 -
7.10 Attributed Grammar
00:00 -
7.11 Dependency Graph
00:00 -
7.12 Abstract Syntax Tree
00:00
Chapter 8: Database Management System
-
8.1 Normalization Part 1
00:00 -
8.2 Normalization Part 2
00:00 -
8.3 Normalization Part 3
00:00 -
8.4 Transaction Management & Concurrency Control 1
00:00 -
8.5 Transaction Management & Concurrency Control 2
00:00 -
8.6 Transaction Management & Concurrency Control 3
00:00 -
8.7 Structure Query Language 1
00:00 -
8.8 Structure Query Language 2
00:00
Chapter 9: Theory Of Computation
-
9.1 Introduction of TOC
00:00 -
9.2 Regular Language, Grammar, Expression
00:00 -
9.3 Finite State Automata
00:00 -
9.4 Minimization of DFA
00:00 -
9.5 Conversion Between FSA-RE-RG
00:00 -
9.6 NFA-ε to DFA Conversion
00:00 -
9.7 Properties of Regular Language
00:00 -
9.8 Context Free Grammar
00:00 -
9.9 Simplification of CFG
00:00 -
9.10 CFL to PDA
00:00 -
9.11 NPDA & DPDA
00:00 -
9.12 CFL or Not
00:00 -
9.13 CFG to PDA
00:00 -
9.14 Closure Properties of CFL
00:00 -
9.15 Unrestricted Grammar (Type-0)
00:00 -
9.16 Turing Machine
00:00 -
9.17 Turing Machine as a Transducer
00:00 -
9.18 RL, REL & Closure Property
00:00 -
9.19 Decidability & Countability
00:00
Chapter 10: Computer Organization and Architecture
-
10.1 Introduction
00:00 -
10.2 Instruction Cycle
00:00 -
10.3 Classification of Instruction Format
00:00 -
10.4 Flags
00:00 -
10.5 Addressing Modes
00:00 -
10.6 Transfer Flow Graph
00:00 -
10.7 Types of Instruction
00:00 -
10.8 Pipelining
00:00 -
10.9 Dependency in the Pipelining
00:00 -
10.10 Mapping Techniques
00:00 -
10.11 Updating Techniques
00:00
E-Book – GATE – NEW ADDED SYLLABUS
-
E-Book
Practice Set – GATE – NEW ADDED SYLLABUS
-
Practice Set 1
-
Practice Set 2
Data Structure and Algorithm (NEW)
Chapter 1: Data Structure and Algorithm (Latest)
-
L-1 DSA
00:00 -
L-2 DSA
00:00 -
L-3 DSA
00:00 -
L-4
00:00 -
L-5
00:00 -
L-6
00:00 -
L-7
00:00 -
L-8
00:00 -
L-9
00:00 -
L-10
00:00 -
L-11
00:00 -
L-12
00:00 -
L-13
00:00 -
L-14
00:00 -
L-15
00:00 -
L-16
00:00 -
L-17
00:00 -
L-18
00:00 -
L-19
00:00 -
L-20
00:00 -
L-21
00:00 -
L-22
00:00 -
L-23
00:00 -
L-24
00:00 -
L-25
00:00 -
L-26
00:00 -
L-27
00:00 -
L-28
00:00 -
L-29
00:00
Chapter 2: Computer Organization and Architecture
-
L-1 COA
00:00 -
L-2
00:00 -
L-3
00:00 -
L-4
00:00 -
L-5
00:00 -
L-6
00:00 -
L-7
00:00 -
L-8
00:00 -
L-9
00:00 -
L-10
00:00 -
L-11
00:00 -
L-12
00:00 -
L-13
00:00 -
L-14
00:00 -
L-15
00:00 -
L-16
00:00 -
L-17
00:00 -
L-18
00:00 -
L-19
00:00 -
L-20
00:00 -
L-21
00:00 -
L-22
00:00 -
L-23
00:00
E-Book – Data Structure and Algorithm (NEW)
-
E-Book
Practice Set – Data Structure and Algorithm (NEW)
-
Practice Set 1
-
Practice Set 2
Computer Organization and Architecture (NEW)
E-Book – Computer Organization and Architecture (NEW)
-
E-Book
Practice Set – Computer Organization and Architecture (NEW)
-
Practice Set 1
-
Practice Set 2
Student Ratings & Reviews
No Review Yet
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹Free.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹588.00 for 1 month
0 Lessons
From: ₹588.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
0 Lessons
From: ₹118.00 for 1 month
