Data Structures
Akopọ
Write a program that stores one exam mark and you need one variable. Write one that stores thirty and you do not need thirty variables, because thirty variables cannot be looped over, cannot be sorted, and cannot be passed to a subroutine in one piece. What you need is a single name that holds all thirty and a number that says which one you mean. That is an array, and it is the reason the loop you met earlier in this course is useful at all.
This lesson covers the concept of a data structure and the two the specification names: arrays, in one and two dimensions, and records. Arrays hold many things of the same kind under one name; records hold several different things about one subject. You will learn to use each of them in the design of solutions to simple problems, to combine them into an array of records, and to say why a particular structure suits a particular problem, which is the form the exam question takes.
Awọn Afojusun
- Understand the concept of data structures.
- Use arrays (or equivalent) in the design of solutions to simple problems.
- Use records (or equivalent) in the design of solutions to simple problems.
Àwòrán ọpọlọ
A ti ṣe àwòrán kókó yìí kí o lè rí bí àwọn èrò ṣe so pọ̀.
Ṣí àwòrán ọpọlọ nínú áàpù
Akọ̀wé Ẹ̀kọ́
Àkọsílẹ̀ Ẹ̀kọ́ Pípé wà lórí Ohun Èlò Green Bridge
Gba ohun èlò Green Bridge CBT sórí fóònù tàbí kọ̀mpútà rẹ fún gbogbo ilé ìkàwé IGCSE: ìwé ìdánwò àtijọ́, ìlànà ìdíwọ̀n, àwòrán èrò, káàdì ìkẹ́kọ̀ọ́ àti ẹ̀kọ́ ohùn.
Ìdánwò Ẹ̀kọ́
Oriire fun ipari ẹkọ lori Data Structures. Ni bayi ti o ti ṣawari naa awọn imọran bọtini ati awọn imọran, o to akoko lati fi imọ rẹ si idanwo. Ẹka yii nfunni ni ọpọlọpọ awọn adaṣe awọn ibeere ti a ṣe lati fun oye rẹ lokun ati ṣe iranlọwọ fun ọ lati ṣe iwọn oye ohun elo naa.
Iwọ yoo pade adalu awọn iru ibeere, pẹlu awọn ibeere olumulo pupọ, awọn ibeere idahun kukuru, ati awọn ibeere iwe kikọ. Gbogbo ibeere kọọkan ni a ṣe pẹlu iṣaro lati ṣe ayẹwo awọn ẹya oriṣiriṣi ti imọ rẹ ati awọn ogbon ironu pataki.
Lo ise abala yii gege bi anfaani lati mu oye re lori koko-ọrọ naa lagbara ati lati ṣe idanimọ eyikeyi agbegbe ti o le nilo afikun ikẹkọ. Maṣe jẹ ki awọn italaya eyikeyi ti o ba pade da ọ lójú; dipo, wo wọn gẹgẹ bi awọn anfaani fun idagbasoke ati ilọsiwaju.
- An array holds 15 items. What is the index of the last item? A. 0 B. 14 C. 15 D. 16 Answer: B
- Which statement about an array is correct? A. Its items may have different data types B. Its items are reached by a field name C. All of its items have the same data type D. It can only hold numbers Answer: C
- A two dimensional array Grid has 6 rows and 9 columns. How many elements does it have? A. 15 B. 45 C. 54 D. 69 Answer: C
- Which structure is most appropriate for storing a name, an age and a Boolean about one person? A. A one dimensional array B. A two dimensional array C. A record D. A string Answer: C
- In a one dimensional array holding a grid of width 5, which expression gives the index of the element in row 3, column 2? A. 3 + 2 B. 3 * 5 + 2 C. 3 * 2 + 5 D. 5 * 2 + 3 Answer: B
Ṣiṣẹ́ lórí àwọn ìbéèrè wọ̀nyí nínú ohun èlò náà
Ṣiṣẹ́ lórí àwọn ìbéèrè wọ̀nyí nínú ohun èlò náà
Awọn Iwe Itọsọna Ti a Gba Nimọran
Ṣe Adaṣe Awọn Ibeere Idanwo Adaṣe
Ṣe o fẹ ṣe adaṣe awọn ibeere idanwo adaṣe nipa Data Structures? Ṣe igbasilẹ ohun elo Green Bridge CBT lati wọle si awọn ibeere idanwo adaṣe ati awọn ayẹwo adaṣe kikun fun koko-ọrọ yii.
Ṣe igbasilẹ ohun elo naa lori Google Playstore
Gbogbo ohun ti o nilo lati ṣe dara julọ ninu JAMB, WAEC ati NECO.
