02:26

Hello World in C - Introduction to C Programming

24:35

Asymptotic Notations, Explained with examples

06:25

How to convert NFA to DFA with examples

05:34

Theta Notation (Θ), Explained with examples. Solves questions on Asymptotic Analysis.

02:35

Big Omega Notation (Ω), Explained with examples

06:31

Big O Notation, Explained with examples

06:56

Asymptotic Notations, (big O, small o, big omega Ω, small omega ω, theta Θ), Explained with examples

04:15

What is Asymptotic Analysis? Explained with examples

10:37

Difference between NFA and DFA with examples

08:09

Acceptance of String by Finite Automata with examples

05:11

String Acceptance by NFA with examples

02:16

String Acceptance by DFA with examples

04:05

3 Ways to Represent Finite State Machines

04:01

Non-deterministic Automaton (NFA) and its tuples (Q, Σ, δ, q0, F) with examples

05:19

Deterministic Finite Automaton (DFA) and its tuples (Q, Σ, δ, q0, F) with examples

08:01

Chomsky Hierarchy - Explained in Detail with examples

04:15

How to deal with Multi Valued Attributes and Composite Attributes in DBMS

05:03

Time Complexity - Explained, with Example

02:04

Space Complexity, Time Complexity - How to compare Algorithms

05:30

Single Accumulator Organization - Part 2 of 2 - Execution of Instructions

05:00

Single Accumulator Organization - Part 1 of 2 - General Purpose Registers

02:24

Why you shouldn't use Goto Statement | Previous Year GATE Question | GATE 1994 | DSA

02:22

Previous Year GATE Question on Increment, Decrement Operator | GATE 2017 | ADA | PYQs

03:03

Previous Year GATE Question on Arrays | GATE 2008 | Data Structures and Algorithms | PYQs

03:36

Previous Year GATE Question on Pointers and Array | GATE 2015 | Data Structures & Algorithms | PYQs

04:11

Previous Year GATE Question on Pointers and Arrays | GATE 2011 | Data Structure & Algorithms | PYQs

02:02

Previous Year GATE Questions on Pointers | GATE 2016 | Data Structures and Algorithms | PYQs

03:45

Previous Year GATE Question on Pointers & Arrays | GATE 2015 | Data Structures and Algorithms

01:34

Previous Year GATE Question on Functions | GATE 1993 | 2 Marks | Data Structure and Algorithms

03:40

GATE Previous Year Question on Static Variable | GATE 2004, ISRO 2008 | Data Structures & Algorithms

03:35

Previous Year Gate Question on Static Scoping | GATE 1987 | Data Structures and Algorithms | PYQs

04:02

Previous Year Gate Question on Pointers | GATE 2008 | Design and Analysis of Algorithms | PYQs

07:20

Process State Transition Diagram Part 2 - Previous Year GATE Questions | PYQs

29:55

Process State Diagram, Explained in detail

06:27

Classification of Instruction Formats - 3 Address, 2 Address, 1 Address, 0 Address Instructions

04:27

Reflexive Relation - Explained with Examples

03:33

Static Scoping vs Dynamic Scoping, Explained with example

02:24

Why is Intersection a Derived Operator?

03:48

Shortcut Method to find Preorder, Inorder, and Postorder of a Ternary Tree in Hindi

03:16

Shortcut Method to find Preorder, Inorder, and Postorder of a Binary Tree in Hindi