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