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

Q. |
## The time factor when determining the efficiency of algorithm is measured by____________. |

A. | counting microseconds. |

B. | counting the number of key operations. |

C. | counting the number of statements. |

D. | counting the kilobytes of algorithm. |

Answer» B. counting the number of key operations. |

View all MCQs in:
Data Structures (DS)

- The space 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 time complexity of an infix to postfix conversion algorithm?
- A variable whose size is determined at compile time and cannot be changed at run time is_________.
- What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
- Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?

Login to Continue

It will take less than 2 minutes

Report MCQ