DATA STRUCTURES AND APPLICATIONS Syllabus

DATA STRUCTURES AND APPLICATIONS(15CS33):

Module 1:  Introduction 

Data Structures            Classifications (Primitive & Non Primitive)            Data Structure Operations

Review Of            Arrays            Structures            Self-Referential Structures            Unions

Pointers            Dynamic Memory Allocation Functions

Representation Of Linear Arrays In Memory            Dynamically Allocated Arrays

Array Operations:            Traversing            Inserting            Deleting            Searching            Sorting

Multidimensional Arrays            Polynomials            Sparse Matrices

Strings:            Basic Terminology            Storing            Operations            Pattern Matching Algorithms

Programming Examples.

  Module 2:  Stacks And Queues

Stack:            Definition            Stack Operations            Array Representation Of Stacks            Stacks Using Dynamic Arrays            Stack Applications:            Polish Notation            Infix To Postfix Conversion            Evaluation Of Postfix Expression

Recursion:            Factorial            GCD            Fibonacci Sequence          Tower Of Hanoi            Ackerman's Recursive Function

Queue:            Definition            Array Representation            Queue            Operations            Circular Queues            Circular Queues Using Dynamic Arrays            Dequeues            Priority Queues            A Mazing Problem

Multiple Stacks And Queues

Programming Examples

Module 3:  Linked List

Definition            Representation Of Linked Lists In Memory            Memory Allocation            Garbage Collection

Linked List Operations:            Traversing            Searching            Insertion            Deletion.

Doubly Linked Lists            Circular Linked Lists            Header Linked Lists

Linked Stacks And            Linked Queues

Applications Of Linked Lists:            Polynomials            Sparse Matrix Representation.

Programming Examples

  

 Module 4:  Trees

  

Terminology

Binary Trees            Properties Of Binary Trees            Array And Linked Representation Of Binary Trees

Binary Tree Traversals            Inorder            Postorder            Preorder

Additional Binary Tree Operations.

Threaded Binary Tree

Binary Search Trees            Definition            Insertion            Deletion            Traversal            Searching

Application Of Trees-Evaluation Of Expression

Programming Examples

   

Module 5:  Graph / Sorting And Searching / Hashing / Files

Graphs:            Definitions            Terminologies            Matrix And Adjacency List Representation Of Graphs            Elementary Graph Operations Traversal Methods: o   Breadth First Search o   Depth First Search.

Sorting And Searching:            Insertion Sort            Radix Sort            Address Calculation Sort

Hashing:            The Hash Table Organizations            Hashing Functions            Static And Dynamic Hashing

Files And Their Organization:            Data Hierarchy            File Attributes            Text Files And Binary Files            Basic File Operations            File Organizations And Indexing