📘 DS

DATA STRUCTURES

Access study materials and notes for this subject

DS Mid 1 Quesetion and Answers

PDF Document

PreviewDownload

DS Mid 2 Quesetion and Answers

PDF Document

PreviewDownload

DS Unit 1 Introduction To Data Structures And Sracks

PDF Document

PreviewDownload

DS Unit 2 Dictionaries And Hash Table Representation

PDF Document

PreviewDownload

DS Unit 3 Search Trees

PDF Document

PreviewDownload

DS Unit 4 Graphs And Sorting

PDF Document

PreviewDownload

DS Unit 5 Pattern Matching And Tries

PDF Document

PreviewDownload

DS Unit 1 (Alt) Introduction To Data Structures And Sracks

PDF Document

PreviewDownload

DS Unit 2 (Alt) Dictionaries And Hash Table Representation

PDF Document

PreviewDownload

DS Unit 3 (Alt) Search Trees

PDF Document

PreviewDownload

DS Unit 4 (Alt) Graphs And Sorting

PDF Document

PreviewDownload

DS Unit 5 (Alt) Pattern Matching And Tries

PDF Document

PreviewDownload

Syllabus Overview

UNIT - 1 Introduction to Data Structures and Sracks

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

UNIT - 2 Dictionaries and Hash Table Representation

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, quadratic probing, double hashing
  • Rehashing
  • Extendible hashing

UNIT - 3 Search Trees

Search Trees

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

UNIT - 4 Graphs and Sorting

Graphs

  • Graph Implementation Methods
  • Graph Traversal Methods

Sorting

  • Quick Sort
  • Heap Sort
  • External Sorting - Model for external sorting, Merge Sort

UNIT - 5 Pattern Matching and Tries

Pattern Matching and Tries

  • Pattern matching algorithms - Brute force, the Boyer–Moore algorithm, the Knuth-Morris-Pratt algorithm
  • Standard Tries
  • Compressed Tries
  • Suffix tries
DATA STRUCTURES Notes