Analysis and design of algorithms

What is the purpose of using Big-O notation in computer science?

• To determine the profitability of an algorithm

• To compare the time complexity of algorithms

• To measure the color complexity of an algorithm's output

• To calculate the exact runtime of an algorithm in seconds

What does it mean to 'analyse the suitability of different algorithms for a given task and data set'?

• To choose the best algorithm based on its color and style

• To select the most cost-effective algorithm

• To determine which algorithm performs best for specific conditions

• To use the same algorithm for all tasks

What is the primary purpose of using algorithms in routing problems?

• To increase the complexity of data transmission

• To find the shortest route for data packets on the Internet

• To reduce the speed of data transmission

• To increase data packet size

How do algorithms contribute to the security of communications?

• By encrypting communications to make them unhackable

• By making communications faster

• By reducing the cost of communications

• By publicizing the communication data

What is the purpose of writing a compiler program?

• To convert machine code into a high-level language

• To translate a high-level language to machine code

• To increase the execution time of programs

• To debug programs automatically

What type of diagram is predominantly used in the image to represent algorithm processes?

• Pie chart

• Flowchart

• Bar graph

• Line graph

What is a crucial characteristic of a good algorithm regarding its execution steps?

• It should execute in as many steps as possible

• It should execute efficiently, in as few steps as possible

• It should execute only with user intervention at each step

• It should execute differently each time it is run

Why must a good algorithm always terminate?

• To ensure it runs indefinitely

• To avoid using any system resources

• To ensure it does not enter an infinite loop

• To make it easier to write

What is the relationship between problem size and execution time as described in the material?

• The smaller the problem size, the longer the execution time

• The execution time is not related to the problem size

• The larger the problem size, the longer the execution time

• The execution time decreases as the problem size increases

How is the order of magnitude for a linear function written according to the learning material?

• O(n)

• O(n^2)

• O(log n)

• O(1)