The Basics of CS Knowledge | Design Patterns Network Operating System Database Data Structure

Hello, students. Haha.

As I mentioned before, we have conducted a large-scale update this time after collecting feedback from students.

After two whole months of updates, it is now complete. A total of 47 lectures have been added and revised, and the lecture materials have also increased to 340 pages.

Latest version of the lesson plan: v23.01.02

I will make sure that all students will be able to perfectly prepare for CS interviews with just this one lecture.

thank you

[Updates]

Essential knowledge for developers

[Special Lecture] 100% Passing in IT Major Companies

Design Pattern

MVC MVP MVVM pattern

Spring's MVC pattern application case

Dependency Injection and Dependency Inversion Principle

network

TCP/IP Layer 4 #2. MTU, MSS, and PMTUD

Cache in Web Browsers #1. The Concept of Local Storage

Cache in web browsers #2. Local storage and origin

Web Browser Cache #3. UX Improvement Using Local Storage

Web Browser Cache #4. Session Storage

HTTP header

Web Browser Cache #5. Cookies

Web Browser Cache #6. Similarities and Differences Between Local Storage, Session Storage, and Cookies

Login Implementation #1. Session-based Authentication Method: Concept

Login Implementation #2 Session-based Authentication Method: Practice

[Appendix] Why Developers Should Follow Conventions

Login implementation #3. Token-based authentication method (access token, refresh token) concept

Login implementation #4. Token-based authentication method (access token, refresh token) practice

DEEP DIVE: Serialization and Deserialization

HTTP status codes you must memorize

HTTP Method #1. Difference between GET and POST

HTTP Method #2. Difference between PUT and PATCH

Data Structure

Data Structure Basics

Time complexity

Big-O notation

Time complexity Q1 for practice with problem

Time complexity Q2 for practice with problem

Time complexity Q3 for practice with problem

Time complexity Q4 for practice with problem

Time complexity Q5 for practice with problem

Why Time Complexity is Needed

space complexity

static array

Dynamic array (vector)

Memory and Pointers

Linked List

Difference between array and linked list

stack

Queue

Fundamentals of Graph Theory (Graph, Vertex, Edge, Weight)

Tree (Tree Data Structure)

Binary tree and binary search tree

Adjacency matrix

Adjacency list

Difference between adjacency matrix and adjacency list

Map

Set

Time complexity of data structures that must be memorized