๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

์ „์ฒด ๊ธ€51

๋น„ํŠธ ๋ฒกํ„ฐ(bit Vector) ๋น„ํŠธ ๋ฒกํ„ฐ : ์ค‘๋ณต๋˜์ง€์•Š๋Š” ์ •์ˆ˜์ง‘ํ•ฉ์„ ๋น„ํŠธ๋กœ ๋‚˜ํƒ€๋‚ด๋Š” ๋ฐฉ์‹ - ์ž๋ฆฌ์— ํ•ด๋‹นํ•˜๋Š” ์ˆ˜์— 0,1์„ ์‚ฌ์šฉํ•˜์—ฌ ํ‘œํ˜„ : ๋ฉ”๋ชจ๋ฆฌ์˜ ์‚ฌ์šฉ์„ ํฌ๊ฒŒ ๊ฐ์†Œ์‹œํ‚ฌ ์ˆ˜ ์žˆ๋‹ค๋Š” ์žฅ์  ์œ„ ๊ทธ๋ฆผ๊ณผ ๊ฐ™์ด ์ •์ˆ˜์ง‘ํ•ฉ {1,3,5,6}์„ ํ‘œํ˜„ํ•˜๋ฉฐ 0~7๊นŒ์ง€์˜ ๋ฒ”์œ„๋งŒ ํ‘œํ˜„ํ•˜๋Š” ๊ฒฝ์šฐ ๊ฒจ์šฐ 1Byte์˜ ๊ณต๊ฐ„๋งŒ ํ•„์š” ๋น„ํŠธ์—ฐ์‚ฐ์ž ๊ธฐํ˜ธ ์—ฐ์‚ฐ์ž๋ช… ๊ธฐ๋Šฅ right ์—ฐ์‚ฐ์ž ๋น„ํŠธ๋ฅผ ์˜ค๋ฅธ์ชฝ์œผ๋กœ ์ด๋™์‹œํ‚ด (์–‘์ˆ˜๊ธฐ์ค€ : x/2^n - ๋ชซ๋งŒ์‚ฌ์šฉ) & AND ์—ฐ์‚ฐ์ž ๋ชจ๋‘ 1์ด๋ฉด 1 > ํŠน์ •๋น„ํŠธ๊ฐ’์„ 0์œผ๋กœ ๋งŒ๋“ค๊ณ ์‹ถ์€ ๊ฒฝ์šฐ ์‚ฌ์šฉ ^ XOR ์—ฐ์‚ฐ์ž ๋‘˜์ด ๋‹ค๋ฅด๋ฉด 1 | OR ์—ฐ์‚ฐ์ž 1๊ฐœ๋ผ๋„ 1์ด๋ฉด 1 > ํŠน์ •๋น„ํŠธ๊ฐ’์„ 1๋กœ ๋งŒ๋“ค๊ณ ์‹ถ์€ ๊ฒฝ์šฐ ์‚ฌ์šฉ 2020. 8. 23.
์•„์Šคํ‚ค(ASCII)์ฝ”๋“œ์™€ ์œ ๋‹ˆ์ฝ”๋“œ(Unicode) * ์ปดํ“จํ„ฐ์˜ ๊ธฐ๋ณธ์ €์žฅ๋‹จ์œ„ : ๋ฐ”์ดํŠธ(Byte) = 8bit * ๋”ฐ๋ผ์„œ 1Byte์—๋Š” 1bit๋Š” 0,1 ๋‘๊ฐ€์ง€ ๊ฐ’์„ ํฌํ•จํ•˜๋ฏ€๋กœ ์ด 2^8(=256)๊ฐœ์˜ ๊ฐ’ ์ €์žฅ ๊ฐ€๋Šฅ * ๋ฌธ์ž์ธ์ฝ”๋”ฉ(Encording) : ๋ฌธ์ž๋‚˜ ๊ธฐํ˜ธ์˜ ์ง‘ํ•ฉ์„ ์ปดํ“จํ„ฐ์— ์ €์žฅํ•˜๊ฑฐ๋‚˜, ํ†ต์‹ ๋ชฉ์ ์œผ๋กœ ์‚ฌ์šฉํ•˜๋Š” ๊ฒฝ์šฐ ๋ถ€ํ˜ธ๋กœ ๋ณ€ํ™˜ ์•„์Šคํ‚ค(ASCII, American Standard Code for Information Interchange) : ๋ฏธ๊ตญ์—์„œ ์ •์˜ํ•œ ๋ถ€ํ˜ธ์ฒด๊ณ„์˜ ํ‘œ์ค€ : ์•„์Šคํ‚ค์ฝ”๋“œ๋Š” 8๋น„ํŠธ๋ฅผ ๋ชจ๋‘ ์‚ฌ์šฉํ•˜๋Š” ๊ฒƒ์ด ์•„๋‹ˆ๋ผ 7bit(128๊ฐœ)์˜ ๊ฐ’๋งŒ ์‚ฌ์šฉ : ๋‚˜๋จธ์ง€ 1๋น„ํŠธ๋Š” ํ†ต์‹ ์—๋Ÿฌ ๊ฒ€์ถœ์„์œ„ํ•ด ์‚ฌ์šฉํ•˜๊ธฐ ๋•Œ๋ฌธ์ด๋‹ค = Parity Bit : ์ด๋Š” '์˜๋ฌธ ํ‚ค๋ณด๋“œ'๋กœ ์ž…๋ ฅํ•  ์ˆ˜ ์žˆ๋Š” ๋ชจ๋“  ๊ฐ€๋Šฅ์„ฑ์„ ๋‹ด์•˜์ง€๋งŒ, ๋‹ค๋ฅธ ์–ธ์–ด๋ฅผ ํ‘œํ˜„ํ•˜๊ธฐ์—๋Š” ๋ถ€์กฑ : ๋”ฐ๋ผ์„œ 8bi.. 2020. 8. 23.
[List] ArrayList, Vector, LinkedList 1. List Interface : Link์ธํ„ฐํŽ˜์ด์Šค๋ฅผ ์ƒ์†๋ฐ›๋Š” ์ž๋ฃŒ๊ตฌ์กฐ - ArrayList, Vector, LinkedList ๋“ฑ ArrayList ์ด ํด๋ž˜์Šค๋Š” Synchronized(X) : ์†๋„๊ฐ€ ์กฐ๊ธˆ ๋น ๋ฆ„, ๋™๊ธฐํ™”์ฒ˜๋ฆฌ ํ•„์š”์—†๋Š” ๊ฒฝ์šฐ ์ฃผ๋กœ ์‚ฌ์šฉ Vector ์ด ํด๋ž˜์Šค๋Š” Synchronized(O) : ์†๋„๊ฐ€ ์กฐ๊ธˆ ๋А๋ฆผ : ์š”์†Œ์˜ ์ˆœ์„œ ์ €์žฅ๋˜๋ฉฐ, ์ค‘๋ณต ์ €์žฅ ๊ฐ€๋Šฅ : ๊ฐ’์„ ์—ฌ๋Ÿฌ๊ฐœ ์ €์žฅํ›„ ์ผ๊ด„์ฒ˜๋ฆฌ๊ฐ€ ๋ชฉ์  : ์ผ๊ด„์ฒ˜๋ฆฌ > ๋ฐ˜๋ณต์ง€์‹œ์ž Iterator ๋˜๋Š” for (์ž๋ฃŒํ˜• ๋ณ€์ˆ˜๋ช…:collection) ํ™œ์šฉ ArrayList.add(e) ์—˜๋ฆฌ๋จผํŠธ ๊ฐ’ ์ถ”๊ฐ€ / index๋ฅผ ํ™œ์šฉํ•˜์—ฌ ์ง€์ •์œ„์น˜์— ์ €์žฅ ๊ฐ€๋Šฅ ArrayList.get(index) index์— ์œ„์น˜ํ•œ ์—˜๋ฆฌ๋จผํŠธ ๋ฐ˜ํ™˜ ArrayList.set(Index, .. 2020. 8. 22.
[Map] HashMap, HashTable, TreeMap 1. Map : Map์ธํ„ฐํŽ˜์ด์Šค๋ฅผ ๊ตฌํ˜„ํ•œ ํด๋ž˜์Šค๋“ค์€ ํ‚ค์™€ ๊ฐ’์„ ํ•˜๋‚˜์˜ ์Œ์œผ๋กœ ์ €์žฅํ•˜๋Š” ๋ฐฉ์‹์„ ์‚ฌ์šฉ : ์š”์†Œ์˜ ์ˆœ์„œ๋Š” ์ €์žฅํ•˜์ง€์•Š์œผ๋ฉฐ, ํ‚ค๊ฐ’์˜ ์ค‘๋ณต์€ ํ—ˆ์šฉํ•˜์ง€์•Š์œผ๋‚˜ ๊ฐ’์˜ ์ค‘๋ณต์€ ํ—ˆ์šฉ : HashMap HashTable TreeMap โ€‹ โ€‹ 2. HashMap : ํ•ด์‹œ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์‚ฌ์šฉ >> ๊ฒ€์ƒ‰์†๋„ ์šฐ์ˆ˜ : ์ค‘๋ณต๋œ ํ‚ค๊ฐ’ ํ—ˆ์šฉX (๋‹จ, ๊ฐ’์˜ ์ค‘๋ณต์€ ํ—ˆ์šฉ) Method Function hashMap.put(K,V) ์š”์†Œ ๊ฐ’ ์ถ”๊ฐ€ hashMap.keySet() ํ‚ค๋“ค ๋ฐ˜ํ™˜ > set(์ง‘ํ•ฉ)ํ˜•ํƒœ๋กœ hashMap.entrySet() ์•คํŠธ๋ฆฌ๋“ค ๋ฐ˜ํ™˜ > set(์ง‘ํ•ฉ)ํ˜•ํƒœ๋กœ hashMap.get(K) ํ‚ค์— ํ•ด๋‹นํ•˜๋Š” ๊ฐ’ ๋ฐ˜ํ™˜ hashMap.replace(K,V) ํ‚ค์— ํ•ด๋‹นํ•˜๋Š” ๊ฐ’ ๋ณ€๊ฒฝ hashMap.remove(K) ํ‚ค์— ํ•ด๋‹นํ•˜.. 2020. 8. 22.
[EXTENDING] put Web Scrapper in Server show the result immediately instead of CSV file. -> dont need to download anything But can download by button [Flask] - micro-framework that allows you to make website with Python 2020. 8. 6.
[GET READY FOR DJANGO] OOP [ Django? ] - web Framework to make Back End API, Front End using only Python [Argument, Keyword argument?] - *args : infinite positional arguements (>>take tuple) - **kwargs : infinite keyword arguements ( >>take dictionary) [ Method ] - functions inside of a class - โ˜… method ! ๋ชจ๋“  ๋ฉ”์†Œ๋“œ์˜ ์ฒซ๋ฒˆ์งธ argument๋Š” ๋ฉ”์†Œ๋“œ๋ฅผ ํ˜ธ์ถœํ•˜๋Š” ์ž๊ธฐ์ž์‹ (instance)์ด์•ผ ํŒŒ์ด์ฌ์€ ๋ฉ”์†Œ๋“œ๋ฅผ ํ˜ธ์ถœํ• ๋•Œ ๊ทธ ๋ฉ”์†Œ๋“œ์˜ ์ธ์Šคํ„ด์Šค๋ฅผ ์ฒซ๋ฒˆ์งธ ์•„๊ทœ๋จผํŠธ๋กœ ์‚ฌ์šฉํ•ด - ๋‚ด์žฅํ•จ์ˆ˜ dir(class) : ํด๋ž˜์Šค์— ์กด์žฌ.. 2020. 8. 5.