Batch CS-6b GATE 2021

CS6b-GATE 2021 Course is for GATE 2021 aspirants. This course will  includes complete Video lectures of all subjects of Computer science according to GATE syllabus, practice quizzes, Assignments. This is scheduled course i.e. lectures added according to course scheduled. This will helps students to study in proper manner and sequence, which will lead them to understand whole syllabus along with practice questions. It is suggested please maintain proper notes so that you can revise them time to time.

For better preparation it suggested that

  1. Make proper notes during the lectures.
  2. Solved the numerical problems by pausing the video lecture.
  3. Check your answer and results as faculty solving the problem and if you got wrong answer somehow please watch the solution carefully so you can learn the implementation of concept.
  4. Before going to next lecture please revise the notes.
  5. Don’t hesitate to ask doubt because asking doubts will lead you towards better learning.

Best of luck.

                            Team Engenius

Theory Of Computation

1
TOC Lec. 1.1 Introduction Of TOC
01:10:20
2
TOC Lec. 1.2 Alphabet And Strings
44:18
3
TOC Lec. 1.3 Prefix,Suffix,Power Of Alphabet
42:44
4
TOC Lec. 1.4 Language And Set
52:39
5
TOC Lec.1.5 Regular Language And NFA
01:05:05
6
TOC Lec.1.6 Conversion Of NFA to DFA And Minimization
01:01:58
7
TOC Lec.1.7 Theory Of DFA
44:31
8
TOC Lec. 1.8 Minimal DFA Solved Problems
55:54
9
TOC Lec.1.9 Minimal DFA Solved Problems
01:00:50
10
TOC Lec.1.10 Minimal DFA Solved Problems
01:01:30
11
TOC Lec.1.11 Minimal DFA Solved Problems
53:19
12
TOC Lec.1.12 Epsilon NFA
47:24
13
TOC Lec. 1.13 Conversion Of Epsilon NFA To NFA, Epsilon NFA To DFA
01:05:50
14
TOC Lec.1.14 Minimal DFA Solved Problems
45:52
15
TOC Lec. 1.15 Compound Finite Automata
52:58
16
TOC Lec.1.16 Compound Finite Automata
49:36
17
TOC Lec 1.17 Decision Properties Of Finite Automata
50:01
18
TOC Lec.1.18 Minimization Of DFA
1:06:17
19
TOC Lec.1.19 Designated Initial State DFA’s
39:45
20
TOC Lec.1.20 Moore And Mealy Machine
1:28:24
21
TOC Lec. 2.1 Basic Of Regular Expression
59:03
22
TOC Lec. 2.2 Regular Expression Solved Problems
42:24
23
TOC Lec. 2.3 Equivalence Of FA And Regular Expressions
37:34
24
TOC Lec. 2.4 Transition Graph & State Elimination Method
57:26
25
TOC Lec. 2.5 Equivalence Of Regular Expressions & Finite Automata
58:37
26
TOC Lec.2.6 Algebraic Properties of ‘RE’ & Closure Property of ‘RL’ Part-1
1:05:50
27
TOC Lec. 2.7 Closure Property Of ‘RL’ Part-2
59:18
28
TOC Lec.2.8 Closure Property Of ‘RL’ Part-3
58:57
29
TOC Lec. 2.9 Pumping Lemma
33:48
30
TOC Lec.3.1 Grammar Introduction
47:15
31
TOC Lec.3.2 Grammar Costruction Solved Problems
49:39
32
TOC Lec.3.3 Chomsky Hierarchy & Regular Grammar
1:04:20
33
TOC Lec.4.1 Introduction & Simplifaction Of CFG
45:08
34
TOC Lec. 4.2 CNF & GNF
1:23:56
35
TOC Lec. 4.3 Decision Properties of CFL
40:54
36
TOC Lec. 4.4 Pushdown Automata (PDA)
34:15
37
TOC Lec. 4.5 PDA Construction Solved Problems
1:28:07
38
TOC Lec.4.6 Closure Properties of DCFL and CFL
1:16:54
39
TOC Lec.4.7 Conversion of CFG to PDA and PDA to CFG and Pumping Lemma of CFL
47:55
40
TOC Lec. 5.1 Introduction of Turing Machine
32:55
41
TOC Lec. 5.2 Construction of Turing Machine
45:23
42
TOC Lec. 5.3 Closure Property of Recursive And RE Set And CSL
41:16
43
TOC Lec. 5.4 Universal TM and Reducibility and PCP and RICE Theorem
49:25
44
TOC Lec. 6.1 Summary of Chomsky Hierarchy and Closure Properties and Decidability
26:21
45
TOC Lec. 6.2 Detection of Regular and CFL
43:26

Computer System Organization

1
CSO Lec.1.1 Introduction and Computer Components
39:34
2
CSO Lec.1.2 Basic instruction cycle and Program execution
35:53
3
CSO Lec.1.3 Bus Structure & Register Transfer Language
1:04:41
4
CSO Lec1.4 Assembly Level Language
40:09
5
CSO. Lec.1.5 Interrupt
48:12
6
CSO Lec.1.6 Assembly Language GATE Solved Problems
1:19:41
7
CSO Lec.1.7 Addressing Mode
38:46
8
CSO Lec.1.8 Addressing Mode Theory
43:36
9
CSO Lec.1.9 Addressing Mode Solved Problems
1:07:45
10
CSO Lec1.10 Instruction Format
45:29
11
CSO Lec1.11 Expanding Opcodes
40:15
12
COA Lec1.12 Instruction Set Architecture , CISC, RISC
58:21
13
COA Lec.1.13 Instruction Format Solved Example
53:44
14
COA Lec.1.14 Instruction Format And Addressing Mode Gate Solved Problems
50:28
15
COA Lec.1.15 ALU and Data Path
39:34
16
COA Lec.2.1 Memory Hierarchy Part-1
56:50
17
COA Lec.2.2Memory Hierarchy Part-2
34:34
18
COA Lec. 2.3Memory Hierarchy Solved Problems
43:35
19
COA Lec.2.4 Cache Memory Working Principle
25:05
20
COA Lec.2.5 Cache Memory Mapping
1:28:52

Discrete Mathematics

1
DM Lec.1.1 Introduction & Graph Terminology
47:10
2
DM Lec.1.2 Types of Graph
48:19
3
DM Lec.1.3 Sum of Degrees of Vertices Theorem
59:04
4
DM Lec.1.4 Isomorphic Graph
1:08:24
5
DM Lec.1.5 Planar Graph
50:03
6
DM Lec.1.6 Graph Coloring
36:50
7
DM Lec.1.7 Graph Measurement & Traversability
1:04:37
8
DM Lec.1.8 Matching
1:24:46
9
DM. Lec.1.9 Line Covering (Edge Covering)
40:53
10
DM Lec.1.10 Vertex Covering
51:19
11
DM Lec.1.11 Spanning Tree
35:09
12
DM Lec.1.12 Connectivity
55:52
13
Graph Theory Questions

Operating System

Programming In C

Data structure

Analysis and Design of Algorithms

Compiler Design

Computer Network

Data Base Management System

Digital Logic

Mathematics

Genral Aptitude

1
APT Lec. 1 Introduction
29:02
2
Apt Lec 2.1 Speed, Time and Distance
01:16:26
3
Apt Lec. 2.2 Speed,Time And Distance
44:16
4
Apt Lec. 2.3 Speed, Time And Distance
01:13:28

Be the first to add a review.

Please, login to leave a review
Add to Wishlist
Enrolled: 7 students
Lectures: 82