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