OSI and TCP/IP Models The OSI and TCP/IP model is used to help the developer to design their system for interoperability. The OSI model has 7 layers while the TCP/IP model has a more summarized form of the OSI model only consisting 4 layers. This is important if you’re are trying to design a system to communicate with other systems. 개발자가 상호운용성을 위해 시스템을 설계할 때 OSI 및 TCP/IP 모델을 사용합니다. OSI 모델은 7개의 계..

Normalization vs Denormalization Database normalization is a process used to organize a database into tables and columns. The idea is that a table should be about a specific topic and that only those columns which support that topic are included. This limits the number of duplicate data contained within your database. This makes the database more flexible by eliminating issues stemming from data..

CS - 16. Databases - 16.1 SQL vs NoSQL databases Databases 💡A database is a collection of useful data of one or more related organizations structured in a way to make data an asset to the organization. A database management system is a software designed to assist in maintaining and extracting large collections of data in a timely fashion. 데이터베이스는 데이터를 조직의 자산으로 만들기 위한 방식으로 구조화된 하나 이상의 관련 조직의 유용한 ..

CS - 5. Bitwise Operators Bitwise Operators 💡 Bitwise operators are used to perform operations on individual bits of a number. They are used in cryptography, image processing, and other applications. 비트 연산자 비트 연산자는 숫자의 개별 비트에 대한 연산을 수행하는 데 사용됩니다. 암호화, 이미지 처리 및 기타 애플리케이션에 사용됩니다. 비트 연산자는 컴퓨터 프로그래밍에서 사용되며, 이는 데이터를 비트 단위로 조작하는데 사용됩니다. 비트 연산자의 종류는 아래와 같습니다. - AND ( & ) : 두 비트가 모두 1일 때만 결과가 1이 됩니다. - ..

CS - 4. String Search and Manipulations - 4.6. Rabin-Karp's algorithm Rabin-Karp’s algorithm Rabin-Karp algorithm is a string searching algorithm that uses hashing to find any one of a set of pattern strings in a text. For strings of average length n, it performs in O(n+m) time with O(m) space, where m is the length of the pattern. It is often used in bioinformatics to search for DNA patterns. 라..

CS - 4. String Search and Manipulations - 4.5. Boyer Moore Algorithm Boyer Moore Algorithm 💡Boyer Moore algorithm is a string searching algorithm that is used to find the index of a substring in a string. It is a very efficient algorithm that is used in many applications. It is used in text editors, compilers, and many other applications. 보이어 무어 알고리즘은 문자열에서 하위 문자열의 인덱스를 찾는 데 사용되는 문자열 검색 알고리즘입니다...