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