Fundamentals of Computer Science Engineering - Practice Flashcards

Comprehensive vocabulary flashcards covering basic notions of computer engineering, security, networking, data structures, algorithms, and AI based on the course materials.

JSON (JavaScript Object Notation)

A lightweight, text-based format for storing and exchanging structured data that is human-readable, easy to parse, and a standard for APIs and configuration files.

CSV (Comma Separated Values)

A simple text file format used to store tabular data where each line represents a record and each record consists of one or more fields separated by commas.

XML (Extensible Markup Language)

A plain text file using custom tags to store and transport structured data; unlike HTML, it allows users to define their own tags.

DDL (Data Definition Language)

A category of SQL commands used to define and modify database structures, including CREATE, ALTER, DROP, TRUNCATE, and RENAME.

DML (Data Manipulation Language)

A category of SQL commands used to manipulate data within tables, including SELECT, INSERT, UPDATE, and DELETE.

ACID Properties

The four core principles of data integrity in transactions: Atomicity, Consistency, Isolation, and Durability.

Normalization

The process of organizing a database to reduce redundancy and improve integrity, involving forms like 1NF, 2NF, and 3NF.

One-to-Many Relationship (1:N)

A database relationship where one record in Table A relates to many records in Table B, such as Customer to Orders.

Graph

A collection of nodes (vertices) connected by edges, which can be directed, undirected, weighted, or unweighted.

Tree

A special type of graph with one root, no cycles, and a hierarchical structure where each node (except the root) has exactly one parent.

DFS (Depth-First Search)

A traversal strategy that uses a stack (LIFO) to go as deep as possible down one path before backtracking.

BFS (Breadth-First Search)

A traversal strategy that uses a queue (FIFO) to explore a graph or tree layer by layer, starting from a node and visiting all immediate neighbors first.

Stack

A LIFO (Last In, First Out) data structure where the last element added is the first to be removed.

Queue

A FIFO (First In, First Out) data structure where the first element added is the first to be removed.

Linked List

A data structure consisting of nodes scattered in memory, where each node contains data and a pointer to the next node.

Binary Search

A fast search algorithm for sorted data that repeatedly divides the search space in half, achieving $O(\log n)$ complexity.

Bubble Sort

A simple sorting algorithm that repeatedly compares and swaps adjacent elements if they are in the wrong order.

Selection Sort

A sorting algorithm that repeatedly finds the minimum element from the unsorted part and swaps it into its correct position at the beginning.

Merge Sort

A divide-and-conquer sorting algorithm that is fast and stable for large datasets with a complexity of $O(n \log n)$.

Big O Notation

A notation used to describe the upper bound of an algorithm's time complexity, focusing on the worst-case scenario.

$O(1)$ (Constant Time)

Complexity where the algorithm's runtime does not depend on the input size, such as a hash table lookup.

$O(n)$ (Linear Time)

Complexity where the runtime grows directly in proportion to the input size, such as a linear search.

CIA Triad

The three core principles of computer security: Confidentiality, Integrity, and Availability.

Hashing

A deterministic, irreversible mathematical function that converts any size input into a fixed-size output (hash).

Symmetric Encryption

A type of encryption that uses the same secret key for both encryption and decryption, such as AES-128.

Asymmetric Encryption

A type of encryption using a public key for encryption and a private key for decryption, such as RSA.

MFA (Multi-Factor Authentication)

A security requirement of two or more authentication methods from different categories: something you know, something you have, or something you are.

LAN (Local Area Network)

A network covering a small geographical area like a single building or campus, typically offering high speed and low latency.

WAN (Wide Area Network)

A network spanning cities, countries, or continents; the Internet is the largest example.

Router

A network device that connects different networks and routes data between a LAN and the Internet.

IPv4 Address

A 32-bit numerical identifier for devices on a network, formatted as four octets from 0 to 255 separated by dots (e.g., 192.168.0.1).

IPv6 Address

A 128-bit alphanumeric identifier for devices on a network, formatted as eight groups of hexadecimal digits separated by colons.

MAC Address

A permanent and unique 48-bit hardware identifier burned into a network interface card (NIC).

ARP (Address Resolution Protocol)

The protocol used to find the MAC address of a device when only its IP address is known.

CI/CD

Continuous Integration (automated merging and testing) and Continuous Deployment (automated deployment of tested code to production).

Docker

An open platform used to package applications into standardized containers that include everything needed to run the app.

Microservices

An architecture where an application is broken into small, independent services that communicate over a network via APIs.

Artificial Intelligence (AI)

Computer systems capable of performing tasks that typically require human intelligence, such as learning, reasoning, and problem-solving.

Narrow AI (Weak AI)

AI designed to perform one specific task extremely well, such as a spam filter or a chess-playing program.

Machine Learning (ML)

A subset of AI where computers learn patterns from data and build models to make predictions on new data.

Supervised Learning

A type of machine learning where the algorithm learns from labeled training data that includes correct answers provided by a 'teacher'.

Neural Networks

An AI model inspired by the structure of the human brain, consisting of input, hidden, and output layers of artificial neurons.

Input Validation

The security practice of checking user input for correct type, format, range, and length before processing to prevent attacks like SQL injection.

Logging

The practice of recording events in a system (who did what and when) for debugging, security auditing, and performance monitoring.

Turing Test

A test proposed by Alan Turing in 1950 to determine if a machine can demonstrate intelligent behavior indistinguishable from a human.

Supercomputer Performance

Measured in FLOPS (Floating Point Operations Per Second); modern systems reach the Exaflop level ($10^{18}$ calculations per second).

Halting Problem

A question of whether a program will eventually stop or run indefinitely, proven by Alan Turing to be undecidable for all possible programs.

Memory Stack

A tightly managed region of memory that automatically handles local variables in a LIFO order, typically limited to 1–8 MB.

Memory Heap

A large pool of memory used for dynamic allocation ($malloc$/$new$), where data can exist beyond the function that created it.

Enum (Enumerated Type)

A user-defined data type containing a set of named constants to improve code readability and type safety.