GATE 2021: Computer Science / Information Technology

Get a call back from our Expert

Key Features and Syllabus covered


What is this course about?

GATE 2021 : Computer Science / Information Technology

This is a comprehensive course for GATE 2021 CS/IT Engineering which will cover the Technical and Non-Technical Parts of the GATE syllabus. It is Suitable for Aspirants Preparing for GATE , ESE, PSUs Examinations.

Exam Covered : Graduate Aptitude Test in Engineering

Validity : Till GATE 2021 Exam.

Study Materials :  Theory and Objective Books of Technical Subjects  , GATE Previous Year Solved Papers , DPP Booklets , Guide for Engineering Mathematics Book  , General Aptitude & Reasoning Book

Total Online Tests - 60 

Part Test -20 , Subject Test – 10 , Cascaded Test-5 , Full Syllabus Test -15 and Mock Test -10

For more online tests, visit website.... www.onlineengineersacademy.org

So don’t miss the live classes and avail initial 40% discount.

Coupon Code - GATECS40

Curriculum :

1 # NUMBER SYSTEM Part 1

00:47:24

2 # NUMBER SYSTEM Part 2

00:37:40

3 # NUMBER SYSTEM Part 3

01:09:23

4 # Average Part 1

01:07:21

5 # Average Part 2

00:28:28

6 # Average Part 3

00:36:36

7 # RATIO & PROPATIONAL (ALLIGATION)

01:43:52

8 # PERCENTAGE Part 1

00:56:30

9 # PERCENTAGE Part 2

00:42:02

10 # PERCENTAGE Part 3

00:17:36

11 # PROFIT LOSS

01:03:56

12 # SIMPLE INTEREST

01:14:50

13 # Compound Interest

00:47:05

14 # SPEED & DISTANCE

02:02:09

1 # Linear Algebra -1

02:20:21

2 # Linear Algebra -1

03:35:30

3 # Linear Algebra -1

03:18:23

4 # Linear Algebra -1

03:04:59

5 # Calculus

01:17:22

6 # Calculus

00:57:47

7 # Calculus

01:16:23

8 # Probability and Statistics-1

02:41:34

9 # Probability and Statistics-1

01:15:37

1 # Boolean Algebra

02:52:25

2 # K-Map

02:58:23

3 # Practice questions on Minimization

00:56:17

4 # Logic Gates-1 (NOT, AND, OR Gates)

01:07:33

5 # Logic Gates-2 (NAND & NOR Gates)

00:57:25

6 # Logic Gates-3 (Ex-OR & Ex-NOR Gates)

03:07:04

7 # Logic Gate-4 & Combinational Circuits-1

03:21:50

8 # Combinational Circuits-2

02:14:22

9 # Combinational Circuits-3

00:38:41

10 # Combinational Circuits-4

02:04:49

11 # Combinational Circuits-5

01:59:55

12 # Decoder,Encoder & Sequential Circuits-1

02:35:00

13 # Sequential Circuits-2

02:45:23

14 # Flip-Flops

01:55:24

15 # Registers (SISO & SIPO)

01:52:54

16 # PISO & PIPO REGISTERS and COUNTERS-1

03:03:33

17 # Synchronous Counter

03:13:15

18 # Number System-1

02:41:19

19 # NUMBER SYSTEM-2

03:20:06

1 # Introduction to COA, Logical Representation of Memory

02:08:07

2 # System bus, Instruction Cycle

02:03:15

3 # Instruction Formats

02:42:17

4 # Flags

02:51:35

5 # Addressing Modes

02:52:47

6 # Addressing Modes,Instruction Set

03:01:23

7 # Instruction Cycle with Interrupt, RIC,CISC

02:43:32

8 # Microoperation,Microprofram,Control Unit

02:44:36

9 # Performance Evaluation and Time Calculation of CPU, Flynn's Classification

02:49:11

10 # Flynn's Classification, Pipelining

02:40:50

11 # Pipelining,Dependencies in pipelining

02:47:09

12 # Hazards,Memory organization

02:47:24

13 # Cache memory organization

02:05:49

14 # Cache Organization

01:57:31

15 # Cache Memory organization,DMA

01:45:46

16 # Doubt Class

01:22:07

  Algorithms

PRICE: 500 /- Buy This

1 # Introduction to Network and OSI/TCP Model

02:50:19

2 # Introduction to Network and OSI/TCP Model

02:47:33

3 # Application layer Protocols & Data Link layer

01:52:57

4 # Data Link layer

02:04:27

5 # Data Link layer

02:15:46

6 # MAC Sub Layer Protocol

02:51:08

7 # Ckt switching and Packet switching ,802.3 and 802.5 Frame format , IP Addressing

03:52:52

8 # Ckt switching and Packet switching ,802.3 and 802.5 Frame format , IP Addressing

04:03:19

9 # IP Protocol and Traffic Shopping Algorithm

03:59:38

10 # Routing Algorithm and TCP Protocol

03:02:42

11 # Routing Algorithm and TCP Protocol

03:04:21

12 # Network Security

03:13:57

13 # Network Security, Wireless 2G/3G Network , Bluetooth

02:59:46

1 # Introduction to TOC,Finite Automata

02:00:19

2 # Deterministic Finite Automata (DFA)

01:58:46

3 # Deterministic Finite Automata (DFA)

02:02:32

4 # DFA,Expressive Power

01:55:09

5 # Complement of Finite Automata, design issues of FA

01:51:53

6 # Conversion of NFA to DFA & Epsilon NFA to NFA

02:02:30

7 # Minimization of DFA

01:36:27

8 # Regular Expression

02:00:57

9 # Regular Expression

01:57:15

10 # Conversion of Regular Expression to FA & FA to Regular Expression

01:55:04

11 # Regular Language and Pumping Lemma

01:58:04

12 # Decision Properties of FA

02:03:41

13 # Closure Property of Regular Language

01:50:31

14 # Mealy and Moore Machine

02:02:32

15 # Grammar,Chomsky Classification of Grammar

02:32:31

16 # Simplification of CFG,Normal Form of CFG

01:55:06

17 # Decision Problem of CFG, Closure Property of CFG

01:53:03

19 # Edited Video - Decision Problem of CFG, Closure Property of CFG

05:09:32

20 # Edited Video - Decision Problem of CFG, Closure Property of CFG

05:09:32

21 # PDA,How to check language is CFL or not

02:02:07

22 # Turing Machine

00:08:32

23 # Turing Machine

01:47:31

24 # Turing Machine

01:19:14

25 # Doubt session

01:52:05

1 # Introduction to compiler, Lexical Anaylsis

02:58:53

2 # Syntax Analysis,Parsing

03:09:30

3 # Syntax Analysis,Parsing

03:07:31

4 # Parsing

02:59:49

5 # Parsing

02:28:43

6 # Semantic, Intermediate code generation

03:04:04

7 # Code optimization ,Runtime environment

03:12:59

  Databases

PRICE: 500 /- Buy This

1 # Introduction to relational Model(FD's & Keys Concept)

02:46:48

2 # Keys & Normalization-1(Finding Candidate keys)

02:35:20

3 # Keys & Normalization- 2(Decompostions property)

02:46:23

4 # Normal Forms

01:53:25

5 # Transactions- 1(ACID Property & Examples of Schedules )

02:02:54

6 # Transactions -2(Serializable Schedule)

02:10:23

7 # Transactions- 3 (Problems due to concurrent execution of Transactions)

01:56:50

8 # Transactions- 4 (Recoverable Schedules &Practice Questions)

02:04:02

9 # Lock Based Protocol

02:20:24

10 # Relational Algebra Query Language & Minimal Cover

02:41:43

1 # Introduction To Complier, Lexical analysis

01:51:28

2 # Syntax analysis

02:52:42

3 # Parsing

00:20:11

5 # Parsing

00:00:00

4 # Parsing

02:26:54

5 # Parsing

02:26:18

6 # Parsing

02:22:15

₹ 25000


What You will Get

  • Online Classes

    Online Classes of purchased course which will cover the Technical & Non-Technical Syllabus.

  • Unlimited Access

    Get unlimited access during the validity of the course. You can access the course 24/7 as per your convenience

  • Student Interaction

    Students can interact with our teachers using the chat and email option

Achieve your career dreams, wherever you are, whenever you want!

ABOUT US

Nimbus is an online learning platform for Engineering graduates who are preparing for competitive exams like ESE,GATE,PSU,SSC -JE and other JE and AE exams.

ADDRESS
Khasra 262, Westend Marg, Near Garden of Five Senses, Saket, New Delhi, India 110030

CONTACT US
[email protected]
+91 7374000888, +91 7374000999