Dsasyllabus
Dsasyllabus
Hours/week 3 4 - 7
5
Marks 100 100 - 200
Pre-requisite courses:
Programming Language
Outline of the Course:
Sr. Title of the unit Minimum number
No. of hours
1. Introduction to Data Structure 04
2. Linear Data Structure 12
3. Non-Linear Data Structure 16
4. Sorting 10
5. Searching 01
6. Dictionaries 02
Total hours (Theory) : 45
Total hours (Lab) : 60
Total hours : 105
Detailed Syllabus:
1. Introduction 04 Hours 08%
Introduction to data structure (Types of data structure),
Introduction to algorithms. Algorithm Analysis and Big O
notation, Memory representation of Array: Row Order and
Column Order, Abstract Data Types (ADT)
2. Linear Data Structure 12 Hours 27%
Stack: Operations: push, pop, peep, change, Applications of
Stack: Recursion: Recursive Function Tracing, Principles of
recursion, Tail recursion, Removal of Recursion, Tower of
© CHARUSAT 2024
Page 31 of 194
Hanoi, Conversion: Infix to Postfix, Infix to Prefix.
Evaluation: Prefix and Postfix expression,
Queue Simple Queue: Insert and Delete operation, Circular
Queue: Insert and Delete operation, Concepts of: Priority
Queue, Double-ended Queue, Applications of Queue,
Linked List: Memory Representation of LL, Singly Linked
List, Doubly Linked List, Circular Linked List, Applications
of Linked List
3. Non-Linear Data Structure 16 Hours 36%
Tree: Tree Concepts, Tree Traversal Techniques: Pre-order,
Post-order and In-order (Recursive and Iterative), Binary
Search Tree: Iterative and Recursive, Balanced Trees (AVL
Trees, Applications of Tree, Skip list
Heaps: Priority queues and Binary Heaps
Graph: Graph concepts, Memory Representation of Graph,
BFS and DFS, Applications of Graph
4. Sorting 10 Hours 23%
Sorting (concepts, Selection Sort, Bubble Sort, Merge Sort,
Radix Sort, Insertion Sort, Heap Sort, Quick Sort, Counting
sort, Topological sort)
5. Searching 01 Hours 02%
Sequential Search, Binary Search
6. Dictionaries 02 Hours 04%
Hashing, Hashing Functions, Collision-Resolution
Techniques, Applications
CO1 3 - 2 - - - - - - - - - 3 -
CO2 - 2 - - - - - - - - - - 3 -
CO3 - 3 3 3 - - - - - - - - 2 -
CO4 - 1 - 1 2 - - - - - - - 2 -
CO5 2 2 2 2 - - - - - - - 2 3 -
CO6 2 - - - - - - - - - - - 2 -
Reference book:
1. Classic Data structures, D.Samanta, Prentice-Hall International.
2. Data Structures using C & C++, Ten Baum, Prentice-Hall International.
3. Data Structures: A Pseudo-code approach with C, Gilberg & Forouzan, Thomson Learning.
© CHARUSAT 2024
Page 33 of 194
4. Fundamentals of Data Structures in C++, Ellis Horowitz, Sartaj Sahni, Dinesh Mehta, W.
H. Freeman.
5.
Shaffer
6. Data Structures and Algorithm in Java: Goodrich and Tamassia: John Wiley and Sons.
Web material:
1. http://www.leda-tutorial.org/en/official/ch02s02s03.html
2. http://www.leda-tutorial.org/en/official/ch02s02s03.html
3. http://www.softpanorama.org/Algorithms/sorting.shtml
© CHARUSAT 2024
Page 34 of 194