Two main measures for the efficiency of an algorithm are____________.

Related MCQs

• 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 time factor when determining the efficiency of algorithm is measured by____________.
• The space factor when determining the efficiency of algorithm is measured by___________.
• The efficiency of a BFS algorithm is dependent on _______.
• A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
• What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
• What is the time complexity of an infix to postfix conversion algorithm?
• Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?
• In infix to postfix conversion algorithm, the operators are associated from?