Data structure & Algorithms

 Share more and more And comment for help

SYLLABUS (Detailed Contents):

Module 1: Introduction

Basic Terminologies: Elementary Data Organizations, Data Structure Operations: insertion,

deletion, traversal, etc.; Analysis of an Algorithm, Asymptotic Notations, Time-Space trade

off.

Searching: Linear Search and Binary Search Techniques and their complexity analysis.

Module 2: Stacks and Queues

ADT Stack and its operations: Algorithms and their complexity analysis, Applications of

Stacks: Expression Conversion and evaluation – corresponding algorithms and complexity

analysis. ADT queue, Types of Queue: Simple Queue, Circular Queue, Priority Queue;

Operations on each type of Queues: Algorithms and their analysis.

Module 3: Linked Lists

Singly-linked lists: Representation in memory, Algorithms of several operations: Traversing,

Searching, Insertion into, Deletion from the linked list; Linked representation of Stack and

Queue, Header nodes, Doubly linked list: operations on it and algorithmic analysis;

 Circular  Linked Lists: All operations their algorithms and the complexity analysis.

Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary

Tree, Binary Search Tree, AVL Tree; Tree operations on each of the trees and their

algorithms with complexity analysis. Applications of Binary Trees. B Tree, B+ Tree:

definitions, algorithms, and analysis.

Module 4: Sorting and Hashing

Objective and properties of different sorting algorithms: Selection Sort, Bubble Sort,

Insertion Sort, Quick Sort, Merge Sort, Heap Sort; Performance and Comparison among all

the methods, Hashing.

Module 4: Graph

Basic Terminologies and Representations, Graph search and traversal algorithms and

complexity analysis.

All Lectures

Part 1             Click Here
Part 2             Click Here
Part 3             Click Here