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