Step 1: Requirement clarification Purpose: to solve the RIGHT problem! Functional requirements What…

Introduction A series of nodes. each node contains 2 parts: information, a reference to the next…

Spanning Tree Given an undirected, weighted graph G(V, E) A spanning tree is a set of edges: no…

Main concerns Reliability The system should continue to work correctly even in the face of adversity…

Database is just a bunch of files on disk. Storage Manager is the one that maintains the database…

Dijkstra Shortest path in an unweighted graph: BFS Problem: given a weighted graph of non-negative…

Thread - Process 1. Process a process is a program in execution. a program is not a process, a…

Change Data Capture (CDC) is a technique used in databases to capture and track changes made to…

Hash vs Encrypt vs Encode Hashing converting a given key into another smaller and fixed-size value…

Mutator Methods. push() - 0(1) Add a new element to the end of the array. pop() - 0(1) Delete the…