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