Programming Fundementals
This type of loop runs at least once, regardless of the condition.
do-while loop
This linear data structure follows the First In, First Out (FIFO) principle.
queue
This sorting algorithm repeatedly compares adjacent elements and swaps them.
bubble sort
This is the core part of an operating system, managing memory and CPU time.
kernel
This language is used to manage and query data in relational databases.
SQL
A function that calls itself is known as this.
recursion
This structure uses a "last in, first out" (LIFO) method for accessing elements.
stack
This algorithm is used to find the shortest path in a graph.
Dijkstra’s algorithm
The time between a request and its response in a scheduling algorithm.
response time
A database model where data is stored in tables with rows and columns.
Relational database
A variable with scope only inside a function.
local variable
A tree where each parent has at most two children.
binary tree
This algorithm divides a problem in half at each step and is used in sorted arrays.
binary search
A condition where a set of processes are blocked waiting for each other.
deadlock
This SQL command is used to remove all records from a table, but not the table itself.
DELETE
The error that occurs when a program runs but gives incorrect output.
logic/semantic error
This structure is used to implement graphs and consists of a list of lists.
adjacency list
A recursive algorithm that divides a problem into sub-problems, solves each, and combines the result.
divide and conquer
This memory management technique swaps processes between RAM and disk.
paging
A field (or set of fields) that uniquely identifies each record in a table.
primary key
This programming concept allows objects to take many forms.
polymorphism
This data structure uses key-value pairs and allows fast access by keys.
hash table
This algorithm is used to traverse a tree or graph by exploring as far as possible along each branch.
depth-first search (DFS)
An algorithm where the process with the shortest burst time is executed first.
Shortest Job First (SJF)
This type of database does not use fixed table schemas and stores data as JSON-like documents.
NoSQL database