{"id":3731,"date":"2023-08-25T00:00:00","date_gmt":"2023-08-25T00:00:00","guid":{"rendered":"https:\/\/tech-lib.eu\/tech\/understanding-how-binary-code-works\/"},"modified":"2023-08-25T00:00:00","modified_gmt":"2023-08-25T00:00:00","slug":"understanding-how-binary-code-works","status":"publish","type":"post","link":"https:\/\/tech-lib.eu\/tech\/understanding-how-binary-code-works\/","title":{"rendered":"Understanding How Binary Code Works"},"content":{"rendered":"
\n
Jak p\u0159ev\u00e9st \u010d\u00edslo do dvojkov\u00e9 soustavy?<\/div>\n
Pro p\u0159evod \u010d\u00edsel z des\u00edtkov\u00e9 soustavy se pou\u017e\u00edv\u00e1 algoritmus vyu\u017e\u00edvaj\u00edc\u00ed zbytk\u016f po celo\u010d\u00edseln\u00e9m d\u011blen\u00ed z\u00e1kladem po\u017eadovan\u00e9 soustavy (pro dvojkovou soustavu je to \u010d\u00edslo 2 , pro \u0161estn\u00e1ctkovou 16 atd.). P\u0159ev\u00e1d\u011bn\u00e9 \u010d\u00edslo vyd\u011bl\u00edme z\u00e1kladem po\u017eadovan\u00e9 soustavy, zap\u00ed\u0161eme si zbytek do \u0159et\u011bzce a v\u00fdsledek d\u011blen\u00ed si ulo\u017e\u00edme.<\/div>\n
\n\t\t\t\t\t Dal\u0161\u00ed informace najdete na<\/span> www.itnetwork.cz<\/a>\n\t\t\t\t<\/div>\n<\/p><\/div>\n
\n
<\/div>\n

Z\u00e1kladem v\u0161ech digit\u00e1ln\u00edch technologi\u00ed je bin\u00e1rn\u00ed k\u00f3d, kter\u00fd umo\u017e\u0148uje po\u010d\u00edta\u010d\u016fm analyzovat a ukl\u00e1dat data v jim srozumiteln\u00e9m jazyce. C\u00edlem tohoto \u010dl\u00e1nku je demystifikovat fungov\u00e1n\u00ed bin\u00e1rn\u00edho k\u00f3du t\u00edm, \u017ee odpov\u00edme na \u010dasto kladen\u00e9 ot\u00e1zky, jako nap\u0159\u00edklad jak pozdravit v bin\u00e1rn\u00edm k\u00f3du, zda je u\u010den\u00ed bin\u00e1rn\u00edho k\u00f3du jednoduch\u00e9, jak funguje v jednoduch\u00e9 \u010de\u0161tin\u011b a co znamenaj\u00ed konkr\u00e9tn\u00ed bin\u00e1rn\u00ed sekvence. <\/p>\n

<\/div>\n

Syst\u00e9m k\u00f3dov\u00e1n\u00ed informac\u00ed pouze pomoc\u00ed \u010d\u00edsel 0 a 1 se naz\u00fdv\u00e1 bin\u00e1rn\u00ed k\u00f3d. T\u011bmito symboly jsou reprezentov\u00e1ny dva stavy elektronick\u00e9ho za\u0159\u00edzen\u00ed, nap\u0159\u00edklad tranzistoru, kter\u00e9 mohou b\u00fdt bu\u010f zapnut\u00e9 (1), nebo vypnut\u00e9 (0). Bin\u00e1rn\u00ed k\u00f3dov\u00e1n\u00ed m\u016f\u017ee kombinac\u00ed t\u011bchto dvou symbol\u016f reprezentovat jak\u00fdkoli typ informace, v\u010detn\u011b textu, \u010d\u00edsel, grafiky a dokonce i hudby. <\/p>\n

<\/div>\n

Za\u010dn\u011bme t\u00edm, \u017ee probereme pojem bit\u016f, abychom l\u00e9pe pochopili, jak bin\u00e1rn\u00ed k\u00f3d funguje. V bin\u00e1rn\u00edm k\u00f3du je bit z\u00e1kladn\u00ed jednotkou informace a m\u016f\u017ee uchov\u00e1vat hodnotu 0 nebo 1. Bajt, nejmen\u0161\u00ed pam\u011b\u0165ov\u00e1 jednotka v po\u010d\u00edta\u010dov\u00e9m syst\u00e9mu, se skl\u00e1d\u00e1 z osmi bit\u016f. Nap\u0159\u00edklad bin\u00e1rn\u00ed reprezentace p\u00edsmene „A“ je 01000001, kde ka\u017ed\u00e1 0 nebo 1 ozna\u010duje jeden bit. Pam\u011b\u0165 po\u010d\u00edta\u010de obsahuje tento \u0159et\u011bzec osmi bit\u016f. <\/p>\n

<\/div>\n

Abychom mohli bin\u00e1rn\u011b pozdravit, mus\u00edme ka\u017ed\u00e9 p\u00edsmeno p\u0159ev\u00e9st na ekvivalentn\u00ed bin\u00e1rn\u00ed k\u00f3d. H je reprezentov\u00e1no \u010d\u00edslem 01001000, E \u010d\u00edslem 01000101, L \u010d\u00edslem 01001100 a O \u010d\u00edslem 01001111. Bin\u00e1rn\u00ed k\u00f3d pro „ahoj“ je tedy 01001000, 01000101, 01001100, 01001100 a 01001111. <\/p>\n

<\/div>\n

Bin\u00e1rn\u00ed k\u00f3d: Je to jednoduch\u00e9? Zpo\u010d\u00e1tku se m\u016f\u017ee zd\u00e1t, \u017ee u\u010den\u00ed bin\u00e1rn\u00edho k\u00f3du je obt\u00ed\u017en\u00e9, zejm\u00e9na pro lidi bez technick\u00e9ho vzd\u011bl\u00e1n\u00ed. Z\u00e1klady se v\u0161ak m\u016f\u017ee nau\u010dit ka\u017ed\u00fd, sta\u010d\u00ed \u010das a praxe. Nau\u010dit se des\u00edtkovou soustavu, na kterou jsme v\u00edce zvykl\u00ed, je n\u011bkdy prvn\u00edm krokem ke zvl\u00e1dnut\u00ed bin\u00e1rn\u00edho k\u00f3dov\u00e1n\u00ed. Ka\u017ed\u00e1 \u010d\u00edslice v des\u00edtkov\u00e9 soustav\u011b m\u00e1 10 mo\u017en\u00fdch hodnot (0-9). Podobn\u00e9 je bin\u00e1rn\u00ed k\u00f3dov\u00e1n\u00ed, a\u017e na to, \u017ee zde jsou pouze dv\u011b potenci\u00e1ln\u00ed hodnoty (0 a 1). Nau\u010dit se bin\u00e1rn\u00ed k\u00f3d je jednodu\u0161\u0161\u00ed s \u010dasem, prax\u00ed a pomoc\u00ed online n\u00e1stroj\u016f a v\u00fdukov\u00fdch program\u016f. <\/p>\n

<\/div>\n

Ve sv\u00e9 nejz\u00e1kladn\u011bj\u0161\u00ed podob\u011b pou\u017e\u00edv\u00e1 bin\u00e1rn\u00ed k\u00f3d ke k\u00f3dov\u00e1n\u00ed informac\u00ed pouze \u010d\u00edsla 0 a 1. Bin\u00e1rn\u00ed posloupnosti se vytv\u00e1\u0159ej\u00ed kombinac\u00ed t\u011bchto symbol\u016f a mohou reprezentovat jak\u00fdkoli typ dat. V z\u00e1vislosti na situaci m\u016f\u017ee ka\u017ed\u00e1 bin\u00e1rn\u00ed sekvence ozna\u010dovat n\u011bco jin\u00e9ho. Nap\u0159\u00edklad symbol vyk\u0159i\u010dn\u00edku „!“ je reprezentov\u00e1n bin\u00e1rn\u00ed posloupnost\u00ed 00100001. Po\u010d\u00edta\u010de mohou zpracov\u00e1vat a interpretovat p\u0159ijat\u00e1 data tak, \u017ee r\u016fzn\u00fdm bin\u00e1rn\u00edm sekvenc\u00edm p\u0159i\u0159azuj\u00ed specifick\u00e9 interpretace. <\/p>\n

<\/div>\n

Jazyk po\u010d\u00edta\u010d\u016f, bin\u00e1rn\u00ed k\u00f3d, jim umo\u017e\u0148uje efektivn\u011b zpracov\u00e1vat a uchov\u00e1vat informace. Bin\u00e1rn\u00ed k\u00f3d pot\u0159ebuje k reprezentaci jak\u00e9hokoli typu dat pouze dva symboly 0 a 1. A\u010dkoli se to na prvn\u00ed pohled m\u016f\u017ee zd\u00e1t obt\u00ed\u017en\u00e9, bin\u00e1rn\u00ed k\u00f3d se s trochou cviku a \u00fasil\u00ed m\u016f\u017ee nau\u010dit ka\u017ed\u00fd. A\u017e se s bin\u00e1rn\u00edm k\u00f3dem setk\u00e1te p\u0159\u00ed\u0161t\u011b, budete mu rozum\u011bt a ocen\u00edte \u00fa\u017easn\u00fd sv\u011bt digit\u00e1ln\u00edch technologi\u00ed, kter\u00e9 podporuje.<\/p><\/div>\n

\n
FAQ<\/div>\n
\n
Jak\u00e9 je bin\u00e1rn\u00ed \u010d\u00edslo od 1 do 10?<\/div>\n

N\u00e1sleduj\u00ed bin\u00e1rn\u00ed \u010d\u00edslice od 1 do 10: <\/p>\n

<\/div>\n

1 -> 1 <\/p>\n

<\/div>\n

2 -> 10 <\/p>\n

<\/div>\n

3 -> 11 <\/p>\n

<\/div>\n

4 -> 100 <\/p>\n

<\/div>\n

5 -> 101 <\/p>\n

<\/div>\n

6 -> 110 <\/p>\n

<\/div>\n

7 -> 111 <\/p>\n

<\/div>\n

8 -> 1000 <\/p>\n

<\/div>\n

9 -> 1001 <\/p>\n

<\/div>\n

10 -> 1010 <\/p>\n<\/div>\n

\n
Co znamen\u00e1 01001000 01100101 01101100 01101100 01101111 00100001?<\/div>\n

Ve sch\u00e9matu k\u00f3dov\u00e1n\u00ed znak\u016f ASCII odpov\u00edd\u00e1 bin\u00e1rn\u00ed k\u00f3d „01001000 01100101 01101100 01101111 00100001“ slovu „Hello!“. <\/p>\n<\/div>\n

\n
Co je 01110111 v bin\u00e1rn\u00edm k\u00f3du?<\/div>\n

Bin\u00e1rn\u00ed k\u00f3d 01110111 odpov\u00edd\u00e1 des\u00edtkov\u00e9mu k\u00f3du 119. <\/p>\n<\/div>\n

\n
Jak funguje bin\u00e1rn\u00ed k\u00f3d pro hlup\u00e1ky?<\/div>\n

P\u0159esto\u017ee se jedn\u00e1 o z\u00e1kladn\u00ed my\u0161lenku v informatice, lze bin\u00e1rn\u00ed k\u00f3d p\u0159edstavit laicky. P\u0159i reprezentaci informac\u00ed pou\u017e\u00edv\u00e1 bin\u00e1rn\u00ed k\u00f3dov\u00e1n\u00ed pouze dva symboly, obvykle 0 a 1. Funguje tak, \u017ee ozna\u010duje speci\u00e1ln\u00ed sadu 0 a 1, kter\u00e9 zastupuj\u00ed r\u016fzn\u00e1 p\u00edsmena, \u010d\u00edsla nebo p\u0159\u00edkazy. <\/p>\n

<\/div>\n

Ka\u017ed\u00e1 \u010d\u00edslice v bin\u00e1rn\u00edm k\u00f3dov\u00e1n\u00ed se ozna\u010duje jako bit, co\u017e je zkratka pro „bin\u00e1rn\u00ed \u010d\u00edslici“. Z t\u011bchto bit\u016f jsou tvo\u0159eny bajty, kter\u00e9 se obvykle skl\u00e1daj\u00ed z 8 bit\u016f. Ka\u017ed\u00fd bajt m\u016f\u017ee zastupovat jin\u00e9 p\u00edsmeno nebo p\u0159\u00edkaz. <\/p>\n

<\/div>\n

Nap\u0159\u00edklad bin\u00e1rn\u00ed k\u00f3d 01000001 m\u016f\u017ee p\u0159edstavovat p\u00edsmeno „A“. To znamen\u00e1, \u017ee prvn\u00ed bit je 0 a dal\u0161\u00ed bity jsou 1, 0 atd. Kombinac\u00ed t\u011bchto bit\u016f m\u016f\u017eeme v po\u010d\u00edta\u010di reprezentovat jak\u00fdkoli typ informace, v\u010detn\u011b textu, grafiky a spustiteln\u00fdch instrukc\u00ed. <\/p>\n

<\/div>\n

Bin\u00e1rn\u00ed k\u00f3d je nejz\u00e1kladn\u011bj\u0161\u00edm zp\u016fsobem elektronick\u00e9 reprezentace informac\u00ed, a proto jej po\u010d\u00edta\u010de vyu\u017e\u00edvaj\u00ed. Stav\u016fm zapnut\u00ed\/vypnut\u00ed elektronick\u00fdch obvod\u016f dokonale odpov\u00edd\u00e1 bin\u00e1rn\u00ed soustava, co\u017e po\u010d\u00edta\u010d\u016fm usnad\u0148uje zpracov\u00e1n\u00ed a ukl\u00e1d\u00e1n\u00ed dat. Pochopen\u00ed bin\u00e1rn\u00edho k\u00f3du n\u00e1m m\u016f\u017ee pomoci l\u00e9pe pochopit, jak po\u010d\u00edta\u010de funguj\u00ed, v\u010detn\u011b toho, jak upravuj\u00ed a ukl\u00e1daj\u00ed data. <\/p>\n<\/div>\n

\n
Jak se zapisuje 11 v bin\u00e1rn\u00edm k\u00f3du?<\/div>\n

K vyj\u00e1d\u0159en\u00ed \u010d\u00edsla 11 ve dvojkov\u00e9 soustav\u011b byste pou\u017eili sm\u011bs jedni\u010dek a nul. Ka\u017ed\u00e1 \u010d\u00edslice v bin\u00e1rn\u00edm k\u00f3du odpov\u00edd\u00e1 jedn\u00e9 mocnin\u011b dvojky. Za\u010dali byste nejprav\u011bj\u0161\u00ed \u010d\u00edslic\u00ed, dali byste j\u00ed hodnotu 1 a pak byste ji vyn\u00e1sobili dv\u011bma pro ka\u017ed\u00e9 dal\u0161\u00ed m\u00edsto vlevo. <\/p>\n

<\/div>\n

V tomto p\u0159\u00edpad\u011b by \u010d\u00edslo 11 bylo ve dvojkov\u00e9 soustav\u011b reprezentov\u00e1no jako „1011“. Hodnotu jedna p\u0159edstavuje nejprav\u011bj\u0161\u00ed m\u00edsto, dvojku druh\u00e9 nejprav\u011bj\u0161\u00ed, \u010dty\u0159ku t\u0159et\u00ed a osmi\u010dku nejlev\u011bj\u0161\u00ed. Bin\u00e1rn\u00ed \u010d\u00edslo, v tomto p\u0159\u00edpad\u011b 11, lze p\u0159ev\u00e9st na jeho des\u00edtkov\u00fd ekvivalent se\u010dten\u00edm hodnot m\u00edst, kter\u00e1 maj\u00ed v sob\u011b jedni\u010dku. <\/p>\n<\/div>\n

\n
Co je 8 bit\u016f ve dvojkov\u00e9 soustav\u011b?<\/div>\n

Osm nul a jedni\u010dek se pou\u017e\u00edv\u00e1 k vyj\u00e1d\u0159en\u00ed 8 bit\u016f ve dvojkov\u00e9 soustav\u011b, kter\u00e9 lze pou\u017e\u00edt k vyj\u00e1d\u0159en\u00ed kter\u00e9koli z 256 mo\u017en\u00fdch hodnot.<\/p>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

Jak p\u0159ev\u00e9st \u010d\u00edslo do dvojkov\u00e9 soustavy? Pro p\u0159evod \u010d\u00edsel z des\u00edtkov\u00e9 soustavy se pou\u017e\u00edv\u00e1 algoritmus vyu\u017e\u00edvaj\u00edc\u00ed zbytk\u016f po celo\u010d\u00edseln\u00e9m d\u011blen\u00ed z\u00e1kladem po\u017eadovan\u00e9 soustavy (pro dvojkovou soustavu je to \u010d\u00edslo 2 , pro \u0161estn\u00e1ctkovou 16 atd.). P\u0159ev\u00e1d\u011bn\u00e9 \u010d\u00edslo vyd\u011bl\u00edme z\u00e1kladem po\u017eadovan\u00e9 soustavy, zap\u00ed\u0161eme si zbytek do \u0159et\u011bzce a v\u00fdsledek d\u011blen\u00ed si ulo\u017e\u00edme. Dal\u0161\u00ed informace najdete na … \u010c\u00edst d\u00e1l<\/a><\/p>\n","protected":false},"author":2635,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[17],"tags":[],"class_list":["post-3731","post","type-post","status-publish","format-standard","hentry","category-computer-science"],"_links":{"self":[{"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/posts\/3731","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/users\/2635"}],"replies":[{"embeddable":true,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/comments?post=3731"}],"version-history":[{"count":0,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/posts\/3731\/revisions"}],"wp:attachment":[{"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/media?parent=3731"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/categories?post=3731"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/tech-lib.eu\/tech\/wp-json\/wp\/v2\/tags?post=3731"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}