Data structures
BCSCCS 303 R03 DATA STRUCTURES
(Common for CSE, IT and ICT)
L T P CREDITS
3 1 0 4
UNIT - I (15 Periods)
Pseudo code & Recursion: Introduction – Pseudo code – ADT – ADT model, implementations; Recursion – Designing recursive algorithms – Examples – GCD, factorial, fibonnaci, Prefix to Postfix conversion, Tower of Hanoi; General linear lists – operations, implementation, algorithms
UNIT - II (15 Periods)
Linear Lists: Stacks – Basic Operations, Linked stack, Algorithms, Implementation, Applications – Infix to Postfix, Evaluation of Postfix - Queues – Operations, Linked list design, algorithms, Mazing Problem, Complex implementations – circularly linked lists, doubly linked lists – Sparse Matrices – linked representation, input, output, erase
UNIT - III (15 Periods)
Non-Linear Lists: Trees – basic concepts, binary trees, traversals, expression trees; General trees – insertion, deletion - Conversion of general to binary tree; Binary Search tree – basics, operations, ADT, applications – Threaded trees; AVL trees – basic concepts and implementation
UNIT - IV (15 Periods)
Heaps & Trie Structure: Heaps – basics, implementation, algorithms; Heap applications – Priority Queues; Multi-way Trees – B-tree implementation, algorithms, 2-3 tree, Trie structure; Searching – sequential and binary search, hashed searches, collision resolution; Graphs – Elementary operations – BFS – DFS - Minimum Cost Spanning Tree - Kruskal’s & Prims algorithms
Text Books:
1. Richard F. Gilberg & Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach with C”, Thomson Learning, 2nd Edition, 2007.
2. Ellis Horowitz, Sartaj Sahni, & Susan Anderson Freed, “Fundamentals of Data Structures in C”, University Press, 2nd Edition, 2008 (Sections 3.5, 4.7, 6.1, 6.2.1, 6.2.2, 6.3.1, 6.3.2)
References:
1. J.P.Trembley & P.G. Sorenson,
(Common for CSE, IT and ICT)
L T P CREDITS
3 1 0 4
UNIT - I (15 Periods)
Pseudo code & Recursion: Introduction – Pseudo code – ADT – ADT model, implementations; Recursion – Designing recursive algorithms – Examples – GCD, factorial, fibonnaci, Prefix to Postfix conversion, Tower of Hanoi; General linear lists – operations, implementation, algorithms
UNIT - II (15 Periods)
Linear Lists: Stacks – Basic Operations, Linked stack, Algorithms, Implementation, Applications – Infix to Postfix, Evaluation of Postfix - Queues – Operations, Linked list design, algorithms, Mazing Problem, Complex implementations – circularly linked lists, doubly linked lists – Sparse Matrices – linked representation, input, output, erase
UNIT - III (15 Periods)
Non-Linear Lists: Trees – basic concepts, binary trees, traversals, expression trees; General trees – insertion, deletion - Conversion of general to binary tree; Binary Search tree – basics, operations, ADT, applications – Threaded trees; AVL trees – basic concepts and implementation
UNIT - IV (15 Periods)
Heaps & Trie Structure: Heaps – basics, implementation, algorithms; Heap applications – Priority Queues; Multi-way Trees – B-tree implementation, algorithms, 2-3 tree, Trie structure; Searching – sequential and binary search, hashed searches, collision resolution; Graphs – Elementary operations – BFS – DFS - Minimum Cost Spanning Tree - Kruskal’s & Prims algorithms
Text Books:
1. Richard F. Gilberg & Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach with C”, Thomson Learning, 2nd Edition, 2007.
2. Ellis Horowitz, Sartaj Sahni, & Susan Anderson Freed, “Fundamentals of Data Structures in C”, University Press, 2nd Edition, 2008 (Sections 3.5, 4.7, 6.1, 6.2.1, 6.2.2, 6.3.1, 6.3.2)
References:
1. J.P.Trembley & P.G. Sorenson,
References: 1. J.P.Trembley & P.G. Sorenson, "An Introduction to Data Structures with Applications", Tata McGraw Hill, 2nd Edition, 2002. 2. Seymour Lipschutz and G.A.Vijayalakshmi Pai, “Data Structures”, Tata McGraw Hill, 2005.