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