50 likes | 181 Vues
This comprehensive module introduces the foundational concepts of data structures, including Abstract Data Types (ADTs) such as stacks and queues, and the basics of trees. Through targeted lectures and summaries, students will learn about linked lists, arrays, and their complexities in terms of time and space. We'll also dive into practical examples, such as computing space used in directories, and demonstrate the flexibility of data structures in C++ with STL. Ideal for beginners and professionals looking to enhance their understanding of data organization.
E N D
Quiz #1 Program • Introduction • Complexity notion • ADT • Stack • Queue • Tree (basics) • CDS • Array • SLL
Lectures- Summary Add Delete Find Linked List Simple Flexible O(1) sort -> no adv O(1) - any O(n) - specific O(n) (no bin search) Arrays Simple, fast Inflexible O(1) O(n) inc sort O(n) O(n) O(logn) binary search
File system Tree (directory) External nodes files, internal nods directories Examples Pb: Compute the space used by the directory • Sol: Recursively given by the Sum of • Size of the directory • sizes of files in the directory • the space used by the children directory 5124K /user/rt/courses 1K Postorder traversal 4874K 249K Coen343/ 1K Coen352/ 2K 4870K 10K 229K Projects/ 1K Grades 3K Grades 8K Homework/ 1K Programs/ 1K 82K 4787K Papers/ 1K Demos/ 1K Hw1 3K Hw2 2K Hw3 4K Pr1 57K Pr2 97K Pr3 74K buylow 26K sellhigh 55K market 4786K