Data Structures and Applications BCS304

Module 1 Overview

INTRODUCTION TO DATA STRUCTURES: Data Structures, Classifications (Primitive & Non-Primitive), Data structure Operations

Review of pointers and dynamic Memory Allocation,

ARRAYS and STRUCTURES: Arrays, Dynamic Allocated Arrays, Structures and Unions, Polynomials, Sparse Matrices, representation of Multidimensional Arrays, Strings

STACKS: Stacks, Stacks Using Dynamic Arrays, Evaluation and conversion of Expressions

Text Book: Chapter-1:1.2 Chapter-2: 2.1 to 2.7 Chapter-3: 3.1,3.2,3.6

Reference Book 1: 1.1 to 1.4

Module 2 Overview

QUEUES: Queues, Circular Queues, Using Dynamic Arrays, Multiple Stacks and queues.

LINKED LISTS : Singly Linked, Lists and Chains, Representing Chains in C, Linked Stacks and Queues, Polynomials

Module 3 Overview

LINKED LISTS : Additional List Operations, Sparse Matrices, Doubly Linked List.

TREES: Introduction, Binary Trees, Binary Tree Traversals, Threaded Binary Trees.

Text Book: Chapter-4: 4.5,4.7,4.8 Chapter-5: 5.1 to 5.3, 5.5

Module 4 Overview

TREES(Cont..): Binary Search trees, Selection Trees, Forests, Representation of Disjoint sets, Counting Binary Trees,

GRAPHS: The Graph Abstract Data Types, Elementary Graph Operations

Module 5 Overview

HASHING: Introduction, Static Hashing, Dynamic Hashing

PRIORITY QUEUES: Single and double ended Priority Queues, Leftist Trees

INTRODUCTION TO EFFICIENT BINARY SEARCH TREES: Optimal Binary Search Trees

Text Book: Chapter 8: 8.1 to 8.3 Chapter 9: 9.1, 9.2 Chapter 10: 10.1