B. Sc., COMPUTER SCIENCE (2022 – 2025 Batch)
Semester III
Paper Name: Fundamentals of Data Structures
Paper Code: 22UCSCS38
Unit I : Introduction of algorithms Analyzing algorithms, Arrays :
Representation of Arrays, Implementation of Stacks and queues, Application of
Stack: Evaluation of Expression - Infix to postfix Conversion - Multiple stacks
and Queues, Sparse Matrices.
Unit II: Linked list
Singly Linked list - Linked stacks and queues - polynomial addition -
More on linked Lists - Doubly linked List and Dynamic Storage Management -
Garbage collection and compaction.
Unit III: Trees Basic
Terminology - Binary Trees - Binary Tree representations - Binary trees -
Traversal - More on Binary Trees - Threaded Binary trees - counting Binary
trees. Graphs: Terminology and Representations - Traversals, connected
components and spanning Trees, Single Source Shortest path problem.
Unit IV: Symbol Tables Static Tree
Tables - Dynamic Tree Tables - Hash Tables Hashing Functions - overflow
Handling. External sorting : Storage Devices -sorting with Disks : K-way
merging - sorting with tape.
Unit V: Internal sorting
Insertion
sort - Quick sort - 2 way Merge sort - Heap sort - shell sort - sorting on
keys. Files: Files, Queries and sequential organizations - Index Techniques -
File organization.
Text Book
:
1. Ellis Horowitz, Sartaj Shani, Fundamentals of Data Structures,
Galgotia publication.
Supplementary Readings :
1. Aaron M. Tenenbaum, YedidyahLangsam, Moshe
J.Augenstein ,Data structures Using C,
Kindersley (India) Pvt. Ltd.,
2. Alfred V. Aho, John E. Hopcroft, Jeffrey
D. Ullman ,Data structure and Algorithms,
, Pearson Education Pvt. Ltd.,
3. Seymour Lipschutz , Data Structures ,Tata McGraw-Hill – 2006
.jpg)
No comments:
Post a Comment