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