Saranya Suresh

DEQUE (Double-Ended Queue) - Advantages, Disadvantages and Applications

Queue Introduction

Evaluating Postfix Expression - Stack Applications

Recursion - Stack Applications

Infix to Postfix Conversion 3 - Stack Applications

Infix to Postfix Conversion 2 - Stack Applications

Infix to Postfix Conversion 1 - Stack Applications

Reversing a List and Balancing Symbols - Stack Applications

Stacks Introduction

Difference Between Linear Search and Binary Search

Stack Implementation Using L L - Advantages, Disadvantages and Applications

Stack Implementation Using Linked Lists

#11 Ambigous Grammars / Ambiguity in Context Free Grammars

#10 Derivations from a Grammar and Parse Tree (Left Derivation and Right Derivation Tree)

Traveling Salesman Problem using branch and bound

#7 Finite Automata to Regular Expression - State Elimination Method

finding min and max value using divide and conquer method

#9 Types of Grammar / Context free Grammar / Generating Language from the Grammar

Non Restoring Division Method Example

Solving Recurrence Relations Using Substitution method1

Deleting an element from an Array

Bit Pair Recoding for multiplication

Priority Queue - Insertion Operation

Quick Sort using divide and conquer method

Advantages and Disadvantages of arrays

Insertion in Circular Singly Linked Lists: Beginning and End

Doubly Linked Lists - Deletion at the Middle

merge sort using divide and conquer method

#5 LL - Inserting a new node before a given node - Singly Linked Lists

#4 LL - Inserting a new node after a given node - Singly Linked Lists

Insertion in Circular Doubly Linked Lists: Beginning and End

#1 Linked Lists - Data Structures