24-2 IT104 P1

The data elements are organized in a sequential series in a ______data structure.

In ___________ data structures all elements may or may not be of same type.

In ___________ data structure data items are not in sequence.

All that good algorithms do, with the exception of ...

• They are accurate

• They deliver an accurate output

• They never terminate

• They are unmistakable 

Which of the following is NOT a feature of a good computer program?

• Be easy to read and understand

• Run efficiently and correctly

• Be complex and hard to debug

• Be easy to modify 

In the analysis of time complexity, which of the following best describes a constant time statement?

• Takes varying time based on inputs

• Executes in the same amount of time regardless of input size

• Always takes more than one second to execute

• Depends on the operating system 

Which of the following describes nested loops in the context of time complexity analysis?

• A loop within a loop that executes more than once

• A loop that never ends

• Statements that are not affected by input size

• A separate program from the main algorithm

Which of the following correctly defines space complexity?

• The amount of time an algorithm takes to run

• The total amount of memory required by an algorithm

• The length of the code in a program

• The efficiency of a data structure

What does the ‘n' typically represent in time complexity functions?

• The number of instructions

• The total number of algorithms

• The size of the input

• The depth of recursion

Which goal of data structure design is emphasized as the primary focus?

• Effectivity

• Easy modification

• Correctness

• User-friendliness