Scribd
Upload
1 views

Data Structures Core

The document outlines a Data Structures course that covers fundamental concepts, linear and non-linear data structures, graph algorithms, and various searching, sorting, and hashing techniques. It includes practical exercises, course objectives, outcomes, and references, emphasizing the application of data structures in different domains. The course aims to equip students with the skills to implement and analyze data structures and algorithms effectively.

Uploaded by

vjay2003
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
1 views

Data Structures Core

The document outlines a Data Structures course that covers fundamental concepts, linear and non-linear data structures, graph algorithms, and various searching, sorting, and hashing techniques. It includes practical exercises, course objectives, outcomes, and references, emphasizing the application of data structures in different domains. The course aims to equip students with the skills to implement and analyze data structures and algorithms effectively.

Uploaded by

vjay2003
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

SUB.

CODE DATA STRUCTURES LTP C


3 0 2 4
COURSE OBJECTIVES:

 To introduce basic concepts of Data types, Algorithms and linear data structures.
 To perform operations on linear data structures Stack and Queues.
 To apply suitable non-linear data structure operations to solve specific problems.
 To utilize relevant graph algorithms for various graph-based applications.
 To evaluate different searching, sorting and hashing algorithms.
 To apply the data structure concepts in different domains.

UNIT- I INTRODUCTION TO DATA STRUCTURE AND LIST 8

Applications: Linked list- image viewer, Music player, previous & next pages in web browser, GPS
navigation, undo redo functionality.

Introduction to DS – Types of Data Structures- Introduction to analysis of algorithms - Asymptotic


Notations -Recursive, Non-Recursive Algorithm - Abstract Data Types (ADTs) -List ADT -Array-based
implementation -Linked list implementation - Singly linked lists -Circularly linked lists -Doubly-linked
lists -Applications of lists - Polynomial ADT- Polynomial Manipulation.

UNIT- II LINEAR DATA STRUCTURES–STACKS, QUEUES 9

Applications: Stack-back & forward buttons in a web browser, recursive programs-Queue- call centers,
printer management, traffic systems, task scheduling

Stack ADT -Stack Model - Implementations: Array and Linked list - Operations - Applications -
Balancing Symbols -Evaluating arithmetic expressions- Infix to Postfix conversion -Function Calls -
Queue ADT - Operations - Circular Queue - DeQueue - Applications of Queues.

UNIT- III N O N -LINEAR DATA STRUCTURES–TREES 9


Applications: BST- dictionary, phone contacts, online store system, File system. AVL trees-indexing
databases-Heaps-resource allocation, directory structures in file systems.

Tree ADT -Tree Traversals -Binary Tree ADT- Expression trees- Binary Search Tree ADT- AVL Trees -
-Priority Queue (Heaps) - Binary Heap- Multi way Search Trees: B-Tree-B+ Tree.

UNIT -IV NON-LINEAR DATA STRUCTURES -GRAPHS 7

Applications: Social Networks, Transportation, Computer networks, Web crawling, GPS Navigation,
Network routing. Telecommunication Networks-route planning for postal delivery, road trips

Graph Definition-Representation of Graphs-Types of Graph- Breadth-first traversal -Depth-first traversal


-Bi-connectivity-Euler circuits-Topological Sort-Shortest Path Algorithm: Dijkstra’s algorithm- Minimum
Spanning Tree: Prim’s algorithm, Kruskal’s Algorithm.
UNIT -V SEARCHING, SORTING AND HASHING 6

Applications: E-commerce Applications, Social Media, Search Engines, Text Editors and IDE ,Accident
Detection, Online shopping- Hashing : Bloom Filtering, Data base indexing, Password storage.

Searching: Linear Search-Binary Search. Sorting: Bubble sort -Selection sort -Insertion sort -Quick sort.
Hashing: Hash Functions -Collision Resolution Strategies: Separate Chaining -Open Addressing -
Rehashing.

UNIT- VI RECENT TRENDS AND DS APPLICATION I N DIFFERENT DOMAINS 6

Introduction - Cache-Oblivious Data Structures, Sketch Data Structures ,Geometric Data Structures, Self-
Organizing Data Structures. Applications- AI & ML- Decision Trees for Predictions, Graphs in Neural
Networks-Block chain Technology-Merkle trees, Hash tables. Healthcare and Bioinformatics-suffix trees,
hash tables and Graphs. IoT- Circular buffer, Graphs & BST.

TOTAL:45 PERIODS
PRACTICAL EXERCISES:
1. Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs
4. Implementation of Polynomial Manipulation using Linked list
5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Implementation of Dijkstra’s Algorithm
10. Implementation of Prim’s Algorithm
11. Implementation of Linear Search and Binary Search
12. Implementation of Insertion Sort and Selection Sort
13. Implementation of Open Addressing (Linear Probing and Quadratic Probing)
TOTAL:30 PERIODS

COURSE OUTCOMES:
At the end of this course, the students will be able to:

CO1: define basic concepts in algorithms and data structures.


CO2: implement linear data structure operations.
CO3; choose appropriate linear/non–linear data structure operations for solving a given problem.
CO4: apply appropriate graph algorithms for graph applications.
CO5: analyze the various searching, sorting and hashing algorithms.
CO6: apply the data structure concepts in different domains.
TOTAL:75 PERIODS
TEXT BOOKS:
1.Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education,
2017.
2. Kamthane, “Introduction to Data Structures in C”, 1st Edition, Pearson Education, 2007
3. Sartaj Sahni, “Data Structures, Algorithms and Applications in C++”, Silicon paper publications,2008.

REFERENCES:
1. “SCHAM’S outlines Data Structures With C”, Seymour Lipschutz, Adopted in India by
Arrangement with The Tata McGraw-Hill companies, Lnc., New York.
2. Langsam, Augenstein and Tanenbaum, “Data Structures Using C and C++”, 2nd Edition,
Pearson Education,2015.
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction
to Algorithms", Fourth Edition, Mcgraw Hill/ MIT Press,2022.
4. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,”Data Structures and Algorithms”, 1st
edition, Pearson, 2002.
5. Kruse, “Data Structures and Program Design in C”, 2nd Edition, Pearson Education, 2006.
6. Rajesh K. Shukla, “Data Structures using C and C++”,Wiley India Publications,2009.

CO – PO MAPPING
PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 1 2 3
1 2 2 1 2 2 - - - 1 1 1 3 3 3
2 2 1 1 1 - - - 2 1 1 3 3 3
3 2 2 2 2 2 1 1 - 2 2 1 3 3 3
4 2 2 1 1 2 - - - 3 1 2 3 3 3
5 2 2 2 2 2 - - - 2 1 1 3 3 3
6 2 2 3 3 2 1 1 - 2 1 1 2 3 3
LOW (1) ; MEDIUM (2) ; HIGH (3)

You might also like