# JNTUK B.TECH R20 1-2 Syllabus For Data structures PDF 2022

### Get Complete Lecture Notes for Data structures on Cynohub APP

You will be able to find information about Data structures along with its Course Objectives and Course outcomes and also a list of textbook and reference books in this blog.You will get to learn a lot of new stuff and resolve a lot of questions you may have regarding Data structures after reading this blog. Data structures has 5 units altogether and you will be able to find notes for every unit on the CynoHub app. Data structures can be learnt easily as long as you have a well planned study schedule and practice all the previous question papers, which are also available on the CynoHub app.

All of the Topic and subtopics related to Data structures are mentioned below in detail. If you are having a hard time understanding Data structures or any other Engineering Subject of any semester or year then please watch the video lectures on the official CynoHub app as it has detailed explanations of each and every topic making your engineering experience easy and fun.

### Data structures Unit One

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.

### Data structures Unit Three

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.

### Data structures Unit Four

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 Trees- AVL Trees, Insertion, Deletion and Rotations.

### Data structures Unit Five

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.

### Data structures Course Objectives

The objective of the course is 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

### Data structures 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

### Data structures Text Books

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

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

### Data structures Reference Books

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

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

Data Structures with C, Seymour Lipschutz TMH