Chapter 1 Flashcards
The method be which data is organised is knows as?
Data structures
Depending on how you choose to organise your data, your program may run faster or slower by orders of?
Magnitude
The array data structure is defined as
a list of data elements
What is the index of an array?
The index of an array is the number which identifies where a piece of data lives inside the array
Most data structures used in four basic ways are referred to as
Operations
The four operations of data structures are
Read
Search
Insert
Delete
Measuring the speed of an operation is also known as its what?
Time complexity
Looking up a value at a particular index is known as
Read
Looking to see if a particular value exists within the array and if so, which index it falls at is known as
Search
Insert is known as
Adding a new value to an additional slot within the array
Delete is known as
Removing a value from the data structure
A computer’s memory can be viewed as
a giant collection of cells
The kind of search operation where the computer checks each cell one at a time is known as?
Linear search
Why is searching less efficient than reading?
Searching is less efficient than reading because it takes many steps to search while it takes reading just one step no matter the size of the array
Insertion in a worst case scenario can take how many steps for inserting an array containing any number of elements?
N + 1 steps. Here, there are N shifts plus 1 insertion which makes up the total number of steps
