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
- Course includes – Recorded Lecture Videos , E-book , Practice Set with PYQ , Chapter wise Mock Test and Full Length Mock Test
- Recorded by Best Mentors across the country from IIT/IISc
Course Curriculum
Quantitative Aptitude
Chapter 1: Numbers System
-
36:16
-
21:33
-
16:15
-
22:36
-
12:51
-
22:33
-
23:54
-
18:26
-
42:53
-
36:42
-
01:10:10
-
35:05
-
15:24
Chapter 2: Percentages and Application
Chapter 3: Ratio, Proportion, and Mixtures
-
17:53
-
08:36
-
23:10
-
13:12
-
13:12
Chapter 4: Time, Speed, and Distance
-
07:41
-
10:54
-
21:48
-
10:43
-
11:02
-
31:07
Chapter 5: Time and Work
Chapter 6: Geometry
-
16:53
-
19:00
-
05:15
-
11:29
-
07:18
-
6.6 Trigonometry
17:46 -
52:04
-
37:10
-
01:01:36
Chapter 7: Permutation and Combination
-
12:02
-
11:58
-
06:44
-
11:57
-
32:39
-
08:24
-
25:59
Chapter 8: Probability
Chapter 9: Algebra
-
17:57
-
19:03
-
37:51
-
46:35
-
49:03
-
54:15
-
23:39
-
28:53
Chapter 10: Set Theory
-
11:28
Chapter 11: Previous Year Aptitude GATE Questions
-
11.1 Aptitude-ME-GATE-question-2020
16:15 -
11.2 Aptitude-EE-Gate-Question-2020
11:14 -
11.3 Aptitude-EC-Gate-Question-2020
10:52 -
11.4 Aptitude-CS-GATE-Question-2020
09:12 -
11.5 Aptitude-CH-GATE-Question-2020
12:06 -
11.6 Aptitude-CE-GATE-Question-2020
20:05 -
11.7 Aptitude-CE-GATE-Questions-2018
15:36 -
11.8 Aptitude-CS-GATE-questions-2018
08:11 -
11.9 Aptitude-EC-GATE-Questions-2018
08:52 -
11.10 Aptitude-ME-GATE-Questions-2018-
12:37 -
11.11 Aptitude-CH-GATE-Questions-2017
10:37 -
11.12 Aptitude-EC-GATE-Questions-2016
12:32 -
11.13 Aptitude-EE-GATE-questions-2016
10:32 -
11.14 Aptitude-GATE-Questions-2015
28:36 -
11.15 Aptitude-CS-GATE-Questions-2015
12:15 -
11.16 Aptitude-EC-GATE-Questions-2015
07:30 -
11.17 Aptitude-ME-GATE-Questions-2015
15:10
Chapter 12: Spatial Aptitude
-
56:41
E-Book – Quantitative Aptitude
-
E-Book
Practice Set – Quantitative Aptitude
-
Practice Set 1
-
Practice Set 2
Mock Test – Quantative Aptitude
-
Mock Test 1
-
Mock Test 2
Engineering Mathematics
Chapter 1: Limit
-
1.1 Limit PART – I
21:39 -
1.2 Limit PART – II
01:09:01 -
1.3 Limit – GATE Questions
01:09:01
Chapter 2: Continuity
-
2.1 Introduction to Continuity
01:11:59 -
2.2 Types of Continuity
26:25
Chapter 3: Differentiability
-
3.1 Differentiability PART – I
34:47 -
3.2 Differentiability PART – II
16:40
Chapter 4: Properties of Function
-
4.1 Monotone Function
30:27
Chapter 5: Maxima & Minima
-
5.1 Introduction to Maxima & Minima
23:52 -
5.2 Maxima and Minima GATE Questions
12:58 -
5.3 Maxima & Minima (Two Variable)
29:47 -
5.4 Maxima And Minima Gate Questions – Math – Part-I
27:29 -
5.5 Maxima And Minima Gate Questions – Math – Part-II
45:11 -
5.6 Maxima And Minima Gate Questions – Math – Part-III
31:50
Chapter 6: Mean Value Theorem
-
6.1 Introduction to Mean-Value Theorem
28:00 -
6.2 Mean-Value Theorem GATE Questions
17:26
Chapter 7: Integration
-
7.1 Integration
01:22:14 -
7.2 Integration – Arc, Area , Length and Volume
01:19:26
Chapter 8: Linear Algebra
-
8.1 Linear Transformation
01:52:51 -
8.2 Introduction to Matrices
58:27 -
8.3 Rank & Nullity
24:32 -
8.4 System of Linear Equations
01:12:43 -
8.5 Eigenvalues & Eigenvectors
41:57 -
8.6 Number of Linearly Independent Eigenvectors
01:16:46 -
8.7 Diagonalization of Matrix
48:21 -
8.8 Some Important Properties Of Special Matrices
42:25
Chapter 9: Probability Distribution
-
9.1 Probability Distribution
01:58:46 -
9.2 Poisson’s Distribution
01:04:32
Chapter 10: Statistics
-
10.1 Statistics
02:26:57 -
10.2 Statistics Gate Questions (MATHs)
05:46
Chapter 11: Differential Equation
-
11.1 Differential Equation Part – I
01:53:39 -
11.2 Differential Equation Part – II
01:01:04 -
11.3 Differential Equations – GATE Questions
17:02 -
11.4 Partial Differential Equations
01:13:03 -
11.5 Differential Equations GATE Questions
47:36
Chapter 12: Numerical Methods
-
12.1 Numerical Integration
01:47:40 -
12.2 Numerical Differentiation
01:11:01 -
12.3 Roots of Equations
02:15:45 -
12.4 Numerical Analysis Maths
01:13:16
Chapter 13: Complex Analysis
-
13.1 Complex Analysis PART – I
01:11:27 -
13.2 Complex Analysis PART – II
01:20:05 -
13.3 Complex Analysis PART – III
53:37 -
13.4 Complex Analysis – GATE Questions
01:13:24 -
13.5 Complex Differentiation
30:09 -
13.6 Zeros & Singularity: Poles, Essential Singularity, Harmonic Singularity
22:07
Chapter 14: Vector Analysis
-
14.1 Vector Analysis Part-1
01:06:58 -
14.2 Vector Analysis Part-2
54:12 -
14.3 Vector Analysis Part-3
42:36 -
14.4 Vector Analysis Part-4
02:10:21 -
14.5 Vector Analysis GATE Questions PART-1
27:15 -
14.6 Vector Analysis GATE Questions PART-2
25:00
Chapter 15: Laplace Transform
-
15.1 Laplace Transform
06:52 -
Laplace Transform Gate Questions
06:52
E-Book – Engineering Mathematics
-
E-Book
Practice Set – Engineering Mathematics
-
Practice Set 1
-
Practice Set 2
Mock Test – Engineering Mathematics
-
Mock Test 1
-
Mock Test 2
Logical Reasoning
Chapter 1: Series
-
1.1 Series
25:12
Chapter 2: Coding and Decoding
-
2.1 Coding and Decoding
13:29
Chapter 3: Analytical Reasoning (AR) or Data Arrangement
-
3.1 Data Arrangement
39:34
Chapter 4: Blood Relations
-
4.1 Blood Relations
11:59
Chapter 5: Clocks and Calendars
-
5.1 Clock
20:30 -
5.2 Calendars
23:53
Chapter 6: Data Interpretation
-
6.1 Data Interpretation
26:04
Chapter 7: Directions
-
7.1 Directions
11:09
Chapter 8: Syllogism
-
8.1 Syllogism
16:33
E-Book – Logical Reasoning
-
E-Book
Practice Set – Logical Reasoning
-
Practice Set 1
-
Practice Set 2
Mock Test – Logical Reasoning
-
Mock Test 1
Verbal Ability
Chapter 1: Noun
-
1.1 Noun
01:08:39
Chapter 2: Pronoun
-
2.1 Pronoun
01:44:52
Chapter 3: Subject and Verb Agreement
-
3.1 Subject and Verb Agreement
01:17:39
Chapter 4: Tenses
-
4.1 Tenses
55:33
Chapter 5: Modifiers
-
5.1 Modifiers Part 1
43:32 -
5.2 Modifiers Part 2
01:05:44
Chapter 6: Vocabulary Building
-
6.1 Vocabulary PART – I
56:20 -
6.2 Vocabulary PART – II
32:05
Chapter 7: Verbal Logic
-
7.1 Course of Action
37:19 -
7.2 Critical Reasoning
42:46 -
7.3 Summary Type Questions
44:09 -
7.4 Deductive Logic & Logical Consistency
01:16:06
Chapter 8: Reading Comprehension (RC)
-
8.1 Introduction to Reading Comprehension (VA)
27:24 -
8.2 Reading Comprehension – Eclectic Reading (VA)
50:46 -
8.3 Reading Comprehension – Tones (VA)
01:06:16 -
8.4 Reading Comprehension – How to Solve Questions (VA)
54:51
Chapter 9: Articles & Prepositions
-
9.1 Articles & Prepositions
01:20:05
E-Book – Verbal Ability
-
E-Book
Practice Set – Verbal Ability
-
Practice Set 1
-
Practice Set 2
Mock Test – Verbal Ability
-
Mock Test 1
Algorithms
Chapter 1: Basics – Asymptotic Notation
-
1.1 Introduction of Algorithm
46:22 -
1.2 Basics – Asymptotic Notation Part 1
01:00:43 -
1.3 Basics – Asymptotic Notation Part 2
55:11
Chapter 2: Divide and Conquer
-
2.1 Divide & Conquer Part 1
01:00:13 -
2.2 Divide & Conquer Part 2
01:19:07 -
2.3 Divide & Conquer Part 3
01:13:01 -
2.4 Divide & Conquer Part 4
01:15:43 -
2.5 Divide & Conquer Part 5
01:00:13
Chapter 3: Sorting Techniques
-
3.1 Sorting Techniques Part 1
38:56 -
3.2 Sorting Techniques Part 2
49:41 -
3.3 Sorting Techniques Part 3
56:08
Chapter 4: Greedy Techniques
-
4.1 Greedy Techniques Part 1
47:23 -
4.2 Greedy Techniques Part 2
50:00 -
4.3 Greedy Techniques Part 3
46:07 -
4.4 Greedy Techniques Part 4
37:55 -
4.5 Greedy Techniques Part 5
43:36
Chapter 5: Dynamic Programming
-
5.1 Dynamic Programming
59:48
E-Book – Algorithms
-
E-Book
Practice Set – Algorithms
-
Practice Set 1
-
Practice Set 2
Mock Test – Algorithms
-
Mock Test 1
Compiler Design
Chapter 1: Introduction of Compiler and Lexical Analysis (Compiler)
-
1.1 Introduction of Compiler
51:45 -
1.2 Lexical Analysis
01:03:21 -
1.3 GATE Questions
06:34
Chapter 2: Parsing & Shift Reduce Parser
-
2.1 Introduction of Parsing
15:48 -
2.2 Recursive Predictive Parser
45:24 -
2.3 First Follow
20:13 -
2.4 Predict Parsing Table
34:34 -
2.5 GATE Questions (Top Down Parsing)
11:04 -
2.6 Shift Reduce Parser
01:59:59 -
2.7 Handle
15:17 -
2.8 Operator Precedence Parser
29:16 -
2.9 GATE Questions
20:17
Chapter 3: Semantic Analysis (Compiler)
-
3.1 Semantic Analyser
36:17 -
3.2 Attributed Grammar
09:46 -
3.3 Dependency Graph
10:12 -
3.4 Abstract Syntax Tree
07:45 -
3.5 GATE Questions
07:27
Chapter 4: Intermediate Code Generator (Compiler)
-
4.1 Intermediate Code Generator
29:13 -
4.2 Directed Acyclic Graph (DAG)
14:15 -
4.3 Basic Block
08:01 -
4.4 Control Graph
11:32 -
4.5 GATE Questions
07:34
Chapter 5: Run Time Environment (Compiler)
-
5.1 Runtime Environment
20:36 -
5.2 Scope Resolution Technique
07:57
Chapter 6: Local Optimization & Data Flow Analysis
-
6.1 Local Optimization & Data Flow Analysis
01:48:59 -
6.2 Constant Propagation
01:50:25
E-Book – Compiler Design
-
E-Book
Practice Set – Compiler Design
-
Practice Set 1
-
Practice Set 2
Mock Test – Compiler Design
-
Mock Test 1
-
Mock Test 2
Computer networks
Chapter 1: ISO OSI Physical Layer, LAN Technologies
-
1.1 Introduction Connecting Devices, Layering Principle (CN)
01:09:03 -
1.2 Introduction Connecting Devices, Layering Principle (CN)
01:43:53 -
1.3 GATE Questions
17:23
Chapter 2: Datalink Layer and SWP
-
2.1 Physical Layer and Data Link Layer (CN)
01:13:58 -
2.2 Physical Layer and Data Link Layer (CN)
50:32 -
2.3 Physical Layer and Data Link Layer (CN)
01:00:46 -
2.4 Physical Layer and Data Link Layer (CN)
45:04 -
2.5 Physical Layer and Data Link Layer (CN)
55:28 -
2.6 Physical Layer and Data Link Layer (CN)
01:15:30 -
2.7 Physical Layer and Data Link Layer (CN)
01:39:20 -
2.8 Physical Layer and Data Link Layer (CN)
01:00:42
Chapter 3: Network Layer
-
3.1 Network Layer
21:21 -
3.2 Network Layer
01:22:12 -
3.3 Network Layer
48:46 -
3.4 Network Layer
01:10:31 -
3.5 Network Layer
40:21 -
3.6 Network Layer
41:08 -
3.7 Network Layer
01:03:30 -
3.8 Network Layer
01:02:45
Chapter 4: Transport Layer
-
4.1 Transport Layer
01:22:02
Chapter 5: Application Layer and Network Security
-
5.1 Application Layer and Network Security (Full)
01:13:52
Chapter 6: Computer Network
-
6.1 Computer Network
25:59 -
6.2 Computer Network
09:52 -
6.3 Computer Network
27:23 -
6.4 Computer Network
24:23 -
6.5 Computer Network
20:15 -
6.6 Computer Network
25:42 -
6.7 Computer Network
26:36 -
6.8 Computer Network
02:15 -
6.9 Computer Network
31:18 -
6.10 Computer Network
20:25 -
6.11 Computer Network
15:11 -
6.12 Computer Network
16:31
E-Book – Computer Networks
-
E-Book
Practice Set – Computer Networks
-
Practice Set 1
-
Practice Set 2
Mock Test – Computer Networks
-
Mock Test 1
-
Mock Test 2
Computer Organization and Architecture
Chapter 1: Introduction
-
1. Introduction
49:08
Chapter 2: Instruction Format
-
2.1 Instruction Cycle
32:57 -
2.2 Classification of Instruction Format
02:05:26 -
2.3 Flags
33:17 -
2.4 Addressing Modes
01:35:58 -
2.5 Transfer of Flow Graph
02:09:03 -
2.6 Types of Instruction
08:52 -
2.7 GATE Questions
40:44
Chapter 3: CPU Organization
-
3.1 Control Unit
38:30 -
3.2 Gate Questions
01:38:13 -
3.3 Piping
02:00:09 -
3.4 Dependency in the Pipeline
02:11:18
Chapter 4: Memory Organization
-
4.1 Mapping Techniques
49:14 -
4.2 Updating Techniques
18:12 -
4.3 GATE Questions
08:56
Chapter 5: Input and Output Unit
-
5. Input & Output Organization
36:42
E-Book – Computer Organization and Architecture
-
E-Book
Practice Set – Computer Organization and Architecture
-
Practice Set 1
-
Practice Set 2
Mock Test – Computer Organization and Architecture
-
Mock Test 1
-
Mock Test 2
Database Management System
Chapter 1: Normalization
-
1.1 Normalization Part 1
42:02 -
1.2 Normalization Part 2
32:56 -
1.3 Normalization Part 3
44:24
Chapter 2: Database Design – ER Model
-
2.1 ER Model – Full
01:11:09
Chapter 3: Transaction Management & Concurrency Control
-
3.1 Transaction Management & Concurrency Control Part 1
01:04:11 -
3.2 Transaction Management & Concurrency Control Part 2
02:03:35 -
3.3 Transaction Management & Concurrency Control Part 3
01:04:11
Chapter 4: File Structures & Indexing
-
4.1 File Structures & Indexing – Full
02:19:02
Chapter 5: Structured Query Language
-
5.1 SQL Part 1
51:13 -
5.2 SQL Part 2
30:54
E-Book – Database Management System
-
E-Book
Practice Set – Database Management System
-
Practice Set 1
-
Practice Set 2
Mock Test – Database Management System
-
Mock Test 1
-
Mock Test 2
Digital Logic
Chapter 1: Number Systems
-
1.1 Introduction
40:23 -
1.2 Complements
44:44 -
1.3 Binary Codes
56:59 -
1.4 Gate Questions
36:49
Chapter 2: Boolean Algebra & Logic Gates
-
2.1 Introduction of Boolean Algebra
22:45 -
2.2- Logic Circuits-PART – I
01:01:22 -
2.3 Logic Circuit- PART – II
58:54 -
2.4 Logic Circuit PART – III
45:24 -
2.5 Logic Circuit PART – IV
32:34
Chapter 3: Combination Circuits
-
3.1 Introduction
01:08:35 -
3.2 Adders and Subtractors
01:08:35 -
3.3 Multiplexer and Demultiplexer
46:48 -
3.4 Decoder, Encoder, and Gate Questions
46:48
Chapter 4: Logic Families
-
4.1 Introduction
44:55 -
4.2 Characteristics of Digital ICs
40:25 -
4.3 Transistor-Transistor Logic
26:60 -
4.4 Emitter-Coupled Logic and CMOS Logic, Gate Questions
01:09:57
Chapter 5: Sequential Circuits
-
5.1 Introduction
01:13:08 -
5.2 Flip-Flops and Registers
50:17 -
5.3 Finite State Machines
48:09 -
5.4 Clock Pulses
58:16 -
5.5 Counters – Part 1
43:23 -
5.6 Counters – Part 2
46:04 -
5.7 Synchronous Counters
41:15
Chapter 6: A/D & D/A Converters
-
6.1 Introduction to ADC & DAC
41:15 -
6.2 Types of ADC
43:06 -
6.3 Types of DAC & Gate Questions
52:07
Chapter 7: Semiconductor Memories
-
7.1 Semiconductor Memories
38:34
Chapter 8: Microprocessor
-
8.1 Microprocessor 8085
37:38
E-Book – Digital Logic
-
E-Book
Practice Set – Digital Logic
-
Practice Set 1
-
Practice Set 2
Mock Test – Digital Logic
Discrete Mathematics and Graph Theory
Chapter 1: Set Theory
-
1.1 Basics of Set Part 1
01:33:58 -
1.2 Basics of Set Part 2
01:29:47 -
1.3 Basics of Set Part 3
33:35 -
1.4 Basics of Set GATE Questions
40:17 -
1.5 Set Relations
01:11:45 -
1.6 Posets, Hasse Diagram, and Lattices Part 1
01:36:20 -
1.6.1 Posets, Hasse Diagram, and Lattices Part 2
01:05:06 -
1.6.2 Posets, Hasse Diagram, and Lattices Part 3
51:28 -
1.7 Function Part 1
41:16 -
1.8 Function Part 2
01:17:37 -
1.9 Function GATE Questions
51:51
Chapter 2: Graph Theory
-
2.1 Basics of Graph
19:25 -
2.2 Types of Graph – 1
01:18:38 -
2.3 Types of Graph – 2
01:28:40 -
2.4 Types of Graph – 3
34:02 -
2.5 Types of Graph GATE Questions – 1
01:04:46 -
2.6 Types of Graph GATE Questions – 2
46:20 -
2.7 Advanced Graph
38:10 -
2.8 GATE Questions
01:00:18
Chapter 3: Group Theory
-
3.1 Basics of Algebraic Theory & Group Properties
43:01 -
3.2 GATE Questions
54:08 -
3.3 Types of Group, Subgroup & Other Algebraic Structures
44:05 -
3.4 GATE Questions
21:51
Chapter 4: Predicate & First Order Logic
-
4.1 Proposition Basic Concepts
52:59 -
4.2 GATE Questions & First Order Logic
01:10:35
Chapter 5: Boolean Algebra
-
5.1 Boolean Logic Laws and Basic Concepts & GATE Questions
29:06
Chapter 6: Combinatorics
-
6.1 Basics of Combinatorics
46:40 -
6.2 GATE Questions Combinatorics
21:18 -
6.3 Combinatorics Part 2 and GATE Questions
33:26
E-Book – Discrete Mathematics and Graph Theory
-
E-Book
Practice Set – Discrete Mathematics and Graph Theory
-
Practice Set 1
-
Practice Set 2
Mock Test – Discrete Mathematics and Graph Theory
-
Mock Test 1
-
Mock Test 2
Operating System
Chapter 1: Introduction of OS
-
1.1 Introduction, Goals of OS, Types of OS
35:38
Chapter 2: Process Management
-
2.1 Process Concepts – OS
01:04:25 -
2.2 CPU-scheduling-1 – OS
01:06:24 -
2.2 CPU-scheduling-2 – OS
01:10:58 -
2.3 CPU-Scheduling-3 – OS
01:36:05 -
2.4 Synchronization-1 – OS
01:20:00 -
2.5 Synchronization-2 – OS
01:16:21 -
2.6 Ssynchronization-3 – OS
01:11:57 -
2.7 Synchronization-4 – OS
01:01:09 -
2.8 Synchronization-5 – OS
50:19 -
2.9 Concurrent Programming – OS
01:27:08 -
2.10 Deadlock – OS
01:24:25 -
2.11 Threads – OS
25:37
Chapter 3: Memory Management
-
3.1-introduction RAM Chip – OS
41:50 -
3.2 Loading Linking Address Binding – OS
14:03 -
3.3.1 Contiguous Memory Management Techniques – OS
35:19 -
3.3.3 GATE Questions On Paging – OS
54:50 -
3.3.4 Multi Level Paging – OS
56:55 -
3.3.5 Inverted Paging Segmentation – OS
35:54 -
3.3.6 Segmented Paging – OS
45:29 -
3.4 Virtual Memory – OS – PART I
40:43 -
3.5 Virtual Memory – OS – PART II
58:28
Chapter 4: File & Device Allocation
-
4.1 File Device Management PART-I – OS
38:42 -
4.2 File Device Management PART-II- OS
57:24
E-Book – Operating System
-
E-Book
Practice Set – Operating System
-
Practice Set 1
-
Practice Set 2
Mock Test – Operating System
-
Mock Test 1
-
Mock Test 2
Programming and Data Structures
Chapter 1: Introduction & Scoping (PROGRAMMING)
-
1.1 Introduction & Scoping
18:07 -
1.2 GATE Questions on Scoping
10:40
Chapter 2: Pointer (PROGRAMMING)
-
2.1 Local & Global Variables / Parameter Parsing Techniques
54:49 -
2.2 GATE Questions on Static Variables
34:43
Chapter 3: Static Variable & Parameter Parsing Techniques (PROGRAMMING)
-
3.1 Local & Global Variables / Parameter Parsing Techniques
36:39 -
3.2 GATE Questions on Static Variables
26:02
Chapter 4: C Programming (PROGRAMMING)
-
4.1 C Programming
01:31:38
Chapter 5: Programming Languages (PROGRAMMING)
-
5.1 Types of Programming Language
28:52 -
5.2 GATE Questions on Programming-I
01:11:43 -
5.3 GATE Questions on Programming-II
34:03 -
5.4 GATE Questions on Programming-III
40:41
Chapter 6: Tree (DS)
-
6.1 Binary Tree
01:14:13 -
6.2 Binary Search Tree
01:11:17 -
6.3 AVL Tree
01:07:38 -
6.4 B Tree
01:17:53 -
6.5 GATE Questions-I
01:24:23 -
6.6 GATE Questions-II
36:41
Chapter 7: Hashing (DS)
-
7.1 Hashing
57:35
Chapter 8: Stack (DS)
-
8.1 Stack
49:16 -
8.2 Recursion
43:17 -
8.3 Expression Evaluation
01:06:40
Chapter 9: Array (DS)
-
9.1 Array
52:28 -
9.2 String
40:47 -
9.3 Terminologies & Concepts
38:54
Chapter 10: Graph (DS)
-
10.1 Graph
01:18:55
Chapter 11: Structure, Union & Linked List (DS)
-
11.1 Structure & Union
39:20 -
11.2 Linked List
01:20:49
E-Book – Programming and Data Structures
-
E-Book
Practice Set – Programming and Data Structures
-
Practice Set 1
-
Practice Set 2
Mock Test – Programming and Data Structure
-
Mock Test 1
-
Mock Test 2
Theory of Computation
Chapter 1: Regular Language
-
1.1 Introduction of TOC
30:00 -
1.2 Chomsky Classification of Grammar
50:10 -
1.3 Regular Grammar, Regular Expression
01:18:21 -
1.4 Finite State Automata
01:01:45 -
1.5 Minimization of DFA
31:34 -
1.6 GATE Questions
01:03:35 -
1.7 Conversions Between FSA-RE-RG
58:24 -
1.8 Is Language Regular or Not
30:07 -
1.9 NFA-e to DFA Conversion
16:42 -
1.10 GATE Questions
22:19 -
1.11 Properties of Regular Language
01:18:33 -
1.12 GATE Questions
38:53 -
1.13 Mealy Moore Machine
36:01
Chapter 2: Context Free Grammar
-
2.1 Context Free Grammar
59:03 -
2.2 Simplification of CFG
59:03 -
2.3 Normal Form
33:54 -
2.4 CYK Algorithm
15:00 -
2.5 GATE Questions
28:31
Chapter 3: CFL & PDA
-
3.1 CFL to PDA
01:00:37 -
3.2 NPDA & DPDA
24:11 -
3.3 CFL or Not
13:50 -
3.4 CFG to PDA
25:38 -
3.5 Closure Properties of CFL
39:01 -
3.6 GATE Questions
25:40
Chapter 4: Turing Machine
-
4.1 Unrestricted Grammar (Type-0)
16:42 -
4.2 Turing Machine
39:06 -
4.3 Turing Machine as a Transducer
16:30 -
4.4 Types of Turing Machine
13:03 -
4.5 RL, REL & Closure Properties
24:05 -
4.6 GATE Questions
10:54
Chapter 5: Decidability & Countability
-
5.1 Decidability & Countability
29:14
E-Book – Theory of Computation
-
E-Book
Practice Set – Theory of Computation
-
Practice Set 1
-
Practice Set 2
Mock Test – Theory of Computation
-
Mock Test 1
Practice and Doubt Session
Chapter 1: Quantitative Aptitude
-
1.1 Quantitative Aptitude
01:34:35 -
1.2 Quantitative Aptitude
01:23:11
Chapter 2: Engineering Mathematics
-
2.1 Engineering Mathematics
01:12:01 -
2.2 Engineering Mathematics
02:28:21 -
2.3 Engineering Mathematics
01:35:29 -
2.4 Engineering Mathematics
04:01:03
Chapter 3: Programming and Data Structures
-
3.1 Programming and Data Structures
01:08:54
Chapter 4: Operating System
-
4.1 Operating System
01:15:11
Chapter 5: Theory of Computation
-
5.1 Theory of Computation
02:25:49
Chapter 6: Digital Electronics
-
6.1 Digital Electronics
43:49 -
6.2 Digital Electronics
59:31
Chapter 7: COA
-
7.1 COA
01:33:43
Chapter 8: Compiler Design
-
8.1 Compiler Design
01:11:09
Chapter 9: Discrete Maths (PS)
-
9.1 Discrete Maths (PS)
01:10:16
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
01:18
Chapter 2: Programming & Data Structure
-
2.1 – Introduction & Scoping
18:04 -
2.2 – Pointers
54:47 -
2.3 – Static Variable & Parameter Parsing Techniques
36:34 -
2.4 – C Programming
01:31:37 -
2.5 – Programming Language
28:51 -
2.6 – Binary Tree
01:14:13 -
2.7 – Binary Search Tree
44:18 -
2.8 – AVL Tree
01:07:38 -
2.9 – B Tree
01:17:53 -
2.10 – Hashing
57:35 -
2.11 – Stack
49:16 -
2.12 – Recursion
43:16 -
2.13 – Expression Evaluation
01:06:40 -
2.14 – Array
52:26 -
2.15 – String
40:47 -
2.16 – Graph
01:18:54
Chapter 3: Digital Logic For CS
-
3.1 – Number System Introduction
40:23 -
3.2 – Number System Complement
44:44 -
3.3 – Binary Codes
56:59 -
3.4 – Boolean Algebra
22:47 -
3.5 – Logic Circuit 1
03:56 -
3.6 – Logic Circuit 2
58:52 -
3.7 – Logic Circuit 3 (K-map)
45:24 -
3.8 – Combinational Circuit
01:37:12 -
3.9 – Sequential Circuit
01:13:08
Chapter 4: Operating System
-
4.1 – CPU Scheduling 1
01:06:24 -
4.2 – CPU Scheduling 2
01:10:57 -
4.3 – Synchronization 1
01:19:58 -
4.4 – Synchronization 2
01:16:19 -
4.5 – Synchronization 3
30:25 -
4.6 – Synchronization 4
18:24 -
4.7 – Deadlock
01:24:26 -
4.8 – Threads
20:38 -
4.9 – Contiguous Memory Management Techniques
32:07 -
4.10 – Paging
59:08 -
4.11 – Inverted Paging & Segmentation
22:53 -
4.12 – Virtual Memory
28:36 -
4.13 – File & Device Management
19:25 -
4.14 – Process Concepts
01:04:25 -
4.15 – Process Scheduling
08:16
Chapter 5 Discrete Mathematics & Graph Theory
-
5.1 – Basic Of Set – PART I – DGMT
01:33:58 -
5.2 – Basic-Of-Set-PART II – DMGT
01:29:47 -
5.3 – Basic Of Set PART III – DMGT
33:35 -
5.4 – Set Relation – DMGT
01:11:45 -
5.5 – Relation Poset and Lattice PART I – DMGT
01:36:20 -
5.6 – Relation Poset and Lattice PART II – DMGT
01:05:06 -
5.7 Posets Hasse Diagram and Lattices PART III -DMGT
51:28 -
5.8 Functions PART I – DMGT
41:15 -
5.9 Functions PART II – DMGT
01:17:37 -
5.10 Basics Of Graph PART I – DMGT
19:25 -
5.11 Type Of Graph PART I – DMGT
01:18:38 -
5.12 Type Of Graph PART II – DMGT
01:28:40 -
5.13 Type Of Graph PART III – DMGT
34:02 -
5.14 Advanced Graph – DMGT
38:10 -
5.15 Basic Of Algebraic Theory Group Properties – DMGT
43:01 -
5.16 Types Of Group Subgroup Other Algebraic Structure – DMGT
44:05 -
5.17 Proposition Basic Concepts – DMGT
52:59
Chapter 7: Computer Networks Important Topics
-
7.1 – Introduction Connecting Devices, Layering Principle
01:36:35 -
7.2 – Physical Layer and Data Link Layer PART I
50:31 -
7.3 – Physical Layer and Data Link Layer PART II
46:17 -
7.4 – Physical Layer and Data Link Layer PART III
45:04 -
7.5 – Physical Layer and Data Link Layer PART IV
24:31 -
7.6 – Physical Layer and Data Link Layer PART V
06:28 -
7.7 Physical Layer and Data Link Layer PART VI
01:39:18 -
7.8 Physical Layer and Data Link Layer PART VII
43:32 -
7.9 Network Layer – PART I
21:15 -
7.10 Network Layer – PART II
01:22:09 -
7.11 Network Layer – PART III
14:25 -
7.12 Network Layer – PART IV
01:10:31 -
7.13 Network Layer – PART V
40:21 -
7.14 Network Layer – PART VI
41:06 -
7.15 Network Layer – PART VII
43:14 -
7.16 Network Layer – PART VIII
01:02:45 -
7.17 Transport Layer
01:03:39
Chapter 8: Compiler Design
-
8.1 – Introduction of Compiler
51:45 -
8.2 – Introduction of Parsing
15:47 -
8.3 – Recursive Predictive Parser
45:24 -
8.4 – First Follow
20:12 -
8.5 – Predict Parsing Table
34:34 -
8.6 – Shift Reduce Parser
01:59:59 -
8.7 – Handle
15:16 -
8.8 – Operator Precedence Parser
29:16 -
8.9 – Semantic Analyzer
36:17 -
8.10 – Attributed Grammar
09:46 -
8.11 – Dependency Graph
10:12 -
8.12 – Abstract Syntax Tree
07:45
Chapter 9: Database Management System
-
9.1 – Normalization Part 1
42:02 -
9.2 – Normalization Part 2
32:56 -
9.3 – Normalization Part 3
44:24 -
9.4 – Transaction Management & Concurrency Control 1
38:23 -
9.5 – Transaction Management & Concurrency Control 2
01:54:42 -
9.6 – Transaction Management & Concurrency Control 3
01:04:14 -
9.7 – Structured Query Language Part 1
51:12 -
9.8 – Structured Query Language Part 2
30:54
Chapter 10: Theory of Computation
-
10.1 – Introduction of TOC
26:52 -
10.2 – Regular Language, Grammar, Expression
01:05:14 -
10.3 – Finite State Automata
01:05:14 -
10.4 – Minimization of DFA
31:34 -
10.5 – Conversion Between FSA-RE-RG
58:24 -
10.6 – NFA-ε to DFA Conversion
16:42 -
10.7 – Properties of Regular Language
01:18:33 -
10.8 – Context Free Grammar
59:03 -
10.9 – Simplification of CFG
22:33 -
10.10 – CFL to PDA
01:00:37 -
10.11 – NPDA & DPDA
24:11 -
10.12 – CFL or Not
13:50 -
10.13 – CFG to PDA
25:38 -
10.14 – Closure Properties of CFL
39:01 -
10.15 – Unrestricted Grammar (Type-0)
16:42 -
10.16 – Turing Machine
39:06 -
10.17 – Turing Machine as a Transducer
16:30 -
10.18 – RL, REL & Closure Property
24:05 -
10.19 – Decidability & Countability
29:14
Chapter 11: Computer Organization and Architecture
-
11.1 – Introduction
49:08 -
11.2 – Instruction Cycle
32:57 -
11.3 – Classification of Instruction Format
02:05:26 -
11.4 – Flags
33:17 -
11.5 – Addressing Modes
01:35:58 -
11.6 – Transfer Flow Graph
02:09:03 -
11.7 – Types of Instruction
08:52 -
11.8 – Pipelining
02:00:09 -
11.9 – Dependency in the Pipelining
02:11:18 -
11.10 – Mapping Techniques
49:14 -
11.11 – Updating Techniques
18:12
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: Discrete Mathematics
-
1.1 Basic Of Algebric Theory
43:01 -
1.2 GATE Questions DGMT
54:08
Chapter 2: Computer Organisation and Architecture
-
2.1 Dependency in The Pipe Line
02:11:18
Chapter 3: Compiler Design
-
3.1 Local Optimization and Data Flow Analysis PART I
01:48:59 -
3.2 Local Optimization and Data Flow Analysis PART II
01:50:25
Chapter 4: Operating System
-
4.1 CPU Scheduling 1
01:10:58 -
4.2 CPU Scheduling 2
01:36:05 -
4.2 CPU Scheduling 3
01:36:05
Chapter 5: Computer Networks
-
5.1 ARP-1
25:59 -
5.2 ARP – 2
09:52 -
5.3 DHCP – 1
24:23 -
5.4 DHCP – 2
20:15 -
5.5 ICMP – 1
25:42 -
5.6 ICMP – 2
26:36 -
5.7 ICMP – 3
02:15 -
5.8 Packet Switching
31:18 -
5.9 Switching Circuit
20:25 -
5.10 Timer Management in TCP-1
15:11 -
5.11 Timer Management in TCP-2
16:31 -
5.12 Basic and Jacobson Algorithm for TOT
27:23
Chapter 6: Aptitude
-
6.1 Spatial Aptitude
56:41
Chapter 7: Latest Computer Organization and Architecture
-
7.1 COA – 1
01:17:50 -
7.2 COA – 2
01:11:40 -
7.3 COA – 3
01:00:20 -
7.4 COA – 4
51:26 -
7.5 COA – 5
01:16:06 -
7.6 COA – 6
57:19 -
7.7 COA – 7
01:14:51 -
7.8 COA – 8
54:33 -
7.9 COA – 9
01:09:08 -
7.10 COA – 10
01:07:17 -
7.11 COA – 11
01:18:56 -
7.12 COA – 12
01:13:18 -
7.13 COA – 13
44:27 -
7.14 COA – 14
01:00:06 -
7.15 COA – 15
01:01:52 -
7.16 COA – 16
10:44 -
7.17 COA – 17
01:25:46 -
7.18 COA – 18
01:06:46 -
7.19 COA – 19
01:20:16 -
7.20 COA – 20
01:22:54 -
7.21 COA – 21
01:31:49 -
7.22 COA – 22
01:20:41 -
7.23 COA – 23
01:23:08
E-Book – GATE – NEW ADDED SYLLABUS
-
E-Book
Practice Set – GATE – NEW ADDED SYLLABUS
-
Practice Set 1
-
Practice Set 2
Chapter – 8 Data Structure and Algorithm (NEW)
Chapter 1: Data Structure and Algorithm (Latest)
-
L-1 DSA
01:27:16 -
L-2 DSA
01:41:11 -
L-3 DSA
01:05:19 -
L-4 DSA
01:47:40 -
L-5
01:41:28 -
L-6
01:24:23 -
L-7
01:11:17 -
L-8
01:27:02 -
L-9
01:08:12 -
L-10
01:22:58 -
L-11
01:51:54 -
L-12
01:04:12 -
L-13
02:06:29 -
L-14
01:04:45 -
L-15
01:34:39 -
L-16
01:12:17 -
L-17
01:16:49 -
L-18
01:01:18 -
L-19
02:01:31 -
L-20
01:07:54 -
L-21
35:18 -
L-22
34:31 -
L-23
01:17:07 -
L-24
01:28:57 -
L-25
01:28:35 -
L-26
02:13:41 -
L-27
01:23:04 -
L-28
01:19:18 -
L-29
55:53
E-Book – Data Structure and Algorithm (NEW)
-
E-Book
Practice Set – Data Structure and Algorithm (NEW)
-
Practice Set 1
-
Practice Set 2
Quiz
-
Computer Science Engineering
Student Ratings & Reviews
No Review Yet
