MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
. Match the following.a) Completeness i) How long does it take to find a solutionb) Time Complexity ii) How much memory need to perform the search.c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
A
a-iii, b-i, c-ii
B
a-i, b-ii, c-iii
C
a-i, b-iii, c-ii
D
a-iii, b-ii, c-i
Explanation: 

Detailed explanation-1: -Time complexity is defined as the amount of time taken by an algorithm to run, as a function of the length of the input. It measures the time taken to execute each statement of code in an algorithm.

Detailed explanation-2: -The time complexity, measured in the number of comparisons, then becomes T(n) = n-1. In general, an elementary operation must have two properties: There can’t be any other operations that are performed more frequently as the size of the input grows.

Detailed explanation-3: -A search algorithm is complete if it is guaranteed to find a solution if there is one. Those search strategies that are guaranteed to find a path with fewest arcs or the least cost are complete. They have worst-case time complexity which increases exponentially with the number of arcs on the paths explored.

Detailed explanation-4: -Answer: Option 3. Explanation: A measure of the amount of memory needed for an algorithm to execute is called Space efficiency or space complexity.

There is 1 question to complete.
Previous
Next