THE GATEHUB

Operations on Relations | Inverse | Union | Intersection | Composite | Discrete Mathematics

Prim's Algorithm for minimum spanning trees || GATECSE || DAA

Properties of Group in Discrete Mathematics | Group Theory

Introduction to Backtracking || Backtracking Algorithm || DAA

Using Pointer to print 2D Arrays Elements | GATE Solved Problem | Data Structure

Introduction to Doubly Linked List (Creation And Display) | Data structures

Deletion of a Node in a Linked List(at beginning, end, specified position)with code| Data Structure

Properties of Transitive Relation | Discrete Mathematics

LL(1) parser | Example 1 | Top Down Parser | Compiler Design

Planar Graph and Non Planar Graph || Planarity of a Graph || GATECSE || Graph Theory

0/1 Knapsack Problem Using Backtracking || Backtracking Algorithm || DAA

NFA to DFA Conversion Example 1 | Conversion from NFA to DFA Examples | TOC | Automata Theory

else if ladder in c || C Programming

Laws of Sets | Set Theory | Discrete Mathematics

SDD to generate Three Address Code || SDT || Compiler Design

Queue implementation using linked list | Full explanation | Data Structure

Heapsort Algorithm | Heapsort Time Complexity Analysis | Sorting Algorithm | GATECSE | DAA

Ambiguous Grammar | Introduction to Ambiguous Grammar | Compiler Design

Linear Search Algorithm with Code & Complexity (Iterative & Recursive) | GATECSE | Data Structure

Stack Implementation using Array | Data Structure

Basic Blocks and Flow Graphs | Code Optimization | Compiler Design

Conversion from Language to Grammar || GATECSE || TOC

Fibonacci Heap || Properties || Memory Representation || DAA

Removal of Useless Production | Simplification of CFG | Elimination of Useless production | TOC

Pointer and 2D Array | Using Pointer to print 2D Arrays | GATECSE | Data Structure

N Queen Problem Using Backtracking | N Queen Problem | Backtracking Algorithm | DAA

Doubly Circular Linked List Insertion (Begin, end and Specified Position) | Data Structure

Backpatching Example 2 (Loop & Switch Case ) | Three Address Code | ICG | Compiler Design

Design a DFA in which set of all strings can be accepted which ends with ab or ba | TOC

Propositional Logic | Conjunction, Disjunction and Negation | Discrete Mathematics

Runtime Environment ||

Relation between symmetric and asymmetric relations | Discrete Mathematics

Introduction to C Programming ||

Cut vertex || Articulation Point || Cut edge || Bridge || Graph Theory

Introduction to Syntax Directed Definition (SDD)| Syntax Directed Translation | Compiler Design

Introduction to Regular Expression | Regular Language to Regular Expression | Automata Theory

If Else Control Statements in C || C Programming

Longest Common Subsequence Using Dynamic Programming || GATECSE || DAA

Removal of Unit Production | Simplification of CFG | Elimination of Unit production | TOC

Operations on Relations | Inverse | Union | Intersection | Composite | Discrete Mathematics

Lexical Analyzer ||

DFA Minimization || Example 3 || Minimization of DFA || GATE CSE || TOC

How to Install Code Blocks || C Programming

Subgroup in Group Theory | Discrete Mathematics

What is Algorithm ||

Asymptotic Notation Solved Examples | Part-4 | Big O | Big Ω | Big Θ | GATECSE | DAA

Structure of C Program || C Programming

Reflexive Relation with examples | Discrete Mathematics

Irreflexive Relation with examples | Discrete Mathematics

Symmetric Relation with Examples | Discrete Mathematics

Antisymmetric Relation with Examples | Discrete Mathematics