1 / 5

Summary

Summary. 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

niles
Download Presentation

Summary

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Summary

  2. Quiz #1 Program • Introduction • Complexity notion • ADT • Stack • Queue • Tree (basics) • CDS • Array • SLL

  3. 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

  4. C++ STL

  5. 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

More Related