- Computer Science Engineering (CSE)
- Data Structures (DS)
- The space factor when determining the ef...

Q. |
## The space factor when determining the efficiency of algorithm is measured by___________. |

A. | counting the maximum memory needed by the algorithm. |

B. | counting the minimum memory needed by the algorithm. |

C. | counting the average memory needed by the algorithm. |

D. | counting the maximum disk space needed by the algorithm. |

Answer» A. counting the maximum memory needed by the algorithm. |

View all MCQs in:
Data Structures (DS)

- The time factor when determining the efficiency of algorithm is measured by____________.
- Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- The efficient searching algorithm for algorithm for a sorted array is _________.
- Two main measures for the efficiency of an algorithm are____________.
- The efficiency of a BFS algorithm is dependent on _______.
- What is the space complexity for deleting a linked list?
- What is the space complexity of a linear queue having n elements?
- What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
- What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

Login to Continue

It will take less than 2 minutes

Report MCQ