The Coding and Computer Science Compendium

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall with Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/59

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No study sessions yet.

60 Terms

1
New cards

Big O(1) - Time Complexity

Constant Time

2
New cards

Big O(1) - Definition

The algorithm takes the same amount of time regardless of input size.

3
New cards

Big O(1) - Example

Accessing an array element by index.

4
New cards

Big O(log n) - Time Complexity

Logarithmic Time

5
New cards

Big O(log n) - Definition

The time grows slowly as input size increases; usually involves cutting the problem in half repeatedly.

6
New cards

Big O(log n) - Example

Binary Search.

7
New cards

Big O(n) - Time Complexity

Linear Time

8
New cards

Big O(n) - Definition

The time grows directly proportional to the input size.

9
New cards

Big O(n) - Example

Iterating through a list (For Loop).

10
New cards

Big O(n log n) - Time Complexity

Linearithmic Time

11
New cards

Big O(n log n) - Definition

Slightly slower than linear; typical of efficient sorting algorithms.

12
New cards

Big O(n log n) - Example

Merge Sort, Quick Sort, Heap Sort.

13
New cards

Big O(n^2) - Time Complexity

Quadratic Time

14
New cards

Big O(n^2) - Definition

Time grows exponentially with input; performance degrades quickly.

15
New cards

Big O(n^2) - Example

Nested loops (Bubble Sort, Insertion Sort).

16
New cards

Stack - Data Structure

Last In, First Out (LIFO)

17
New cards

Stack - Analogy

A stack of plates; you can only take the top one off.

18
New cards

Stack - Key Operations

Push (add), Pop (remove), Peek (see top).

19
New cards

Queue - Data Structure

First In, First Out (FIFO)

20
New cards

Queue - Analogy

A line at a grocery store.

21
New cards

Queue - Key Operations

Enqueue (add), Dequeue (remove).

22
New cards

Hash Map / Hash Table - Data Structure

Key-Value Pair Storage

23
New cards

Hash Map - Efficiency

Average O(1) lookup time.

24
New cards

Hash Map - Concept

Uses a hash function to compute an index into an array of slots.

25
New cards

Binary Search Tree (BST) - Data Structure

Hierarchical Tree

26
New cards

BST - Rule

Left child is smaller than parent; Right child is larger than parent.

27
New cards

BST - Efficiency

O(log n) for search/insert/delete (if balanced).

28
New cards

Linked List - Data Structure

Chain of Nodes

29
New cards

Linked List - Concept

Elements are not stored in contiguous memory; each node points to the next.

30
New cards

Linked List - Pros/Cons

Fast insertion/deletion, slow access (must traverse).

31
New cards

HTTP 200 - Status Code

OK (Request succeeded)

32
New cards

HTTP 301 - Status Code

Moved Permanently (Redirect)

33
New cards

HTTP 400 - Status Code

Bad Request (Client error)

34
New cards

HTTP 401 - Status Code

Unauthorized (Authentication required)

35
New cards

HTTP 403 - Status Code

Forbidden (Authenticated but no permission)

36
New cards

HTTP 404 - Status Code

Not Found (Resource does not exist)

37
New cards

HTTP 500 - Status Code

Internal Server Error (Server crashed)

38
New cards

HTTP 502 - Status Code

Bad Gateway (Invalid response from upstream)

39
New cards

GET - HTTP Method

Retrieve data from a server (Idempotent).

40
New cards

POST - HTTP Method

Submit data to a server to create a resource.

41
New cards

PUT - HTTP Method

Update/Replace a resource.

42
New cards

DELETE - HTTP Method

Delete a resource.

43
New cards

Encapsulation - OOP Principle

Bundling data and methods that operate on that data within a class, hiding internal state.

44
New cards

Inheritance - OOP Principle

A class derives properties and behavior from a parent class.

45
New cards

Polymorphism - OOP Principle

Objects of different types can be treated as instances of the same class (Method Overriding/Overloading).

46
New cards

Abstraction - OOP Principle

Hiding complex implementation details and showing only the essential features of the object.

47
New cards

Recursion - Concept

A function calling itself to solve smaller instances of the problem.

48
New cards

Base Case - Concept

The condition that stops the recursion from looping infinitely.

49
New cards

chmod - Linux Command

Change file modes (permissions).

50
New cards

grep - Linux Command

Global Regular Expression Print (Search for text patterns).

51
New cards

ls - Linux Command

List directory contents.

52
New cards

cd - Linux Command

Change Directory.

53
New cards

sudo - Linux Command

SuperUser DO (Execute with admin privileges).

54
New cards

man - Linux Command

Manual (Display help/manual for a command).

55
New cards

SSH - Protocol

Secure Shell (Encrypted remote login).

56
New cards

Git - Tool

Distributed Version Control System.

57
New cards

Docker - Tool

Platform for developing, shipping, and running applications in containers.

58
New cards

API - Acronym

Application Programming Interface.

59
New cards

JSON - Acronym

JavaScript Object Notation (Data interchange format).

60
New cards

SQL - Acronym

Structured Query Language (Database communication).