Algorithms - Quiz
A) Quick Sort B) Heap Sort C) Merge Sort D) Bubble Sort
A) Queue B) Array C) Binary Tree D) Stack
A) Prim's algorithm B) Dijkstra's algorithm C) Bellman-Ford algorithm D) A* search algorithm
A) A function that generates random numbers. B) A function that has no return statement. C) A function that iterates over a collection of elements. D) A function that calls itself in a problem-solving process.
A) Tarjan's algorithm B) Kosaraju's algorithm C) Warshall's algorithm D) Floyd's algorithm
A) Complexity B) Efficiency C) Scalability D) Granularity
A) Insertion Sort B) Selection Sort C) Merge Sort D) Bubble Sort
A) Burrows-Wheeler Transform B) Huffman Coding C) Run-Length Encoding D) Differential Encoding
A) Queue B) Linked List C) Stack D) Heap
A) Ford-Fulkerson algorithm B) Bubble Sort C) Binary Search algorithm D) Depth-First Search
A) O(log n) B) O(n) C) O(n2) D) O(n log n)
A) BFS is easier to implement. B) DFS uses less memory space. C) BFS guarantees the shortest path to the goal. D) DFS finds the path more quickly.
A) To find the shortest paths between all pairs of vertices in a weighted graph. B) To sort elements in ascending order. C) To calculate the maximum flow in a flow network. D) To determine the largest connected component in an undirected graph.
A) Longest Common Subsequence algorithm B) Selection Sort C) Radix Sort D) Heap Sort
A) Muḥammad ibn Mūsā al-Khwārizmī B) Adelard of Bath C) Geoffrey Chaucer D) John of Seville
A) Algorism B) algoritmi C) augrym D) arithmos
A) The Canterbury Tales B) Liber Algoritmi de numero Indorum C) Liber Alghoarismi de practica arismetrice D) kitāb al-ḥisāb al-hindī
A) They are based on finite sequences of instructions. B) They provide well-defined correct results for all users. C) They use deterministic processes to generate recommendations. D) They rely on heuristics, not true algorithms.
A) They prevent automated reasoning. B) They eliminate randomness from the algorithm. C) They divert code execution through various routes. D) They ensure that the algorithm always terminates.
A) Generating random outputs without input. B) Following a fixed sequence of operations. C) Using heuristics to solve problems. D) Deducing valid inferences through code execution.
A) They were early computers. B) They were a form of algorithmic programming. C) They represented heuristic methods. D) They were used for place-value calculation.
A) Egyptian mathematics B) Greek mathematics C) Chinese mathematics D) Babylonian mathematics
A) Neo-Babylonian dynasty B) Assyrian dynasty C) Akkadian dynasty D) Hammurabi dynasty
A) Greek mathematics B) Babylonian mathematics C) Egyptian mathematics D) Indian mathematics
A) Al-Kindi B) Muḥammad ibn Mūsā al-Khwārizmī C) Euclid D) Nicomachus
A) Template method pattern B) Decorator pattern C) Divide-and-conquer D) Dynamic programming
A) Television B) Telegraph C) Telephone D) Radio
A) Algebra by Al-Khwarizmi B) Euclid's Elements C) Introduction to Arithmetic by Nicomachus D) Sulba Sutras
A) Analytical engine B) Telephone-switching network C) Jacquard loom D) Telegraph
A) Quartz oscillator B) Pendulum mechanism C) Balance wheel mechanism D) Verge escapement mechanism
A) Serial execution B) Recursion C) Parallel processing D) Iteration
A) Greedy method B) Dynamic programming C) Linear programming D) Heuristic method
A) Reduction of complexity B) Brute-force or exhaustive search C) Backtracking D) Divide and conquer
A) Konrad Zuse B) George Stibitz C) Alan Turing D) John von Neumann
A) Solving integer programming problems. B) Optimizing linear functions with constraints. C) Simulating annealing processes. D) Finding minimal spanning trees.
A) David Hilbert B) Alonzo Church C) Emil Post D) Alan Turing
A) Natural languages B) Flowcharts C) Pseudocode D) Drakon-charts
A) Charles Babbage B) Herman Hollerith C) George Stibitz D) Ada Lovelace
A) P B) ZPP C) NP D) RP
A) Rectangles B) Arrows C) Dots D) Diamonds
A) Control tables B) Implementation description C) Formal description D) High-level description
A) Substitution cipher B) Transposition cipher C) Frequency analysis D) Caesar cipher
A) SAINT program B) Turing machines C) Post-quantum encryption standards D) Lambda calculus
A) IF-THEN-ELSE B) SEQUENCE C) WHILE-DO D) RECURSION
A) LLVM standard C++ sorting library B) C# System.Linq C) Python's built-in sort function D) Java Collections Framework
A) Language models B) Human coders C) Reinforcement learning D) Automated evaluators
A) Decision point B) Program flow C) Sub-structure nesting D) Output
A) 2025 B) 2023 C) 2019 D) 2020
A) A simple and general representation B) An optimized code for specific hardware C) A detailed implementation guide D) A graphical aid like a flowchart
A) Prim's algorithm B) Tabu search C) Floyd–Warshall algorithm D) Simulated annealing
A) Parallelizable algorithms B) Inherently serial problems C) Distributed algorithms D) Non-deterministic algorithms
A) AlphaEvolve B) AlphaZero C) AlphaDev D) DeepMind
A) Difference Engine B) Z3 C) Babbage's analytical engine D) ENIAC
A) Sequential search B) Bubble sort C) Binary search D) Linear search
A) P versus NP problem B) Las Vegas problem C) Monte Carlo problem D) Reduction of complexity problem
A) Decorator pattern B) Dynamic programming C) Template method pattern D) Divide-and-conquer
A) Floppy disks B) Magnetic tape C) Hard drives D) Punch cards
A) Turing machines B) Lambda calculus C) Recursive functions D) Formulation 1
A) Quantum computing B) Transformer-based AI C) SAINT program D) NIST encryption standards
A) Difference engine B) Punch cards C) Electromechanical relays D) Telegraph
A) Problems with integer constraints. B) Graphs without negative cycles. C) Dynamic programming problems. D) Linear programming problems.
A) Audio recording B) Text messaging C) Data transmission D) Image printing
A) 15th century B) 19th century C) 13th century D) 17th century |
Created with That Quiz —
the site for test creation and grading in math and other subjects.