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