All about topic: Abstract data structures
The Big Question in Abstract data structures
Why do programmers organize data in specific ways? What advantages does one way of organizing data have over a different way of organizing data?
Description and resources for Abstract data structures
The reason we use abstract structures is because they efficiently use memory based on the design of the data stored in them. With very large amounts of data or very frequently changing data, the data structure can make a huge difference in the efficiency (run time) of your computer program.
In more common language, an abstract data structure is just some arrangement of data that we've built into an orderly arrangement.
What is really interesting here is how and why we store data.
The key transfer here is to build performant algorithms. You should be able to look at a novel abstract data structure and understand the benefit of that specific structure. Please remember: abstract data structures use memory in specific way to optimize the operations on data within that data structure.
Related Abstract data structures standards
Identify a situation that requires the use of recursive thinking.
Identify recursive thinking in a specified problem solution.
Trace a recursive algorithm to express a solution to a problem.
Describe the characteristics of a two- dimensional array.
Construct algorithms using two- dimensional arrays.
Describe the characteristics and applications of a stack.
Construct algorithms using the access methods of a stack.
Describe the characteristics and applications of a queue.
Construct algorithms using the access methods of a queue.
Explain the use of arrays as static stacks and queues.
Describe the features and characteristics of a dynamic data structure.
Describe how linked lists operate logically.
Sketch linked lists (single, double and circular).
Describe how trees operate logically (both binary and non-binary).
Define the terms: parent, left-child, right-child, subtree, root and leaf.
State the result of inorder, postorder and preorder tree traversal.
Sketch binary trees.
Define the term dynamic data structure.
Compare the use of static and dynamic data structures.
Suggest a suitable structure for a given situation.
Daily notes with the topic Abstract data structures
Notes for current academic year (2022 - 2023).