Home Library Explore SAT

Home Library Explore SAT

CIS4514_Quiz3 Flashcards | StudBud

Explore/CIS4514_Quiz3

What is the worst-case time complexity of the Merge Sort algorithm?

Which of the following best describes the concept of algorithm complexity?

CIS4514_Quiz3

7 terms·StudBud Administration·17 plays

Imported from external platform

Flashcards7 cardsFPractice quizPHost liveL

Questions 7

Answers

1
Which of the following best describes the concept of algorithm complexity?
The number of variables used within an algorithm
The number of lines in the code that makes up an algorithm
The measure of time and/or space needed by an algo. as a function of input
The amount of memory an algorithm uses at runtime
2
What is the worst-case time complexity of the Merge Sort algorithm?
O(n log n)
O(n^2)
O(2^n)
O(n)
3
What is the worst-case time complexity of the Bubble Sort algorithm?
O(nlogn)
O(n)
O(1)
O(n^2)
4
Which of the following is NOT a characteristic of a well-designed algorithm?
It produces an output
It has a clear beginning and end
It can solve any problem, regardless of input type
It has a finite number of steps
5
What is the worst-case time complexity of the Insertion Sort algorithm?
O(n^2)
O(2^n)
O(n)
O(nlogn)
6
Which of the following statements about time complexity is TRUE?
Time complexity remains constant regardless of input size
Time complexity only considers the time taken by the fastest part of algo.
It is measured by counting basic operations as input size increases
Time complexity is concerned only with how much memory an algorithm uses
7
What is the correct definition of an algorithm?
A set of instructions designed to perform a specific task/ solve a problem
A collection of data used in computer systems
A programming language used to solve mathematical problems
A graphical representation of data flow in a program