Data Structures Notes
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View Data Structures Notes as PDF for free.
More details
- Words: 298
- Pages: 2
What is Data structures A specific data object used as an object of computation. What we use Algorithms in Data Structure? • • • • • •
determine the running time of a program as a function of its inputs; determine the total or maximum memory space needed for program data; determine the total size of the program code; determine whether the program correctly computes the desired result; determine the complexity of the program--e.g., how easy is it to read, understand, and modify; and, determine the robustness of the program--e.g., how well does it deal with unexpected or erroneous inputs?
the hardware: processor used (type and speed), memory available (cache and RAM), and disk available; the programming language in which the algorithm is specified; the language compiler/interpreter used; and the computer operating system software. o o o
• • •
What is foundational Data Structures? • • • • •
Dynamic Arrays Singly-Linked Lists Multi-Dimensional Arrays Exercises Projects
Why we use Stacks, queues and deque? A stack can be used to keep track of partially completed tasks. A queue is a pile in which items are added an one end and removed from the other.a queue is used when a sequence of activities must be done on a first-come, first-served basis. a deque extends the notion of a queue. In a deque, items can be added to or removed from either end of the queue. In a sense, a deque is the more general abstraction of which the stack and the queue are just special cases.
What is a linked lista linked list ? is data structure that consists of a sequence of data records such that in each record there is a field that contains a reference (i.e., a link) to the next record in the sequence.
determine the running time of a program as a function of its inputs; determine the total or maximum memory space needed for program data; determine the total size of the program code; determine whether the program correctly computes the desired result; determine the complexity of the program--e.g., how easy is it to read, understand, and modify; and, determine the robustness of the program--e.g., how well does it deal with unexpected or erroneous inputs?
the hardware: processor used (type and speed), memory available (cache and RAM), and disk available; the programming language in which the algorithm is specified; the language compiler/interpreter used; and the computer operating system software. o o o
• • •
What is foundational Data Structures? • • • • •
Dynamic Arrays Singly-Linked Lists Multi-Dimensional Arrays Exercises Projects
Why we use Stacks, queues and deque? A stack can be used to keep track of partially completed tasks. A queue is a pile in which items are added an one end and removed from the other.a queue is used when a sequence of activities must be done on a first-come, first-served basis. a deque extends the notion of a queue. In a deque, items can be added to or removed from either end of the queue. In a sense, a deque is the more general abstraction of which the stack and the queue are just special cases.
What is a linked lista linked list ? is data structure that consists of a sequence of data records such that in each record there is a field that contains a reference (i.e., a link) to the next record in the sequence.
Related Documents
Data Structures Notes
May 2020 9
Data Structures
October 2019 38
Data Structures
June 2020 21
Data Structures
April 2020 34
Data Structures
May 2020 22