Data Structures Final Exam Questions
With 100% Correct Answers | Verified |
Updated !!!
Big Oh Notation CORRECT ANSWERS - Least upper bound measure of the time
complexity of an algorithm
Algorithm Analysis CORRECT ANSWERS - Analyze code to see if its speed and/or
memory consumption is optimal for a given problem
O(1) CORRECT ANSWERS - Big oh of one
- Constant time
O(logn) CORRECT ANSWERS - Logarithmic Time
- As the problem doubles, it only takes one more unit of time
O(n) CORRECT ANSWERS - Linear time
- As the problem doubles so does the amount of work
O(nlogn) CORRECT ANSWERS - Linear log
O(n^2) CORRECT ANSWERS - Quadratic
Linear Search CORRECT ANSWERS - O(n)
- Typically in terms of worst case
- For unsorted array
Binary Search CORRECT ANSWERS - O(logn)
- Divide and conquer algorithm instead of reading the problem by 1 on each iteration,
we'll reduce it by a fractional amount
- For sorted array
Functional notation CORRECT ANSWERS - A more precise measure of the number of
steps/operations that a given algorithm requires to do complete
Big O from functional notation CORRECT ANSWERS - Keep only the fastest growing
term
- Drop coefficient
Recursion CORRECT ANSWERS - A method that calls itself
- Base case: recursion to stop
- Self-call (maybe indirect)
- Production rule: causes us to approach base case
, Tail Recursion CORRECT ANSWERS - The only self-calls are on the last statement of
the function
Non-tail Recursion CORRECT ANSWERS - Call(s) are embedded in the function body
Indirect Recursion CORRECT ANSWERS A() -> B() -> A()
Excessive Recursion CORRECT ANSWERS - Redundant recursion calls
Arrays CORRECT ANSWERS - Continuous chunk of memory
- Random access
---Element 5 is just as accessible as element 20
Linked Base CORRECT ANSWERS - Pointer/Reference
- One or more that link to another data point/node
Named Nodes CORRECT ANSWERS - Nodes that have a pointer(s) assigned to it that
are held in the list object
Linear Data Structures CORRECT ANSWERS - Straight, effectively single dimension
structure
- Commonly implemented with an array
Stack CORRECT ANSWERS - Linear
- Two basic operations
- Push: add data onto the top of the stack
- Pop: remove data from the top of the stack
--- O(1)
Pop() Operation CORRECT ANSWERS 1) Return value from the top of the stack
2) Shift the top over
3) Clean memory
Queues CORRECT ANSWERS - Linear data structure
- FIFO (First In First Out) or LILO (Last In Last Out)
- Enqueue: add data onto the last data
- Dequeue: remove data in the front
Linked Based Queue structure CORRECT ANSWERS - Singly Linked
- Two named nodes
Array Based Queue structure CORRECT ANSWERS - Pushing F(Front) and E(End)
towards next array
With 100% Correct Answers | Verified |
Updated !!!
Big Oh Notation CORRECT ANSWERS - Least upper bound measure of the time
complexity of an algorithm
Algorithm Analysis CORRECT ANSWERS - Analyze code to see if its speed and/or
memory consumption is optimal for a given problem
O(1) CORRECT ANSWERS - Big oh of one
- Constant time
O(logn) CORRECT ANSWERS - Logarithmic Time
- As the problem doubles, it only takes one more unit of time
O(n) CORRECT ANSWERS - Linear time
- As the problem doubles so does the amount of work
O(nlogn) CORRECT ANSWERS - Linear log
O(n^2) CORRECT ANSWERS - Quadratic
Linear Search CORRECT ANSWERS - O(n)
- Typically in terms of worst case
- For unsorted array
Binary Search CORRECT ANSWERS - O(logn)
- Divide and conquer algorithm instead of reading the problem by 1 on each iteration,
we'll reduce it by a fractional amount
- For sorted array
Functional notation CORRECT ANSWERS - A more precise measure of the number of
steps/operations that a given algorithm requires to do complete
Big O from functional notation CORRECT ANSWERS - Keep only the fastest growing
term
- Drop coefficient
Recursion CORRECT ANSWERS - A method that calls itself
- Base case: recursion to stop
- Self-call (maybe indirect)
- Production rule: causes us to approach base case
, Tail Recursion CORRECT ANSWERS - The only self-calls are on the last statement of
the function
Non-tail Recursion CORRECT ANSWERS - Call(s) are embedded in the function body
Indirect Recursion CORRECT ANSWERS A() -> B() -> A()
Excessive Recursion CORRECT ANSWERS - Redundant recursion calls
Arrays CORRECT ANSWERS - Continuous chunk of memory
- Random access
---Element 5 is just as accessible as element 20
Linked Base CORRECT ANSWERS - Pointer/Reference
- One or more that link to another data point/node
Named Nodes CORRECT ANSWERS - Nodes that have a pointer(s) assigned to it that
are held in the list object
Linear Data Structures CORRECT ANSWERS - Straight, effectively single dimension
structure
- Commonly implemented with an array
Stack CORRECT ANSWERS - Linear
- Two basic operations
- Push: add data onto the top of the stack
- Pop: remove data from the top of the stack
--- O(1)
Pop() Operation CORRECT ANSWERS 1) Return value from the top of the stack
2) Shift the top over
3) Clean memory
Queues CORRECT ANSWERS - Linear data structure
- FIFO (First In First Out) or LILO (Last In Last Out)
- Enqueue: add data onto the last data
- Dequeue: remove data in the front
Linked Based Queue structure CORRECT ANSWERS - Singly Linked
- Two named nodes
Array Based Queue structure CORRECT ANSWERS - Pushing F(Front) and E(End)
towards next array
