
Algorithm Time Complexities and Spring MVC Concepts
Flashcard
•
Computers
•
12th Grade
•
Practice Problem
•
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).
Access all questions and much more by creating a free account
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
Already have an account?
Similar Resources on Wayground
10 questions
Technology vocabulary
Flashcard
•
University
15 questions
Relative Clauses
Flashcard
•
12th Grade
16 questions
April Fools Trivia
Flashcard
•
KG - University
15 questions
Complete Ielts 5-6.5 - Unit 6 (Listening & Reading_Vocab))
Flashcard
•
University
15 questions
Curriculum Approaches Flashcards
Flashcard
•
University
17 questions
Philippine History
Flashcard
•
University
20 questions
Erosion & Deposition Flashcard Review
Flashcard
•
KG - University
Popular Resources on Wayground
15 questions
Fractions on a Number Line
Quiz
•
3rd Grade
20 questions
Equivalent Fractions
Quiz
•
3rd Grade
25 questions
Multiplication Facts
Quiz
•
5th Grade
22 questions
fractions
Quiz
•
3rd Grade
20 questions
Main Idea and Details
Quiz
•
5th Grade
20 questions
Context Clues
Quiz
•
6th Grade
15 questions
Equivalent Fractions
Quiz
•
4th Grade
20 questions
Figurative Language Review
Quiz
•
6th Grade