CY-303 Data Structures Notes
5 notes for Data Structures, unit by unit.
Notes for CY-303
- Unit 1 · Short notes Introduction to Data Structure Concepts of Data and Information · Classification of Data structures · Abstract Data Types · Implementation aspects: Memory representation · Data structures operations and cost estimation · Linear data structures – Arrays
- Unit 2 · Short notes Stacks and Queue Stacks as ADT · Different implementations of stack · Multiple stacks · Application of stack – infix to postfix conversion · Evaluation of postfix expression · Recursion using stack
- Unit 3 · Short notes Tree Definitions – height, depth, order, degree · Binary Search Tree – operations, traversal, search · AVL Tree · Heap · Comparison of various tree types · Introduction to forest
- Unit 4 · Short notes Graphs Introduction to graphs · Classification – directed and undirected graphs · Graph representation · Graph traversal – Depth First Search (DFS) · Graph traversal – Breadth First Search (BFS) · Minimum Spanning Tree – Kruskal’s algorithm
- Unit 5 · Short notes Sorting Introduction to sorting · Bubble Sort · Quick Sort · Selection Sort · Heap Sort · Insertion Sort
More for CY-303
Other 3rd semester CY subjects
- CY-301 Technical Communication
- CY-302 Fundamentals of Cryptography
- CY-304 Digital Systems
- CY-305 Object Oriented Programming & Methodology
- CY-306 Computer Workshop (Python Programming)