Course Content
Module – Quantitative Aptitude
Chapter 1: Numbers System
0/13
1.1 Types of numbers
36:16
1.2 Divisibility rules
21:33
1.3 Cyclicity or fundamental to find the last digit
16:15
1.4 Concept of HCF/LCM and its application
22:36
1.5 Remainders
12:51
1.6 Highest power and trailing zeros
22:33
1.7 Factors
23:54
1.8 Number System Exam Questions
18:26
1.9 Cyclicity – Last Digit (Unit Place)
42:53
1.10 Cyclicity – Last 2 Digits
36:42
1.11 Remainder Theorem
01:10:10
1.12 Base System
35:05
1.13 Right Most Non-Zero Digit
15:24
Chapter 2: Percentages and Application
0/7
2.1 Introduction to Percentage
15:06
2.2 Change of base
16:01
2.3 Profit, loss, and discount concept
33:59
2.4 Simple Interest and Compound Interest
16:08
2.5 Faulty Weights
03:10
2.6 Successive Percentage Change
05:25
2.7 Percentage Exam Questions
20:08
Chapter 3: Ratio, Proportion, and Mixtures
0/5
3.1 Introduction to Ratio
17:53
3.2 Introduction to Proportion
08:36
3.3 Partnership
23:10
3.4 Alligation & Mixture
13:12
3.5 Ratio & Proportion Exam Questions
13:12
Chapter 4: Time, Speed, and Distance
0/6
4.1 Relation between Time, Speed & Distance
07:41
4.2 Average Speed
10:54
4.3 Relative Speed
21:48
4.4 Boats & Stream
10:43
4.5 Races
11:02
4.6 Time, Speed & Distance Exam Questions
31:07
Chapter 5: Time and Work
0/3
5.1 Introduction to Time & Work
02:37
5.2 Different types of questions of Time & Work
33:49
5.3 Time & Work Exam Questions
33:49
Chapter 6: Geometry
0/9
6.1 Angles
16:53
6.2 Triangles & Properties
19:00
6.3 Quadrilateral
05:15
6.4 Circle
11:29
6.5 Polygon
07:18
6.6 Trigonometry
17:46
6.7 Geometry & Mensuration (Higher Concept)
52:04
6.8 Mensuration
37:10
6.9 Geometry Exam Questions
01:01:36
Chapter 7: Permutation and Combination
0/7
7.1 Arrangement based on Alphabets
12:02
7.2 Arrangement based on Numbers
11:58
7.3 Rank in Dictionary
06:44
7.4 Combination
11:57
7.5 Application of Combination
32:39
7.6 Permutation
08:24
7.7 Permutation & Combination Exam Questions
25:59
Chapter 8: Probability
0/3
8.1 Introduction to Probability
07:13
8.2 Types of Questions of Probability
46:33
8.3 Probability Exam Questions
27:57
Chapter 9: Algebra
0/8
9.1 Linear Equation
17:57
9.2 Quadratic Equation
19:03
9.3 Introduction to Progression
37:51
9.4 Logarithm
46:35
9.5 Logarithm Practice
49:03
9.6 Modulus
54:15
9.7 Inequality
23:39
9.8 Algebra Exam Questions
28:53
Chapter 10: Set Theory
0/1
10.1 Set Theory
11:28
Chapter 11: Previous Year Aptitude GATE Questions
0/17
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
0/1
12.1 Spatial Aptitude
56:41
E-Book – Quantitative Aptitude
0/1
E-Book
Practice Set – Quantitative Aptitude
0/2
Practice Set 1
Practice Set 2
Mock Test – Quantative Aptitude
0/2
Mock Test 1
Mock Test 2
Engineering Mathematics
Chapter 1: Limit
0/3
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
0/2
2.1 Introduction to Continuity
01:11:59
2.2 Types of Continuity
26:25
Chapter 3: Differentiability
0/2
3.1 Differentiability PART – I
34:47
3.2 Differentiability PART – II
16:40
Chapter 4: Properties of Function
0/1
4.1 Properties of Functions
30:27
Chapter 5: Maxima & Minima
0/6
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
0/2
6.1 Introduction to Mean-Value Theorem
28:00
6.2 Mean-Value Theorem GATE Questions
17:26
Chapter 7: Integration
0/2
7.1 Integration
01:22:14
7.2 Integration – Arc, Area , Length and Volume
01:19:26
Chapter 8: Linear Algebra
0/8
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
0/2
9.1 Probability Distribution
01:58:46
9.2 Poisson’s Distribution
01:04:32
Chapter 10: Statistics
0/2
10.1 Statistics
02:26:57
10.2 Statistics Gate Questions (MATHs)
05:46
Chapter 11: Differential Equation
0/5
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
0/4
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
0/6
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
0/6
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
0/2
15.1 Laplace Transform
06:52
Laplace Transform Gate Questions
06:52
E-Book – Engineering Mathematics
0/1
E-Book
Practice Set – Engineering Mathematics
0/2
Practice Set 1
Practice Set 2
Mock Test – Engineering Mathematics
0/2
Mock Test 1
Mock Test 2
Discrete Mathematics and Graph Theory
Chapter 1: Set Theory
0/11
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
0/8
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
0/4
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
0/2
4.1 Proposition Basic Concepts
52:59
4.2 GATE Questions & First Order Logic
01:10:35
Chapter 5: Boolean Algebra
0/1
5.1 Boolean Logic Laws and Basic Concepts & GATE Questions
29:06
Chapter 6: Combinatorics
0/3
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
0/1
E-Book
Practice Set – Discrete Mathematics and Graph Theory
0/2
Practice Set 1
Practice Set 2
Mock Test – Discrete Mathematics and Graph Theory
0/2
Mock Test 1
Mock Test 2
Logical Reasoning
Chapter 1: Series
0/1
1.1 Series
25:12
Chapter 2: Coding and Decoding
0/1
2.1 Coding and Decoding
13:29
Chapter 3: Analytical Reasoning (AR) or Data Arrangement
0/1
3.1 Data Arrangement
39:34
Chapter 4: Blood Relations
0/1
4.1 Blood Relations
11:59
Chapter 5: Clocks and Calendars
0/2
5.1 Clock
20:30
5.2 Calendars
23:53
Chapter 6: Data Interpretation
0/1
6.1 Data Interpretation
26:04
Chapter 7: Directions
0/1
7.1 Directions
11:09
Chapter 8: Syllogism
0/1
8.1 Syllogism
16:33
E-Book – Logical Reasoning
0/1
E-Book
Practice Set – Logical Reasoning
0/2
Practice Set 1
Practice Set 2
Mock Test – Logical Reasoning
0/2
Mock Test 1
Mock Test 2
Verbal Ability
Chapter 1: Noun
0/1
1.1 Noun
01:08:39
Chapter 2: Pronoun
0/1
2.1 Pronoun
01:44:52
Chapter 3: Subject and Verb Agreement
0/1
3.1 Subject and Verb Agreement
01:17:39
Chapter 4: Tenses
0/1
4.1 Tenses
55:33
Chapter 5: Modifiers
0/2
5.1 Modifiers Part 1
43:32
5.2 Modifiers Part 2
01:05:44
Chapter 6: Vocabulary Building
0/2
6.1 Vocabulary PART – I
56:20
6.2 Vocabulary PART – II
32:05
Chapter 7: Verbal Logic
0/4
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)
0/4
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
0/1
9.1 Articles & Prepositions
01:20:05
E-Book – Verbal Ability
0/1
E-Book
Practice Set – Verbal Ability
0/2
Practice Set 1
Practice Set 2
Mock Test – Verbal Ability
0/2
Mock Test 1
Mock Test 2
Computer networks
Chapter 1: ISO OSI Physical Layer, LAN Technologies
0/3
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
0/8
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
0/8
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
0/1
4.1 Transport Layer
01:22:02
Chapter 5: Application Layer and Network Security
0/1
5.1 Application Layer and Network Security (Full)
01:13:52
Chapter 6: Computer Network
0/12
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
0/1
E-Book
Practice Set – Computer Networks
0/2
Practice Set 1
Practice Set 2
Mock Test – Computer Networks
0/2
Mock Test 1
Mock Test 2
Computer Organization and Architecture
Chapter 1: Introduction
0/1
1. Introduction
49:08
Chapter 2: Instruction Format
0/7
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
0/4
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
0/3
4.1 Mapping Techniques
49:14
4.2 Updating Techniques
18:12
4.3 GATE Questions
08:56
Chapter 5: Input and Output Unit
0/1
5. Input & Output Organization
36:42
E-Book – Computer Organization and Architecture
0/1
E-Book
Practice Set – Computer Organization and Architecture
0/2
Practice Set 1
Practice Set 2
Mock Test – Computer Organization and Architecture
0/2
Mock Test 1
Mock Test 2
Database Management System
Chapter 1: Normalization
0/3
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
0/1
2.1 ER Model – Full
01:11:09
Chapter 3: Transaction Management & Concurrency Control
0/3
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
0/1
4.1 File Structures & Indexing – Full
02:19:02
Chapter 5: Structured Query Language
0/2
5.1 SQL Part 1
51:13
5.2 SQL Part 2
30:54
E-Book – Database Management System
0/1
E-Book
Practice Set – Database Management System
0/2
Practice Set 1
Practice Set 2
Mock Test – Database Management System
0/2
Mock Test 1
Mock Test 2
Digital Logic
Chapter 1: Number Systems
0/4
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
0/5
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
0/4
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
0/4
4.1 Introduction
44:55
4.2 Characteristics of Digital ICs
40:25
4.3 Transistor-Transistor Logic
27:00
4.4 Emitter-Coupled Logic and CMOS Logic, Gate Questions
01:09:57
Chapter 5: Sequential Circuits
0/7
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
0/3
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
0/1
7.1 Semiconductor Memories
38:34
Chapter 8: Microprocessor
0/1
8.1 Microprocessor 8085
37:38
E-Book – Digital Logic
0/1
E-Book
Practice Set – Digital Logic
0/2
Practice Set 1
Practice Set 2
Mock Test – Digital Logic
0/2
Mock Test 1
Mock Test 2
Operating System
Chapter 1: Introduction of OS
0/1
1.1 Introduction, Goals of OS, Types of OS
35:38
Chapter 2: Process Management
0/12
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
0/9
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
0/2
4.1 File Device Management PART-I – OS
38:42
4.2 File Device Management PART-II- OS
57:24
E-Book – Operating System
0/1
E-Book
Practice Set – Operating System
0/2
Practice Set 1
Practice Set 2
Mock Test – Operating System
0/2
Mock Test 1
Mock Test 2
Algorithms
Chapter 1: Basics – Asymptotic Notation
0/3
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
0/5
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
0/3
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
0/5
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
0/1
5.1 Dynamic Programming
59:48
E-Book – Algorithms
0/1
E-Book
Practice Set – Algorithms
0/2
Practice Set 1
Practice Set 2
Mock Test – Algorithms
0/2
Mock Test 1
Mock Test 2
Programming and Data Structures
Chapter 1: Introduction & Scoping (PROGRAMMING)
0/2
1.1 Introduction & Scoping
18:07
1.2 GATE Questions on Scoping
10:40
Chapter 2: Pointer (PROGRAMMING)
0/2
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)
0/2
3.1 Local & Global Variables / Parameter Parsing Techniques
36:39
3.2 GATE Questions on Static Variables
26:02
Chapter 4: C Programming (PROGRAMMING)
0/1
4.1 C Programming
01:31:38
Chapter 5: Programming Languages (PROGRAMMING)
0/4
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)
0/6
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)
0/1
7.1 Hashing
57:35
Chapter 8: Stack (DS)
0/3
8.1 Stack
49:16
8.2 Recursion
43:17
8.3 Expression Evaluation
01:06:40
Chapter 9: Array (DS)
0/3
9.1 Array
52:28
9.2 String
40:47
9.3 Terminologies & Concepts
38:54
Chapter 10: Graph (DS)
0/1
10.1 Graph
01:18:55
Chapter 11: Structure, Union & Linked List (DS)
0/2
11.1 Structure & Union
39:20
11.2 Linked List
01:20:49
E-Book – Programming and Data Structures
0/1
E-Book
Practice Set – Programming and Data Structures
0/2
Practice Set 1
Practice Set 2
Mock Test – Programming and Data Structure
0/2
Mock Test 1
Mock Test 2
Data Structure and Algorithm (NEW)
Chapter 1: Data Structure and Algorithm (Latest)
0/29
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)
0/1
E-Book
Practice Set – Data Structure and Algorithm (NEW)
0/2
Practice Set 1
Practice Set 2
Theory of Computation
Chapter 1: Regular Language
0/13
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
0/5
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
0/6
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
0/6
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
0/1
5.1 Decidability & Countability
39:01
E-Book – Theory of Computation
0/1
E-Book
Practice Set – Theory of Computation
0/2
Practice Set 1
Practice Set 2
Mock Test – Theory of Computation
0/2
Mock Test 1
Mock Test 2
Compiler Design
Chapter 1: Introduction of Compiler and Lexical Analysis (Compiler)
0/3
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
0/9
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)
0/5
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)
0/5
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)
0/2
5.1 Runtime Environment
20:36
5.2 Scope Resolution Technique
07:57
Chapter 6: Local Optimization & Data Flow Analysis
0/2
6.1 Local Optimization & Data Flow Analysis
01:48:59
6.2 Constant Propagation
01:50:25
E-Book – Compiler Design
0/1
E-Book
Practice Set – Compiler Design
0/2
Practice Set 1
Practice Set 2
Mock Test – Compiler Design
0/2
Mock Test 1
Mock Test 2
Practice and Doubt Session
Chapter 1: Quantitative Aptitude
0/2
1.1 Quantitative Aptitude
01:34:35
1.2 Quantitative Aptitude
01:23:11
Chapter 2: Engineering Mathematics
0/4
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
0/1
3.1 Programming and Data Structures
01:08:54
Chapter 4: Operating System
0/1
4.1 Operating System
01:15:11
Chapter 5: Theory of Computation
0/1
5.1 Theory of Computation
02:25:49
Chapter 6: Digital Electronics
0/2
6.1 Digital Electronics
43:49
6.2 Digital Electronics
59:31
Chapter 7: COA
0/1
7.1 COA
01:33:43
Chapter 8: Compiler Design
0/1
8.1 Compiler Design
01:11:09
Chapter 9: Discrete Maths (PS)
0/1
9.1 Discrete Maths (PS)
01:10:16
Practice Set – Practice and Doubt Session
0/2
Practice Set 1
Practice Set 2
Revision for GATE with Most Important Topics
Chapter 1: Concept of Gateflix Revision
0/1
1.1 – Concept of Gateflix Revision
01:18
Chapter 2: Programming & Data Structure
0/16
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
0/9
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
0/15
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
0/17
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
0/17
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
0/12
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
0/8
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
0/19
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
0/11
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
0/1
E-Book
Practice Set – Revision for GATE with Most Important Topics
0/2
Practice Set 1
Practice Set 2
GATE – NEW ADDED SYLLABUS
Chapter 1: Discrete Mathematics
0/2
1.1 Basic Of Algebric Theory
43:01
1.2 GATE Questions DGMT
54:08
Chapter 2: Computer Organisation and Architecture
0/1
2.1 Dependency in The Pipe Line
02:11:18
Chapter 3: Compiler Design
0/2
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
0/3
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
0/12
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
0/1
6.1 Spatial Aptitude
56:41
Chapter 7: Latest Computer Organization and Architecture
0/23
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
0/1
E-Book
Practice Set – GATE – NEW ADDED SYLLABUS
0/2
Practice Set 1
Practice Set 2
Quiz
0/1
Computer Science Quiz
03:03:00
GATE Computer Science Engineering
Join the conversation
S. Priyanka 2 weeks ago
What happened to two when calculating 50/3 sir added one remainder last
Reply
S. Priyanka 2 weeks ago
Yes
Reply
S. Priyanka 2 weeks ago
1023/5=20 20/5=4 3=3 20+4+3=27
Reply
S. Priyanka 2 weeks ago
200/5=40 Why we take 20/4
Reply
S. Priyanka 2 weeks ago
Finding trailing zeroes also hard
Reply
S. Priyanka 2 weeks ago
100 factorial computation
Reply
Previous
Next
0% Complete

This will close in 0 seconds

Error: Contact form not found.

This will close in 0 seconds

    Book an Expert Call

    This will close in 0 seconds

      Book an Expert Call

      This will close in 0 seconds

        Book an Expert Call

        This will close in 0 seconds