
Algorithm Time Complexities and Spring MVC Concepts
Flashcard
•
Computers
•
12th Grade
•
Easy
Valo Márquez
Used 2+ times
FREE Resource
Student preview

20 questions
Show all answers
1.
FLASHCARD QUESTION
Front
What is O(1) time complexity?
Back
O(1) — Constant Time: The running time of the algorithm is constant and doesn’t change with the size of the input data set. For instance, accessing an array element with its index is an O(1) operation.
2.
FLASHCARD QUESTION
Front
What is O(log n) time complexity?
Back
O(log n) — Logarithmic Time: Each time the algorithm’s operation runs, the size of the input data set is decreased significantly (often halved). Binary search is a classic example, where the list to be searched gets halved with each step.
3.
FLASHCARD QUESTION
Front
What is O(n) time complexity?
Back
O(n) — Linear Time: The running time of the algorithm grows linearly with the size of the input data set. Simple search algorithms, iterating through all elements of an array or list, typically have linear time complexity.
4.
FLASHCARD QUESTION
Front
What is O(n²) time complexity?
Back
O(n²) — Quadratic Time: The algorithm’s running time is proportional to the square of the size of the input data set. Algorithms with nested loops often fall into this category. Examples include bubble sort, insertion sort, and selection sort for their average or worst-case scenarios.
5.
FLASHCARD QUESTION
Front
What is O(2^n) time complexity?
Back
O(2^n) — Exponential Time: Algorithms with this time complexity double their running time with each additional element in the input data set. This is often seen in brute-force algorithms. An example is the recursive calculation of the Fibonacci sequence without memoization.
6.
FLASHCARD QUESTION
Front
What is O(n!) time complexity?
Back
O(n!) — Factorial Time: The running time grows factorial based on the input size. This is seen in some particularly inefficient algorithms, especially certain brute-force methods. The classic example is the traveling salesman problem solved using a brute-force approach.
7.
FLASHCARD QUESTION
Front
What is Spring MVC?
Back
Spring MVC — a framework within the Spring Framework that is used for building web applications. It follows the Model-View-Controller (MVC) design pattern, which separates the application into three interconnected components: Model (data), View (presentation), and Controller (business logic).
Create a free account and access millions of resources
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
Similar Resources on Wayground
15 questions
Untitled form
Flashcard
•
University
15 questions
The Great Gatsby Reading control
Flashcard
•
University
17 questions
Todays Affirmations
Flashcard
•
University
15 questions
7517 01 Programming Basics
Flashcard
•
10th Grade - University
12 questions
Understanding Minimalism Concepts
Flashcard
•
University
20 questions
Understanding Zina in Islamic Law
Flashcard
•
12th Grade - University
15 questions
Understanding Pseudocode Concepts
Flashcard
•
12th Grade
12 questions
Organic 2 Exam 4 Review
Flashcard
•
KG
Popular Resources on Wayground
20 questions
Halloween Trivia
Quiz
•
6th - 8th Grade
25 questions
Multiplication Facts
Quiz
•
5th Grade
15 questions
Order of Operations
Quiz
•
5th Grade
20 questions
Halloween
Quiz
•
5th Grade
16 questions
Halloween
Quiz
•
3rd Grade
12 questions
It's The Great Pumpkin Charlie Brown
Quiz
•
1st - 5th Grade
20 questions
Possessive Nouns
Quiz
•
5th Grade
10 questions
Halloween Traditions and Origins
Interactive video
•
5th - 10th Grade