Algorithms trivia

40 Algorithms trivia questions, no sign-in. Review your misses in the LoreUp app.

• Which sort repeatedly picks the smallest value left and puts it in the front position?Algorithms
• Which data structure stores values of one kind in a single row, each given a number?Algorithms
• What is the single node at the very top of a tree structure called?Algorithms
• Which sort is named for the way small values rise to one end like bubbles?Algorithms
• Which data structure lets you add and remove items at both the front and the back?Algorithms
• Which sort works like picking up cards one at a time and slipping each into its right place among the cards already arranged?Algorithms
• What is the time complexity of a search that weighs items against the middle value of sorted data and halves the range each time?Algorithms
• How many comparisons between values are needed at minimum to be sure of the largest of 100 unsorted numbers?Algorithms
• Which data structure serves the item with the highest assigned rank first, whatever order items went in?Algorithms
• Big O notation keeps the coefficients and the lower-order terms of an expression as they are.Algorithms
• On a stack, putting an item in is called pop and taking one out is called push.Algorithms
• Which flowchart symbol marks the spot where a condition splits the flow in two?Algorithms
• Rewriting the same procedure in Python instead of Java makes it a different algorithm.Algorithms
• There is only one algorithm for a given problem, so there is no choice of method to make.Algorithms
• Algorithms are at work when a map app finds a quick route to your destination.Algorithms
• A recipe written out as ordered steps also counts as an example of an algorithm.Algorithms
• The same algorithm can take longer to compute when there is more data to handle.Algorithms
• The same algorithm can take different amounts of time depending on which input it is given.Algorithms
• A set stores a value twice, as two separate items, when the same value is added twice.Algorithms
• In a binary search tree, the left subtree of a node holds values smaller than that node.Algorithms
• Binary search gives the right result even when the data is not sorted.Algorithms
• Which data structure takes out the item that entered first?Algorithms
• Which method halves the search range each time by comparing against the middle value of sorted data?Algorithms
• Which data structure expresses relationships with vertices and edges?Algorithms
• Which data structure is mainly used for BFS, which explores a graph starting from the nearest vertices?Algorithms
• Which data structure is mainly useful for DFS, which follows one path in a graph as deep as it can?Algorithms
• What is the usual average time complexity of looking up a value by key in a hash table?Algorithms
• What must a recursive function have so that it finishes instead of calling itself forever?Algorithms
• Which algorithm strategy takes the choice that looks best right now at every step?Algorithms
• Breadth-first search (BFS) is usually implemented with a queue.Algorithms
• What is the result of sorting the numbers 3, 1, 2 in ascending order?Algorithms
• Which data structure takes out the most recently added item first?Algorithms
• Linear search checks the middle value first and halves the range each time.Algorithms
• Sorting is the work of arranging data in order by some fixed criterion.Algorithms
• A flowchart is a drawing that shows the flow of an algorithm with symbols and arrows.Algorithms
• Time complexity is the measure of how much memory a program takes up.Algorithms
• A stack is a FIFO structure in which the item put in first comes out first.Algorithms
• A recursive function is one that calls itself again.Algorithms
• A queue is a FIFO structure in which the item put in first comes out first.Algorithms
• An algorithm is the name for the physical parts a computer is made of.Algorithms