Syllabus
|
Course Code: BCA-405 Course Name: DATA STRUCTURES – II |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Tree-Definitions and Concepts, Representation of Binary Tree, Binary Tree Traversal (Inorder, postorder, preorder), Threaded Binary Tree, Binary Search Trees – Definition, Operations viz., searching, insertions and deletion; Applications of Trees - AVL trees and various operation viz. insertions, deletion, searching, B-tree and B+ trees along with various operations on these trees. | |
| 2 | Graph-Matrix Representation Of Graphs, Elementary Graph Operations viz., Traversal and Searching(Breadth First and
Depth Searching), Insertions, Deletion; Spanning Trees, Minimal spanning tree; Applications of Graphs: Topological Sorting, Shortest-Path Algorithms, Dijkstra’s Algorithm, Warshall’s Algorithm. |
|
| 3 | Files: Introduction Attributes of a File, Classification of Files, File Operations, Comparison of Various Types of Files,
File Organization: Sequential, Indexed-Sequential, Random-Access File. Hashing: Hashing Functions, Collision-Resolution Techniques. |
|
| 4 | Priority Queues: Binary Heaps, Applications of Priority Queues, Leftist Heap, Skew Heap, Binomial Queues. Sorting: Counting Sort, Shell Sort, Radix Sort, Merge Sort, and Lower Bound for Sorting, Randomized Quick Sort. | |
