ordered list in which insertion/deletion are done at separate ends.

4 main operations that could be define for each ADT

Each instruction has to be clear and unambiguous.

repeating an action multiple times

is a special format for storing and organizing data.

always chooses the optimal approach in solving a problem

a partially sorted binary tree

a set of ordered pairs with elements known as key value

similar to divide and conquer except that the results of the subproblems are reused for overlapping subproblems

The result of each step depends on the input and/or the result of the previous step.

2 Classification of Data Structures

hierarchical nature of a structure in graphical form

What is ADT

used for retrieving either minimum or maximum element

stores elements where each is a separate object

breaking a problem into smaller subproblems

ordered list in which insertion/deletion are done at one (1) end

when a function calls itself once or multiple times to solve a problem

Two parts of ADT

Elements are stored and accessed in non-sequential order.

Elements that are accessed in a sequential order but may be stored unsystematically.

An algorithm must have one (1) or more results, with specified relation to the input.

An algorithm should have zero or more well-defined data given before the algorithm begins.

An algorithm must terminate after a specified number of steps.

is a step-by-step set of instructions to be executed in sequence for solving a problem.

collection of elements that do not have to be in order

 a set of vertices and set of links which connects that pair of vertices