Students those who are studying JNTUK R20 CSE/IT Branches, Can Download Unit wise R20 1-2 Data Structures Material/Notes PDFs below.

Course Objectives: This course is designed to:

• Introduce the fundamental concept of data structures and abstract data types
• Emphasize the importance of data structures in developing and implementing efficient algorithms
• Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are represented in memory and used by algorithms

Course Outcomes: After completing this course a student will be able to:

• Summarize the properties, interfaces, and behaviors of basic abstract data types
• Discuss the computational efficiency of the principal algorithms for sorting & searching
• Use arrays, records, linked structures, stacks, queues, trees, and Graphs in writing programs
• Demonstrate different methods for traversing trees

UNIT-1

Data Structures – Definition, Classification of Data Structures, Operations on Data Structures, Abstract Data Type (ADT), Preliminaries of algorithms. Time and Space complexity. Searching – Linear search, Binary search, Fibonacci search. Sorting- Insertion sort, Selection sort, Exchange (Bubble sort, quick sort), distribution (radix sort), merging (Merge sort) algorithms.

UNIT-2

UNIT-3

Queues: Introduction to Queues, Representation of Queues-using Arrays and using Linked list, Implementation of Queues-using Arrays and using Linked list, Application of Queues-Circular Queues, Deques, Priority Queues, Multiple Queues.

Stacks: Introduction to Stacks, Array Representation of Stacks, Operations on Stacks, Linked list Representation of Stacks, Operations on Linked Stack, Applications-Reversing list, Factorial Calculation, Infix to Postfix Conversion, Evaluating Postfix Expressions.

UNIT-4

Trees: Basic Terminology in Trees, Binary Trees-Properties, Representation of Binary Trees using Arrays and Linked lists. Binary Search Trees- Basic Concepts, BST Operations: Insertion, Deletion, Tree Traversals, Applications-Expression Trees, Heap Sort, Balanced Binary TreesAVL Trees, Insertion, Deletion and Rotations.

UNIT-5

Graphs: Basic Concepts, Representations of Graphs-Adjacency Matrix and using Linked list, Graph Traversals (BFT & DFT), Applications- Minimum Spanning Tree Using Prims & Kruskals Algorithm, Dijkstra’s shortest path, Transitive closure, Warshall’s Algorithm.

e-Resources:

Modules / Lectures

Text Books:

1) Data Structures Using C. 2nd Edition.Reema Thareja, Oxford.

2) Data Structures and algorithm analysis in C, 2nded, Mark Allen Weiss.

Reference Books:

1) Fundamentals of Data Structures in C, 2nd Edition, Horowitz, Sahni, Universities Press.

2) Data Structures: A PseudoCode Approach, 2/e, Richard F.Gilberg, Behrouz A. Forouzon, Cengage.

3) Data Structures with C, Seymour Lipschutz TMH