2

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

Preamble: This course is core subject developed to help the student understand the data structure principles used in power systems, machines and control systems. This subject covers linear data structures, linked lists, trees, graphs, searching and sorting.

Course Objectives:

• Operations on linear data structures and their applications.
• The various operations on linked lists.
• The basic concepts of Trees, Traversal methods and operations.
• Concepts of implementing graphs and its relevant algorithms.
• Sorting and searching algorithms.

UNIT-1

Linear Data Structures: Arrays, Stacks and Queues Data Structures -Operations-Abstract Data Types-Complexity of Algorithms-Time and SpaceArrays-Representation of Arrays-Linear Arrays-Insertion–Deletion and Traversal of a Linear Array-Array as an Abstract Data Type-Multi-Dimensional arrays-Strings-String OperationsStoring Strings-String as an Abstract Data Type

Stack -Array Representation of Stack-Stack Abstract Data Type-Applications of Stacks: PrefixInfix and Postfix Arithmetic Expressions-Conversion-Evaluation of Postfix ExpressionsRecursion-Towers of Hanoi-Queues-Definition-Array Representation of Queue-The Queue Abstract Data Type-Circular Queues-Dequeues-Priority Queues.

Unit-2

Unit-3

Trees

Terminology-Representation of Trees-Binary Trees-Properties of Binary Trees-Binary Tree Representations-Binary Tree Traversal-Preorder-Inorder and Postorder Traversal-ThreadsThread Binary Trees-Balanced Binary Trees-Heaps-Max Heap-Insertion into and Deletion from a Max Heap-Binary Search Trees-Searching-Insertion and Deletion from a Binary Search TreeHeight of Binary Search Tree, m-way Search Trees, B-Trees.

Unit-4

Graphs

Graph Theory Terminology-Graph Representation-Graph Operations-Depth First Search-Breadth First Search-Connected Components-Spanning Trees-Biconnected Components-Minimum Cost Spanning Trees-Kruskal’s Algorithm-Prism’s Algorithm-Shortest Paths-Transitive Closure-AllPairs Shortest Path-Warshall’s Algorithm.

Unit-5

Searching and Sorting

Searching -Linear Search-Binary Search-Fibonacci Search-Hashing-Sorting-Definition-Bubble Sort-Insertion sort-Selection Sort-Quick Sort-Merging-Merge Sort-Iterative and Recursive Merge Sort-Shell Sort-Radix Sort-Heap Sort.

Course Outcomes: After the completion of the course the student should be able to:

• data structures concepts with arrays, stacks, queues.
• linked lists for stacks, queues and for other applications.
• traversal methods in the Trees.
• various algorithms available for the graphs.
• sorting and searching in the data ret retrival applications.

TEXT BOOKS:

1. Fundamentals of Data Structures in C, 2nd Edition, E.Horowitz, S.Sahni and Susan Anderson Freed, Universities Press Pvt. Ltd.
2. Data Structures with C, Seymour Lipschutz, Schaum’s Outlines, Tata McGraw Hill