Data Structures and Algorithms - Chapter 9: Priority Queues - Phạm Bảo SơnPriority Queues! Heaps! Adaptable Priority Queues
45 trang | Chia sẻ: candy98 | Ngày: 28/11/2020 | Lượt xem: 661 | Lượt tải: 0
Electrical Engineering - Chapter 5: Decision MakingType of logical expression Produces result of true or false Compares values of two arithmetic expressions
25 trang | Chia sẻ: thuongdt324 | Ngày: 28/11/2020 | Lượt xem: 675 | Lượt tải: 0
Electrical Engineering - Chapter 4: Basic Input and OutputSeries of bytes in sequence Flow from device to device Objects are regions of storage in memory Object used determines device stream comes from or goes to cin and cout are identifiers for objects defined by iostream (screen and keyboard)
16 trang | Chia sẻ: thuongdt324 | Ngày: 28/11/2020 | Lượt xem: 669 | Lượt tải: 0
Data Structures and Algorithms - Chapter 10: Graphs - Trần Minh ChâuData structures for graphs Graph traversal Depth-first search Breadth-first search Directed graphs Shortest paths Dijkstra's Algorithm Minimum spanning trees Kruskal's Algorithm Prim-Jarnik Algorithm
104 trang | Chia sẻ: candy98 | Ngày: 28/11/2020 | Lượt xem: 636 | Lượt tải: 0
Data Structures and Algorithms - Chapter 9: Maps and Dictionaries - Trần Minh ChâuMaps Hash tables Dictionaries Maps & Dictionaries Map ADT and Dictionary ADT: model a searchable collection of key-value entries main operations are searching, inserting, and deleting entries Dictionary: multiple entries with the same key are allowed Dictionary applications: word-definition pairs credit card authorizations ...
29 trang | Chia sẻ: candy98 | Ngày: 28/11/2020 | Lượt xem: 623 | Lượt tải: 0
Data Structures and Algorithms - Chapter 8: Sorting - Trần Minh ChâuBubble Sort Insertion Sort Merge Sort Quick Sort
45 trang | Chia sẻ: candy98 | Ngày: 28/11/2020 | Lượt xem: 618 | Lượt tải: 0
Data Structures and Algorithms - Chapter 7: Trees - Trần Minh ChâuTree ADT Preorder and postorder traversals BinaryTree ADT Inorder traversal Tree Terminology Root: node without parent (A) • Internal node: node with at least one child (A, B, C, F) • Leaf (aka External node): node without children (E, I, J, K, G, H, D) • Ancestors of a node: parent, grandparent, great-grandparent, etc. • Depth o...
23 trang | Chia sẻ: candy98 | Ngày: 28/11/2020 | Lượt xem: 646 | Lượt tải: 0
Data Structures and Algorithms - Chapter 6: Search Trees - Trần Minh ChâuBinary Search Trees AVL Trees (2,4) Trees Red-Black Trees
20 trang | Chia sẻ: candy98 | Ngày: 28/11/2020 | Lượt xem: 738 | Lượt tải: 0
Data Structures and Algorithms - Chapter 5: Stacks & Queues - Trần Minh ChâuThe Stack ADT • Applications of Stacks • Array-based implementation • List-based stack • Applications • The Queue ADT • Implementation with a circular array • List-based queue • Round Robin schedulers
30 trang | Chia sẻ: candy98 | Ngày: 28/11/2020 | Lượt xem: 914 | Lượt tải: 0
Data Structures and Algorithms - Chapter 4: Arrays and Linked Lists - Trần Minh ChâuArrays Singly Linked Lists Doubly Linked Lists Arrays Built-in in most programming languages Two kinds (programmer responsibility): Unordered: attendance tracking Ordered: high scorers Operations: Insertion Deletion Search
27 trang | Chia sẻ: candy98 | Ngày: 28/11/2020 | Lượt xem: 706 | Lượt tải: 0
