Kɔmputa so dwumadi ahorow (Computer programming)

Fa links ɛka ho
Ɛfi Wikipedia
C programming language

Kɔmputa so dwumadi ahorow (Computer programming) yɛ ɔkwan a wɔfa so yɛ akontaabu pɔtee bi (anaasɛ wɔ ɔkwan a ɛkɔ akyiri so no, wɔyɛ kɔmputa so aba pɔtee bi), mpɛn pii no denam kɔmputa so dwumadi ahorow a wotumi di ho nhyehyɛe na wɔyɛ so.[1] Dwumadie fa nnwuma te sɛ nhwehwɛmu, algorithms a wɔyɛ, profiling algorithms’ pɛpɛɛpɛyɛ ne nneɛma a wɔde di dwuma, ne algorithms a wɔde di dwuma (mpɛn pii no wɔ programming kasa pɔtee bi mu, a wɔtaa frɛ no coding).[2][3][4] Wɔkyerɛw dwumadi bi Fibea koodu (source code) wɔ kasa biako anaa nea ɛboro saa a nhyehyɛefo a wɔyɛ nhyehyɛe anaa dwumadifo (programmers) te ase mu, sen sɛ wɔbɛkyerɛw mfiri code a central processing unit no na ɛyɛ tẽẽ. Dwumadi nhyehyɛe atirimpɔw ne sɛ wobenya akwankyerɛ ahorow a ɛtoatoa so a ɛbɛma adwuma bi (a ebetumi ayɛ den te sɛ operating system ) ayɛ adwuma wɔ kɔmputa so, a mpɛn pii no wɔde bedi ɔhaw bi ho dwuma. Enti nhyehyɛe a wɔyɛ no yiye taa hwehwɛ sɛ wonya nimdeɛ wɔ nsɛmti ahorow pii mu, a nea ɛka ho ne nimdeɛ a ɛfa dwumadi no mu (application domain) ho, algorithms titiriw, ne ntease a wɔde di dwuma wɔ ɔkwan a ɛfata so (formal logic).

Nnwuma a ɛka nhyehyɛe ho na ɛfa ho no bi ne sɔhwɛ, debugging,[5] source code a wɔhwɛ so, build systems a wɔde bedi dwuma, ne nneɛma a wonya fi mu a wɔhwɛ so, te sɛ kɔmputa so dwumadi ahorow mfiri code. Nanso, bere a wobetumi abu eyinom sɛ ɛyɛ nhyehyɛe nhyehyɛe no fa no, mpɛn pii no, wɔtaa de asɛmfua softwea nkɔso di dwuma kɛse ma nhyehyɛe kɛse yi nyinaa – bere a nsɛmfua nhyehyɛe, dwumadie, ne mmarahyɛ taa twe adwene si mmara a wɔkyerɛw ankasa so. Nea ɛne eyi hyia no, softwea mfiridwuma de mfiridwuma ho akwan ne nnyinasosɛm ahorow bom ne softwea a wɔyɛ. Afei nso, ɛtɔ mmere bi a wɔn a wɔde wɔn ho hyɛ softwea a wɔyɛ mu no betumi de wɔn ho ahyɛ reverse engineering, a ɛyɛ adeyɛ a ɛne sɛ wɔbɛhwehwɛ sɛ wɔbɛte dwumadi bi a ɛwɔ hɔ dedaw ase sɛnea ɛbɛyɛ a wɔbɛsan de ne dwumadi adi dwuma wɔ ɔkwan bi so no mu.[6]

Abakɔsɛm[sesa]

Ada Lovelace, a ne nsɛm a ɔkyerɛwee de kaa Luigi Menabrea krataa no awiei ho no, nea ɛka ho ne algorithm a edi kan a wɔayɛ sɛ wɔde bɛyɛ adwuma denam Analytical Engine so. Wɔtaa gye tom sɛ ɔyɛ obi a odi kan a ɔyɛ kɔmputa so dwumadi wɔ abakɔsɛm mu.

Mfiri a wotumi yɛ ho nhyehyɛe wɔ hɔ mfehaha pii. Wɔ afeha a ɛto so 9 mu tɔnn no, Persiafo Banu Musa[7] anuanom na wɔyɛɛ nnwom a wɔde di dwuma nhyehyɛe a wotumi yɛ ho nhyehyɛe, na wɔkaa mfiri a wɔde bɔ sanku a wɔde yɛ adwuma ho asɛm wɔ Book of Ingenious Devices.[8][9] Wɔ 1206 mu no, Arab mfiridwumayɛfo Al-Jazari yɛɛ afiri a wɔde bɔ sanku a wotumi yɛ ho nhyehyɛe a wobetumi ayɛ mfiri a wɔde bɔ nnwom a wɔde bɔ nnwom a ɛyɛ dɛ ne sanku nhyehyɛe ahorow, denam pegs ne cams so. Wɔ afe 1801 mu no, Jacquard loom no tumi yɛɛ nwene soronko koraa denam "program" no a wɔbɛsesa so – pasteboard card ahorow a ɛtoatoa so a wɔabɔ ntokuru wɔ mu.

Nhyehyɛe ahorow a wɔde brɛki koodu nso awɔ hɔ mfehaha pii.[10][11] Wɔ afeha a ɛto so 9 mu no, Arabni akontaabufo Al-Kindi kaa ɔkwan bi a wɔfa so kyerɛw nsɛm a wɔde asie a wɔde kyerɛkyerɛ mmara a wɔabɔ no kokoam mu ho asɛm, wɔ A Manuscript on Deciphering Cryptographic Messages.[12] Ɔde nkyerɛkyerɛmu a edi kan mae wɔ cryptanalysis by frequency analysis, algorithm a edi kan a ebrɛki koodu so.[12][13]

Mpɛn pii no, wɔkyerɛ sɛ kɔmputa so dwumadi a edi kan no wɔyɛɛ no 1843 mu, bere a akontaabufo Ada Lovelace tintim nhyehyɛe bi a wɔde bu Bernoulli akontaahyɛde ahorow a ɛtoatoa so, a na wɔahyɛ da ayɛ sɛ Charles Babbage ne Analytical Engine na ɛbɛyɛ no.[14] Nanso, na Charles Babbage akyerɛw ne dwumadi a edi kan ama Analytical Engine no dedaw wɔ 1837.[14][15]

Bere bi na wɔde nsɛm ne akwankyerɛ ahorow sie abɔnten so kaad a wɔabɔ no akuturuku so, na na wɔma ɛyɛ pɛpɛɛpɛ na wɔhyehyɛ no wɔ program deck ahorow mu.

Wɔ 1880 mfe no mu no, Herman Hollerith de adwene a ɛne sɛ wɔbɛkora nsɛm so wɔ ɔkwan a mfiri betumi akenkan so bae.[16] Akyiri yi control panel (plug board) a wɔde kaa ne 1906 Type I Tabulator ho maa kwan ma wɔ hyehyɛ maa nnwuma ahorow, na ebeduu 1940 mfe no awiei no, wɔde unit record mfiri te sɛ IBM 602 ne IBM 604 yɛɛ nhyehyɛe denam control panels a ɛte saa ara kwan so, sɛnea na ɛlɛtrɔnik kɔmputa ahorow a edi kan no te no. Nanso, bere a wɔde adwene a ɛne sɛ wɔde kɔmputa a wɔde nneɛma akora so no bɛba wɔ 1949 mu no, wɔde nhyehyɛe ne nsɛm nyinaa siee na wɔyɛɛ ho adwuma wɔ ɔkwan koro no ara so wɔ kɔmputa so nkae mu (computer memory).

Mfiri kasa[sesa]

Na mfiri koodu yɛ kasa a wɔde kyerɛw nhyehyɛe ahorow a edi kan no, na wɔkyerɛw no wɔ mfiri pɔtee no akwankyerɛ nhyehyɛe mu, na mpɛn pii no wɔde nkyerɛwde abien na ɛkyerɛw. Ankyɛ na wɔyɛɛ assembly kasa ahorow a ɛma Nnhyehyɛefoɔ (programmer) no kyerɛ akwankyerɛ wɔ nsɛm a wɔakyerɛw no kwan so (text format) mu (sɛ nhwɛso no, ADD X, TOTAL), a wɔde tiawa ma adwumayɛ koodu biara ne din ahorow a ntease wom a wɔde bɛkyerɛ address ahorow. Nanso esiane sɛ assembly kasa yɛ kakraa bi sen nkyerɛwde soronko ma mfiri kasa nti, mfiri abien a ɛsono akwankyerɛ ahorow nso wɔ assembly kasa ahorow.[17]

Kɔmpaela kasa ahorow[sesa]

Kasa ahorow a ɛkorɔn maa ɔkwan a wɔfa so yɛ dwumadi bi no yɛɛ mmerɛw na ntease wom, na na wonhia hardware a ɛwɔ ase no kɛse . Adwinnade a edi kan a ɛfa kɔmpaela ho, A-0 System, no, Grace Hopper, a ɔno nso hyehyɛɛ asɛmfua ‘compiler’ na ɔyɛɛ no afe 1952 mu. FORTRAN, kasa a ɛdi kan a wɔde di dwuma kɛseɛ a ɛwɔ dwumadie a ɛyɛ adwuma, puei wɔ afe 1957 mu,[18] na ankyɛ na wɔyɛɛ kasa foforɔ pii —titiriw no, COBOL a na wɔde asi wɔn ani so sɛ wɔbɛyɛ nsɛm ho dwumadie wɔ aguadi mu, ne Lisp a wɔde yɛ kɔmputa nhwehwɛmu.[19][20]

Saa kasa ahorow a wɔaboaboa ano yi ma nhyehyɛeyɛfo no tumi kyerɛw nhyehyɛe ahorow wɔ nsɛmfua a ɛyɛ den wɔ kasamufa mu, na otumi yi mmara no mu nsɛm pii, na ɛma ɛyɛ mmerɛw sɛ ɔde n’ani besi mfiri akwankyerɛ ahorow a ɛsonosonoe so denam mpaemuka a wɔaboaboa ano ne heuristics so. Wɔn a wɔboaboa nneɛma ano de kɔmputa tumi dii dwuma de maa nhyehyɛe yɛɛ mmerɛw denam ma a wɔmaa nhyehyɛeyɛfo kwan ma wɔkyerɛɛ akontaabu denam fomula bi a wɔde infix nkyerɛwde bɛhyɛ mu no so.[21]

Nhyehyeɛ Dwumadi kasa ahorow[sesa]

Dwumadie kasa ahodoɔ boa dwumadie ahodoɔ (a wɔfrɛ no programming paradigms). Kasa a wɔde bedi dwuma no gyina nneɛma pii a ɛsɛ sɛ wosusuw ho, te sɛ adwumakuw no nhyehyɛe, sɛnea ɛfata sɛ wɔyɛ adwuma, sɛnea nnipa foforo package ahorow wɔ hɔ, anaa ankorankoro pɛ. Sɛnea ɛbɛyɛ yiye no, wɔbɛpaw programming kasa a ɛfata yiye ma adwuma a ɛwɔ hɔ no. Nneɛma a wɔde di gua fi saa adwene yi mu ne sɛ wobenya nhyehyɛeyɛfo a wɔdɔɔso a wonim kasa no a wɔde bɛkyekye kuw, sɛnea wɔbɛboaboa nneɛma ano ama saa kasa no, ne sɛnea dwumadi ahorow a wɔakyerɛw wɔ kasa bi mu no yɛ adwuma yiye.

Kasa ahorow a efi ase fi "nea ɛba fam" kosi "nea ɛkorɔn"; "low-level" kasa ahorow no taa yɛ nea ɛfa mfiri ho kɛse na ɛyɛ ntɛm sɛ wɔde di dwuma, bere a "high-level" kasa ahorow no ɛnyɛ den sɛ wɔde bedi dwuma nanso ɛnyɛ ntɛmntɛm. Mpɛn pii no ɛyɛ mmerɛw sɛ wobɛkyerɛw mmara wɔ "nea ɛkorɔn" kasa ahorow mu sen "nea ɛba fam" de. Nhyehyeɛ Dwumadi kasa ahorow ho hia ma sɔftwɛɛ nkɔso. Wɔn ne nneɛma a wɔde si sɔftwɛɛ nyinaa, efi aapɔ ahorow a ɛnyɛ den so kosi nea ɛyɛ nwonwa sen biara so.

Allen Downey, kyerɛw wɔ ne nhoma How To Think Like A Computer Scientist[22] mu sɛ:

Ɛsono sɛnea nsɛm no mu nsɛm no te wɔ kasa ahorow mu, nanso ɛkame ayɛ sɛ akwankyerɛ atitiriw kakraa bi pue wɔ kasa biara mu:

  • nea wɔde hyɛm: Boaboa data ano fi keyboard, fael, anaa mfiri foforo bi so.
  • nea wɔde ba: Kyerɛ data wɔ screen no so anaasɛ fa data kɔ fael anaa mfiri foforo bi so.
  • Nkontaabu: Yɛ akontabuo mfitiaseɛ dwumadie te sɛ nkabom ne dodoɔ.
  • Tebea a Wɔde da no adi: Hwɛ sɛ tebea horow bi wɔ hɔ na di nsɛm a wɔahyehyɛ no nnidiso nnidiso a ɛfata.
  • Mpɛn pii: Yɛ adeyɛ bi mpɛn pii, mpɛn pii no, wosakra no bi.

Kɔmputa kasa pii ma wonya ɔkwan bi a wɔfa so frɛ dwumadi ahorow a nhomakorabea ahorow a wɔkyɛ de ma no. Sɛ dwumadie a ɛwɔ nwomakorabea bi di dwumadi mber nhyiamde a ɛfata akyi (sɛ nhwɛsoɔ, method of passing arguments) a, ɛnde wɔbɛtumi akyerɛw saa dwumadie yi wɔ kasa foforɔ biara mu.

Wɔn a wɔyɛ nhyehyɛe[sesa]

Kɔmputa so dwumadifo ne wɔn a wɔkyerɛw kɔmputa so dwumadi ahorow. Wɔn nnwuma taa hwehwɛ sɛ:

  • Nhwɛsode a wɔde yɛ
  • Koodu kyerɛw
  • Nsiesie wɔ koodu mu
  • Nkrataa
  • Wɔaka abom
  • Nsiesie
  • Ahwehwɛde ahorow mu nhwehwɛmu
  • sɔftwɛɛ nhyehyɛe
  • sɔftwɛɛ a wɔsɔ hwɛ
  • nkyerɛkyerɛmu a wɔakyerɛkyerɛ mu

Ɛwom sɛ wɔde nhyehyɛe ho nsɛm akyerɛ wɔ nsɛm ho amanneɛbɔ mu sɛ ɛyɛ akontaabu asɛm bi de,[23] nanso nhwehwɛmu ahorow bi kyerɛ sɛ nhyehyɛeyɛfo pa wɔ ahokokwaw a emu yɛ den wɔ nnipa awosu kasa mu, na sɛnea wosua sɛnea wɔkyerɛw koodu no te sɛ ɔman foforo so kasa a wosua.[24][25]

Beaɛ a menyaa mmoa fii[sesa]

  1. ↑ What Is Programming? And How To Get Started (in English), 2023-07-24, retrieved 2023-07-28
  2. ↑ yearofcodes, Learn Programming — What is coding?, retrieved 2023-07-28
  3. ↑ yearofcodes, Learn Programming — What is computer programming?, retrieved 2023-07-28
  4. ↑ How to Code – Coding for Beginners and How to Learn Programming for Free (in English), 2021-08-17, retrieved 2023-07-28
  5. ↑ Software Engineering | Debugging (in American English), 2018-06-25, retrieved 2023-07-28
  6. ↑ Computer programming - HandWiki (in English), retrieved 2023-07-28
  7. ↑ Pioneers of Engineering: Al-Jazari and the Banu Musa (in English), retrieved 2023-07-28
  8. ↑ Teun Koetsier (2001-05-01), "On the prehistory of programmable machines: musical automata, looms, calculators", Mechanism and Machine Theory (in English), vol. 36, no. 5, pp. 589–603, doi:10.1016/S0094-114X(01)00005-2, ISSN 0094-114X, retrieved 2023-07-28
  9. ↑ Automatic Flute Player in computing, retrieved 2023-07-28
  10. ↑ https://www.twinkl.com.gh/blog/what-is-code-breaking-and-how-is-it-used-in-maths, retrieved 2023-07-28 {{citation}}: Missing or empty |title= (help)
  11. ↑ Rebecca (2021-09-24), Code-Breaking (Cryptanalysis): A Complete History (in American English), retrieved 2023-07-28
  12. ↑ 12.0 12.1 Phillip Rogaway, Till Stegers (2009-07), Authentication without Elision: Partially Specified Protocols, Associated Data, and Cryptographic Models Described by Code, IEEE, doi:10.1109/csf.2009.23, retrieved 2023-07-28 {{citation}}: Check date values in: |date= (help)
  13. ↑ John F. Dooley (2013-09-24), A Brief History of Cryptology and Cryptographic Algorithms (in English), Springer Science & Business Media, ISBN 978-3-319-01628-3, retrieved 2023-07-28
  14. ↑ 14.0 14.1 Explore Ada Lovelace’s Bernoulli program with Wolfram – Ada Lovelace Day, retrieved 2023-07-28
  15. ↑ https://arxiv.org/abs/2303.13740
  16. ↑ Herman Hollerith, retrieved 2023-07-28
  17. ↑ Are instruction set and assembly language the same thing? (in English), retrieved 2023-07-29
  18. ↑ {{cite web}}: Empty citation (help)
  19. ↑ Computer History Museum - Lectures - The World's First COBOL Compilers, 2011-10-13, archived from the original on 2011-10-13, retrieved 2023-07-29
  20. ↑ How was the first compiler written? (in English), retrieved 2023-07-29
  21. ↑ Fortran creator John Backus dies (in English), 2007-03-20, retrieved 2023-07-29
  22. ↑ Think Python: How to Think Like a Computer Scientist - 2e (in English), 2012, retrieved 2023-07-29
  23. ↑ What does mathematics have to do with programming? (in English), retrieved 2023-07-29
  24. ↑ To the brain, reading computer code is not the same as reading language (in English), 2020-12-15, retrieved 2023-07-29
  25. ↑ 7 ways learning to code is like learning a language (in English), retrieved 2023-07-29
Yɛ yi fii "https://tw.wikipedia.org/w/index.php?title=Kɔmputa_so_dwumadi_ahorow_(Computer_programming)&oldid=177441"