1.4 Concept of HCF/LCM and its application

11.9 Aptitude GATE Questions 2015 CS

12:15

11.10 Aptitude GATE Questions 2015 ME

15:10

11.11 Aptitude GATE Questions 2015 EC + IN

07:30

Chapter 12: Spatial Aptitude

0/1

12.1 Spatial Aptitude

56:41

E-Book – Quantitative Aptitude

0/1

Practice Set – Quantitative Aptitude

0/2

1.1 Introduction to Limit

Engineering Mathematics

Chapter 1: Limit

0/13

21:39

1.2 Indeterminate Forms

01:09:01

1.3 Methods to Solve Limit

1.4 Factoring Method

1.5 Rationalisation Method

1.8 Failure of L-Hospital Rule

1.9 Approximation Method

1.10 Limit involving Modulus Function

1.11 Limit involving Riemann Integration

1.12 Limit involving Greatest Integer Function

1.13 Various Exams and Practice Questions

2.1 Introduction to Continuity

Chapter 2: Continuity

0/7

01:11:59

2.2 Types of Continuity

26:25

2.3 Types of Discontinuity

2.4 Continuity in an Interval [a,b]

2.5 Continuity of P(X)/Q(X)

2.6 Continuity of Modulus Function

2.7 Various Exam Questions and Practice Questions

3.1 Introduction to Differentiability

Chapter 3: Differentiability

0/3

34:47

3.2 Differentiability of Modulus Function

16:40

3.3 Various Exam Questions

4.2 Increasing and Decreasing Function

Chapter 4: Properties of Function

0/4

4.1 Monotone Function

30:27

4.3 Concave Upward and Downward

4.4 Point of Inflection

5.1 Local Maxima & Local Minima

Chapter 5: Maxima & Minima

0/3

23:52

5.2 Absolute Maximum and Absolute Minimum

12:58

5.3 Maximum & Minimum Value in a Given Interval

29:47

Chapter 6: Mean Value Theorem

0/7

6.1 Intermediate MVT

28:00

6.2 Integral Form of Intermediate MVT

6.5 Integral Form of Lagrange’s MVT

6.6 Cauchy’s MVT

6.7 Various Exam Questions

8.1 Linear Transformation

Chapter 7: Integration

0/2

Chapter 8: Linear Algebra

0/9

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 Properties of Special Matrices

42:25

8.9 GATE Questions

9.1 Discrete Probability Distribution

Chapter 9: Probability Distribution

0/12

01:58:46

9.2 Binomial Distribution

01:04:32

9.3 Poisson Distribution

9.4 Continuous Probability Distribution

9.5 Uniform Distribution

9.6 Exponential Distribution

9.7 Normal Distribution

9.8 Mean, Median, and Mode

9.9 Expectation, Second Moment, and Variance

9.10 Cumulative Distribution

9.11 Joint Probability Distribution

9.12 GATE Questions

11.1 Introduction to Differential Equations

Chapter 10: Statistics

0/1

10.1 Statistics

02:26:57

Chapter 11: Differential Equation

0/15

01:53:39

11.2 Order and Degree

01:01:04

11.3 Ordinary and Partial Differential Equations

17:02

11.4 Linear and Nonlinear Differential Equations

01:13:03

11.5 Homogeneous and Nonhomogeneous Equations

11.6 Methods for First Order First Degree

11.7 Variable Separable Method

11.8 Leibnitz Differential Equations

11.9 Bernoulli’s Differential Equations

11.10 Homogeneous Function Differential Equations

11.11 Equations with dy/dx = f(ax + by + c)

11.12 Higher Order with Constant Coefficients

11.13 Higher Order with Variable Coefficients

11.14 Partial Differential Equations

12.1 Numerical Integration

11.15 GATE Questions

47:36

Chapter 12: Numerical Methods

0/3

01:47:40

12.2 Numerical Differentiation

01:11:01

12.3 Roots of Equations

02:15:45

Chapter 13: Complex Analysis

0/9

13.1 Introduction to Complex Numbers

01:11:27

13.2 Limit, Continuity, and Differentiability

01:20:05

13.3 Analytic Functions

53:37

13.4 Entire Functions

01:13:24

13.5 Complex Differentiation

30:09

13.6 Zeros & Singularity

22:07

13.7 Residues at Poles

13.8 Complex Integration (Open & Closed Path)

13.9 GATE Questions

Chapter 14: Vector Analysis

0/1

14.1 Vector Analysis

38:23

Chapter 15: Laplace Transform

0/1

15.1 Laplace Transform

02:23:11

E-Book – Engineering Mathematics

0/1

Practice Set – Engineering Mathematics

0/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

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

Practice Set – Logical Reasoning

0/2

3.1 Subject and Verb Agreement

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

01:17:39

Chapter 4: Tenses

0/1

4.1 Tenses

55:33

Chapter 5: Modifiers

0/2

Chapter 6: Vocabulary Building

0/2

6.1 Vocabulary I – Root Words

56:20

6.2 Vocabulary I (VA)

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)

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

Practice Set – Verbal Ability

0/2

1.1 Introduction of Algorithm

Algorithms

Chapter 1: Basics – Asymptotic Notation

0/3

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

Practice Set – Algorithms

0/2

1.1 Introduction of Compiler

Compiler Design

Chapter 1: Introduction of Compiler and Lexical Analysis (Compiler)

0/3

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)

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/4

6.1 Local Optimization & Data Flow Analysis

01:48:59

6.2 Constant Propagation

01:50:25

6.3 Liveness Analysis

6.4 Common Subexpression Elimination

E-Book – Compiler Design

0/1

Practice Set – Compiler Design

0/2

1.1 Introduction Connecting Devices, Layering Principle (CN)

Computer networks

Chapter 1: ISO OSI Physical Layer, LAN Technologies

0/3

01:09:03

1.2 Introduction Connecting Devices, Layering Principle (CN)

01:43:53

1.3 GATE Questions

2.1 Physical Layer and Data Link Layer (CN)

Chapter 2: Datalink Layer and SWP

0/8

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

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.10 Computer Network

20:25

6.11 Computer Network

15:11

6.12 Computer Network

16:31

E-Book – Computer Networks

0/1

Practice Set – Computer Networks

0/2

2.2 Classification of Instruction Format

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.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.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

E-Book – Computer Organization and Architecture

0/1

Practice Set – Computer Organization and Architecture

0/2

3.1 Transaction Management & Concurrency Control Part 1

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

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

E-Book – Database Management System

0/1

Practice Set – Database Management System

0/2

2.3 SOP & POS Expressions

Digital Logic

Chapter 1: Number Systems

0/4

Chapter 2: Boolean Algebra & Logic Gates

0/5

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

26:60

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

Practice Set – Digital Logic

0/2

1.4 Basics of Set GATE Questions

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

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

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

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

6.1 Basics of Combinatorics

Chapter 6: Combinatorics

0/3

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

Practice Set – Discrete Mathematics and Graph Theory

0/2

1.1 Introduction, Goals of OS, Types of OS

Operating System

Chapter 1: Introduction of OS

0/1

35:38

Chapter 2: Process Management

0/6

2.4 Concurrent Programming

Chapter 3: Memory Management

0/5

3.1 Introduction of RAM Chip

41:50

3.2 Loading, Linking & Address Binding

14:03

3.3 Memory Management Techniques

35:19

4.1 File & Device Management – 1

38:42

3.4 Virtual Memory

4.2 File & Device Management – 2

Chapter 4: File & Device Allocation

0/1

57:24

E-Book – Operating System

0/1

Practice Set – Operating System

0/2

1.1 Introduction & Scoping

Programming and Data Structures

Chapter 1: Introduction & Scoping (PROGRAMMING)

0/2

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

6.6 GATE Questions-II

8.3 Expression Evaluation

Chapter 7: Hashing (DS)

0/1

7.1 Hashing

57:35

Chapter 8: Stack (DS)

0/3

01:06:40

Chapter 9: Array (DS)

0/3

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

Practice Set – Programming and Data Structures

0/2

1.2 Chomsky Classification of Grammar

Theory of Computation

Chapter 1: Regular Language

0/13

1.1 Introduction of TOC

30:00

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

1.11 Properties of Regular Language

1.10 GATE Questions

22:19

01:18:33

1.12 GATE Questions

2.2 Simplification of CFG

1.13 Mealy Moore Machine

36:01

Chapter 2: Context Free Grammar

0/5

2.1 Context Free Grammar

59:03

Chapter 3: CFL & PDA

0/6

3.5 Closure Properties of CFL

39:01

3.6 GATE Questions

4.1 Unrestricted Grammar (Type-0)

Chapter 4: Turing Machine

0/6

4.3 Turing Machine as a Transducer

4.2 Turing Machine

39:06

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

29:14

E-Book – Theory of Computation

0/1

Practice Set – Theory of Computation

0/2

1.1 Quantitative Aptitude

Practice and Doubt Session

Chapter 1: Quantitative Aptitude

0/2

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

E-Book – Practice and Doubt Session

0/1

Practice Set – Practice and Doubt Session

0/2

1.1 – Concept of Gateflix Revision

Revision for GATE with Most Important Topics

Chapter 1: Concept of Gateflix Revision

0/1

2.1 – Introduction & Scoping

Chapter 2: Programming & Data Structure

0/16

2.2 – Pointers

2.3 – Static Variable & Parameter Parsing Techniques

2.4 – C Programming

2.5 – Programming Language

2.6 – Binary Tree

2.13 – Expression Evaluation

2.7 – Binary Search Tree

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

4.2 – CPU Scheduling 2

4.3 – Synchronization 1

4.4 – Synchronization 2

4.5 – Synchronization 3

4.9 – Contiguous Memory Management Techniques

4.6 – Synchronization 4

4.10 – Paging

4.11 – Inverted Paging & Segmentation

4.12 – Virtual Memory

4.13 – File & Device Management

4.14 – Process Concepts

4.15 – Process Scheduling

Chapter 5: Set Theory

0/9

5.1 – Basic Of Set

5.2 – Basic Of Set Part 2

5.3 – Basic Of Set Part 3

5.4 – Set Relation

5.5 – Relation Poset and Lattice Part 1

5.6 – Relation Poset and Lattice Part 2

5.7 – Posets Hasse Diagram and Lattices Part 3

5.8 – Functions Part 1

5.9 – Functions Part 2

Chapter 6: Graph Theory

0/5

6.1 – Basics of Graph

6.2 – Types of Graph Part 1

6.3 – Types of Graph Part 2

6.4 – Types of Graph Part 3

6.5 – Advanced Graph

7.1 – Introduction Connecting Devices, Layering Principle

Chapter 7: Computer Networks Important Topics

0/6

7.2 – Physical Layer and Data Link Layer Part 1

7.3 – Physical Layer and Data Link Layer Part 2

7.4 – Network Layer Part 1

7.5 – Network Layer Part 2

7.6 – Transport Layer

8.1 – Introduction of Compiler

Chapter 8: Compiler Design

0/12

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

9.2 – Normalization Part 2

9.3 – Normalization Part 3

9.4 – Transaction Management & Concurrency Control 1

9.5 – Transaction Management & Concurrency Control 2

9.6 – Transaction Management & Concurrency Control 3

9.7 – Structured Query Language Part 1

9.8 – Structured Query Language Part 2

10.1 – Introduction of TOC

Chapter 10: Theory of Computation

0/19

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

10.7 – Properties of Regular Language

01:18:33

10.8 – Context Free Grammar

59:03

10.9 – Simplification of CFG

10.14 – Closure Properties of CFL

39:01

10.15 – Unrestricted Grammar (Type-0)

10.17 – Turing Machine as a Transducer

10.16 – Turing Machine

39:06

16:30

10.18 – RL, REL & Closure Property

10.19 – Decidability & Countability

11.3 – Classification of Instruction Format

Chapter 11: Computer Organization and Architecture

0/11

11.1 – Introduction

49:08

11.2 – Instruction Cycle

32:57

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

Practice Set – Revision for GATE with Most Important Topics

0/2

1.1 Concept of Gateflix Revision

GATE – NEW ADDED SYLLABUS

Chapter 1: Concept of Gateflix Revision

0/1

2.1 Introduction & Scoping

Chapter 2: Programming & Data Structure

0/16

2.2 Pointers

2.3 Static Variable & Parameter Parsing Techniques

2.4 C Programming

2.5 Programming Language

2.6 Binary Tree

2.13 Expression Evaluation

2.7 Binary Search Tree

Chapter 3: Digital Logic For CS

0/9

3.1 Number System Introduction

3.2 Number System Complement

3.7 Logic Circuit 3 (K-map)

3.8 Combinational Circuit

3.9 Sequential Circuit

Chapter 4: Operating System

0/15

4.3 Synchronization 1

4.4 Synchronization 2

4.5 Synchronization 3

4.9 Contiguous Memory Management Techniques

4.6 Synchronization 4

4.10 Paging

4.11 Inverted Paging & Segmentation

4.12 Virtual Memory

4.13 File & Device Management

4.14 Process Concepts

4.15 Process Scheduling

Chapter 5: Set Theory

0/17

5.1 Basic Of Set

5.2 Basic Of Set Part 2

5.3 Basic Of Set Part 3

5.4 Set Relation

5.5 Relation Poset and Lattice Part 1

5.6 Relation Poset and Lattice Part 2

5.7 Posets Hasse Diagram and Lattices Part 3

5.11 Types of Graph Part 1

5.12 Types of Graph Part 2

5.13 Types of Graph Part 3

5.14 Advanced Graph

5.15 Basic of Algebraic Theory & Group Properties

5.16 Types of Group, Subgroup & Other Algebraic Structure

5.17 Proposition Basic Concepts

6.1 Introduction, Connecting Devices, Layering Principle

Chapter 6: Computer Networks Important Topics

0/16

6.2 Physical Layer and Data Link Layer

6.3 Physical Layer and Data Link Layer

6.4 Physical Layer and Data Link Layer

6.5 Physical Layer and Data Link Layer

6.6 Physical Layer and Data Link Layer

6.7 Physical Layer and Data Link Layer

6.8 Physical Layer and Data Link Layer

Chapter 7: Compiler Design

0/12

7.1 Introduction of Compiler

7.2 Introduction of Parsing

7.3 Recursive Predictive Parser

7.4 First Follow

7.5 Predict Parsing Table

7.6 Shift Reduce Parser

7.7 Handle

Draft Lesson7.8 Operator Precedence Parser

7.9 Semantic Analyzer

7.10 Attributed Grammar

7.11 Dependency Graph

7.12 Abstract Syntax Tree

Chapter 8: Database Management System

0/8

8.1 Normalization Part 1

8.2 Normalization Part 2

8.3 Normalization Part 3

8.4 Transaction Management & Concurrency Control 1

8.5 Transaction Management & Concurrency Control 2

8.6 Transaction Management & Concurrency Control 3

8.7 Structure Query Language 1

8.8 Structure Query Language 2

Chapter 9: Theory Of Computation

0/19

9.1 Introduction of TOC

9.2 Regular Language, Grammar, Expression

9.3 Finite State Automata

9.4 Minimization of DFA

9.5 Conversion Between FSA-RE-RG

9.6 NFA-ε to DFA Conversion

9.7 Properties of Regular Language

9.8 Context Free Grammar

9.9 Simplification of CFG

9.14 Closure Properties of CFL

9.15 Unrestricted Grammar (Type-0)

9.16 Turing Machine

9.17 Turing Machine as a Transducer

9.18 RL, REL & Closure Property

9.19 Decidability & Countability

Chapter 10: Computer Organization and Architecture

0/11

10.1 Introduction

10.2 Instruction Cycle

10.3 Classification of Instruction Format

10.4 Flags

10.5 Addressing Modes

10.6 Transfer Flow Graph

10.7 Types of Instruction

10.8 Pipelining

10.9 Dependency in the Pipelining

10.10 Mapping Techniques

10.11 Updating Techniques

E-Book – GATE – NEW ADDED SYLLABUS

0/1

Practice Set – GATE – NEW ADDED SYLLABUS

0/2

Data Structure and Algorithm (NEW)

Chapter 1: Data Structure and Algorithm (Latest)

0/29

Chapter 2: Computer Organization and Architecture

0/23

E-Book – Data Structure and Algorithm (NEW)

0/1

Practice Set – Data Structure and Algorithm (NEW)

0/2

Computer Organization and Architecture (NEW)

E-Book – Computer Organization and Architecture (NEW)

0/1

Practice Set – Computer Organization and Architecture (NEW)

0/2