Computer Science Flashcard

Front

What is DFS (Depth-First Search)?

Back

DFS is an algorithm for traversing or searching tree or graph data structures. It starts at the root (or an arbitrary node) and explores as far as possible along each branch before backtracking.

Front

What is Floyd’s Cycle Detection Algorithm?

Back

Floyd’s Cycle Detection Algorithm, also known as the Tortoise and Hare algorithm, is used to detect cycles in a sequence of values, particularly in linked lists.

Front

What is a greedy algorithm?

Back

A greedy algorithm is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most immediate benefit.

Front

What is Dijkstra’s Algorithm?

Back

Dijkstra’s Algorithm is a greedy algorithm used for finding the shortest paths between nodes in a graph, particularly for weighted graphs.

Front

What is Kruskal’s Algorithm?

Back

Kruskal’s Algorithm is a greedy algorithm that finds the minimum spanning tree for a connected weighted graph by adding edges in increasing order of their weight.

Front

What is Prim’s Algorithm?

Back

Prim’s Algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph by starting from a single vertex and expanding the tree.

Front

What is the Round Robin scheduling algorithm?

Back

Round Robin is a pre-emptive scheduling algorithm used in operating systems where each process is assigned a fixed time slice in a cyclic order.

Front

What is FCFS (First-Come, First-Served) scheduling?

Back

FCFS is a non-preemptive scheduling algorithm where the process that arrives first is executed first.

Front

What is Shortest Job Next scheduling?

Back

Shortest Job Next (SJN) is a scheduling algorithm that selects the process with the smallest execution time next.

Front

What is Priority Scheduling?

Back

Priority Scheduling is a scheduling method where each process is assigned a priority, and the process with the highest priority is executed first.