Scribd
Upload
259 views

Data Structures and Algorithms

The document outlines the units of a course on data structures and algorithms. Unit I introduces abstract data types like arrays, sets, and maps. Unit II covers algorithm analysis and recursion. Unit III discusses stacks, queues, linked lists, and trees. Unit IV presents priority queues, hash tables, and search trees. Unit V focuses on sorting, selection, and graph algorithms. The course uses two textbooks, one covering Units I to III and the other covering Units II to V.

Uploaded by

ᴋᴀʙɪʟ .ʟ
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
259 views

Data Structures and Algorithms

The document outlines the units of a course on data structures and algorithms. Unit I introduces abstract data types like arrays, sets, and maps. Unit II covers algorithm analysis and recursion. Unit III discusses stacks, queues, linked lists, and trees. Unit IV presents priority queues, hash tables, and search trees. Unit V focuses on sorting, selection, and graph algorithms. The course uses two textbooks, one covering Units I to III and the other covering Units II to V.

Uploaded by

ᴋᴀʙɪʟ .ʟ
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Data Structures and Algorithms

Unit-I:
Abstract Data Types: Introduction-Date Abstract Data Type-Bags-Iterators.
Arrays: Array Structure-Python List-Two Dimensional Arrays-Matrix Abstract
Data Type. Sets, Maps: Sets-Maps- Multi-Dimensional Arrays.
Unit-II:
Algorithm Analysis: Experimental Studies-Seven Functions-Asymptotic
Analysis. Recursion: Illustrative Examples-Analyzing Recursive Algorithms
Linear Recursion- Binary Recursion-Multiple Recursion.
Unit-III:
Stacks, Queues, and Deques: Stacks- Queues- Double-Ended Queues Linked.
Lists: Singly Linked Lists-Circularly Linked Lists-Doubly Linked Lists. Trees:
General Trees-Binary Trees-Implementing Trees-Tree Traversal Algorithms.
Unit-IV:
Priority Queues: Priority Queue Abstract Data Type- Implementing a Priority
Queue- Heaps-Sorting with a Priority Queue. Maps, Hash Tables, and Skip
Lists: Maps and Dictionaries-Hash Tables- Sorted Maps-Skip Lists-Sets,
Multisets, and Multimaps.
Unit-V:
Search Trees: Binary Search Trees-Balanced Search Trees-AVL Trees-Splay
Trees. Sorting and Selection: Merge sort-Quick sort-Sorting through an
Algorithmic Lens- Comparing Sorting Algorithms-Selection. Graph
Algorithms: Graphs-Data Structures for Graphs-Graph Traversals-Shortest
Paths-Minimum Spanning Trees.

Text book:

1. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John


Wiley & Sons, 2011. (Unit – 1) Chapters: 1, 2, 3.
2. Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, “Data
Structures and Algorithms in Python”, John Wiley & Sons, 2013. (Unit –
2, 3, 4, and 5) Chapters: 3 to 12, and 14.

You might also like