COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Correctness
|
|
|
Time Complexity
|
|
|
Space Complexity
|
|
|
None of the above
|
Detailed explanation-1: -Time Complexity − Running time or the execution time of operations of data structure must be as small as possible. Space Complexity − Memory usage of a data structure operation should be as little as possible.
Detailed explanation-2: -Characteristics of a data structure There are three main characteristics: Correctness. Time complexity. Space complexity.
Detailed explanation-3: -The running time of an algorithm refers to the length of time it takes for it to run as a function. An algorithm’s running time for a given input depends on the number of operations executed. An algorithm with more operations will have a lengthier running time.
Detailed explanation-4: -Time complexity is a function that describes how long an algorithm takes in terms of the quantity of input it receives. Space complexity is a function that describes how much memory (space) an algorithm requires to the quantity of input to the method.
Detailed explanation-5: -Explanation: Worst Case : This is the scenario where a particular data structure operation takes maximum time it can take.