Data Structures
This is the simplest data structure where elements are stored in a contiguous block of memory.
What is an array?
This is preprocessing directive that contains declarations for standard input/output objects like 'cout' and 'cin'.
What is '#include <iostream>'
This is the main component of a computer responsible for executing instructions.
What is cpu?
This is the pseudocode to swap two numbers a and b.
What is 'temp = a; a = b; b = temp'?
The algorithm used to find the shortest path in a weighted graph is named after this person.
Who is Dijkstra?
This is used to describe algorithm time/space complexities.
What is Big O notation?
This string function in Python removes white spaces from both ends of a string.
What is strip()?
This memory type is volatile and stores data temporarily for quick access by the processor.
What is RAM?
This is the pseudocode to check if a number is positive, negative, or zero.
What is 'if number > 0, print "positive"; else if number < 0, print "negative"; else print "zero"?
This sorting algorithm splits the array into halves and merges them after sorting.
This operation adds an element to the top of a stack.
What is push(element)?
This operator in C++ is used to allocate memory dynamically.
What is new?
This is the smallest unit of data a computer can process.
What is a bit?
This is the pseudocode to calculate the sum of numbers from 1 to n.
What is 'initialize sum to 0; for i from 1 to n, add i to sum'?
This type of algorithm repeatedly tries all possible solutions to find the best one.
What is brute force?
This type of linked list links the last node back to the first node.
What is a circular linked list?
This keyword in Python is used to define a function.
What is def?
This type of memory is located inside the CPU and stores frequently used data for faster access.
What is cache memory?
This is the pseudocode for reversing a string.
What is 'for i from end to start, add characters to a new string'?
This graph algorithm uses a stack or recursion to explore as far as possible along each branch before backtracking.
What is depth-first search(DFS)?
This data structure processes elements in a first-in, first-out (FIFO) manner.
What is a queue?
This operator in JavaScript is used for strict equality checks.
What is '==='?
This type of assembly instruction tells the CPU to combine two numbers.
What is 'add'?
This is the pseudocode to find the largest number in an array.
What is 'initialize max to first element; for each element, if greater, update max'?
The process of dividing a problem into smaller subproblems is also called this.
What is recursion/divide & conquer?