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