DATA STRUCTURES AND
ALGORITHIMS
Examples of Linear and Non-Linear Types - Answer- Linear: Array, List, Stack, Que
Non-Linear: Tree, Graph
Considerations for choosing a Data Structure (5) - Answer- 1. Size of data
2. Speed and manner of data use
3. Data dynamics (how much/frequency of editing/changing)
4. Size of required storage
5. Fetch time of info from data structures
Name 6 Common Data structures - Answer- (linear)
1. Lists
2. Arrays
3. Records
4. Trees
5. Tables
6. Graphs
What is a data structure? - Answer- The scheme of organizing related information
Used to store data in an organized fashion
Basic Data Operations (6) - Answer- 1. Traversing
2. Searching
3. Insertion
4. Deletion
5. Sorting
6. Merging
Describe the "Divide and Conquer" strategy/algorithm for manipulating data -
Answer- 1. Divide problem into sub-problems
2. Find solution to each sub-problem
3. Merge sub-solutions into final solution
What is an algorithm? - Answer- A step by step procedure, which defines a set of
instructions to be executed in certain order to get the desired output.
Important Algorithm Categories/Functions (5) - Answer- 1. Search − Algorithm to
search an item in a datastructure.
2. Sort − Algorithm to sort items in certain order
3. Insert − Algorithm to insert item in a datastructure
4. Update − Algorithm to update an existing item in a data structure
5. Delete − Algorithm to delete an existing item from a data structure
ALGORITHIMS
Examples of Linear and Non-Linear Types - Answer- Linear: Array, List, Stack, Que
Non-Linear: Tree, Graph
Considerations for choosing a Data Structure (5) - Answer- 1. Size of data
2. Speed and manner of data use
3. Data dynamics (how much/frequency of editing/changing)
4. Size of required storage
5. Fetch time of info from data structures
Name 6 Common Data structures - Answer- (linear)
1. Lists
2. Arrays
3. Records
4. Trees
5. Tables
6. Graphs
What is a data structure? - Answer- The scheme of organizing related information
Used to store data in an organized fashion
Basic Data Operations (6) - Answer- 1. Traversing
2. Searching
3. Insertion
4. Deletion
5. Sorting
6. Merging
Describe the "Divide and Conquer" strategy/algorithm for manipulating data -
Answer- 1. Divide problem into sub-problems
2. Find solution to each sub-problem
3. Merge sub-solutions into final solution
What is an algorithm? - Answer- A step by step procedure, which defines a set of
instructions to be executed in certain order to get the desired output.
Important Algorithm Categories/Functions (5) - Answer- 1. Search − Algorithm to
search an item in a datastructure.
2. Sort − Algorithm to sort items in certain order
3. Insert − Algorithm to insert item in a datastructure
4. Update − Algorithm to update an existing item in a data structure
5. Delete − Algorithm to delete an existing item from a data structure
