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 and Extern

    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

    10.22
  • Lock-Btn

    Local Parameter of Function

    11.11
  • 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

    12.32
  • 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

    15.53
  • Lock-Btn

    Recursive Function for Decimal to Binary

    14.06
  • Lock-Btn

    Recursive Function to Convert Decimal to Hexadecimal

    10.39
  • 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

    11.33
  • Lock-Btn

    Demonstration of Pointers Using C Program

    13.13
  • Lock-Btn

    Example Program 1 on Pointers

    10.53
  • Lock-Btn

    Example Program 2 on Pointers

    10.28
  • Lock-Btn

    Example Program 3 on Pointers

    6.16
  • Lock-Btn

    Passing Address to Function Call by Address

    13.29
  • 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

    8.45
  • Lock-Btn

    Call by Address Example 2

    9.38
  • Lock-Btn

    Swapping Value of Two Variables Using Call by Address

    7.08
  • Lock-Btn

    Gate 2015 Question on Pointers

    9.47
  • Lock-Btn

    Gate 2016 Question on Pointers

    11.16
  • Lock-Btn

    Relation Between Array and Pointer Part 1

    23.27
  • Lock-Btn

    Relation Between Array and Pointer Part 2

    12.21
  • 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

    10.43
  • Lock-Btn

    Gate 2019 Question on Array and Pointers

    8.58
  • Lock-Btn

    Gate 2019 Question on Array and Pointers 1

    4.58
  • Lock-Btn

    Pass Array to Function

    11.13
  • Lock-Btn

    Pass Array to Function Continued

    11.12
  • Lock-Btn

    Creating Variables Using Malloc

    27.17
  • Lock-Btn

    Create Array Using Malloc

    21.21
  • Lock-Btn

    Demonstration Program for Creating Array Using Pointer

    7.27
  • Lock-Btn

    Two Dimension and Pointer

    26.48
  • 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-Dimesion 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 - Part 1

    12.14
  • Lock-Btn

    Gate 2003 Question on Pointer - Part 2

    9.59
  • Lock-Btn

    Gate 2000 Question on Pointer

    15.37
  • 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

    15.42
  • Lock-Btn

    String Fundamentals

    21.4
  • Lock-Btn

    String Functions

    27.53
  • 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 2011 Question on Array of Char

    18.56
  • 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

    4.37
  • Lock-Btn

    Structure Fundamental Continued

    4.37
  • Lock-Btn

    Structure Declaration Using Typedef

    5.22
  • Lock-Btn

    Initialize a Structure

    10.37
  • Lock-Btn

    Demonstration Program on Structures

    9.03
  • 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.18
  • 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

    Comparision 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 Pipeling: Throughput

    8.48
  • Lock-Btn

    Introduction to Pipeling: 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

Our experts can answer your questions

Talk to our experts
Benefits of Ekeeda Pro