Which of the following best describes an algorithm?, A programming language, A finite set of instructions, A type of hardware, A graphical interface, What is the Big-O notation for a linear search algorithm?, O(1), O(log n), O(n), O(n²), Which sorting algorithm has a worst-case time complexity of O(n²)?, Merge sort, Quick sort (worst case), Binary search, Heap sort, An algorithm that runs in exponential time is considered to run in:, Reasonable time, Polynomial time, Unreasonable time, Constant time, Which of the following is an example of a problem that runs in unreasonable time?, Sorting with merge sort, Finding shortest path, Traveling salesman problem, Binary search in array, What does it mean when we say a problem is 'undecidable'?, It takes too long, No algorithm exists, It requires too much memory, Solved on quantum computers, The Halting Problem is an example of:, Reasonable time problem, Unreasonable time problem, An undecidable problem, Solved by parallel computing, Which of the following best describes parallel computing?, One instruction at a time, Problem parts solved simultaneously, Multiple programming languages, Data in multiple locations, If a task takes 60 seconds sequentially and can be perfectly divided among 4 processors, how long would it take using parallel processing?, 60 seconds, 30 seconds, 15 seconds, 240 seconds, Which of the following tasks would benefit MOST from parallel processing?, Reading file line by line, Applying filter to pixels, Calculating Fibonacci numbers, Following a linked list, What is a key limitation of parallel computing?, Always makes programs faster, Some problems can't be parallelized, Requires special languages, Works with small data sets, Which of the following time complexities represents polynomial time?, O(2ⁿ), O(n!), O(n³), O(nⁿ), A heuristic approach to a problem:, Always finds optimal solution, Good solution in reasonable time, Makes problem undecidable, Converts exponential to polynomial, Binary search has a time complexity of O(log n). This means:, Runs in constant time, Runtime doubles with input, Runtime increases by 1 with input, Runs in exponential time, Which statement about decidable vs. undecidable problems is correct?, Decidable solved in reasonable time, Undecidable need faster computers, Decidable always correct answers, All real-world problems decidable, What is 'speedup' in parallel computing?, Ratio of sequential to parallel time, Number of processors used, Improvement in code quality, Reduction in memory usage, Which scenario demonstrates Amdahl's Law?, More processors doubles performance, 50% sequential code limits speedup, Parallel always faster, Memory increases with processors, An algorithm that checks every possible password combination is an example of:, Polynomial-time algorithm, Brute-force in unreasonable time, Undecidable problem, Efficient algorithm, Which of the following problems is decidable but may take unreasonable time?, The Halting Problem, Optimal traveling salesman, Prime or composite number, Reading input from user, What is the time complexity of accessing an element in an array by index?, O(1), O(log n), O(n), O(n²).

Algorithm and Complexity Quiz

etter
Skriv ut
Innebygd

Ledertavle

Visuell stil

Alternativer

AI-forsterket: Denne aktiviteten inneholder innhold generert av AI. Få mer informasjon.

Bytt mal

Gjenopprett automatisk lagring: ?