Login on Ekeeda
Signup on Ekeeda
Signup on Ekeeda
Book Ekeeda Session

GATE Computer Engineering (Batch 4)

START FREE TRIAL GET SUBSCRIPTION
  • Lock-Btn

    Introduction to Number System

    10.55
  • Lock-Btn

    Number System Conversion

    24.04
  • Lock-Btn

    Numericals Based on Number System-Part 1

    21.36
  • Lock-Btn

    Numericals Based on Number System-Part 2

    18.14
  • Lock-Btn

    Complement Number Representation

    19.31
  • Lock-Btn

    Structure of C Program

    5.02
  • Lock-Btn

    Installing Atom

    5.51
  • Lock-Btn

    Basics of Printf

    9.55
  • Lock-Btn

    Variables and Datatypes

    18.26
  • Lock-Btn

    Basics of Scanf

    9.09
  • Lock-Btn

    Math Operators in C

    11.28
  • Lock-Btn

    Program Example 1

    8.33
  • Lock-Btn

    Program Example 2

    13.09
  • Lock-Btn

    Signed Number Representation for Binary

    32
  • Lock-Btn

    Important Properties of 1's and 2's Complement Numbers

    17.43
  • Lock-Btn

    Concept of Overflow and Sign Extension

    18.52
  • Lock-Btn

    Subtraction Using R's and (R-1)'s Complement Method

    34.04
  • Lock-Btn

    Program Example 3

    5.15
  • Lock-Btn

    Increment and Decrement Operators

    22.13
  • Lock-Btn

    More on Increment and Decrement Operators

    19.11
  • Lock-Btn

    Bitwise Operators

    17.23
  • Lock-Btn

    Binary Codes

    30.06
  • Lock-Btn

    Generation of Gray Code

    14.41
  • Lock-Btn

    Conversion of Binary to Gray and Gray to Binary Codes

    12.57
  • Lock-Btn

    Gate Numerical on Number System Part 1

    28
  • Lock-Btn

    Gate Numerical on Number System Part 2

    25.07
  • Lock-Btn

    For Loop

    18.27
  • Lock-Btn

    While Loop

    11.41
  • Lock-Btn

    If Else Statement

    5
  • Lock-Btn

    Nested if Else

    7.11
  • Lock-Btn

    Logical Operators

    10.51
  • Lock-Btn

    Switch Case Part 1

    11.07
  • Lock-Btn

    Switch Case Part 2

    13.36
  • Lock-Btn

    Boolean Laws

    25.16
  • Lock-Btn

    Concept of Minterms and Maxterm

    22.32
  • Lock-Btn

    Problems Based on Minterms and Maxterms

    32.37
  • Lock-Btn

    Complementing the Function

    11.25
  • Lock-Btn

    Ternary Operator

    7.22
  • Lock-Btn

    Do While Loop

    9.43
  • Lock-Btn

    Practice Questions on Control Structures Part 1

    26.3
  • Lock-Btn

    GATE 2015 Question on Control Structures

    10.37
  • Lock-Btn

    GATE 2017 Question on Control Structures

    13.31
  • Lock-Btn

    Practice Questions on Control Structures Part 2

    15.3
  • Lock-Btn

    Practice Questions on Control Structures Part 3

    14.03
  • Lock-Btn

    Introduction to K-Map

    15.49
  • Lock-Btn

    Grouping Techniques in K-Map

    31.56
  • Lock-Btn

    Numerical Based on Boolean Algebra

    28.24
  • Lock-Btn

    Functions Introduction

    16.21
  • Lock-Btn

    Function Calls in Detail

    7.02
  • Lock-Btn

    Programming Example of Function

    12.42
  • Lock-Btn

    Function Definition and Function Declaration

    19.03
  • Lock-Btn

    Types of Functions Void and Non Void

    4.57
  • Lock-Btn

    Example of Void Function

    10.25
  • Lock-Btn

    Storage Class Auto

    16.27
  • Lock-Btn

    Basic Logic Gates

    6.26
  • Lock-Btn

    Universal Logic Gates

    16.25
  • Lock-Btn

    Numericals Based on Universal Logic Gates

    22.3
  • Lock-Btn

    Ex-OR Gate

    13.37
  • Lock-Btn

    Important Properties of Ex-OR Gate

    20.02
  • Lock-Btn

    Gate Numericals on Logic Gates

    36.04
  • Lock-Btn

    Register Storage Class

    13.45
  • Lock-Btn

    Static Storage Class

    21.29
  • Lock-Btn

    Local Parameter of Function

    14.38
  • Lock-Btn

    Example 1 on Storage Class

    10.2
  • Lock-Btn

    Example 2 on Storage Class

    10.12
  • Lock-Btn

    Example 3 on Storage Class

    10.56
  • Lock-Btn

    Example 4 on Storage Class

    11.1
  • Lock-Btn

    GATE 2012 Question on Storage Class

    11.05
  • Lock-Btn

    Introduction to Combinational Logic Circuit

    11.24
  • Lock-Btn

    Half Adder

    7.14
  • Lock-Btn

    Half Subtractor

    7.17
  • Lock-Btn

    Full Adder

    12.23
  • Lock-Btn

    Implementing Full Adder with Half Adder

    10.46
  • Lock-Btn

    Concept of Comparator

    20.47
  • Lock-Btn

    4-Bit Parallel/ Ripple Adder

    15.55
  • Lock-Btn

    4-Bit Serial Adder

    18.46
  • Lock-Btn

    GATE 2019 Question on Storage Class

    9.18
  • Lock-Btn

    Recursive Functions Introduction

    17.07
  • Lock-Btn

    Recursive Function Find Sum of First N Natural Numbers

    5.12
  • Lock-Btn

    4-Bit Adder/ Subtractor

    11.03
  • Lock-Btn

    Encoder

    8.11
  • Lock-Btn

    Decoder

    11.36
  • Lock-Btn

    Full Adder Using 3:8 Decoder

    14.56
  • Lock-Btn

    Decoder Expansion

    17.34
  • Lock-Btn

    Concept of Demultiplexer

    7.37
  • Lock-Btn

    Decoder Using Demultiplexer

    6.35
  • Lock-Btn

    Concept of Multiplexer

    8.47
  • Lock-Btn

    Multiplexer Expansion

    14.4
  • Lock-Btn

    Recursive Function to Find X Raise to Y

    9.53
  • Lock-Btn

    Recursive Function to Find Fibonacci Number

    9.14
  • Lock-Btn

    Recursive Function for Decimal to Binary

    19.31
  • Lock-Btn

    Recursive Function to Convert Decimal to Hexadecimal

    14.48
  • Lock-Btn

    Practice Question on Recursion

    5.27
  • Lock-Btn

    GATE 2018 Question on Recursion

    11.31
  • Lock-Btn

    GATE 2017 Question on Recursion

    13.32
  • Lock-Btn

    GATE 2016 Question on Recursion

    9.08
  • Lock-Btn

    GATE 2019 Question on Recursion

    6.03
  • Lock-Btn

    Implementing 2:1 Mux Using 4:1 Mux

    8.4
  • Lock-Btn

    2:1 Multiplexer as Universal Logic Circuit

    16.03
  • Lock-Btn

    4:1 Multiplexer as Universal Logic Gate

    5.52
  • Lock-Btn

    Gate Problems on Mux, Decoder and Decoder

    29.13
  • Lock-Btn

    Introduction to Sequential Logic Circuit

    14.44
  • Lock-Btn

    NOR Latch

    14.54
  • Lock-Btn

    NAND Latch

    10.32
  • Lock-Btn

    Pointers Fundamentals

    18.5
  • Lock-Btn

    Data Type of Pointer

    18.49
  • Lock-Btn

    Demonstration of Pointers Using C Program

    13.13
  • Lock-Btn

    Example Program 1 on Pointers

    9.23
  • Lock-Btn

    Example Program 2 on Pointers

    13.33
  • Lock-Btn

    Example Program 3 on Pointers

    11.55
  • Lock-Btn

    Passing Address to Function Call by Address

    10.17
  • Lock-Btn

    Problem with RS Latch

    17.43
  • Lock-Btn

    Delay Latch/Flip Flop

    4.49
  • Lock-Btn

    JK Latch and T- Latch

    7.48
  • Lock-Btn

    Excitation Table for all Latches/Flip Flops

    19.52
  • Lock-Btn

    Latch/Flip Flop Conversion Concept

    23.22
  • Lock-Btn

    SR Latch to JK Latch Conversion

    18.09
  • Lock-Btn

    Call by Address Example 1

    13.21
  • Lock-Btn

    Call by Address Example 2

    10.19
  • Lock-Btn

    Swapping Value of Two Variables Using Call by Address

    7.08
  • Lock-Btn

    GATE 2015 Question on Pointers

    8.04
  • Lock-Btn

    GATE 2016 Question on Pointers

    11.16
  • Lock-Btn

    Relation Between Array and Pointer - Part 1

    18.54
  • Lock-Btn

    Relation Between Array and Pointer - Part 2

    10.43
  • Lock-Btn

    D Latch to JK Latch Conversion

    8.58
  • Lock-Btn

    D Latch to T Latch Conversion

    6.46
  • Lock-Btn

    Concept of Triggering

    14.17
  • Lock-Btn

    Difference Between Latch and Flipflop

    10.59
  • Lock-Btn

    Behaviour of Flip Flop in Toggle Mode

    13.19
  • Lock-Btn

    Race Around Condition in JK Latch

    14.44
  • Lock-Btn

    Master-Slave JK Flip Flop

    9.03
  • Lock-Btn

    Introduction to Shift Register

    9.17
  • Lock-Btn

    Traverse Array by Using Pointer

    15.2
  • Lock-Btn

    GATE 2019 Question on Array and Pointers - Part 1

    4.47
  • Lock-Btn

    GATE 2019 Question on Array and Pointers - Part 2

    10.56
  • Lock-Btn

    Pass Array to Function

    17.58
  • Lock-Btn

    Creating Variables Using Malloc

    27.17
  • Lock-Btn

    Create Array Using Malloc

    17.07
  • Lock-Btn

    Demonstration Program for Creating Array Using Pointer

    7.27
  • Lock-Btn

    Two Dimension and Pointer

    25.32
  • Lock-Btn

    Classification of Shift Register

    28.48
  • Lock-Btn

    Ring Counter

    17.46
  • Lock-Btn

    Twisted Ring Counter

    14.12
  • Lock-Btn

    Introduction to Asynchronous Counter

    10.03
  • Lock-Btn

    Asynchronous Up Counter

    15.14
  • Lock-Btn

    Asynchronous Down Counter

    19.45
  • Lock-Btn

    Demonstration Program of 2-Dimension Array and Pointers

    11.08
  • Lock-Btn

    Pointer to Pointer

    7.58
  • Lock-Btn

    Pointer to Function

    18.02
  • Lock-Btn

    GATE 2003 Question on Pointer

    12.09
  • Lock-Btn

    Gate 2003 Question on Pointer - Part 2

    9.59
  • Lock-Btn

    GATE 2000 Question on Pointer

    15.31
  • Lock-Btn

    Asynchronous Up/Down Counter

    14.1
  • Lock-Btn

    Introduction To Asynchronous MOD Counter

    17.3
  • Lock-Btn

    Designing Asynchronous MOD 10 Counter

    11.53
  • Lock-Btn

    Introduction to Synchronous Counter

    11.55
  • Lock-Btn

    Designing Synchronous Counter - Part 1

    12.59
  • Lock-Btn

    Designing Synchronous Counter - Part 2

    15.03
  • Lock-Btn

    Finite State Machine

    10.45
  • Lock-Btn

    Char Datatype Fundamentals

    19.35
  • Lock-Btn

    String Fundamentals Part 01

    5.47
  • Lock-Btn

    String Functions Part 01

    12.56
  • Lock-Btn

    Array of Char and Pointers

    11.47
  • Lock-Btn

    GATE 2011 Question on Array of Char

    9.4
  • Lock-Btn

    GATE 2002, 2008, 2017 Question on Array of Char

    21.37
  • Lock-Btn

    Gate 2017 Question on Array of Char

    8.42
  • Lock-Btn

    Non Overlapping Sequence Detector

    16.52
  • Lock-Btn

    Overlapping Sequence Detector

    28.48
  • Lock-Btn

    Gate Numericals Based on Sequential Logic Circuit

    33.18
  • Lock-Btn

    Gate Numericals on FSM

    22.36
  • Lock-Btn

    Structure Fundamental - Part 01

    20.57
  • Lock-Btn

    Structure Fundamental - Part 02

    4.1
  • Lock-Btn

    Structure Declaration Using Typedef

    5.22
  • Lock-Btn

    Initialize a Structure

    10.37
  • Lock-Btn

    Demonstration Program on Structures

    8.23
  • Lock-Btn

    Pointer to Structure

    19.39
  • Lock-Btn

    GATE 2018 Question on Structures

    10.34
  • Lock-Btn

    Self Referential Structure

    19.05
  • Lock-Btn

    Data Structure Introduction

    10.52
  • Lock-Btn

    Comparison of Link List with Arrays

    18.38
  • Lock-Btn

    Types of Link List

    6.47
  • Lock-Btn

    Singly Link List Program Part 1

    44.1
  • Lock-Btn

    Singly Link List Program Part 2

    12.53
  • Lock-Btn

    Singly Link List Program Part 3

    31.34
  • Lock-Btn

    Circular Link List Program Part 1

    26.14
  • Lock-Btn

    Circular Link List Program Part 2

    15.46
  • Lock-Btn

    Doubly Link List Program Part 1

    33.09
  • Lock-Btn

    Doubly Link List Program Part 2

    10.21
  • Lock-Btn

    Doubly Link List Program Part 3

    5.57
  • Lock-Btn

    Doubly Link List Program Part 4

    18.33
  • Lock-Btn

    Print Singly Link List in Reverse Order

    18.06
  • Lock-Btn

    Convert Singly Link List in Reverse Order

    19.07
  • Lock-Btn

    GATE Questions on Link List Part 1

    34.29
  • Lock-Btn

    GATE Questions on Link List Part 2

    16.4
  • Lock-Btn

    Binary Search Tree Fundamentals

    33.22
  • Lock-Btn

    Terms Used in Binary Tree

    17.51
  • Lock-Btn

    Stack Data Structure

    22.14
  • Lock-Btn

    Linear Queue Using Array

    29.49
  • Lock-Btn

    Circular Queue Using Array

    23.17
  • Lock-Btn

    Queue Using Link List

    17.05
  • Lock-Btn

    Binary Tree Program to Insert Node

    35.33
  • Lock-Btn

    Binary Tree Traversal

    28.23
  • Lock-Btn

    Recursive Functions for Inorder Preorder and Postorder Part 1

    35.15
  • Lock-Btn

    Count Leaf Nodes in a Binary Tree

    31.12
  • Lock-Btn

    Count Number of Non Leaf Nodes in Binary Tree

    16.51
  • Lock-Btn

    Construct Binary Tree from Traversal Outputs

    34.52
  • Lock-Btn

    Delete a Node from Binary Tree

    29.28
  • Lock-Btn

    GATE 1995, 1996 Questions on Binary Tree

    9.17
  • Lock-Btn

    GATE 1997, 1998, 2000 Question on Binary Tree

    21.07
  • Lock-Btn

    GATE 2018 Question on Binary Tree

    6.29
  • Lock-Btn

    Multiway Search Tree Part 1

    32.24
  • Lock-Btn

    Multiway Search Tree Part 2

    30.35
  • Lock-Btn

    Multiway Search Tree Part 3

    13.01
  • Lock-Btn

    AVL Tree Introduction

    25.31
  • Lock-Btn

    Rotation Algorithm for AVL Tree

    16.07
  • Lock-Btn

    Multiway Search Tree Part 4

    7.21
  • Lock-Btn

    B+ Tree

    21.28
  • Lock-Btn

    Construction of B+ Tree

    22.24
  • Lock-Btn

    Application of B+ Tree

    9.29
  • Lock-Btn

    GATE Questions on Multiway Tree

    28.54
  • Lock-Btn

    Construction of AVL Tree Example 1

    20.57
  • Lock-Btn

    Construction of AVL Tree Example 2

    22.18
  • Lock-Btn

    Infix, Prefix and Postfix Notation

    33.01
  • Lock-Btn

    Expression Tree

    15.21
  • Lock-Btn

    Algorithm to Evaluate Postfix Expression

    22.4
  • Lock-Btn

    Binary Heap Introduction

    25.09
  • Lock-Btn

    Construction of Max Heap Part 1

    29.34
  • Lock-Btn

    Infix to Postfix Conversion Algorithm Part 1

    47.22
  • Lock-Btn

    Infix to Postfix Conversion Algorithm Part 2

    7.51
  • Lock-Btn

    GATE Questions on Expression Evaluation

    29.41
  • Lock-Btn

    GATE 2018 Question on Expression Tree

    10.18
  • Lock-Btn

    Construction of Max Heap Part 2

    6.13
  • Lock-Btn

    GATE 2009 2014 2001 2015 Question on Binary Heap

    19.57
  • Lock-Btn

    GATE 2011 2009 Question on Binary Heap

    7.19
  • Lock-Btn

    Graph Fundamentals

    28.05
  • Lock-Btn

    DFS Graph Traversal

    26.13
  • Lock-Btn

    BFS Graph Traversal

    13.39
  • Lock-Btn

    DFS Algorithm

    34.12
  • Lock-Btn

    BFS Algorithm

    34.23
  • Lock-Btn

    Types of Edges in DFS Traversal

    30.08
  • Lock-Btn

    GATE 2006 Question 1 on DFS Traversal

    9.5
  • Lock-Btn

    GATE 2008 Question on DFS Traversal

    6.32
  • Lock-Btn

    Introduction Registered Organisation Memory Basics

    24.51
  • Lock-Btn

    Introduction to Register Set

    17.34
  • Lock-Btn

    Single Accumulator Organization : Size 1

    18.39
  • Lock-Btn

    Comparison of Algorithm and Program

    13.14
  • Lock-Btn

    Characteristics of Algorithm

    10.25
  • Lock-Btn

    How to Write Algorithm

    8.38
  • Lock-Btn

    How to Analyse Algorithm

    10.26
  • Lock-Btn

    Analyze Algorithm by Frequency Count Method Part 1

    14.05
  • Lock-Btn

    Analyze Algorithm by Frequency Count Method Part 2

    21.31
  • Lock-Btn

    Analyze Algorithm by Frequency Count Method Part 3

    10.26
  • Lock-Btn

    Single Accumulator Organization : Purpose 2

    26.5
  • Lock-Btn

    Single Accumulator Organization : Connections 3

    21.41
  • Lock-Btn

    General Register Organization 1

    17.34
  • Lock-Btn

    General Register Organization 2

    14.23
  • Lock-Btn

    Classes of Functions and Growth Rate

    9.31
  • Lock-Btn

    Asymptotic Notation Part 1

    31.03
  • Lock-Btn

    Asymptotic Notation Part 2

    12.06
  • Lock-Btn

    Asymptotic Notation Part 3

    14.5
  • Lock-Btn

    General Register Organization 3

    8.11
  • Lock-Btn

    Flag Register

    23.16
  • Lock-Btn

    Stack Organization 1

    29.07
  • Lock-Btn

    Properties of Asymptotic Notations

    21.05
  • Lock-Btn

    Exercises Using Properties of Asymptotic Notations - Part 1

    10.29
  • Lock-Btn

    Exercises Using Properties of Asymptotic Notations - Part 2

    14.57
  • Lock-Btn

    Comparing Functions

    31.08
  • Lock-Btn

    Best Case, Worst Case and Average Case of Algorithm

    20.29
  • Lock-Btn

    Stack Organization 2

    9.35
  • Lock-Btn

    Instruction Cycle 1

    11.52
  • Lock-Btn

    Instruction Cycle 2

    15.14
  • Lock-Btn

    Instruction Cycle 3

    12.01
  • Lock-Btn

    Instruction Formats : Number of Operands 1

    16.2
  • Lock-Btn

    Recurrence Relation for Decreasing Function Part 1

    18.24
  • Lock-Btn

    Recurrence Relation for Decreasing Function Part 2

    16.59
  • Lock-Btn

    Recurrence Relation for Decreasing Function Part 3

    16.4
  • Lock-Btn

    Summary of Decreasing Function

    27.42
  • Lock-Btn

    Instruction Formats : Number of Operands 2

    15.41
  • Lock-Btn

    Instruction Formats : Number of Operands 3

    14.53
  • Lock-Btn

    Instruction Formats : Location of the Operand 1

    10.29
  • Lock-Btn

    Instruction Formats : Location of the Operand 2

    17.59
  • Lock-Btn

    Tree Method to Analyze Recurrence Relation

    25.56
  • Lock-Btn

    Recurrence Relation for Dividing Function Part 1

    15.46
  • Lock-Btn

    Recurrence Relation for Dividing Function Part 2

    10.23
  • Lock-Btn

    Recurrence Relation for Dividing Function Part 3

    14.08
  • Lock-Btn

    Recurrence Relation for Dividing Function Part 4

    14.33
  • Lock-Btn

    Instruction Formats : Location of the Operand 3

    16.54
  • Lock-Btn

    Instruction Formats : Location of the Operand 4

    16.5
  • Lock-Btn

    Instruction Formats : Sub Routine Call and Return

    22.31
  • Lock-Btn

    Instruction Formats : Register Reference Instructions

    23.25
  • Lock-Btn

    Instruction Formats : I O Reference Instructions

    11.28
  • Lock-Btn

    Master's Theorem

    18.24
  • Lock-Btn

    Exercises Solved Using Master's Theorem

    12.5
  • Lock-Btn

    More Examples of Recurrence Relations Part 1

    15.41
  • Lock-Btn

    More Examples of Recurrence Relations Part 2

    9.46
  • Lock-Btn

    Types of Instructions1

    18.57
  • Lock-Btn

    Types of Instructions2

    14.59
  • Lock-Btn

    Types of Instructions 3

    13.2
  • Lock-Btn

    Binary Search Fundamentals

    26.36
  • Lock-Btn

    Binary Search Non Recursive Algorithm

    21.57
  • Lock-Btn

    Binary Search Recursive Algorithm

    18.38
  • Lock-Btn

    Gate Questions on Binary Search

    25.5
  • Lock-Btn

    Addressing Modes 1

    16.08
  • Lock-Btn

    Addressing Modes 2

    15.49
  • Lock-Btn

    Addressing Modes 3

    17.53
  • Lock-Btn

    Control Unit 1

    12
  • Lock-Btn

    Control Unit 2

    17.22
  • Lock-Btn

    Merge Sort Part 1

    28.5
  • Lock-Btn

    Merge Sort Part 2

    32.16
  • Lock-Btn

    Control Unit 3

    22.29
  • Lock-Btn

    ALU Design 1

    16.47
  • Lock-Btn

    ALU Design 2

    15.08
  • Lock-Btn

    ALU Design 3

    28.02
  • Lock-Btn

    Time Complexity of Merge Sort

    17.02
  • Lock-Btn

    Quick Sort Part 1

    22.3
  • Lock-Btn

    Quick Sort Part 2

    19.33
  • Lock-Btn

    Model Gate Question On Instruction Size

    15.46
  • Lock-Btn

    GATE Question 1

    5.41
  • Lock-Btn

    GATE Question 2

    6.43
  • Lock-Btn

    GATE Question 3

    5.02
  • Lock-Btn

    GATE Question 4

    4.1
  • Lock-Btn

    GATE Question 5

    7.41
  • Lock-Btn

    GATE Question 6

    8.1
  • Lock-Btn

    GATE Question 7

    20.15
  • Lock-Btn

    Quick Sort Part 3

    24.09
  • Lock-Btn

    Quick Sort Part 4

    12.11
  • Lock-Btn

    Time Complexity of Quick Sort

    19.24
  • Lock-Btn

    Comparison of Merge Sort and Quick Sort

    15.1
  • Lock-Btn

    GATE Question 8

    14.13
  • Lock-Btn

    GATE Question 9

    11.13
  • Lock-Btn

    GATE Question 10

    5.12
  • Lock-Btn

    GATE Question 11

    12.13
  • Lock-Btn

    GATE Question 12

    4.38
  • Lock-Btn

    GATE Question 13

    9.55
  • Lock-Btn

    GATE Question 14

    3.23
  • Lock-Btn

    GATE Question 15

    5.08
  • Lock-Btn

    GATE Question 16

    10.57
  • Lock-Btn

    GATE Question 17

    10.05
  • Lock-Btn

    GATE Question 18

    9.1
  • Lock-Btn

    GATE Question 19

    11.34
  • Lock-Btn

    GATE Question 20

    13.58
  • Lock-Btn

    Gate Questions on Quick Sort Part 1

    20.11
  • Lock-Btn

    Gate Questions on Quick Sort Part 2

    9.4
  • Lock-Btn

    Gate Questions on Quick Sort Part 3

    13.45
  • Lock-Btn

    Introduction To Memory Hierarchy (Part 1)

    18.24
  • Lock-Btn

    Introduction To Memory Hierarchy (Part 2)

    8.45
  • Lock-Btn

    Introduction to RAM and ROM

    18.43
  • Lock-Btn

    Memory Address Mapping 1

    26.2
  • Lock-Btn

    Bubble Sort

    23.46
  • Lock-Btn

    Selection Sort

    25.39
  • Lock-Btn

    Insertion Sort Part 1

    15.43
  • Lock-Btn

    Insertion Sort Part 2

    13.38
  • Lock-Btn

    Memory Address Mapping 2

    22.56
  • Lock-Btn

    Memory Address Mapping 3

    7.57
  • Lock-Btn

    Memory Address Mapping 4

    8.01
  • Lock-Btn

    Memory Address Mapping 5

    6.17
  • Lock-Btn

    Locality of Reference 1

    14.27
  • Lock-Btn

    Locality of Reference 2

    7.47
  • Lock-Btn

    Fundamentals of Heap

    18.31
  • Lock-Btn

    Stage 1 of Heap Sort

    21.37
  • Lock-Btn

    Stage 2 of Heap Sort

    12.35
  • Lock-Btn

    Analysis of Heap Sort Part 1

    14.11
  • Lock-Btn

    Analysis of Heap Sort Part 2

    22.05
  • Lock-Btn

    Average Memory Access Time

    11.17
  • Lock-Btn

    Cache Address Mapping: Direct Mapping 1

    17.21
  • Lock-Btn

    Cache Address Mapping: Direct Mapping 2

    13.02
  • Lock-Btn

    Cache Address Mapping: Direct Mapping 3

    8.46
  • Lock-Btn

    Cache Address Mapping: Set Associative Mapping 1

    16.11
  • Lock-Btn

    Knapsack Problem by Greedy Method Part 1

    17.58
  • Lock-Btn

    Knapsack Problem by Greedy Method Part 2

    18.1
  • Lock-Btn

    Optimal Merge Patterns

    13.07
  • Lock-Btn

    Job Sequencing with Deadlines

    28.54
  • Lock-Btn

    Cache Address Mapping: Set Associative Mapping 2

    7.34
  • Lock-Btn

    Cache Address Mapping: Set Associative Mapping 3

    8.28
  • Lock-Btn

    Associative Mapping

    15.28
  • Lock-Btn

    Writing into Cache

    8.38
  • Lock-Btn

    Cache Initialization

    4.54
  • Lock-Btn

    Virtual Memory 1

    9.22
  • Lock-Btn

    Virtual Memory 2

    12.33
  • Lock-Btn

    Virtual Memory 3

    24.22
  • Lock-Btn

    Minimum Cost Spanning Tree of a Graph Using Kruskal's Algorithm Part 1

    17.01
  • Lock-Btn

    Minimum Cost Spanning Tree of a Graph Using Kruskal's Algorithm Part 2

    8.44
  • Lock-Btn

    Minimum Cost Spanning Tree of a Graph Using Prim's Algorithm Part 1

    21.3
  • Lock-Btn

    Minimum Cost Spanning Tree of a Graph Using Prim's Algorithm Part 2

    15.26
  • Lock-Btn

    Virtual Memory 4

    9.18
  • Lock-Btn

    Memory Management System

    10.11
  • Lock-Btn

    Memory Gate Question 1

    7.11
  • Lock-Btn

    Memory Gate Question 2

    4.53
  • Lock-Btn

    Memory Gate Question 3

    7.33
  • Lock-Btn

    Memory Gate Question 4

    13.06
  • Lock-Btn

    Memory Gate Question 5

    14.58
  • Lock-Btn

    Memory Gate Question 6

    9
  • Lock-Btn

    Gate Questions on Graph Part 1

    17
  • Lock-Btn

    Gate Questions on Graph Part 2

    13.51
  • Lock-Btn

    Gate Questions on Graph Part 3

    12.38
  • Lock-Btn

    Gate Questions on Graph Part 4

    19.39
  • Lock-Btn

    Memory Gate Question 7

    10.18
  • Lock-Btn

    Memory Gate Question 8

    5.09
  • Lock-Btn

    Memory Gate Question 9

    7.52
  • Lock-Btn

    Memory Gate Question 10

    3.12
  • Lock-Btn

    Memory Gate Question 11

    6.42
  • Lock-Btn

    Memory Gate Question 12

    4.05
  • Lock-Btn

    Memory Gate Question 13

    10.12
  • Lock-Btn

    Memory Gate Question 14

    3.59
  • Lock-Btn

    Prim's Algorithm

    19.07
  • Lock-Btn

    Shortest Distance Algorithm Part 1

    25.23
  • Lock-Btn

    Shortest Distance Algorithm Part 2

    15.18
  • Lock-Btn

    Huffman Coding for Data Compression

    20.09
  • Lock-Btn

    Gate Question on Huffman Coding

    12.45
  • Lock-Btn

    Memory Gate Question 15

    3.13
  • Lock-Btn

    Memory Gate Question 16

    3.56
  • Lock-Btn

    Memory Gate Question 17

    17.18
  • Lock-Btn

    Memory Gate Question 18

    8.56
  • Lock-Btn

    Memory Gate Question 19

    3.57
  • Lock-Btn

    Memory Gate Question 20

    24.49
  • Lock-Btn

    Memory Gate Question 21

    7.12
  • Lock-Btn

    Memory Gate Question 22

    9.29
  • Lock-Btn

    Dynamic Algorithm Introduction

    10.45
  • Lock-Btn

    All Pair Shortest Path Algorithm Part 1

    14.51
  • Lock-Btn

    All Pair Shortest Path Algorithm Part 2

    12.07
  • Lock-Btn

    LCS Problem

    29.08
  • Lock-Btn

    Memory Gate Question 23

    8.53
  • Lock-Btn

    Memory Gate Question 24

    4.54
  • Lock-Btn

    Memory Gate Question 25

    4.44
  • Lock-Btn

    Memory Gate Question 26

    8.15
  • Lock-Btn

    Memory Gate Question 27

    6.07
  • Lock-Btn

    Associative Mapping

    13.32
  • Lock-Btn

    Bellman Ford Algorithm Part 1

    27.21
  • Lock-Btn

    Bellman Ford Algorithm Part 2

    20.5
  • Lock-Btn

    Matrix Chain Multiplication Part 1

    14.32
  • Lock-Btn

    Matrix Chain Multiplication Part 2

    29.46
  • Lock-Btn

    Introduction to Pipelining: Throughput

    8.48
  • Lock-Btn

    Introduction to Pipelining: Parallel Processing

    11.55
  • Lock-Btn

    Data Pipeline 1

    10.04
  • Lock-Btn

    Data Pipeline 2

    18.26
  • Lock-Btn

    Speed Up

    23.01
  • Lock-Btn

    Speed Up Example

    6.02
  • Lock-Btn

    Instruction Pipeline 1

    13.14
  • Lock-Btn

    Matrix Chain Multiplication Part 3

    23.59
  • Lock-Btn

    Multistage Graph Part 1

    10.02
  • Lock-Btn

    Multistage Graph Part 2

    28.58
  • Lock-Btn

    Instruction Pipeline 2

    11.25
  • Lock-Btn

    Hazards in Pipeline 1

    8.29
  • Lock-Btn

    Hazards in Pipeline 2

    9.4
  • Lock-Btn

    Hazards in Pipeline 3

    8.5
  • Lock-Btn

    Handling Hazards 1

    6.16
  • Lock-Btn

    Knapsack Problem Using Dynamic Method Part 1

    25.5
  • Lock-Btn

    Knapsack Problem Using Dynamic Method Part 2

    20.27
  • Lock-Btn

    Travelling Salesman Problem Introduction

    19.03
  • Lock-Btn

    Travelling Salesman Problem Using Dynamic Method

    37.05
  • Lock-Btn

    Handling Hazards 2

    14.46
  • Lock-Btn

    Handling Hazards 3

    6.15
  • Lock-Btn

    Handling Hazards 4

    18.17
  • Lock-Btn

    Important Formulae

    12.43
  • Lock-Btn

    Example 1

    6.13
  • Lock-Btn

    Pipelining Gate Question 1

    8.51
  • Lock-Btn

    N-Queen Problem Part 1

    22.05
  • Lock-Btn

    N-Queen Problem Part 2

    29.57
  • Lock-Btn

    N Queen Problem Part 3

    34.13
  • Lock-Btn

    Pipelining Gate Question 2

    3.43
  • Lock-Btn

    Pipelining Gate Question 3

    22.3
  • Lock-Btn

    Pipelining Gate Question 4

    19.13
  • Lock-Btn

    Pipelining Gate Question 5

    3.41
  • Lock-Btn

    Pipelining Gate Question 6

    4.38
  • Lock-Btn

    Pipelining Gate Question 7

    6.41
  • Lock-Btn

    Pipelining Gate Question 8

    8.02
  • Lock-Btn

    Pipelining Gate Question 9

    13.5
  • Lock-Btn

    Graph Color Problem Part 1

    15.55
  • Lock-Btn

    Graph Color Problem Part 2

    11.08
  • Lock-Btn

    Graph Color Problem Part 3

    13.27
  • Lock-Btn

    Hamiltonion Cycle Problem Part 1

    12.02
  • Lock-Btn

    Hamiltonion Cycle Problem Part 2

    21.19
  • Lock-Btn

    Pipelining Gate Question 10

    5.04
  • Lock-Btn

    Pipelining Gate Question 11

    6.29
  • Lock-Btn

    Pipelining Gate Question 12

    6.52
  • Lock-Btn

    Pipelining Gate Question 13

    4.29
  • Lock-Btn

    Pipelining Gate Question 14

    9.05
  • Lock-Btn

    Pipelining Gate Question 15

    5.03
  • Lock-Btn

    Pipelining Gate Question 16

    9.28
  • Lock-Btn

    P and NP Class Problems

    17.35
  • Lock-Btn

    Decision Problem and Optimization Problem

    13.3
  • Lock-Btn

    Reducing One Problem to Other Problem

    26.59
  • Lock-Btn

    NP Hard and NP Complete

    18.35
  • Lock-Btn

    Prove that a Clique Problem is NP Complete Part 1

    6.51
  • Lock-Btn

    IO Organization Introduction

    12.54
  • Lock-Btn

    Interface Design

    28.24
  • Lock-Btn

    Bus System Design : Distinct IO

    7.34
  • Lock-Btn

    Bus System Design : Isolated IO

    7.48
  • Lock-Btn

    Bus System Design : Memory Mapped IO

    6.31
  • Lock-Btn

    Asynchronous Parallel Transfers

    20.58
  • Lock-Btn

    Asynchronous Serial Transfers

    10.12
  • Lock-Btn

    Types Of Errors And Baud Rate

    12.57
  • Lock-Btn

    Prove that a Clique Problem is NP Complete Part 2

    27.35
  • Lock-Btn

    Gate Questions on NP Completeness Part 1

    13.51
  • Lock-Btn

    Gate Questions on NP Completeness Part 2

    5.2
  • Lock-Btn

    Modes Of Transfers Programmed IO

    17.4
  • Lock-Btn

    Modes Of Transfers Interrupt initiated

    14.43
  • Lock-Btn

    Types of Interrupts 1

    13.48
  • Lock-Btn

    Types of Interrupts 2

    8.04
  • Lock-Btn

    Hash Search Introduction

    25.05
  • Lock-Btn

    Hash Search Collision Handling

    13.18
  • Lock-Btn

    Different Methods of Hashing

    19.25
  • Lock-Btn

    Exercise on Hash Search

    8.21
  • Lock-Btn

    Gate Questions on Hash Search Part 1

    20.54
  • Lock-Btn

    Vectored Interrupts

    13.32
  • Lock-Btn

    Priority Interrupts 1

    17.28
  • Lock-Btn

    Priority Interrupts 2 : parallel Priorities

    24.06
  • Lock-Btn

    DMA 1

    10.12
  • Lock-Btn

    DMA Controller

    22.07
  • Lock-Btn

    IO Organization GATE Question 1

    8.59
  • Lock-Btn

    IO Organization GATE Question 2

    6.43
  • Lock-Btn

    IO Organization GATE Question 3

    3.1
  • Lock-Btn

    IO Organization GATE Question 4

    8.52
  • Lock-Btn

    IO Organization GATE Question 5

    8.45
  • Lock-Btn

    IO Organization GATE Question 6

    6.35
  • Lock-Btn

    IO Organization GATE Question 7

    6.36
  • Lock-Btn

    IO Organization GATE Question 8

    4.4
  • Lock-Btn

    IO Organization GATE Question 9

    4.5
  • Lock-Btn

    Gate Questions on Hash Search Part 2

    6.33
  • Lock-Btn

    Gate Questions on Hash Search Part 3

    11.32
  • Lock-Btn

    What is Compiler

    1.4
  • Lock-Btn

    Analysis and Synthesis Model

    4.29
  • Lock-Btn

    Language Processor-I

    6.23
  • Lock-Btn

    Language Processor-II

    5.08
  • Lock-Btn

    Phases of Compiler

    3.59
  • Lock-Btn

    Lexical Analysis

    3.51
  • Lock-Btn

    Syntax Analysis

    4.01
  • Lock-Btn

    Grammar

    6.31
  • Lock-Btn

    Introduction

    6.25
  • Lock-Btn

    Computer System Organization

    16.16
  • Lock-Btn

    Computer System Structure

    5.07
  • Lock-Btn

    Definition of Operating System

    15.17
  • Lock-Btn

    Proposition and Logical Connectives

    42.05
  • Lock-Btn

    Logical Equivalences-1

    28.32
  • Lock-Btn

    Logical Equivalences-2

    33.18
  • Lock-Btn

    Normal Forms

    32.26
  • Lock-Btn

    Responsibility of Operating System

    18.16
  • Lock-Btn

    Properties of Operating System

    3.47
  • Lock-Btn

    Batch Processing System

    7.02
  • Lock-Btn

    Spooling

    7.25
  • Lock-Btn

    Semantic Analysis-I

    5.45
  • Lock-Btn

    Semantic Analysis-II

    2.09
  • Lock-Btn

    Intermediate Code Generation

    3.53
  • Lock-Btn

    Code Optimization

    5.03
  • Lock-Btn

    Code Generation

    4.13
  • Lock-Btn

    Lexical Analyzer

    2.17
  • Lock-Btn

    Responsibility of Lexical Analysis

    4.39
  • Lock-Btn

    Token Pattern and Lexemes

    8.42
  • Lock-Btn

    Multiprogramming

    7.11
  • Lock-Btn

    Multitasking

    7.37
  • Lock-Btn

    Real Time and Distributed System

    5.09
  • Lock-Btn

    User Mode and Kernel Mode

    12.02
  • Lock-Btn

    Operating System Services

    4.11
  • Lock-Btn

    System Call

    3.43
  • Lock-Btn

    Predicates and Quantifiers

    39.02
  • Lock-Btn

    Nested Quantifiers

    39.02
  • Lock-Btn

    C and C ++ Tokens

    8.36
  • Lock-Btn

    Specification of Token

    1.26
  • Lock-Btn

    Basic of String and Language

    7.04
  • Lock-Btn

    Deterministic Finite State Machine

    16.4
  • Lock-Btn

    Properties of Nested Quantifiers

    41.05
  • Lock-Btn

    English to Logical Statements Conversion

    31.2
  • Lock-Btn

    Topic Covered

    4.3
  • Lock-Btn

    Definition of Process

    5.51
  • Lock-Btn

    Memory Layout

    7.08
  • Lock-Btn

    Process Creation and Termination Command

    8.52
  • Lock-Btn

    Fork Command Example

    5.33
  • Lock-Btn

    Fork Command GATE Question Part-I

    6.19
  • Lock-Btn

    Fork Command GATE Question Part-ll

    5.11
  • Lock-Btn

    NFA

    9.19
  • Lock-Btn

    Regular Expression

    10.17
  • Lock-Btn

    Finite Automata for Token Generation

    4.32
  • Lock-Btn

    Context Free Grammar

    4.2
  • Lock-Btn

    Derivation and Parse Tree

    3.54
  • Lock-Btn

    Sentential Form

    2.41
  • Lock-Btn

    Problem Solving on Process State Transition Diagram

    12.26
  • Lock-Btn

    Process State Transition Diagram

    17.19
  • Lock-Btn

    Context Switching

    10.56
  • Lock-Btn

    Argument

    20.14
  • Lock-Btn

    Rules of Inferences for Propositional Logic

    33.28
  • Lock-Btn

    Syntax of Programming Language

    14.52
  • Lock-Btn

    Leftmost and Rightmost Derivation

    6.44
  • Lock-Btn

    Ambiguous Grammar

    5.11
  • Lock-Btn

    Associativity of Operator

    10.02
  • Lock-Btn

    Rules of Inferences for Quantified statements

    30.19
  • Lock-Btn

    Logical Reasoning

    32.24
  • Lock-Btn

    Schedulers

    23.55
  • Lock-Btn

    Thread

    27.12
  • Lock-Btn

    Problem Solving Thread

    13.53
  • Lock-Btn

    Precedence of Operator

    8.31
  • Lock-Btn

    Left Recursion

    3.58
  • Lock-Btn

    Removal of Left Recursion

    9.16
  • Lock-Btn

    Indirect Left Recursion

    10.14
  • Lock-Btn

    Left Factoring of Grammar

    4.59
  • Lock-Btn

    Non Context Free Grammar

    5.01
  • Lock-Btn

    Scheduling Policies and Optimization Criteria

    10.32
  • Lock-Btn

    FCFS Scheduling Policy

    9.21
  • Lock-Btn

    Convoy Effect

    5.33
  • Lock-Btn

    SJF Scheduling Algorithm

    13.26
  • Lock-Btn

    Basics of Permutation and Combinations

    36.51
  • Lock-Btn

    Combinations

    40.2
  • Lock-Btn

    Parsing

    6.14
  • Lock-Btn

    Top Down Parsing

    4.26
  • Lock-Btn

    Recursive Descent Parser

    6.44
  • Lock-Btn

    Predictive Parsing

    18.52
  • Lock-Btn

    Permutations

    40.55
  • Lock-Btn

    Division/Distribution into Groups

    33.32
  • Lock-Btn

    Shortest Remaining Time First

    9.36
  • Lock-Btn

    Dynamic Prediction for SJF

    13.33
  • Lock-Btn

    Highest Response Time Next

    5.51
  • Lock-Btn

    Priority Based Scheduling

    12.26
  • Lock-Btn

    LL(1) Grammar

    3.47
  • Lock-Btn

    Non Recursive Predictive Parser

    4.05
  • Lock-Btn

    First Set Calculation

    12.26
  • Lock-Btn

    First Set Example

    9.11
  • Lock-Btn

    Follow Set

    17.12
  • Lock-Btn

    Round Robin Scheduling Policy

    12.23
  • Lock-Btn

    Multilevel Feedback Queue

    7.31
  • Lock-Btn

    Pigeonhole Principle

    19.02
  • Lock-Btn

    Dearrangement and Inclusion-Exclusion Principle

    21.01
  • Lock-Btn

    Distribution of Identical Objects-1

    37.51
  • Lock-Btn

    Independent and Cooperating Process

    8.31
  • Lock-Btn

    Inconsistency Due to Lack of Synchronization

    12.18
  • Lock-Btn

    Predictive Parsing

    4.22
  • Lock-Btn

    Non-Recursive Predictive Parsing Algorithm

    10.13
  • Lock-Btn

    Identifying LL(1) Grammar

    8.26
  • Lock-Btn

    Bottom up Parsing

    7.2
  • Lock-Btn

    Handle

    5.24
  • Lock-Btn

    Distribution of Identical Objects-2

    32.43
  • Lock-Btn

    Summation

    32.56
  • Lock-Btn

    Race Condition and Critical Section

    8.53
  • Lock-Btn

    Synchronization Mechanism

    7.25
  • Lock-Btn

    Two Process Solution

    20.3
  • Lock-Btn

    Peterson Solution

    12.14
  • Lock-Btn

    LR Parser

    4.19
  • Lock-Btn

    LR(0) Items

    4.57
  • Lock-Btn

    Closure Operation

    7.07
  • Lock-Btn

    Go-to Operation

    5.14
  • Lock-Btn

    Augmented Grammar

    4.44
  • Lock-Btn

    LR(0) Collection

    8.39
  • Lock-Btn

    Common Mistake in LR(0) Collection- I

    6.12
  • Lock-Btn

    Binomial Expansions and Binomial Identities

    21.03
  • Lock-Btn

    Generating Function

    30.03
  • Lock-Btn

    Properties of Generating Functions

    34.53
  • Lock-Btn

    Bakery Algorithm

    9.17
  • Lock-Btn

    Bakery Algorithm Part-II

    10.26
  • Lock-Btn

    Synchronization Hardware

    13.39
  • Lock-Btn

    Common Mistake in LR(0) Collection- II

    7.15
  • Lock-Btn

    Construction of LR(0) Parsing Table Example-I

    7.37
  • Lock-Btn

    Construction of LR(0) Parsing Table Example-II

    6.16
  • Lock-Btn

    Shift-Reduce Conflict

    9.17
  • Lock-Btn

    LR Parsing Model

    3.38
  • Lock-Btn

    Application of Generating Function

    39.02
  • Lock-Btn

    Recurrence Relation

    39.59
  • Lock-Btn

    GATE Question Solution Semaphore

    27.1
  • Lock-Btn

    Producer Consumer Solution Using Semaphore

    7.22
  • Lock-Btn

    Readers Writers Problem

    10.18
  • Lock-Btn

    LR Parsing Algorithm

    6.3
  • Lock-Btn

    LR Parsing Algorithm Demonstration

    8.41
  • Lock-Btn

    SLR

    9.29
  • Lock-Btn

    Construction of SLR Parsing Table Example-I

    7.11
  • Lock-Btn

    Construction of SLR Parsing Table Example-II

    4.22
  • Lock-Btn

    Recurrence Relation Solving Techniques -1

    22.04
  • Lock-Btn

    Recurrence Relation Solving Techniques -2

    31.55
  • Lock-Btn

    Problem Solving on Recurrence Relation

    28.19
  • Lock-Btn

    Dining Philosophers Problem

    8.35
  • Lock-Btn

    Concurrent Execution Bernstein's Conditions

    10.29
  • Lock-Btn

    Fork and Join Construct

    7.2
  • Lock-Btn

    Parbegin and Parend Construct

    9.04
  • Lock-Btn

    Reduce- Reduce Conflict

    12.54
  • Lock-Btn

    SLR Example and Motivation for CLR

    15.06
  • Lock-Btn

    LR(1) Items

    14.52
  • Lock-Btn

    Basics of Sets

    25.35
  • Lock-Btn

    Introduction to Functions

    20.13
  • Lock-Btn

    Types of Functions

    29.38
  • Lock-Btn

    Deadlock Introduction

    9.19
  • Lock-Btn

    Resource Allocation Graph

    7.26
  • Lock-Btn

    Methods of Handling Deadlock

    17.34
  • Lock-Btn

    Resource Allocation Graph Algorithm

    3.06
  • Lock-Btn

    LR(1) Items Example

    7.22
  • Lock-Btn

    Canonical LR(1) collection and LR - CLR Parsing Table Example-I

    11.26
  • Lock-Btn

    Canonical LR(1) Collection Example-II

    11.05
  • Lock-Btn

    Composition of Functions

    24.27
  • Lock-Btn

    Enumeration of Functions

    30
  • Lock-Btn

    Problems on Functions

    20.12
  • Lock-Btn

    GATE Question Discussion

    15.28
  • Lock-Btn

    Banker's Algorithm

    8.13
  • Lock-Btn

    GATE Question Discussion

    11.35
  • Lock-Btn

    Deadlock Detection Criteria

    6.22
  • Lock-Btn

    Canonical LR(1) Collection Example-III

    10.4
  • Lock-Btn

    LALR Parser

    6.47
  • Lock-Btn

    LALR Example-I

    9.02
  • Lock-Btn

    LALR Example-ll

    7.24
  • Lock-Btn

    Problem with Merging in LALR

    16.26
  • Lock-Btn

    Comparison of LR(0), SLR, LR(1) and LALR

    8.57
  • Lock-Btn

    Introduction to Relations

    18.43
  • Lock-Btn

    Operations on Relations

    33.36
  • Lock-Btn

    Types of Relations Part 1

    39.36
  • Lock-Btn

    Semantic Analysis Requirement

    7.06
  • Lock-Btn

    Semantic Analysis

    7.07
  • Lock-Btn

    Attributed Grammar Framework

    4.18
  • Lock-Btn

    Syntax Directed Definition

    4.44
  • Lock-Btn

    Syntax Directed Translation

    3.25
  • Lock-Btn

    Synthesized Attribute

    3.4
  • Lock-Btn

    Syntax Directed Translation Example-I.a

    5.09
  • Lock-Btn

    Syntax Directed Translation Example-I.b

    2.35
  • Lock-Btn

    Basic of Memory Management

    24.28
  • Lock-Btn

    Logical and Physical Address Space

    18.57
  • Lock-Btn

    Types of Relations Part 2

    22.13
  • Lock-Btn

    Relations on Ordered Pairs

    21.57
  • Lock-Btn

    Counting of Relations

    28.52
  • Lock-Btn

    Overlay

    6.08
  • Lock-Btn

    Contiguous Memory Allocation

    14.01
  • Lock-Btn

    Best Fit First Fit Worst Fit

    11.12
  • Lock-Btn

    Problem Solving Best Fit Next Fit and Worst Fit

    11.37
  • Lock-Btn

    Syntax Directed Translation Example-II

    6.44
  • Lock-Btn

    Syntax Directed Translation Example-III

    4.3
  • Lock-Btn

    DFS for Evaluation of Semantic Rule

    5.05
  • Lock-Btn

    Translation Schema Example-I

    8.14
  • Lock-Btn

    Translation Schema Example -II

    4.52
  • Lock-Btn

    Inherited Attribute

    7.29
  • Lock-Btn

    Closures in Relations

    15.41
  • Lock-Btn

    Theorems in Relations

    25
  • Lock-Btn

    Equivalence Relation and Equivalence Class

    13.49
  • Lock-Btn

    Partition of a Set

    13.32
  • Lock-Btn

    Dependency Graph

    4
  • Lock-Btn

    Topological Sort

    8.12
  • Lock-Btn

    Abstract Syntax Tree

    8.29
  • Lock-Btn

    Abstract Syntax Tree-Example

    3.5
  • Lock-Btn

    Abstract Syntax Tree SDD

    7.12
  • Lock-Btn

    S-Attributed Definition

    3.05
  • Lock-Btn

    L- Attributed Definition

    3.46
  • Lock-Btn

    L-Attributed Example

    3.58
  • Lock-Btn

    Fragmentation

    14.33
  • Lock-Btn

    Non Contiguous Memory Allocation- Page and Frame

    19.5
  • Lock-Btn

    Theorems Related to Equivalence Relation

    19.1
  • Lock-Btn

    Partial Ordering

    34
  • Lock-Btn

    Product Partial Ordering

    13.01
  • Lock-Btn

    Page Table

    17.13
  • Lock-Btn

    GATE Question Solving Page Table

    13.05
  • Lock-Btn

    Multilevel Page Table

    14.19
  • Lock-Btn

    Run Time Environment- Introduction

    5.29
  • Lock-Btn

    Procedure

    4.5
  • Lock-Btn

    Activation Tree

    3.34
  • Lock-Btn

    Control Stack

    9.24
  • Lock-Btn

    Scope of the declaration and L-Value and R-value

    6.57
  • Lock-Btn

    Storage Organization

    5.17
  • Lock-Btn

    Hasse Diagram

    27.49
  • Lock-Btn

    Extremal Elements of Hasse Diagram

    31.46
  • Lock-Btn

    Lattice

    23.13
  • Lock-Btn

    Problem Solving Multilevel Page Table

    19.27
  • Lock-Btn

    Translation Lookaside Buffer

    17.09
  • Lock-Btn

    Problem Solving Mapping and TLB Search

    9.24
  • Lock-Btn

    Activation Record

    12.41
  • Lock-Btn

    Storage Allocation Strategies

    2.36
  • Lock-Btn

    Static Allocation

    3.08
  • Lock-Btn

    Stack Allocation

    4.3
  • Lock-Btn

    Dangling References

    5.3
  • Lock-Btn

    Heap Allocation

    6.03
  • Lock-Btn

    Scoping Rule

    6.54
  • Lock-Btn

    Types of Lattices-1

    36.01
  • Lock-Btn

    Types of Lattices-2

    15.44
  • Lock-Btn

    Topological Sort

    13.53
  • Lock-Btn

    Inverted Page Table

    4.24
  • Lock-Btn

    Segmentation

    19.49
  • Lock-Btn

    Blocks

    2.07
  • Lock-Btn

    Lexical-Static Scoping

    4.59
  • Lock-Btn

    Dynamic Scoping Example

    5.46
  • Lock-Btn

    Displays

    4.31
  • Lock-Btn

    Parameter Passing

    4.02
  • Lock-Btn

    Call by Value

    5.2
  • Lock-Btn

    Call by Reference

    6.37
  • Lock-Btn

    Virtual Memory

    9.07
  • Lock-Btn

    Demand Paging

    11.02
  • Lock-Btn

    Introduction to Group Theory

    27.17
  • Lock-Btn

    Order of a Group

    27.18
  • Lock-Btn

    Standard Examples of Group

    20.44
  • Lock-Btn

    Call By Copy Restore

    13.31
  • Lock-Btn

    Call By Name

    10.04
  • Lock-Btn

    Intermediate Code Generation

    4.36
  • Lock-Btn

    Why Intermediate Representation is required

    3.16
  • Lock-Btn

    Different for Intermediate Representation

    3.1
  • Lock-Btn

    Page Fault

    9.53
  • Lock-Btn

    Performance of Demand Paging

    10.47
  • Lock-Btn

    GATE Question Page Fault

    10.33
  • Lock-Btn

    Reference String

    7.09
  • Lock-Btn

    First in First Out Page Replacement Policy

    8.56
  • Lock-Btn

    Properties of a Group

    14.34
  • Lock-Btn

    Power of an Element

    15.01
  • Lock-Btn

    Order of an Element of a Group

    22.11
  • Lock-Btn

    Graphical Representation, Syntax Tree

    5.06
  • Lock-Btn

    Graphical Representation DAG

    3.47
  • Lock-Btn

    Graphical Representation DAG Example

    2.46
  • Lock-Btn

    SDD for DAG

    5.37
  • Lock-Btn

    Data Structure for DAG

    2.12
  • Lock-Btn

    Three Address Code

    3.52
  • Lock-Btn

    Types of 3 -Address Instruction

    2.49
  • Lock-Btn

    Three Address code Example-I

    2.1
  • Lock-Btn

    Three Address Code Example-II

    3.43
  • Lock-Btn

    Three Address Code Example-III

    5
  • Lock-Btn

    Belady's Anomaly

    7.32
  • Lock-Btn

    Optimal Algorithm

    6.1
  • Lock-Btn

    LRU Algorithm

    6.33
  • Lock-Btn

    LRU Implementation

    6.49
  • Lock-Btn

    LRU Second Chance Algorithm

    12.05
  • Lock-Btn

    Cyclic Group and Properties

    28.04
  • Lock-Btn

    Subgroup and Properties

    20.52
  • Lock-Btn

    Normal Subgroups and Properties

    18.33
  • Lock-Btn

    GATE Question Solution

    18.26
  • Lock-Btn

    Trashing

    5.01
  • Lock-Btn

    Three Address Code Example-IV

    6.44
  • Lock-Btn

    Data Structure for TAC

    10.24
  • Lock-Btn

    Single Static Assignment

    5.38
  • Lock-Btn

    Three Address code for Arrays

    19.37
  • Lock-Btn

    File Allocation Method

    22.2
  • Lock-Btn

    Node Structure

    9.42
  • Lock-Btn

    GATE Question INode Structure

    7.14
  • Lock-Btn

    Free Space Management

    9.34
  • Lock-Btn

    Disk Scheduling

    20.5
  • Lock-Btn

    GATE Question Scheduling

    19.02
  • Lock-Btn

    Introduction to Graph

    44.21
  • Lock-Btn

    Special Graphs

    30.4
  • Lock-Btn

    Basic Block

    2.59
  • Lock-Btn

    Leaders

    5.35
  • Lock-Btn

    Flow Graph and Control Graph

    3.48
  • Lock-Btn

    Finding Basic Blocks

    6.07
  • Lock-Btn

    Control Flow Graph Example-I

    4.18
  • Lock-Btn

    Control Flow Graph -Example-ll

    4.12
  • Lock-Btn

    Basic of Optimization

    3.28
  • Lock-Btn

    Types of Optimization

    5.01
  • Lock-Btn

    Graph Operations

    19.57
  • Lock-Btn

    Self Complementary Graph and Isomorphism

    21.52
  • Lock-Btn

    Connectivity in a Graph

    28.46
  • Lock-Btn

    Euler, Hamiltonian and Planar Graphs

    20.21
  • Lock-Btn

    Trees and Spanning Trees

    23.09
  • Lock-Btn

    Enumeration of Graphs

    18.49
  • Lock-Btn

    Graph Numbers

    19.30
  • Lock-Btn

    DAG Representation of Basic Block

    5.22
  • Lock-Btn

    DAG for the Block

    5.08
  • Lock-Btn

    DAG for Basic Block Example

    3.24
  • Lock-Btn

    Copy Propagation

    2.41
  • Lock-Btn

    Applying Common Sub-Expression Removal and Copy Propagation

    4.41
  • Lock-Btn

    Dead Code Elimination

    3.31
  • Lock-Btn

    Arithmetic Simplification, Strength Reduction and Constant Folding

    5.25
  • Lock-Btn

    Peephole Optimization

    7.34
  • Lock-Btn

    Code Motion

    5.01
  • Lock-Btn

    ER Model Introduction

    7.53
  • Lock-Btn

    Attributes of Entity

    13.22
  • Lock-Btn

    Relationship in ER Model

    17.29
  • Lock-Btn

    One to Many Relationship

    19.23
  • Lock-Btn

    Many to Many and One to One Relationship

    14.57
  • Lock-Btn

    Computation

    25.21
  • Lock-Btn

    Defintion of TOC and Formal language

    11.03
  • Lock-Btn

    Grammar

    7.58
  • Lock-Btn

    Automata

    1.59
  • Lock-Btn

    Expressing Power of Automata

    17.37
  • Lock-Btn

    Expressing Power of Automata Question1

    2.04
  • Lock-Btn

    Expressing Power of Automata Question-2

    4.21
  • Lock-Btn

    Limited Memory of FA

    16.28
  • Lock-Btn

    Symbol and Alphabet

    4.18
  • Lock-Btn

    String and String Length

    5.19
  • Lock-Btn

    Relational Model Part 1

    18.09
  • Lock-Btn

    Relational Model Part 2

    12.58
  • Lock-Btn

    Relational Model Part 3

    7.56
  • Lock-Btn

    Strong and Weak Entity

    15.21
  • Lock-Btn

    Example Problem on ER Diagram and Relational Model

    12.1
  • Lock-Btn

    GATE Questions on ER Model Part 1

    10.26
  • Lock-Btn

    GATE Questions on ER Model Part 2

    13.31
  • Lock-Btn

    Recursive Relationship

    18.09
  • Lock-Btn

    Primary Key

    15.1
  • Lock-Btn

    Empty String

    1.56
  • Lock-Btn

    Sub String and Its Type

    12.18
  • Lock-Btn

    Prefix and Suffix

    4.36
  • Lock-Btn

    Reverse of String

    2.07
  • Lock-Btn

    Concatenation of Strings

    2.38
  • Lock-Btn

    Power of Alphabet

    10.11
  • Lock-Btn

    Language

    18.41
  • Lock-Btn

    Finite Automata

    19.4
  • Lock-Btn

    Representation of FA

    4.32
  • Lock-Btn

    Architecture or Block Diagram of FA

    16.24
  • Lock-Btn

    FA -Example 1

    7.41
  • Lock-Btn

    Candidate Key

    8.56
  • Lock-Btn

    Super Key

    16.01
  • Lock-Btn

    Select and Project Operation

    11.58
  • Lock-Btn

    Rename Operation

    10.37
  • Lock-Btn

    Set Operations

    17.32
  • Lock-Btn

    Cartesian Product and Join Operation

    32.01
  • Lock-Btn

    More Examples of JOIN Operation

    22.49
  • Lock-Btn

    Types of Join Inner Join (Theta Join)

    18.05
  • Lock-Btn

    FA -Observations

    17.26
  • Lock-Btn

    Construction of DFA or FA for Finite Languages

    17.18
  • Lock-Btn

    Construction of FA That Including Epsilon

    2.35
  • Lock-Btn

    Construction of FA That Excluding Epsilon

    2.34
  • Lock-Btn

    Construction of FA That Accepts Every String Start With a

    4.23
  • Lock-Btn

    Construction of FA That Accepts Every String Start With ab

    4.27
  • Lock-Btn

    Construction of FA That Accepts Every String Start With bab

    5.38
  • Lock-Btn

    Construction of FA That Accepts Every String Start With aaa

    3.36
  • Lock-Btn

    Construction of FA That Accepts Every String Start With Substring of Length m

    4.2
  • Lock-Btn

    Construction of FA That Accepts Every String Ends With b

    4.18
  • Lock-Btn

    Construction of FA That Accepts Every String Ends With ba

    4.2
  • Lock-Btn

    Construction of FA That Accepts Every String Ends With bab

    5.26
  • Lock-Btn

    Construction of FA That Accepts Every String Ends With Substring of Length m

    4.23
  • Lock-Btn

    Construction of FA That Accepts Every String Contains Sub String b

    2.39
  • Lock-Btn

    Construction of FA That Accepts Every String Contains Sub String ab

    2.34
  • Lock-Btn

    Construction of FA That Accepts Every String Contains Sub String aba

    3.3
  • Lock-Btn

    Construct the FA that Accepts all the Strings of a, b where Start and End with a

    4.2
  • Lock-Btn

    Construct the FA That Accepts All the Strings of a, b Where Start and End with Same Symbol

    4
  • Lock-Btn

    Construct the FA That Accepts All the Strings of a, b Where Start and End with Different Symbol

    3.57
  • Lock-Btn

    Types of Join Inner Join (EQUI Join)

    5.43
  • Lock-Btn

    Types of Join Inner Join (Natural Join)

    8.07
  • Lock-Btn

    Outer Join

    27.41
  • Lock-Btn

    Gate 1999 Question on Relational Algebra

    7.48
  • Lock-Btn

    Gate 2004 Question on Relational Algebra

    13.21
  • Lock-Btn

    Gate 2019 Question on Relational Algebra

    12.43
  • Lock-Btn

    Divide Operation Part 1

    18.56
  • Lock-Btn

    Divide Operation Part 2

    13.53
  • Lock-Btn

    Gate 2017 Question on Divide Operation

    8.13
  • Lock-Btn

    Basic and Extended Operators in Relational Algebra

    14.47
  • Lock-Btn

    Construction of FA That Accepts Every String Starts with aa or bb

    4.18
  • Lock-Btn

    Construction of FA That Accepts Every String Ends with aa or bb

    3.49
  • Lock-Btn

    Construction of FA That Accepts Every String Contains DIBIT as Substring

    3.4
  • Lock-Btn

    Construction of FA That Accepts Every String Contains TRIBIT as Substring

    4.42
  • Lock-Btn

    Construction of FA That Accepts 3rd Symbol from Left End Always b

    3.17
  • Lock-Btn

    Construction of FA That Accepts 4th Symbol from Left End Always a

    2.3
  • Lock-Btn

    Construction of FA That Accepts 2nd Symbol from Right End Always b

    5.25
  • Lock-Btn

    Construction of FA That Accepts 3rd Symbol from Right End Always a

    14.36
  • Lock-Btn

    Construction of FA That Accepts Each String Contains 2 a's Consecutively

    3.24
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Exactly 2

    2.31
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Atleast 2 a's

    1.39
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Atmost 2 a's

    3
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Even Number of a's

    3.15
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Odd Number of a's

    1.37
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Number of b's Divisible by 3

    2.38
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Number of a's Congruent to 2 (mod4)

    4.39
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Number of b's Congruent to 1 (mod4)

    2.57
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Number of b's Congruent to 1 (mod3)

    2.17
  • Lock-Btn

    Construction of FA That Accepts Each String Contains Number of b's Congruent to 3(mod5)

    3.48
  • Lock-Btn

    Construction of FA That Accepts the Length of the String Is Exactly 3

    3.22
  • Lock-Btn

    Construction of FA That Accepts the Length of the String Is Atleast 3

    1.57
  • Lock-Btn

    Construction of FA That Accepts the Length of the String Is Atmost 3

    6.1
  • Lock-Btn

    Construction of FA That Accepts the Length of the String Is Congruent to 2(mod3)

    3.26
  • Lock-Btn

    Construction of FA That Accepts the Length of the String Is Congruent to 1(mod4)

    2.26
  • Lock-Btn

    Construction of FA That Accepts the Length of the String Is Congruent to 2(mod5)

    2.45
  • Lock-Btn

    Construction of FA That Accepts the String Starts with a and Length of the String Is Divisible by 3

    5.31
  • Lock-Btn

    Construction of FA That Accepts the String Starts with ab and Length of the String Is Congruent to 2 (mod3)

    7.07
  • Lock-Btn

    Gate 2012 Question on Relational Algebra

    9.57
  • Lock-Btn

    Gate 2014 Question on Relational Algebra

    10.45
  • Lock-Btn

    Gate 2015 Question on Relational Algebra

    5.53
  • Lock-Btn

    Introduction to TRC

    6.39
  • Lock-Btn

    TRC Syntax Part 1

    13.43
  • Lock-Btn

    TRC Syntax Part 2

    13.32
  • Lock-Btn

    TRC Example 1

    18.51
  • Lock-Btn

    TRC Example 2

    9.14
  • Lock-Btn

    Construction of FA That Accepts the Binary Number is Congruent to 1(mod4)

    12.39
  • Lock-Btn

    Construction of FA That Accepts The Binary Number is Congruent to 2(mod6)

    5.36
  • Lock-Btn

    Construction of FA That Accepts The Binary Number is Congruent to 2(mod4)

    2.3
  • Lock-Btn

    Construction of FA That Accepts The Binary Number is Congruent to 1(mod7)

    2.36
  • Lock-Btn

    Construction of FA That Accepts the Binary Number is Congruent to 3(mod8)

    20.33
  • Lock-Btn

    Introduction to Normalization

    20.04
  • Lock-Btn

    Functional Dependency

    22.19
  • Lock-Btn

    Regular Expression Part-1

    10.1
  • Lock-Btn

    Regular Expression Part-2

    22.27
  • Lock-Btn

    Regular Expression Part-3

    14.11
  • Lock-Btn

    More Examples of FD

    13.19
  • Lock-Btn

    Inference Rules For FD

    15.27
  • Lock-Btn

    Closure Set of Attributes

    18.22
  • Lock-Btn

    Gate 2006 Question on Closure Set of Attributes

    11.12
  • Lock-Btn

    Finding Candidate Key Using FD

    22.05
  • Lock-Btn

    Regular Expression Part-4

    17.18
  • Lock-Btn

    Regular Expression Part-5

    17.43
  • Lock-Btn

    Regular Expression Part-6

    21.12
  • Lock-Btn

    Gate Questions on Candidate Key Part 1

    9.37
  • Lock-Btn

    Gate Questions on Candidate Key Part 2

    12.1
  • Lock-Btn

    Equivalence of Two FD Sets

    21.48
  • Lock-Btn

    Minimal Cover of FD Set

    23.23
  • Lock-Btn

    Regular Expression Part-7

    11.51
  • Lock-Btn

    Conversion from FA to RE Part -1

    8.38
  • Lock-Btn

    Conversion from FA to RE Part -2

    7.58
  • Lock-Btn

    Conversion from FA to RE Part -3

    8.04
  • Lock-Btn

    Conversion from FA to RE Part -4

    5.18
  • Lock-Btn

    Conversion from FA to RE Part -5

    9.01
  • Lock-Btn

    Lossless Decomposition

    23.24
  • Lock-Btn

    FD Preserving Decomposition

    11.08
  • Lock-Btn

    Lossless and FD Preserving Decomposition Example 1

    19.38
  • Lock-Btn

    Lossless and FD Preserving Decomposition Example 2

    14.05
  • Lock-Btn

    Conversion from RE to FA Part -1

    19.05
  • Lock-Btn

    Conversion from RE to FA Part -2

    13.28
  • Lock-Btn

    Conversion from RE to FA Part -3

    7.21
  • Lock-Btn

    Some Formulae for RE

    13.47
  • Lock-Btn

    Lossless and FD Preserving Decomposition Example 3

    13.19
  • Lock-Btn

    Gate 2001 Question on Lossless Decomposition

    4.56
  • Lock-Btn

    Gate 2005 Question on Lossless Decomposition

    5.03
  • Lock-Btn

    Gate 2008 Question on Lossless Decomposition

    9.25
  • Lock-Btn

    First Normal Form

    8.02
  • Lock-Btn

    Second Normal Form Example 1

    19.31
  • Lock-Btn

    Second Normal Form Example 2

    11.17
  • Lock-Btn

    Conversion from RE to FA part -4

    4.18
  • Lock-Btn

    Algebraic Properties of RE

    5.43
  • Lock-Btn

    GATE 2016 Question on RE to FA

    6.49
  • Lock-Btn

    Closer Properties of RE

    19.14
  • Lock-Btn

    Moore and Mealy Machines Part 1

    29.43
  • Lock-Btn

    Second Normal Form Example 3

    17.3
  • Lock-Btn

    Second Normal Form Example 4

    13.19
  • Lock-Btn

    Second Normal Form Example 5

    15.3
  • Lock-Btn

    Third Normal Form Example 1

    11.03
  • Lock-Btn

    Third Normal Form Example 2

    9.14
  • Lock-Btn

    Moore and Mealy Machines Part 2

    6.07
  • Lock-Btn

    Moore and Mealy Machines Part 3

    13.08
  • Lock-Btn

    Moore and Mealy Machines Part 4

    14.3
  • Lock-Btn

    Conversion from Moore to Mealy Machine Part 01

    6.38
  • Lock-Btn

    Conversion from Moore to Mealy Machine Part 02

    10.36
  • Lock-Btn

    Third Normal Form Example 3

    8.17
  • Lock-Btn

    BCNF Example 1

    18.35
  • Lock-Btn

    Facts about 3NF and BCNF

    10.17
  • Lock-Btn

    BCNF Example 2

    11.27
  • Lock-Btn

    BCNF Example 3

    7.06
  • Lock-Btn

    Gate Questions on Normalization Part 1

    12.38
  • Lock-Btn

    Conversion from Mealy to Moore Machine Part 01

    14.54
  • Lock-Btn

    Conversion from Mealy to Moore Machine Part 02

    14.29
  • Lock-Btn

    Pumping Lemma - Part 1

    9.18
  • Lock-Btn

    Pumping Lemma - Part 2

    26.39
  • Lock-Btn

    Gate Questions on Normalization Part 2

    16.34
  • Lock-Btn

    Gate Questions on Normalization Part 3

    16.51
  • Lock-Btn

    Gate Questions on Normalization Part 4

    22.32
  • Lock-Btn

    Pumping Lemma - Part 3

    10.35
  • Lock-Btn

    Pumping Lemma - Part 4

    11.24
  • Lock-Btn

    Pumping Lemma - Part 5

    10.18
  • Lock-Btn

    Understanding Schema

    15.45
  • Lock-Btn

    Create Database

    7.27
  • Lock-Btn

    Create Table Part 1

    11.4
  • Lock-Btn

    Create Table Part 2

    7.24
  • Lock-Btn

    Create Table Part 3

    7.38
  • Lock-Btn

    Create Table Part 4

    11.55
  • Lock-Btn

    One More Exercise for Create Database

    14.07
  • Lock-Btn

    Context Free Grammar - Part 1

    12.16
  • Lock-Btn

    Context Free Grammar - Part 2

    17.45
  • Lock-Btn

    Context Free Grammar - Part 3

    16.17
  • Lock-Btn

    Context Free Grammar - Part 4

    12.34
  • Lock-Btn

    Exercises on Select SQL Part 1

    8.4
  • Lock-Btn

    Exercises on Select SQL Part 2

    8.33
  • Lock-Btn

    Update Operation

    8.51
  • Lock-Btn

    View in DBMS

    14.12
  • Lock-Btn

    Delete Operation

    6.36
  • Lock-Btn

    Order by

    11.37
  • Lock-Btn

    Context Free Grammar - Part 5

    8.43
  • Lock-Btn

    Context Free Grammar - Part 6

    9.16
  • Lock-Btn

    Types of Grammars

    13.15
  • Lock-Btn

    Regular Grammar - Part 1

    10.23
  • Lock-Btn

    Regular Grammar - Part 2

    11.2
  • Lock-Btn

    Retrieve Data from Multiple Tables Exercise 1

    15.2
  • Lock-Btn

    Retrieve Data from Multiple Tables Exercise 2

    12.41
  • Lock-Btn

    Retrieve Data from Multiple Tables Exercise 3

    11.57
  • Lock-Btn

    Retrieve Data from Multiple Tables Exercise 4

    12.38
  • Lock-Btn

    Nested Query

    9.22
  • Lock-Btn

    Aggregate Functions

    9.42
  • Lock-Btn

    CFL

    7.33
  • Lock-Btn

    Simplification of CFG - Part 1

    6.2
  • Lock-Btn

    Simplification of CFG - Part 2

    15.43
  • Lock-Btn

    Simplification of CFG - Part 3

    12.16
  • Lock-Btn

    Simplification of CFG - Part 4

    11.43
  • Lock-Btn

    GATE 2011 Question on SQL

    9.49
  • Lock-Btn

    GATE 2012 Question on SQL

    9.1
  • Lock-Btn

    GATE 2010 Question on SQL

    10.42
  • Lock-Btn

    GATE 2005 Question on SQL

    16.22
  • Lock-Btn

    GATE 2005 Question on SQL Revised

    10.01
  • Lock-Btn

    Group By

    11.38
  • Lock-Btn

    Simplification of CFG - Part 5

    12.41
  • Lock-Btn

    Normal Forms (CNF) - Part 1

    10
  • Lock-Btn

    Normal Forms (CNF) - Part 2

    8.41
  • Lock-Btn

    Normal Forms (GNF) - Part 1

    6.13
  • Lock-Btn

    Normal Forms (GNF) - Part 2

    11.54
  • Lock-Btn

    Group By and Having Clause

    14.48
  • Lock-Btn

    GATE 2020 Question on SQL

    7.54
  • Lock-Btn

    Transaction Management Introduction

    6.23
  • Lock-Btn

    Serial Schedules

    10.46
  • Lock-Btn

    Concurrent Schedule

    16.13
  • Lock-Btn

    Multiple Transactions Running Concurrently

    21.57
  • Lock-Btn

    Normal Forms (GNF) - Part 3

    14.59
  • Lock-Btn

    Normal Forms (GNF) - Part 4

    13.46
  • Lock-Btn

    Normal Forms (GNF) - Part 5

    7.13
  • Lock-Btn

    Decision Properties of CFG Part - 1

    7.42
  • Lock-Btn

    Decision Properties of CFG Part - 2

    11.33
  • Lock-Btn

    States of Transaction

    14.18
  • Lock-Btn

    ACID Properties

    10.32
  • Lock-Btn

    Lost Update Problem W-W Conflict

    12
  • Lock-Btn

    Dirty Read Problem W-R Conflict

    10.46
  • Lock-Btn

    Unrepeatable Read Problem R-W Conflict

    8.05
  • Lock-Btn

    Introduction of Push Down Automata (PDA)

    10.45
  • Lock-Btn

    Working of PDA

    21.38
  • Lock-Btn

    Construction of the PDA for Languages Part-1

    10.2
  • Lock-Btn

    Construction of the PDA for Languages Part-2

    16.45
  • Lock-Btn

    Recoverable Schedule

    18.06
  • Lock-Btn

    Cascading Aborts and Cascadeless Schedule Part 1

    16.17
  • Lock-Btn

    Cascading Aborts and Cascadeless Schedule Part 2

    9.55
  • Lock-Btn

    Strict Schedule

    6.52
  • Lock-Btn

    Serializabilty

    10.13
  • Lock-Btn

    Construction of the PDA for Languages Part-3

    15.46
  • Lock-Btn

    Construction of the PDA for Languages Part-4

    16.17
  • Lock-Btn

    Construction of the PDA for Languages Part-5

    16.41
  • Lock-Btn

    Closure Properties of CFL - Part 1

    11.49
  • Lock-Btn

    Closure Properties of CFL - Part 2

    17.34
  • Lock-Btn

    Closure Properties of CFL - Part 3

    8.24
  • Lock-Btn

    Pumping Lemma for CFL - Part 1

    13.26
  • Lock-Btn

    Example 1 on Conflict Equivalent Schedules

    17.39
  • Lock-Btn

    Example 2 on Conflict Equivalent Schedules

    16.09
  • Lock-Btn

    Example 1 on Conflict Serializable Schedule

    11.55
  • Lock-Btn

    Example 2 on Conflict Serializable Schedule

    15.1
  • Lock-Btn

    Turing Machine Part - 1

    7.43
  • Lock-Btn

    Turing Machine Part - 2

    7.36
  • Lock-Btn

    Turing Machine Part - 3

    14.38
  • Lock-Btn

    Turing Machine Part -4

    0
  • Lock-Btn

    Turing Machine Part -5

    0
  • Lock-Btn

    Example 3 on Conflict Serializable Schedule

    14.07
  • Lock-Btn

    Example 4 on Conflict Serializable Schedule

    7.36
  • Lock-Btn

    Example 5 on Conflict Serializable Schedule

    11.13
  • Lock-Btn

    View Serializable Schedule - Part 1

    19.53
  • Lock-Btn

    View Serializable Schedule - Part 2

    11.13
  • Lock-Btn

    View Serializable Schedule - Part 3

    11.57
  • Lock-Btn

    Lock Based Protocols Introduction

    13.49
  • Lock-Btn

    Two Phase Locking Protocol

    17.13
  • Lock-Btn

    Recursive Language and Recursive Enumerable Language Part-1

    0
  • Lock-Btn

    Recursive Language and Recursive Enumerable Language Part-2

    0
  • Lock-Btn

    Closer Properties of Recursive Language and Recursive Enumerable Language

    0
  • Lock-Btn

    Undecidability - Part 1

    0
  • Lock-Btn

    Undecidability - Part 2

    0
  • Lock-Btn

    Undecidability - Part 3

    0
  • Lock-Btn

    Disadvantage of 2-PL Part 1

    8.26
  • Lock-Btn

    Disadvantage of 2-PL Part 2

    9.24
  • Lock-Btn

    Strict 2-PL

    14.23
  • Lock-Btn

    Rigorous 2-PL

    5.3
  • Lock-Btn

    Conservative 2-PL

    13.15
  • Lock-Btn

    Timestamp Ordering Protocol Part 1

    23.09
  • Lock-Btn

    Timestamp Ordering Protocol Part 2

    12.17
  • Lock-Btn

    GATE 2010 Question on 2-PL

    5.38
  • Lock-Btn

    GATE 2016 Question on 2-PL

    9.07

Our experts can answer your questions

Talk to our experts
Benefits of Ekeeda Pro
Enter your details to download the program syllabus
RESEND IN 00:60
Login on Ekeeda
You're almost there!
We'll be using this information for your application.