I B.TECH II SEM DATA STRUCTURES SYLLABUS

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR

ANANTHAPURAMU

B.Tech. I - II Sem. (CSE)                                                          

(15A05201) DATA STRUCTURES

(Common to CSE and IT branches of Engineering)

Objectives:

·         Understand different Data Structures

·                     Understand Searching and Sorting techniques

Unit-1

Introduction and overview: Asymptotic Notations, One Dimensional array- Multi Dimensional array- pointer arrays.

Linked lists: Definition- Single linked list- Circular linked list- Double linked list- Circular Double linked list- Application of linked lists.

Unit-2

Stacks: Introduction-Definition-Representation of Stack-Operations on Stacks- Applications of Stacks.

Queues:  Introduction, Definition- Representations of Queues- Various Queue Structures- Applications of Queues. Tables: Hash tables.

Unit-3

Trees: Basic Terminologies- Definition and Concepts- Representations of Binary Tree- Operation on a Binary Tree- Types of Binary Trees-Binary Search Tree, Heap Trees, Height Balanced Trees, B. Trees, Red Black Trees.

Graphs: Introduction- Graph terminologies- Representation of graphs- Operations on Graphs- Application of Graph Structures: Shortest path problem- topological sorting.

Unit-4

Sorting : Sorting Techniques- Sorting by Insertion: Straight Insertion sort- List insertion sort- Binary insertion sort- Sorting by selection: Straight selection sort- Heap Sort- Sorting by Exchange- Bubble Sort- Shell Sort-Quick Sort-External Sorts: Merging Order Files-Merging Unorder Files- Sorting Process.

Unit-5

Searching: List Searches- Sequential Search- Variations on Sequential Searches- Binary Search- Analyzing Search Algorithm- Hashed List Searches- Basic Concepts- Hashing Methods- Collision Resolutions- Open Addressing- Linked List Collision Resolution- Bucket Hashing.

 Text Books:

1. “Classic Data Structures”, Second Edition by Debasis Samanta, PHI.

2. “Data Structures A Pseudo code Approach with C”, Second Edition by  

     Richard F. Gilberg, Behrouz A. Forouzan, Cengage Learning.

Reference Books:

1. Fundamentals of Data Structures in C – Horowitz, Sahni, Anderson-

    Freed, Universities Press, Second Edition.

2. Schaum’ Outlines – Data Structures – Seymour Lipschutz – McGrawHill-

    Revised First Edition.

3. Data structures and Algorithms using C++, Ananda Rao Akepogu and

    Radhika Raju Palagiri, Pearson Education.