Open App

Index

Digital Logic: Functional Completeness

Digital Logic: Sequential Circuits

Digital Logic: Boolean Algebra

Digital Logic - Standard Resources Questions

Database Management Systems

Computer Organization & Architecture - 1

Computer Organization & Architecture - 2

Computer Organization & Architecture - 3

Computer Organization & Architecture - 4

Computer Organization & Architecture - 5

Computer Organization & Architecture - 6

Data Structures - 1

Data Structures - 2

Data Structures - 3

Data Structures - 4

Data Structures - 5

Data Structures - 6

Theory of Computation & Automata Theory - 1

Theory of Computation & Automata Theory - 2

Theory of Computation & Automata Theory - 3

Theory of Computation & Automata Theory - 4

Theory of Computation & Automata Theory - 5

Compiler Design - 1

Compiler Design - 2

Compiler Design - 3

Compiler Design - 4

Operating System - 1

Operating System - 2

Operating System - 3

Operating System - 4

Operating System - 5

Operating System - 6

Operating System - 7

Computer Networks - 1

Computer Networks - 2

Computer Networks - 3

Computer Networks - 4

Computer Networks - 5

Computer Networks - 6

Discrete Mathematics - 1

Discrete Mathematics - 2

Discrete Mathematics - 3

Discrete Mathematics - 4

Discrete Mathematics - 5

Discrete Mathematics - 6

Engineering Mathematics - 1

Engineering Mathematics - 2

Engineering Mathematics - 3

Aptitude & Reasoning for GATE

All Exams > Computer Science Engineering (CSE) > Crash Course for GATE CSE > All Videos

All videos of Crash Course for GATE CSE for Computer Science Engineering (CSE) Exam

Digital Logic: Functional Completeness

Functional Completeness | Boolean Algebra | Digital Logic | Set Theory | Propositional Logic

10:54 min

Set of AND; OR; NOT Operations is Functional Complete

Sets { NOT; OR }; { NOT; AND } are Functionally Complete | Functional Completeness | Digital Logic

NAND is Universal Gate | Functional Completeness | Digital Logic | GO Classes | GATE Overflow

NOR is universal Gate | Functional Completeness | Digital Logic | GO Classes | GATE Overflow

Easy Ways to check Functional Completeness | Functional Completeness | Digital Logic | GO Classes

{ Implication; NOT } is Functionally Complete | Functional Completeness | Digital Logic | GO Classes

Multiplexer is Functionally Complete | Functional Completeness | Digital Logic | GO Classes

Set { Implication; 0 } is Functional Complete | Functional Completeness | Digital Logic | GO Classes

GATE CSE 1998 | Implication gate is Functionally Complete |Digital Logic |GO Classes | Deepak Poonia

Linear Boolean Function | Functional Completeness | Digital Logic | GO Classes

Set { Exor; NOT } is Not Functional Complete | Functional Completeness | Digital Logic | GO Classes

GATE CSE 2008 | Functional Completeness | Digital Logic | GO Classes | GATE Overflow | Deepak Poonia

GATE CSE 1999 Functionally Complete | Digital Logic | GO Classes | GATE Overflow | Deepak Poonia

GATE CSE 2015 Functional Completeness | Digital Logic | GO Classes | GATE Overflow | Deepak Poonia

Join for Free

Digital Logic: Sequential Circuits

State of a Sequential Circuit; State Diagram; State Table; Next State Equation; Output Equation

Introduction to Finite State Machine FSM; Mealy Machine; Moore Machine | Transducers | Automata

Finite State Machine(FSM) Design Example 1 | State Table; State Diagram of FSM | Mealy;Moore Machine

Mealy Machine; Moore Machine | Finite State Machine (FSM) | Finite State Transducers(FST)

Mealy Moore Machine Design Example 1 : Increment a binary number by 1

Mealy Moore Machine Design Example 2 : Decrement a binary number by 1

Mealy Moore Machine Design Example 3 : 2's Complement of a binary number

Mealy Moore Machine Design Example 4 : Detect Sequence 01 in a binary string

GATE CSE 1994 FSM Finite State Machine for Addition of two integers | Question: 3.3

GATE CSE 1995 Finite State Machine FSM | Question: 2.23

GATE CSE 2002 Finite State Machine | Question: 2.5 | Sum of present and previous bits of the input

GATE CSE 2005 Finite State Machine | Question: 63 | Computes 2’s Complement of the input number

GATE CSE 2009 Finite State Machine | Question: 27

GATE CSE 2006 Finite State Machine | Question: 37

GATE CSE 2021 Set 2 | Question: 28 | Mealy Machine | Design a Synchronous circuit

Peter Linz Mealy; Moore Machine Question | Example A.2 | Formal Languages and Automata 6th Edition

Digital Logic: Boolean Algebra

GATE CSE 1987 | Number of Boolean Functions | Digital Logic | GO Classes | Deepak Poonia Sir

GATE CSE 1987 | Exor Expression | Boolean Algebra | Digital Logic | GO Classes | Deepak Poonia Sir

GATE CSE 1988 | Boolean Operation * | Boolean Algebra | Digital Logic | GO Classes | Deepak Poonia

GATE CSE 1989 | Neutral Switching Function | Boolean Algebra | Digital | GO Classes | Deepak Poonia

GATE CSE 1989 | Boolean Equations | Boolean Algebra | Digital Logic | GO Classes | Deepak Poonia

GATE CSE 1992; 1998 | Commutative; Not Associative Boolean Operation | Digital Logic | GO Classes

GATE CSE 1994 | Boolean Equations | Boolean Algebra | Digital Logic | GO Classes | Deepak Poonia

GATE CSE 1995 | Simultaneous Boolean Equations | Digital Logic | GO Classes | Deepak Poonia

GATE CSE 1997 | Boolean Operation * | Boolean Algebra | Digital Logic | GO Classes | Deepak Poonia

GATE CSE 1998 | Bit string B XOR with itself n times | Digital Logic | GO Classes | Deepak Poonia

GATE CSE 2015 Binary Operator # | Boolean Algebra | Digital Logic | GO Classes | Deepak Poonia Sir

GATE EC 2010 Question 12 | Output F Logic Circuit | XNOR gate with 3 inputs | Digital Logic

GATE EC 2015 Question 38 | 3 input Majority gate | 3-input XNOR gate | Digital Logic

GATE EC 2022 Question 17 | Boolean Functions Equivalent to x+yz | Digital Logic

GATE EC 2014 Question 15 | Boolean Expression Simplification | Digital Logic

GATE EC 2010 Question 11 | Match the Columns | Logic Gates | Digital Logic

GATE EC 2014 Question 15 | Packed BCD; Unpacked BCD | Packed Binary Coded Decimal | Digital Logic

Crash Course for GATE CSE

938 videos

Join course for free

Join course for free

Digital Logic - Standard Resources Questions

Digital Logic: Standard Questions Session 1 - Boolean Algebra | GO Classes | Deepak Poonia

Digital Logic: Standard Questions Session 2 - Minimization; K-Map | GO Classes | Deepak Poonia

Digital Logic: Standard Questions Session 3 - K-Map; Dummy Variable | GO Classes | Deepak Poonia

Digital Logic: Standard Questions Session 3 - PART 2 - K-Map; Decoder | GO Classes | Deepak Poonia

Digital Logic: Standard Questions Session 4 - Decoder; Encoder; Multiplexer | GO Classes -Deepak Sir

Database Management Systems

Introduction to Database Management Systems (DBMS)

09:38 min

DBMS - Definition

09:01 min

Applications of DBMS

File System vs. Database Management System

Three Tier Architecture

View of Data

Instances and Schemas in DBMS

Database Users

Database Administrator (DBA)

Introduction to Data Models

Database System Architecture - Part 1

Database System Architecture - Part 2

History of DBMS

Database Languages and Software

Introduction to DBMS - Solved Questions

Introduction to Relational Databases

Codd’s 12 Rules (13 Rules)

Database Schema

Keys in RDBMS

Keys in RDBMS (Solved Questions)

Schema Diagrams

Relational Query Languages

Basics of Relational Algebra

Relational Algebra (Select Operation)

Relational Algebra (Project Operation)

Relational Algebra (Union Operation)

Relational Algebra (Set Difference Operation)

Relational Algebra (Cartesian Product Operation)

Relational Algebra (Rename Operation)

Relational Algebra (Set Intersection Operation)

Relational Algebra (Assignment Operation)

Computer Organization & Architecture - 1

Introduction to Computer Organization and Architecture (COA)

Basics of Computer Architecture

Classifications of Computer Architecture

Introduction to Memory

Memory Hierarchy & Interfacing

Memory Interfacing – Solved PYQs

Introduction to Cache Memory

Direct Memory Mapping

Direct Memory Mapping – Solved Examples

Direct Memory Mapping – Solved PYQs (Part 1)

Direct Memory Mapping – Solved PYQs (Part 2)

Direct Memory Mapping – Solved PYQs (Part 3)

Direct Memory Mapping – Hardware Implementation

Associative Mapping

Associative Mapping – Solved Examples

Associative Mapping – Solved PYQ

Computer Organization & Architecture - 2

Set Associative Mapping

Set Associative Mapping – Solved Examples (Part 1)

Set Associative Mapping – Solved Examples (Part 2)

Set Associative Mapping – Solved PYQs (Part 1)

Set Associative Mapping – Solved PYQs (Part 2)

Cache Memory Mapping – A Comparative Study

Cache Memory Mapping – Solved PYQ

Set Associative Mapping – Bonus PYQs

Cache Design - An Overview

Cache Replacement Policies - RR; FIFO; LIFO; & Optimal

Cache Replacement Policies - MRU; LRU; Pseudo-LRU; & LFU

LRU Cache Replacement Policy - Solved PYQs

Cache Coherence Problem & Cache Coherency Protocols

Snooping-based Cache Coherency Protocol

Directory-based Cache Coherency Protocol

Introduction to Primary Memory

Computer Organization & Architecture - 3

Primary Memory – Architecture of ROM (Part 1)

Primary Memory – Architecture of ROM (Part 2)

Primary Memory – Architecture of ROM (Part 3)

Primary Memory – Architecture of ROM (Part 4)

ROM – Solved Examples

Primary Memory – RAM

Primary Memory – Solved Example

Introduction to Secondary Memory

Secondary Memory – Hard Disk Drives

Hard Disk Drives (Solved Problems) - Set 1

Hard Disk Drives – Recording Density & Rotational Speed

Hard Disk Drives (Solved Problems) - Set 2

Hard Disk Drives (Solved Problems) - Set 3

Hard Disk Drives (Solved Problems) - Set 4

Hard Disk Drives (Solved Problems) - Set 5

Secondary Memory – Solid State Drives

Computer Organization & Architecture - 4

Introduction to Number Systems

Binary Number System

Octal Number System

Hexadecimal Number System

Conversion to Decimal Number System

Conversion from Decimal Number System

Number System – Solved Problems (Set 1)

Number System – Solved Problems (Set 2)

Number System – Solved Problems (Set 3)

Number System – Solved Problems (Set 4)

Introduction to Complementary Number Systems

Complementary Number Systems - Examples

Diminished Radix and Radix Complement

Subtraction in Diminished Radix Complement

Subtraction in Radix Complement

Representations of Binary Numbers

Computer Organization & Architecture - 5

Representations of Binary Numbers - Solved Problems

Sign bit Extension (Part 1)

Sign bit Extension (Part 2)

Overflow in Signed and Unsigned Numbers

Introduction to Binary Codes

8421; Excess-3; and 3321 Codes

Binary Codes - Solved Problems

BCD Addition

BCD Adder

Excess-3 Addition

Gray Code

Error Detection

Error Correction

Problem of Encoding in Error Detection and Correction

Hamming Code

Hamming Code – Solved Problems

Computer Organization & Architecture - 6

Floating Point Numbers

Representations of Floating Point Numbers

Explicit vs. Implicit Normalization of Floating Point Numbers

Floating Point Numbers - Solved Problems

IEEE Standard for Floating-Point Arithmetic (IEEE 754)

IEEE 754 - Single and Double Precision

IEEE 754 - Solved Problems (Set 1)

IEEE 754 - Solved Problems (Set 2)

Binary Multiplication

The Concept of Booth’s Algorithm

The Implementation of Booth’s Algorithm

Binary Division

The Concept of Restoring Division

Implementation of Restoring Division

Improving the Hardware of Restoring Division

Non-Restoring Division

Data Structures - 1

Introduction to Data Structures

Data Types vs. Abstract Data Types

Data Structure Definition & Advantages

Types of Data Structures

Basics of Asymptotic Analysis (Part 1)

Basics of Asymptotic Analysis (Part 2)

Basics of Asymptotic Analysis (Part 3)

Basics of Asymptotic Analysis (Part 4)

Basics of Asymptotic Analysis (Part 5)

Guidelines for Asymptotic Analysis (Part 1)

Guidelines for Asymptotic Analysis (Part 2)

Asymptotic Analysis (Solved Problem 1)

Asymptotic Analysis (Solved Problem 2)

Asymptotic Analysis (Solved Problem 3)

Understanding the Void Pointers

Understanding the Null Pointers

Understanding the Dangling Pointers

Understanding the Wild Pointers

Basics of Dynamic Memory Allocation

Dynamic Memory Allocation using malloc()

Dynamic Memory Allocation using calloc()

Dynamic Memory Allocation using realloc()

Releasing the Dynamically Allocated Memory using free()

Structures and Functions (Part 1)

Structures and Functions (Part 2)

Data Structures - 2

Structures and Functions (Part 3)

Structures and Functions (Part 4)

Structures and Functions (Part 5)

Structures and Functions (Part 6)

Self Referential Structures

Introduction to Linked List

Array vs. Single Linked List (In Terms of Representation)

Creating the Node of a Single Linked List

Creating a Single Linked List (Part 1)

Creating a Single Linked List (Part 2)

Traversing a Single Linked List (Counting the Nodes)

Traversing a Single Linked List (Printing the Data)

Traversing the List (Linked List vs. Arrays)

Single Linked List (Inserting a Node at the End)

Insertion at the End (Linked List vs. Array) - Part 1

Insertion at the End (Linked List vs. Array) - Part 2

Single Linked List (Inserting a Node at the Beginning)

Inserting the Data at the Beginning of Single Linked Lists (Possible Mistake)

Inserting the Data at the Beginning of Single Linked List (2nd Method)

Inserting the Data at the Beginning (Singly Linked List vs. Array)

Single Linked List (Inserting a Node at a Certain Position)

Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 1

Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 2

Single Linked List (Deleting the First Node)

Single Linked List (Deleting the Last Node)

Data Structures - 3

Single Linked List (Deleting the Last Node using Single Pointer)

Deletion at the End (Singly Linked List vs. Array)

Deletion at the Beginning (Single Linked List vs. Array)

Single Linked List (Deleting the Node at a Particular Position)

Deleting the Entire Single Linked List

Reverse a Single Linked List

Singly Linked List (Solved Problem 1)

Singly Linked List (Solved Problem 2)

Singly Linked List (Solved Problem 3)

Singly Linked List (Solved Problem 4)

Singly Linked List (Solved Problem 5)

Singly Linked List (Solved Problem 6)

Rapid Fire Quiz (Singly Linked List)

Introduction to Doubly Linked List

Doubly Linked List (Inserting a Node in an Empty List)

Doubly Linked List (Insertion at the Beginning)

Doubly Linked List (Insertion at the End)

Doubly Linked List (Insertion between the Nodes) - Part 1

Doubly Linked List (Insertion between the Nodes) - Part 2

Creating an Entire Doubly Linked List

Doubly Linked List (Deleting the First Node)

Doubly Linked List (Deleting the Last Node)

Doubly Linked List (Deleting the Intermediate Node)

Reversing the Doubly Linked List

Doubly Linked List (Solved Problem 1)

Data Structures - 4

Doubly Linked List (Solved Problem 2)

Why Doubly Linked List?

Rapid Fire Quiz (Doubly Linked List)

Introduction to Circular Linked List

Circular Singly Linked List (Insertion at the Beginning)

Traversing a Circular Singly Linked List

Circular Singly Linked List (Insertion at the End)

Circular Singly Linked List (Insertion between the Nodes)

Creating a Circular Singly Linked List

Circular Singly Linked List (Deleting the First Node)

Circular Singly Linked List (Deleting the Last Node)

Circular Singly Linked List (Deleting the Intermediate Node)

Circular Singly Linked List (Counting the Number of Elements)

Circular Singly Linked List (Searching an Element)

Circular Doubly Linked List (Insertion at the Beginning)

Circular Doubly Linked List (Insertion at the End)

Circular Doubly Linked List (Insertion between the Nodes)

Circular Doubly Linked List (Deleting the First Node)

Circular Doubly Linked List (Deleting the Last Node)

Circular Doubly Linked List (Deleting the Intermediate Node)

Sorted Singly Linked List (Inserting a New Element)

Application of Linked List (Polynomial Arithmetic) - Part 1

Application of Linked List (Polynomial Arithmetic) - Part 2

Application of Linked List (Addition of Two Polynomials)

Application of Linked List (Multiplication of Two Polynomials)

Data Structures - 5

Application of Linked List (Multiplication of Two Polynomials) - Improvements

Adding Two Numbers using Linked Lists - Part 1

Adding Two Numbers using Linked Lists - Part 2

Adding Two Numbers using Linked Lists - Part 3

Introduction to Stacks

Array Implementation of Stacks (Part 1)

Array Implementation of Stacks (Part 2)

Array Implementation of Stacks (Part 3)

Array Implementation of Stacks (Part 4)

Stacks (Important Questions) – Set 1

Stacks (Important Questions) – Set 2

Stacks (Program 1) – Part 1

Stacks (Program 1) – Part 2

Stacks (Program 1) – Part 3

Stacks (Program 2) – Part 1

Stacks (Program 2) – Part 2

Stacks (Program 3)

Linked List Implementation of Stacks (Part 1)

Linked List Implementation of Stacks (Part 2)

Linked List Implementation of Stacks (Part 3)

Stacks (Program 4) – Part 1

Stacks (Program 4) – Part 2

Stacks (Program 4) – Part 3

Stacks (Program 4) – Part 4

Stacks (Program 4) – Part 5

Data Structures - 6

Stacks (Program 4) – Part 6

Stacks (Program 4) – Part 7

Stacks (Program 5)

Application of Stacks (Nested Brackets) - Part 1

Application of Stacks (Nested Brackets) - Part 2

Application of Stacks (Infix to Postfix) - Part 1

Application of Stacks (Infix to Postfix) - Part 2

Application of Stacks (Infix to Postfix) - Part 3

Application of Stacks (Infix to Postfix) - Part 4

Application of Stacks (Infix to Postfix) - Part 5

Application of Stacks (Infix to Postfix) - Part 6

Application of Stacks (Infix to Postfix) - Part 7

Application of Stacks (Infix to Postfix) - Part 8

Stacks (GATE Problems) - Set 1

Stacks (GATE Problems) - Set 2

Queues | Chapter-7 | Data Structures | nesoacademy.org

Binary Trees | Chapter-8 | Data Structures | nesoacademy.org

Theory of Computation & Automata Theory - 1

Introduction to Theory of Computation

Finite State Machine (Prerequisites)

Finite State Machine (Finite Automata)

Deterministic Finite Automata (Example 1)

Deterministic Finite Automata (Example 2)

Deterministic Finite Automata (Example 3)

Deterministic Finite Automata (Example 4)

Regular Languages

Operations on Regular Languages

Non-Deterministic Finite Automata

Formal Definition of Non-Deterministic Finite Automata (NFA)

Non-Deterministic Finite Automata (Solved Example 1)

Non-Deterministic Finite Automata (Solved Example 2)

Non-Deterministic Finite Automata (Solved Example 3)

Conversion of NFA to DFA

Conversion of NFA to DFA (Example 1)

Conversion of NFA to DFA (Example 2)

Conversion of NFA to DFA (Example 3)

Conversion of NFA to DFA (Example 4)

Minimization of Deterministic Finite Automata (DFA)

Theory of Computation & Automata Theory - 2

Minimization of DFA (Example 1)

Minimization of DFA (Example 2)

Minimization of DFA (With Multiple Final States)

Minimization of DFA (With Unreachable States)

Myhill Nerode Theorem - Table Filling Method

Myhill Nerode Theorem - Table Filling Method (Example)

Finite Automata With Outputs

Construction of Mealy Machine

Construction of Mealy Machine (Example 1)

Construction of Mealy Machine (Example 2)

Construction of Moore Machine

Construction of Moore Machine (Example 1)

Construction of Moore Machine (Example 2)

Conversion of Moore Machine to Mealy Machine

Conversion of Moore Machine to Mealy Machine (Example 1)

Conversion of Moore Machine to Mealy Machine (Example 2)

Conversion of Mealy Machine to Moore Machine

Conversion of Mealy Machine to Moore Machine (Example 1)

Conversion of Mealy Machine to Moore Machine (Example 2)

Conversion of Mealy Machine to Moore Machine (Using Transition Table)

Theory of Computation & Automata Theory - 3

Epsilon NFA

Conversion of Epsilon NFA to NFA

Conversion of Epsilon NFA to NFA - Examples (Part 1)

Conversion of Epsilon NFA to NFA - Examples (Part 2)

Regular Expression

Regular Expression - Examples

Identities of Regular Expression

Arden’s Theorem

An Example Proof using Identities of Regular Expressions

Designing Regular Expressions

NFA to Regular Expression Conversion

DFA to Regular Expression Conversion

DFA to Regular Expression Conversion (when the DFA has Multiple Final States)

Conversion of Regular Expression to Finite Automata

Conversion of Regular Expression to Finite Automata - Examples (Part 1)

Conversion of Regular Expression to Finite Automata - Examples (Part 2)

Conversion of Regular Expression to Finite Automata - Examples (Part 3)

Equivalence of Two Finite Automata

Equivalence of Two Finite Automata (Example)

Pumping Lemma (For Regular Languages)

Theory of Computation & Automata Theory - 4

Pumping Lemma (For Regular Languages) | Example 1

Pumping Lemma (For Regular Languages) | Example 2

Regular Grammar

Derivations from a Grammar

Context Free Grammar & Context Free Language

Regular Languages & Finite Automata (Solved Problem 1)

Regular Languages & Finite Automata (Solved Problem 2)

Regular Languages & Finite Automata (Solved Problem 3)

Regular Languages & Finite Automata (Solved Problem 4)

Regular Languages & Finite Automata (Solved Problem 5)

Regular Languages & Finite Automata (Solved Problem 6)

Method to find whether a string belong to a Grammar or not

Derivation Tree (Left & Right Derivation Trees)

Ambiguous Grammar

Simplification of CFG (Reduction of CFG)

Simplification of CFG (Removal of Unit Productions)

Simplification of CFG (Removal of Null Productions)

Chomsky Normal Form & CFG to CNF Conversion

Conversion of CFG to Chomsky Normal Form

Greibach Normal Form & CFG to GNF Conversion

Theory of Computation & Automata Theory - 5

CFG to GNF Conversion (Removal of Left Recursion)

Pumping Lemma (For Context Free Languages)

Pumping Lemma (For Context Free Languages) - Examples (Part 1)

Pumping Lemma (For Context Free Languages) - Examples (Part 2)

Pushdown Automata (Introduction)

Pushdown Automata (Formal Definition)

Pushdown Automata (Graphical Notation)

Pushdown Automata Example (Even Palindrome) PART-1

Pushdown Automata Example (Even Palindrome) PART-2

Pushdown Automata Example (Even Palindrome) PART-3

Equivalence of CFG and PDA (Part 1)

Equivalence of CFG and PDA (Part 2a)

Equivalence of CFG and PDA (Part 2b)

Turing Machine - Introduction (Part 1)

Turing Machine - Introduction (Part 2)

Turing Machine (Formal Definition)

Turing Machine (Example 1)

Turing Machine (Example 2)

The Church-Turing Thesis

Turing Machine for Even Palindromes

Compiler Design - 1

Introduction to Compiler Design

Different Phases of Compiler

Symbol Table

Symbol Table – Solved PYQs

Introduction to Lexical Analyzer

Lexical Analyzer – Tokenization

Lexical Analyzer (Solved Problems) - Set 1

Lexical Analyzer (Solved Problems) - Set 2

Errors and Error Recovery in Lexical Analysis

Introduction to Formal Grammars

Compiler Design - 2

Classifications of Formal Grammars (Part 1)

Classifications of Formal Grammars (Part 2)

Derivations of CFGs

Ambiguity in CFGs

Ambiguity in CFGs - Solved Problems (Set 1)

Ambiguity in CFGs - Solved Problems (Set 2)

Problems of Ambiguity in CFGs

Associativity Violation and Solution in CFGs

Precedence Violation and Solution in CFGs

Associativity and Precedence in CFGs

Compiler Design - 3

Associativity and Precedence in CFGs – Solved Problems (Set 1)

Associativity and Precedence in CFGs – Solved Problems (Set 2)

Recursion in Context Free Grammars (CFGs)

Problem of Left Recursion and Solution in CFGs

Elimination of Left Recursion – Solved Problems

Non-Deterministic CFGs

Non-deterministic CFGs – Solved Problems (Set 1)

Non-deterministic CFGs – Solved Problems (Set 2)

Introduction to Parsers

Top Down Parsers - Recursive Descent Parsers

Compiler Design - 4

Top Down Parsers - LL(1) Parsers

FIRST() and FOLLOW() Functions

FIRST() and FOLLOW() Functions – Solved Problems (Set 1)

FIRST() and FOLLOW() Functions – Solved Problems (Set 2)

LL(1) Parsing Table

LL(1) Parsing

LL(1) Parsing – Solved Problems (Set 1)

LL(1) Parsing – Solved Problems (Set 2)

Bottom-Up Parsers | Chapter-4 | Compiler Design | nesoacademy.org

Semantic Analysis | Chapter-5 | Compiler Design | nesoacademy.org

Operating System - 1

Introduction to Operating Systems

Basics of OS (Computer System Operation)

Basics of OS (Storage Structure)

Basics of OS (I/O Structure)

Computer System Architecture

Operating System Structure

Operating System Services

User Operating System Interface

System Calls

Types of System Calls

System Programs

Operating System - 2

Operating System Design & Implementation

Structures of Operating System

Virtual Machines

Operating System Generation and System Boot

Process Management (Processes and Threads)

Process State

Process Control Block

Process Scheduling

Context Switch

Operation on Processes – Process Creation

Operation on Processes – Process Termination

Operating System - 3

Interprocess Communication

Shared Memory Systems

Message Passing Systems (Part 1)

Message Passing Systems (Part 2)

Message Passing Systems (Part 3)

Sockets in Operating System

Remote Procedure Calls (RPC)

Issues in RPC & How They're Resolved

Introduction to Threads

Multithreading Models & Hyperthreading

fork() and exec() System Calls

Operating System - 4

Threading Issues [fork() & exec() System Calls]

Threading Issues (Thread Cancellation)

Introduction to CPU Scheduling

CPU and I/O Burst Cycles

Preemptive and Non-Preemptive Scheduling

Scheduling Criteria

Scheduling Algorithms - First Come First Served (FCFS)

First Come First Served Scheduling (Solved Problem 1)

First Come First Served Scheduling (Solved Problem 2)

Scheduling Algorithms - Shortest Job First (SJF)

Shortest Job First Scheduling (Solved Problem 1)

Operating System - 5

Shortest Job First Scheduling (Solved Problem 2)

Scheduling Algorithms - Priority Scheduling

Priority Scheduling (Solved Problem 1)

Priority Scheduling (Solved Problem 2)

Scheduling Algorithms - Round Robin Scheduling

Round Robin Scheduling (Turnaround Time & Waiting Time)

Round Robin Scheduling - Solved Problem (Part 1)

Round Robin Scheduling - Solved Problem (Part 2)

Multilevel Queue Scheduling Algorithm

Multilevel Feedback-Queue Scheduling Algorithm

Scheduling Algorithms – Solved Problems

Operating System - 6

Process Synchronization

The Critical-Section Problem

Peterson’s Solution

Test and Set Lock

Semaphores

Disadvantages of Semaphores

The Bounded Buffer Problem

The Readers Writers Problem

The Dining Philosophers Problem

Monitors

Dining Philosophers Solution using Monitors

Operating System - 7

Process Synchronization - Problem 1

Process Synchronization - Problem 2

Process Synchronization - Problem 3

Process Synchronization - Problem 4

Process Synchronization - Problem 5

Deadlocks | Chapter-7 | Operating System | nesoacademy.org

Main Memory | Chapter-8 | Operating System | nesoacademy.org

Virtual Memory | Chapter-9 | Operating System | nesoacademy.org

File Systems | Chapter-10 | Operating System | nesoacademy.org

File System Implementation | Chapter-11 | Operating System | nesoacademy.org

Mass Storage Structure | Chapter-12 | Operating System | nesoacademy.org

Computer Networks - 1

Introduction to Computer Networks

Computer Networks - Basic Characteristics

Network Protocols & Communications (Part 1)

Network Protocols & Communications (Part 2)

Components of a Computer Network

Classification of Computer Networks

Network Topology

Network Topology (Solved Questions)

Basics of IP Addressing

Basics of MAC Addressing

Basics of Port Addressing

Switching Techniques in Computer Networks

Layering in Computer Networks

The OSI Reference Model (Part 1)

The OSI Reference Model (Part 2)

The OSI Reference Model (Part 3)

The OSI Reference Model (Part 4)

Addressing in Networking

The TCP/IP Protocol Suite

Basic Networking Commands (Part 1)

Basics of Cisco Packet Tracer (Part 1)

Basics of Cisco Packet Tracer (Part 2) | Hub

Basics of Cisco Packet Tracer (Part 3) | Switch

Basics of Router

Basics of Cisco Packet Tracer (Part 4) | Router

Computer Networks - 2

Basics of Cisco Packet Tracer (Part 5) | Repeater

Basics of Bridge

Network Devices

Network Devices (Solved Questions)

Physical Layer and Media (Part 1)

Physical Layer and Media (Part 2)

Physical Layer and Media (Part 3)

Line Configuration

Link Layer Services

Sub-layers of the Data Link Layer

Framing (Part 1)

Framing (Part 2)

Framing (Part 3)

High-Level Data Link Control (HDLC)

Bit Stuffing

Binary Synchronous Communications Protocol (BISYNC)

Point-to-Point Protocol (PPP)

Digital Data Communications Message Protocol (DDCMP)

Error Detection

Vertical Redundancy Check (VRC)

Longitudinal Redundancy Check (LRC)

Checksum

Cyclic Redundancy Check (CRC) - Part 1

Cyclic Redundancy Check (CRC) - Part 2

Cyclic Redundancy Check (Solved Problem)

Computer Networks - 3

Network Performance

Latency

Latency (Simulation)

Bandwidth Delay Product

Delay (Solved Problem)

Round Trip Time (RTT)

Flow Control

Stop-and-Wait Protocol

Stop-and-Wait ARQ Protocol

Sliding Window Protocol

Go-Back-N ARQ

Go-Back-N ARQ (Solved Problem 1)

Go-Back-N ARQ (Solved Problem 2)

Selective Repeat ARQ

Selective Repeat ARQ (Solved Problem 1)

Selective Repeat ARQ (Solved Problem 2)

Sliding Window Protocol (Solved Problem 1)

Sliding Window Protocol (Solved Problem 2)

Multiple Access Protocols

Pure Aloha

Slotted Aloha

Carrier Sense Multiple Access (CSMA) – Part 1

Carrier Sense Multiple Access (CSMA) – Part 2

Controlled Access Protocol – Reservation

Controlled Access Protocol – Polling

Computer Networks - 4

Controlled Access Protocol – Token Passing

Channelization Protocols

Ethernet

Ethernet (Solved Questions) - Part 1

Ethernet (Solved Questions) - Part 2

Ethernet Transmitter Algorithm

Experience with Ethernet

Ethernet (Solved Question 1)

Ethernet (Solved Question 2)

Ethernet (Solved Question 3)

IEEE 802.11 Wireless Fidelity (Wi-Fi)

IEEE 802.11 Distribution System

IEEE 802.11 Wi-Fi Frame Format

Hidden Terminal Problem

Exposed Terminal Problem

Multiple Access with Collision Avoidance (MACA)

Wi-Fi (Solved Question)

IEEE 802.15.1 Bluetooth

Bluetooth Protocol Stack

Virtual LAN (VLAN)

Spanning Tree Protocol (STP)

Spanning Tree Protocol (Solved Question)

IPv4 Address (Part 1)

IPv4 Address (Part 2)

Classful Addressing (Part 1)

Computer Networks - 5

Classful Addressing (Part 2)

Classful Addressing (Part 3)

Classful Addressing (CPT Activity)

IPv4 Unicast; Multicast; and Broadcast

Classful Addressing (Solved Question 1)

Classful Addressing (Solved Question 2)

Classful Addressing (Solved Question 3)

Public and Private IP Addresses

Classless Addressing (Part 1)

Classless Addressing (Part 2)

Subnetting

Subnetting (Solved Problem 1)

Verifying the Subnetting (CPT Activity)

Subnetting (Solved Problem 2)

Subnetting (Solved Problem 3)

Subnetting (CPT Activity)

Subnetting (Solved Problem 4)

Subnetting (Troubleshooting 1)

Subnetting (Troubleshooting 2)

Subnetting (Solved Problem 5)

Subnetting (Solved Problem 6)

Subnetting (Solved Problem 7)

Subnetting (Solved Problem 8)

Subnetting (Solved Problem 9)

Subnetting (Solved Problem 10)

Computer Networks - 6

Subnetting (Solved Problem 10)

Subnetting (Solved Problem 11)

Subnetting (Solved Problem 12)

Fixed Length Subnet Masking (FLSM)

Variable Length Subnet Masking (VLSM) - Solved Problem 1

Variable Length Subnet Masking (VLSM) - Solved Problem 2

Network Layer Protocols | Chapter-4 | Computer Networks | nesoacademy.org

Routing Protocols | Chapter-5 | Computer Networks | nesoacademy.org

NAT & IPv6 | Chapter-6 | Computer Networks | nesoacademy.org

Transport Layer | Chapter-7 | Computer Networks | nesoacademy.org

Application Layer & Security | Chapter-8 | Computer Networks | nesoacademy.org

Discrete Mathematics - 1

Introduction to Discrete Mathematics

Motivation & Introduction to Propositional Logic

Propositional Logic; Propositional Variables & Compound Propositions

Logical Operators − Negation; Conjunction & Disjunction

Logical Operators − Exclusive OR

Logical Operators − Implication (Part 1)

Logical Operators − Implication (Part 2)

Logical Operators − Implication (Part 3)

Converse; Contrapositive and Inverse

Logical Operators − Biconditional Operator

Propositional Logic − Precedence of Logical Operators

Translating Sentences into Logical Expressions

Propositional Logic − Puzzle 1

Propositional Logic − Puzzle 2

Propositional Logic (Solved Problem 1)

Tautology; Contradiction; Contingency & Satisfiability

Propositional Logic − Logical Equivalences

Propositional Logic (Solved Problem 2)

Propositional Logic (Solved Problem 3)

Propositional Logic (Solved Problem 4)

Propositional Logic (Solved Problem 5)

Propositional Logic (Solved Problem 6)

Propositional Logic (Solved Problem 7)

Rules of Inference - Basic Terminology

Rules of Inference - Definition & Types of Inference Rules

Discrete Mathematics - 2

Arguments Building Using Rules of Inference (Part 1)

Arguments Building Using Rules of Inference (Part 2)

Checking The Validity of An Argument (Shortcut Method)

Rules of Inference in Propositional Logic (Solved Problem 1)

Rules of Inference in Propositional Logic (Solved Problem 2)

The Limitation of Propositional Logic

Introduction to First Order Logic

Finding The Truth Values of Predicates (Examples)

Quantifiers

Universal Quantifiers

Universal Quantifiers - Counter Examples

Expressing Quantifications in English

Existential Quantifiers

Existential Quantifiers - Examples

Quantifiers with Restricted Domain

Logical Equivalences Involving Predicates & Quantifiers (Part 1)

Logical Equivalences Involving Predicates & Quantifiers (Part 2)

Negating the Quantified Expressions (Part 1)

Negating the Quantified Expressions (Part 2)

Negating the Quantified Expressions (Examples)

Translating English Sentences to Logical Expressions

First Order Logic (Solved Problems) - Part 1

First Order Logic (Solved Problems) - Part 2

First Order Logic (Solved Problems) - Part 3

First Order Logic (Solved Problems) - Part 4

Discrete Mathematics - 3

First Order Logic (Solved Problems) - Part 5

Introduction to Nested Quantifiers

Nested Quantifiers (Solved Example 1)

Nested Quantifiers (Solved Example 2)

Nested Quantifiers (Solved Example 3)

Nested Quantifiers (Translating English Statements) - Example 1

Nested Quantifiers (Translating English Statements) - Example 2

Nested Quantifiers (Translating English Statements) - Example 3

Nested Quantifiers (Translating English Statements) - Example 4

Nested Quantifiers (Translating English Statements) - Example 5

Negating the Nested Quantifiers

Negating the Nested Quantifiers (Example 2)

Negating the Nested Quantifiers (Example 3)

The Resolution Principle (Preliminaries)

The Resolution Principle (Proof of Theorem)

The Resolution Principle (Proving if an Argument is Valid)

The Resolution Principle (Solved Problems)

Fallacies

Rules of Inference for Quantified Statements (Part 1)

Rules of Inference for Quantified Statements (Part 2)

Universal Modus Ponens Rule

Universal Modus Tollens Rule

Set Theory (Basics of Sets)

Set Representation

Inclusion and Equality

Discrete Mathematics - 4

Inclusion vs. Membership

Inclusion vs. Membership (Solved Problem)

Types of Sets - Universal; Null; and Singleton

Null Set (Solved Problem)

Non-Empty Set (Important Theorem)

Power Set

Power Set (Solved Problems)

Power Set (GATE Problem 1)

Power Set (GATE Problem 2)

Cardinality of Sets

Cartesian Product

Cartesian Product (Solved Problems)

Set Operations (Intersection & Union with Venn Diagram)

Set Difference and Set Complement

Set Operations (Solved Problems)

Set Identities (Part 1)

Set Identities (Part 2)

Set Identities (Part 3)

Set Operations (Solved Problem 1)

Set Operations (Solved Problem 2)

Symmetric Difference

Set Operations (GATE Problems)

Set Operations (GATE and TIFR Problem)

Introduction to Relations

Types of Relations (Part 1)

Discrete Mathematics - 5

Types of Relations (Part 2)

Types of Relations (Solved Problem)

Types of Relations (GATE Problems) - Set 1

Types of Relations (GATE Problems) - Set 2

Operations on Relations

Composition of Relations

Representation of Relations

Closure of Relations – Part 1

Closure of Relations – Part 2

Closure of Relations (Solved Problems) - Set 1

Warshall's Algorithm (Finding the Transitive Closure)

Closure of Relations (Solved Problems) - Set 2

Closure of Relations - GATE Problem

Equivalence Relation

Equivalence Relation (Solved Problems)

Equivalence Relation (GATE Problems) - Set 1

Equivalence Relation (GATE Problems) - Set 2

Equivalence Relation (GATE Problem)

Equivalence Classes

Congruence Modulo m

Modulus of Negative Numbers

Equivalence Classes and Partitions

Equivalence Classes and Partitions (Solved Problems)

Introduction to Partial Ordering

Discrete Mathematics - 6

Partial Orderings (Solved Problems) - Set 1

Partial Orderings (Solved Problems) - Set 2

Hasse Diagram

Hasse Diagram (Solved Problems) - Set 1

Hasse Diagram (Solved Problems) - Set 2

Poset (Minimal and Maximal Elements)

Poset (Least and Greatest Elements)

Poset (Lower and Upper Bounds)

Poset (Least Upper Bound and Greatest Lower Bound)

Hasse Diagram (Solved Problems) - Set 3

Symbols for Partial Order

Meet Semilattice

Join Semilattice

Lattice

Lattice (GATE Problems) - Set 1

Complete and Bounded Lattice

Lattice (Complement of an Element)

Lattice (GATE Problems) - Set 2

Complemented Lattice

Distributive Lattice

Engineering Mathematics - 1

Engineering Mathematics I I Unit1: Linear Algebra (Matrices) I Topic: Inverse by Gauss Jordon Method

Engineering Mathematics I I Unit 1: Linear Algebra (Matrices) I Topic: Rank of Matrix

Engineering Mathematics I I Unit 1: Linear Algebra (Matrices) I Topic: Normal form of Matrix

Engineering Mathematics I I Unit 1: Linear Algebra I Solution of Linear Simultaneous Equations

Engineering Mathematics I I Unit 1: Linear Algebra I Solution of Linear Simultaneous Equations

Engineering Mathematics I I Unit 1: Linear Algebra I Solution of Linear Simultaneous Equations

Engineering Mathematics I I Unit 1: Linear Algebra ITopic: Characteristic Equation & Roots of Matrix

Engineering Mathematics I I Unit 1: Linear Algebra I Topic: Eigen Vectors of Matrix

Engineering Mathematics I I Unit 1: Linear Algebra I Topic: Inverse by Cayley-Hamilton Theorem

Engineering Mathematics I I Unit 1: Linear Algebra (Matrices) I Topic: Cayley-Hamilton Theorem

Engineering Mathematics 1 I Prerequisite of Engineering Mathematics - I

Partial Differeltiation

Application of Partial Differeltiation

Reduction Formulae and Curve Tracing

Multiple Integral

Gamma function definition & properties I Beta ; Gamma Function I Engineering Mathematics

Beta function definition & properties I Beta ; Gamma Function I Engineering Mathematics

Beta ; Gamma Function Example 1 I Engineering Mathematics

Beta ; Gamma Function Example 2 I Engineering Mathematics

Beta ; Gamma Function Example 3 I Engineering Mathematics

Beta ; Gamma Function Example 4 I Engineering Mathematics

Beta ; Gamma Function Example 5 I Engineering Mathematics

Beta ; Gamma Function Example 6 I Engineering Mathematics

Beta ; Gamma Function Example 7 I Engineering Mathematics

Beta ; Gamma Function Example 8 I Engineering Mathematics

Beta ; Gamma Function Example 9 I Engineering Mathematics

Beta ; Gamma Function Example 10 I Engineering Mathematics

Beta ; Gamma Function Example 11 I Engineering Mathematics

Reduction formula in terms of Beta ; Gamma Function I Engineering Mathematics

Duplication Formula I Beta ; Gamma Function I Engineering Mathematics

Beta ; Gamma Function Example 12 I Engineering Mathematics

Beta ; Gamma Function Example 17 I Engineering Mathematics

Beta ; Gamma Function Example 18 I Engineering Mathematics

Beta ; Gamma Function Example 20 I Engineering Mathematics

Beta ; Gamma Function Example 19 I Engineering Mathematics

Beta ; Gamma Function Example 21 I Engineering Mathematics

Beta ; Gamma Function Example 22 I Engineering Mathematics

Beta ; Gamma Function Example 23 I Engineering Mathematics

Engineering Mathematics - 2

Complex Numbers

Ordinary Differential Equations

Linear Differential Equations

Fourier Series

Vector Calculus

Engineering Mathematics - 3

Laplace Transform

Inverse Laplace Transform

Fourier Transform

Functions of Complex Variable (Differential Calculus)

Functions of Complex Variable (Integral Calculus)

Introduction to Probability and Distribution - Probability Distribution - Engineering Mathematics 4

Probability Distribution Problem 1 - Probability Distribution - Engineering Mathematics 4

Probability Distribution Problem 2 - Probability Distribution - Engineering Mathematics 4

Probability Distribution Problem 3 - Probability Distribution - Engineering Mathematics - 4

Probability Distribution Problem 4 - Probability Distribution - Engineering Mathematics - 4

Probability Distribution Problem 5 - Probability Distribution - Engineering Mathematics - 4

Probability Distribution Problem 6 - Probability Distribution - Engineering Mathematics - 4

Probability Distribution Problem 7 - Probability Distribution - Engineering Mathematics - 4

Probability Distribution Problem 8 - Probability Distribution - Engineering Mathematics - 4

Some Standard Distribution and Introduction to Binomial Distribution

Binomial Distribution Problem 1 - Probability Distribution - Engineering Mathematics 4

Binomial Distribution Problem 2 - Probability Distribution - Engineering Mathematics 4

Binomial Distribution Problem 3 - Probability Distribution - Engineering Mathematics - 4

Binomial Distribution Problem 4 - Probability Distribution - Engineering Mathematics - 4

Binomial Distribution Problem 5 - Probability Distribution - Engineering Mathematics - 4

Binomial Distribution Problem 6 - Probability Distribution - Engineering Mathematics - 4

Binomial Distribution Problem 7 - Probability Distribution - Engineering Mathematics - 4

Binomial Distribution Problem 8 - Probability Distribution - Engineering Mathematics - 4

Binomial Distribution Problem 9 - Probability Distribution - Engineering Mathematics - 4

Binomial Distribution Problem 10 - Probability Distribution - Engineering Mathematics - 4

Introduction to Poisson Distribution - Probability Distribution - Engineering Mathematics 4

Poisson Distribution Problem 1 - Probability Distribution - Engineering Mathematics 4

Poisson Distribution Problem 3 - Probability Distribution - Engineering Mathematics - 4

Poisson Distribution Problem 4 - Probability Distribution - Engineering Mathematics - 4

Poisson Distribution Problem 5 - Probability Distribution - Engineering Mathematics - 4

Poisson Distribution Problem 6 - Probability Distribution - Engineering Mathematics - 4

Introduction to Normal Distribution - Probability Distribution - Engineering Mathematics 4

Normal Distribution (Forward Problem) - Problem 1

Normal Distribution (Forward Problem) - Problem 2

Normal Distribution (Forward Problem) - Problem 3

Normal Distribution (Forward Problem) - Problem 4

Normal Distribution (Forward Problem) - Problem 5

Normal Distribution (Reverse Problem) - Problem 1

Normal Distribution Type 2 Problem 2

Normal Distribution (Reverse Problem) - Problem 3

Normal Distribution (Reverse Problem) - Problem 4

Concept of Sampling - Sampling Theory - Engineering Mathematics 4

Concept of Large Sample Test and Types - Sampling Theory - Engineering Mathematics 4

Test of Single Mean of Large Sample Test - Problem 1 - Sampling Theory - Engineering Mathematics - 4

Test of Single Mean of Large Sample Test - Problem 2 - Sampling Theory - Engineering Mathematics 4

Test of Single Mean of Large Sample Test - Problem 3 - Sampling Theory - Engineering Mathematics 4

Test for Difference Between Means of Large Sample Test - Problem 1

Test for Difference Between Means of Large Sample Test - Problem 2

Concept of Small Sample Test - Sampling Theory - Engineering Mathematics 4

Aptitude & Reasoning for GATE

Introduction to Aptitude and Reasoning

08:32 min

Ratio

Ratio (Solved Problems) - Part 1

Ratio (Solved Problems) - Part 2

Proportion

Direct and Indirect Proportion

Proportion (Solved Problems)

Ratio and Proportion (10 Solved Problems)

Classification of Numbers

Prime and Composite Numbers

Number of Factors (Part 1)

Number of Factors (Part 2)

Number of Even and Odd Factors

Power of Prime Number in a Factorial

Power of Composite Number in a Factorial

The Base System

The Base System - Addition

The Base System - Subtraction

The Base System (Solved Problems)

Number of Trailing Zeros in a Factorial

Cyclicity of Numbers (Part 1)

Cyclicity of Numbers (Part 2)

Unit Place Calculation (Part 1)

Unit Place Calculation (Part 2)

Unit Place Calculation (Part 3)

Unit Place Calculation (Solved Problems)

Crash Course for GATE CSE

938 videos

Top Courses Computer Science Engineering (CSE)

Explore Courses

Video lectures for Crash Course for GATE CSE 2025 is part of Computer Science Engineering (CSE) exam preparation. The videos have been prepared according to the Computer Science Engineering (CSE) exam syllabus. The Video lectures, notes, tests & MCQs are made for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests here.

Video lectures of Crash Course for GATE CSE in English & Hindi are available as part of Computer Science Engineering (CSE) exam. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

© EduRev

Education Revolution

Signup to see your scores go up within 7 days!

Access 1000+ FREE Docs, Videos and Tests

Continue with Google

Takes less than 10 seconds to signup