Problem Solving in Computer Science

When sorting algorithms, the approach that goes through a list by comparing each pair of adjacent elements and swapping them if they are in the wrong order is most commonly known as which of the following?

Bubble sort

When selecting one algorithm from two or more algorithms to accomplish the same task, which of the following is true?

Consider the simplicity of the algorithms.

Which of the following is the correct order of the three steps of merge sort?

Divide, concur, and combine

When using a hotel Web site to search for hotel rooms, the objects can be of complex types. Which of the following would qualify as a property for this sorting algorithm?

Hotel distance from a city center or an event - or - Previous guest ratings

Which of the following is true about the measurement of algorithm complexity?

It measures the efficiency of algorithms.

When using time and space trade-offs, appropriate choices need to be considered to reach the _____ efficiency of an algorithm.

Optimal

Which of the following is true about time complexity?

Reducing the time complexity of an algorithm reduces the amount of time for the algorithm to run. - or - It is the measurement of the time that it will take for an algorithm to run.

In the design process of an algorithm, it is often required to _____ optimize the time complexity and the space complexity.

Simultaneously

Which of the following is true about space complexity?

Some sorting algorithms are in-place, whereas some are non-in-place. - or - In-place space algorithms use no new (or very little) auxiliary memory when executed.

The memory that is required to run an algorithm is known as _____ complexity.

Space

In addition to space and time complexities for algorithms, a third classification is _____, which is important for sorting integrity.

Stability

Which of the following should be considered in algorithm implementation?

The average and worst case data sizes that a product or an application uses when applying an algorithm

Keith has a request to implement an algorithm for an application that has to respond to all users' requests in less than 1 second. Which of the following must Keith concentrate on?

The expected turnaround time for the product or application to respond to users' requests

Which of the following should be considered when selecting an algorithm for implementation?

The time and space complexities of the algorithm

The time that it will take for an algorithm to be executed is known as _____ complexity.

Time

Consider the factors to consider when selecting an algorithm for implementation. Which of the following should be considered when selecting an algorithm?

Time complexity

The exchange of one thing for another of more or less value, especially to affect a compromise, is known as a _____.

Trade-off

Consider the factors to consider when selecting an algorithm for implementation. Which of the following should not be considered when selecting an algorithm?

Understating the minimum usage of an algorithm in an application that uses it

Which of the following is true about space and time trade-offs when designing an algorithm?

You should have more space to improve time complexity.

Data sorting is arranging time _____ in a list or collection in increasing or decreasing order of some property. It is important that the time _____ is/are homogeneous.

elements; properties