This document provides an overview of a course on data structures. The course goals are to teach fundamental data structures for storing and accessing data efficiently. Key topics covered include linked lists, stacks, queues, searching, sorting, trees, graphs, and hashing. The course objectives are to teach basic concepts and implementations of these structures, as well as applications. The course structure divides content into units covering linked lists, stacks and queues, searching and sorting, trees, graphs, and hashing. Assessment includes instructor evaluation, monthly tests, and end of term examinations. Around 300 students from computer science and engineering departments are expected to participate.

1. Data Structures
By
T CHANDRASHEKER
HoD & Asst. Prof in Dept. of CSE
IIIT RK Valley, RGUKT
.
Data Structures by T Chandrasheker is licensed under a Creative Commons Attribution-
ShareAlike 4.0 International License.

2. Course Description
• The goal of this course is to teach
fundamental data structures, which allow one
to store collections of data with fast updates
and queries. The key topics in this course are
linked lists, stacks and queues, searching and
sorting, different kinds of search trees,
hashing, priority queues and graphs.

3. Course Objectives
• To impart the basic concepts of data structures
• To understand concepts about searching and sorting techniques
• To understand basic concepts about stacks, queues, lists, trees and
graphs
• To teach efficient storage mechanisms of data for an easy access.
• To design and implementation of various basic and advanced data
structures.
• To introduce various techniques for representation of the data in
the real world.
• To develop application using data structures.
• To improve the logical ability

4. Course Outcomes
• Ability to use linear and non-linear data structures like
stack, queue and linked list operation.
• Ability to summarize searching and sorting techniques.
• Ability to have knowledge of tree and graphs concepts.
• Ability to choose appropriate data structure as applied
to specified problem definition.
• Ability to handle operations like searching, insertion,
deletion, traversing mechanism etc. on various data
structures.

5. Course Structure
UNIT-I (Linked Lists):Definition, Linear and Non Linear DS, List of Data Structures,
Applications of DS, Motivation, Definition, Linked List; SLL: Introduction, Definition,
Defining Node of an SLL; Operations on SLL: Creation, Traversal, Insertion at Begin,
End, Middle; Header, Node, Deleting SLL: Deletion at Begin, Deletion at End, Deletion
at Middle, Circular Linked Lists, Double Linked Lists. Working Examples on Linked Lists.
UNIT-II (Stacks & Queues):Introduction, Array representation, Operations on Stack.
Linked List representation of stack, Application of Stacks, Introduction of queues, Array
representation, Linked representation Circular queues, Dequeue, Priority queues,
Application of queues
UNIT-II (Searching and Sorting): Searching: Linear search and Binary search, Sorting:
Bubble sort, Insertion sort, Selection sort, Quick sort and Merge sort.
UNIT-IV (Trees ): Basic Terminologies, Types of trees, traversingaBinary tree, Huffman
tree Introduction, Operations on BST. Introduction and operations on AVL tree and
applications, Properties of Red-Black Tree, Operations on RedBlack Tree, Application,
Properties of B Tree, Operations on B Tree, Application, Heap; Min and Max Heap;
UNIT-V (Graphs ): Introduction & Basic Terminologies, Directed Graphs
Representation, BFS and DFS and their applications.
UNIT-VI (Hashing ): Introduction to HashTables and Functions Types of Hash Tables;
Collision resolve Techniques

6. Delivery Format – Blended / Online
• Blended mode of teaching and learning

7. Learning Activities – Discussion forum,
peer rating etc

8. Assessment
• Instructor Assessment
• Three Monthly test (40% weightage)
• End semester examinations (60% weightage)

9. Expected participation
• This is a fundamental courses in the the
following department of Computer Science
and Engineering department
• Here we are expecting around 300 students
from each institute.