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: -Correctness-Data structure implementation should accurately implement its interface. Time Complexity-The running time or execution time of data structure operations must be as short as feasible. Space Complexity-A data structure operation should use as little memory as feasible.
Detailed explanation-2: -Space Complexity − Memory usage of a data structure operation should be as little as possible.
Detailed explanation-3: -Characteristics of a data structure There are three main characteristics: Correctness. Time complexity. Space complexity.
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: -6. Which of the following is not a Characteristics of a Data Structure? Explanation: Completeness is not a Characteristics of a Data Structure.