Advanced Data Structures: An Introduction to Data Structures and Algorithms
- ISBN-10
- 1777407516
- ISBN-13
- 9781777407513
- Category
- Computers
- Pages
- 160
- Language
- English
- Published
- 2020-11-08
- Publisher
- PageWizard Games, Learning & Entertainment
- Author
- Daniel R. Page
Description
Learn Data Structures and Algorithms! This book is a collection of lectures notes on Data Structures and Algorithms. The content found in this book supplements the free video lecture series, of the same name, "Advanced Data Structures", by the author, Dr. Daniel Page. This video lecture series is available at http://www.pagewizardgames.com/datastructures. This book: -Contains Computer Science topics and materials comparable to those found among university courses at a similar level (second-year) at top Canadian universities. -Provides an accessible written companion and supplemental notes for those that wish to learn the subject of Data Structures and Algorithms from the video lecture series, but have difficulties taking notes, or would prefer having a written alternative to follow along. This book is ideal for those with already an introductory programming background, know a little bit about computing, and wish to learn more about Data Structures and Algorithms and begin a more formal study of Computer Science. The materials here are a great place to start for supplemental/additional learning materials on the subject for self-study, university students, or those that want to learn more about Computer Science. Dr. Daniel Page places great emphasis on the introductory mathematical aspects of Computer Science, a natural transition from a basic programming background to thinking a bit more like a computer scientist about Computer Science. This book is not a textbook. The author assumes the reader is familiar with algebra, functions, common finite and infinite series such as arithmetic series and geometric series, and basic control structures in programming or logic. All the algorithms in this book are described in English, or using Java-like pseudocode. Chapters -Chapter 1 - Introduction: Data Structures, Problems, Input Size, Algorithms, The Search Problem. -Chapter 2 - Intro to Analysis of Algorithms I: Complexity Analysis, Comparing Algorithms, Growth Rate of Functions (Asymptotics), Showing f is O(g), Showing f is not O(g). -Chapter 3 - Intro to Analysis of Algorithms II: Some Properties of O, An Iterative Example, Back to our "Easy" Search Problem. -Chapter 4 - Dictionaries: The Dictionary Problem, Simple Implementations of a Dictionary. -Chapter 5 - Hashing: Hash Function, Hash Code, Separate Chaining, Open Addressing, Revisiting the Load Factor. -Chapter 6 - Trees: Tree ADT, Linked Tree Representation, Tree Property, Computing Height of a Tree, Tree Traversals -Chapter 7 - Priority Queues & Heaps: Priority Queues, Heaps, Array-Based Implementation, Building a Heap, Application: Sorting, Introduction to Amortized Analysis -Chapter 8 - Binary Search Trees: Ordered Dictionary ADT, BST Implementations, Inorder Traversal, Smallest, Get, Put, Remove, Successor. -Chapter 9 - AVL Trees: Height, AVL Trees, Re-Balancing AVL Trees, putAVL, removeAVL, AVL Tree Performance. -Chapter 10 - Graphs: Degrees and the Handshaking Lemma, Complete Graphs, Paths and Cycles, Trees, Forests, Subgraphs, and Connectivity, Graph Representations. -Chapter 11 - Graph Traversals: Depth-First Search (DFS), Path-Finding, Cycle Detection, Counting Vertices, DFS Tree, Breadth-First Search (BFS), Summary. -Chapter 12 - Minimum Spanning Trees: Weighted Graphs, Minimum Spanning Trees & Algorithms, Prim's Algorithm, Heap-Based Implementation of Prim's Algorithm and More! -Chapter 13 - Shortest Paths: Single-Source Shortest Path Problem, Dijkstra's Algorithm. -Chapter 14 - Multiway Search Trees: Beyond Binary Search Trees, Get, Put, Successor and Remove, (2,4)-Trees, B-Trees.
Get the book
Other editions
Similar books
-
Family History Digital Libraries
By William Sims BainbridgeOne named Sara and Timberlake had 11 male workers, 1 female worker, and 4 children workers, so it might have employed the Minor family.
-
Foundation Dreamweaver MX
By Craig Grannell, Jerome Turner, Matt StephensSo here's what we need to do to arrive at our layout: s Create the main table to hold all the page elements. s Deal with the navigation area which is ...
-
Cisco CCNA Certification, 2 Volume Set: Exam 200-301
By Todd LammleThis inclusive, two-book set provides what you need to know to succeed on the new CCNA exam. The set includes Understanding Cisco Networking Technologies: Volume 1 and the CCNA Certification Study Guide: Volume 2.
-
CompTIA Network+ Study Guide: Exam N10-006
By Todd Lammle... you can use: –a –A –c –n –r –R –S –s All nbtstat switches are case sensitive. Generally speaking, lowercase switches deal with NetBIOS names of hosts, ...
-
CompTIA Network+ Study Guide with Online Labs: N10-007 Exam
By Todd Lammle, Jon Buhagiar... you can use: –a –A –c –n –r –R –S –s All nbtstat switches are case sensitive. Generally speaking, lowercase switches deal with NetBIOS names of hosts, ...
-
CCNA: Cisco Certified Network Associate FastPass
By Todd LammleS The S reference point defines the point between the customer router and an ... with the letter E deal with using ISDN on the existing telephone network.
-
Stranger in the Chat Room
By Todd Hafer, Jedd HaferA sequel to In the Chat Room With God finds a group of teens contacted by a mysterious and increasingly malevolent character who claims to know about their encounters with the Almighty and challenges their beliefs. Original.
-
Error Correction Coding: Mathematical Methods and Algorithms
By Todd K. MoonM M−1∑ k=0 −∞ ∞ k=0 The average energy per signal E s ∫ can be related to the ... we will deal primarily with additive white Gaussian noise (AWGN), ...
-
Security+ Training Guide
By Todd King... to deal with most , but unfortunately not all , of these potential threats . ... The S / MIME standard implements encryption for message content using ...
-
CCDA: Cisco Certified Design Associate Study Guide: Exam 640-861
By Todd Lammle, Andy BarklS reference point The S reference point defines the reference point between ... with the letter E deal with using ISDN on the existing telephone network.