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