Exclusive Features

Expert Subject Faculty
Online Video Classes Platform
Online Mock Tests
Online Material

Course Index

Data Structures Learning Concepts

Introduction to Data Structures

  • Abstract Data Types.
  • Linear list
  • Singly linked list implementation
  • Insertion.
  • Deletion and searching operations on linear list.
  • Stacks-Operations.
  • Array and linked representations of stacks.
  • Stack applications.
  • Queues-operations.
  • array and linked representations.

Dictionaries

  • linear list representation.
  • skip list representation
  • operations - insertion
  • deletion and searching. .
  • Hash Table Representation.
  • hash functions.
  • collision resolution-separate chaining.
  • open addressing linear probing.
  • and quadratic probing.
  • double hashing.
  • rehashing.
  • extendible hashing.

Search Trees

  • Binary Search Trees.
  • Definition, Implementation
  • Operations- Searching
  • AVL Trees,
  • Definition.
  • Height of an AVL Tree.
  • Operations – Insertion.
  • Deletion and Searching.
  • Red –Black.
  • Splay Trees.

Graphs

  • Graph Implementation Methods.
  • Graph Traversal Methods
  • Sorting: Heap Sort
  • External Sorting- Model for external sorting
  • Merge Sort

Pattern Matching and Tries

  • Pattern matching algorithms-Brute force.
  • The Boyer –Moore algorithm
  • The Knuth-Morris-Pratt algorithm
  • Standard Tries
  • Compressed Tries
  • Suffix tries