Ad argvmentvm transi
Topos Uranos
Latine

Introdvctio: data composita

Svmmarivm

Haec lectio sextam cvrsvs partem aperit, datis compositis dedicatam. Explicat ad qvid pars valeat: docere qvomodo collectiones datorvm repraesententvr (seqventiae magnitvdinis fixae et variabilis, tabvlae et tabvlaria) et algorithmis primariis tractentvr, manv scriptis et e bibliotheca svmptis, aestimando qvanti constent; sex eivs lectiones exhibet et filvm qvo nectvntvr; in memoriam revocat qvae pars pro cognitis habet, praesertim circvitvs cvm invariante et transmissionem per referentiam constantem; qvaestionem qvam pars solvit proponit, programmatis qvod data servare debet qvorvm nvmervm ignorat et qvod, variabilibvs singvlis scriptvm, ea qvae svpersvnt tacitvm praeterit; svmptvm praenvntiat vt alteram algorithmi mensvram, vna cvm eivs rectitvdine; et ostendit qvo dvcat, in partibvs seqventibvs et in cvrsv Programmatio Lingva C++ II.

Proposita discendi

  1. Seriem argvmentorvm partis describere et explicare qvid qvaeqve lectio seqventi conferat.
  2. Circvitvs, eorvm invariantes et transmissionem parametrorvm (per valorem, per referentiam et per referentiam constantem) in memoriam revocare, et eos, si opvs est, retractare.
  3. Exemplo svmptvm algorithmi praenvntiare vt alteram eivs qvalitatis mensvram, vna cvm eivs rectitvdine.
  4. Agnoscere qvid in fine partis facere scire oporteat, et id ab eis distingvere qvae in partibvs seqventibvs discentvr.

Probatio initialis

Anteqvam pars percvrritvr, initivm ipsvm metiri expedit. Haec probatio est svi ipsivs exploratio: nvlli censvrae svbicitvr, et solvm eivs propositvm est stvdivm dirigere. Qvattvor primae qvaestiones examinant qvae pars pro cognitis habet: invariantem circvitvs qvi maximvm qvaerit, modvm transmissionis parametri magni, nvmervm gyrorvm dvorvm circvitvvm nidificatorvm et arithmeticam sine signo. Sex seqventes ordine lectionvm ideas praecipvas partis attingvnt: indices validos seqventiae, creationem vectoris, qvotiens magnitvdo in dimidivm dividi possit, qvaesitionem in datis ordinatis, dvplicem indicem tabvlae et pericvlvm data eivsdem entis in collectionibvs separatis servandi. Nemo eas iam recte solvere cogitvr, et in nonnvllis earvm «nondvm scio» responsio honesta est: qvaeqve responsio, recta vel non, rem explicat et lectionem nominat qvae eam tractat. Eaedem facvltates in fine itervm metivntvr, in lectione synthesis.

Probatio initialis

Antequam vnitatem incipias, pvnctvm vnde proficisceris metire. Brevis est sui ipsivs probatio: non aestimatvr, et eivs exitvs in solo tvo navigatro servatvr.

  1. Qvaestio 1Ex vnitatibvs prioribvsFragmentvm int largest{0}; int t{}; while (std::cin >> t) { if (t > largest) { largest = t; } } in largest maximam temperatvrarvm lectarvm relinqvere debet. Qvo introitv deficit?

  2. Qvaestio 2Ex vnitatibvs prioribvsFvnctio compvtat qvot vocales habeat textvs decies centenorvm milivm charactervm, in std::string servatvs, nec evm mvtat. Qvomodo eivs parametrvm declarare expedit?

  3. Qvaestio 3Ex vnitatibvs prioribvsQvotiens ++count exseqvitvr in for (int i{0}; i < 6; ++i) { for (int j{0}; j < i; ++j) { ++count; } }?

  4. Qvaestio 4Ex vnitatibvs prioribvsQvid scribit std::println("{}", 0u - 1); in systemate vbi unsigned int 32 bit habet?

  5. Qvaestio 5In seqventia nn elementorvm vt in C++ nvmeratorvm, qvi indices ii elementvm designant?

  6. Qvaestio 6Qvid continet v post std::vector<int> v(3, 7);?

  7. Qvaestio 7Qvot gyros facit for (int m{1024}; m > 1; m /= 2) { ... }?

  8. Qvaestio 8Catalogvs decies centena milia nominvm ordine alphabetico continet. Vt vnvm inveniatvr, in medio aperitvr, dimidivm in qvo nomen esse non potest reicitvr, et idem cvm altero repetitvr. Qvotiens, ad svmmvm, aperiendvs est?

  9. Qvaestio 9Cvm std::vector<std::vector<int>> t{{1, 2, 3}, {4, 5, 6}};, qvanti valent t[1][0] et t.size()?

  10. Qvaestio 10Programma nomina gregis in vno vectore servat et eorvm aestimationes in altero, ita vt aestimatio grades[i] sit ipsivs names[i]. Si solvm vectorem aestimationvm ordinat, qvid accidit?