![SULIT FP305: DATA STRUCTURE
3 SULIT
SECTION B: 50 MARKS
BAHAGIAN B : 50 MARKAH
INSTRUCTION:
This section consists of TWO (2) structured questions. Answer ALL questions.
ARAHAN :
Bahagian ini mengandungi DUA (2) soalan berstruktur. Jawab SEMUA soalan.
QUESTION 1
SOALAN 1
(a) Define Data Structure.
Takrifkan Struktur Data
[2 marks]
[2 markah]
(b) Write TWO (2) differences between list and linked list.
Tuliskan DUA (2) perbezaan di antara senarai dan senarai berpaut.
[4 Marks]
[4 markah]
(c) Differentiate Push and Pop operations in stack.
Bezakan operasi ‘Push’ dan ‘Pop’ dalam tindanan..
[4 marks]
[4 markah]
(d) Last In First Out (LIFO) is the concept in stack. Describe the concept of LIFO.
Last In First Out (LIFO) adalah konsep dalam timbunan. Jelaskan konsep LIFO.
[2 marks]
[2 markah]
(e) Explain the concepts of underflow and overflow in stack.
Terangkan konsep limpahan bawah dan limpahan atas dalam timbunan.
[4 marks]
[4 markah]
CLO1
C1
CLO1
C2
CLO2
C2
CLO1
C2
CLO2
C2](https://image.slidesharecdn.com/fp305qdatastructure33-141207021944-conversion-gate02/85/FP305-data-structure-2-320.jpg)
![SULIT FP305: DATA STRUCTURE
4 SULIT
Figure B1 / Rajah B1
(f) Identify ALL the operations of stack to get the output as given in Figure 1 above.
Kenalpasti SEMUA operasi yang terlibat bagi tindanan untuk memperoleh output seperti di Rajah 1.
[3 marks]
[3 markah]
(g) Declare the data structure for a student by using the information below:
Isytiharkan struktur data pelajar menggunakan maklumat di bawah:
a. name
b. date of birth
c. IC No
d. Telephone Number
[6 marks]
[6 markah]
CLO2
C3
CLO3
C2](https://image.slidesharecdn.com/fp305qdatastructure33-141207021944-conversion-gate02/85/FP305-data-structure-3-320.jpg)
![SULIT FP305: DATA STRUCTURE
5 SULIT
QUESTION 2
SOALAN 2
(a) Define what is queue and explain the concepts used in queue operation.
Takrifkan apa itu baris gilir dan terangkan konsep yang digunakan dalam operasi baris gilir.
[3 marks]
[3 markah]
(b) Identify root node, child node, parents node and leaf node according to Figure B2.
Kenalpasti nod akar, nod anak, nod bapa dan nod daun melalui gambar Rajah B2.
Figure B2 / Rajah B2
[5 Marks]
[5 markah]
(c) List TWO (2) types of searching algorithm.
Senaraikan DUA (2) jenis algoritma carian
[2 marks]
[2 markah]
CLO1
C1
CLO1
C1
CLO1
C2](https://image.slidesharecdn.com/fp305qdatastructure33-141207021944-conversion-gate02/85/FP305-data-structure-4-320.jpg)
![SULIT FP305: DATA STRUCTURE
6 SULIT
(d) Below is the declaration for queue.
Di bawah merupakan pengisytiharan bagi baris gilir
Draw a queue diagram to represent each statement after it is executed. State any error if occured.
Lukis gambarajah baris gilir untuk menerangkan setiap pernyataan selepas dilaksanakan. Nyatakan setiap ‘error’ jika ada.
a. CreateQueue(&g);
b. Enqueue(10,&g);
c. Enqueue (20,&g);
d. CreateQueue (&q);
e. Enqueue (30,&q);
f. Enqueue (40,&q);
g. Enqueue (50,&g);
h. Enqueue (&i,&q);
[4 marks]
[4 markah]
(e) Write the algorithm to dequeue an item from a queue.
Tuliskan algoritma untuk membuang item dari barisan.
[3 marks]
[3 markah]
CLO2
C1
CLO2
C1](https://image.slidesharecdn.com/fp305qdatastructure33-141207021944-conversion-gate02/85/FP305-data-structure-5-320.jpg)
![SULIT FP305: DATA STRUCTURE
7 SULIT
(f) Create Binary Search Tree with this following arithmetic expression. ( 9 + 5 ) * 5 + ( 4 - ( 6 – 3 ) ) .
Lakarkan pepohon carian dedua dengan ungkapan aritmetik ini berikut (9 + 5) * 5 + (4 - (6-3)).
[4 marks]
[4 markah]
(g) Show the step on how to solve the searching problems by using the binary search method.
Papar langkah bagaimana untuk menyelesaikan masalah carian dengan menggunakan kaedah carian dedua.
Target Key Find: 50
The values : {40, 45, 46, 50, 65, 70, 75}
[4 marks]
[4 markah]
SOALAN TAMAT
CLO3
C3
CLO3
C3](https://image.slidesharecdn.com/fp305qdatastructure33-141207021944-conversion-gate02/85/FP305-data-structure-6-320.jpg)
FP305 data structure
- 1. SULIT FP305: DATA STRUCTURE 2 SULIT SECTION A: 50 MARKS BAHAGIAN A: 50 MARKAH INSTRUCTION: This section consists of FORTY (40) objective questions. Mark your answers in the OMR form provided. ARAHAN : Bahagian ini mengandungi EMPAT PULUH (40) soalan objektif. Tandakan jawapan anda di dalam borang OMR yang disediakan.
- 2. SULIT FP305: DATA STRUCTURE 3 SULIT SECTION B: 50 MARKS BAHAGIAN B : 50 MARKAH INSTRUCTION: This section consists of TWO (2) structured questions. Answer ALL questions. ARAHAN : Bahagian ini mengandungi DUA (2) soalan berstruktur. Jawab SEMUA soalan. QUESTION 1 SOALAN 1 (a) Define Data Structure. Takrifkan Struktur Data [2 marks] [2 markah] (b) Write TWO (2) differences between list and linked list. Tuliskan DUA (2) perbezaan di antara senarai dan senarai berpaut. [4 Marks] [4 markah] (c) Differentiate Push and Pop operations in stack. Bezakan operasi ‘Push’ dan ‘Pop’ dalam tindanan.. [4 marks] [4 markah] (d) Last In First Out (LIFO) is the concept in stack. Describe the concept of LIFO. Last In First Out (LIFO) adalah konsep dalam timbunan. Jelaskan konsep LIFO. [2 marks] [2 markah] (e) Explain the concepts of underflow and overflow in stack. Terangkan konsep limpahan bawah dan limpahan atas dalam timbunan. [4 marks] [4 markah] CLO1 C1 CLO1 C2 CLO2 C2 CLO1 C2 CLO2 C2
- 3. SULIT FP305: DATA STRUCTURE 4 SULIT Figure B1 / Rajah B1 (f) Identify ALL the operations of stack to get the output as given in Figure 1 above. Kenalpasti SEMUA operasi yang terlibat bagi tindanan untuk memperoleh output seperti di Rajah 1. [3 marks] [3 markah] (g) Declare the data structure for a student by using the information below: Isytiharkan struktur data pelajar menggunakan maklumat di bawah: a. name b. date of birth c. IC No d. Telephone Number [6 marks] [6 markah] CLO2 C3 CLO3 C2
- 4. SULIT FP305: DATA STRUCTURE 5 SULIT QUESTION 2 SOALAN 2 (a) Define what is queue and explain the concepts used in queue operation. Takrifkan apa itu baris gilir dan terangkan konsep yang digunakan dalam operasi baris gilir. [3 marks] [3 markah] (b) Identify root node, child node, parents node and leaf node according to Figure B2. Kenalpasti nod akar, nod anak, nod bapa dan nod daun melalui gambar Rajah B2. Figure B2 / Rajah B2 [5 Marks] [5 markah] (c) List TWO (2) types of searching algorithm. Senaraikan DUA (2) jenis algoritma carian [2 marks] [2 markah] CLO1 C1 CLO1 C1 CLO1 C2
- 5. SULIT FP305: DATA STRUCTURE 6 SULIT (d) Below is the declaration for queue. Di bawah merupakan pengisytiharan bagi baris gilir Draw a queue diagram to represent each statement after it is executed. State any error if occured. Lukis gambarajah baris gilir untuk menerangkan setiap pernyataan selepas dilaksanakan. Nyatakan setiap ‘error’ jika ada. a. CreateQueue(&g); b. Enqueue(10,&g); c. Enqueue (20,&g); d. CreateQueue (&q); e. Enqueue (30,&q); f. Enqueue (40,&q); g. Enqueue (50,&g); h. Enqueue (&i,&q); [4 marks] [4 markah] (e) Write the algorithm to dequeue an item from a queue. Tuliskan algoritma untuk membuang item dari barisan. [3 marks] [3 markah] CLO2 C1 CLO2 C1
- 6. SULIT FP305: DATA STRUCTURE 7 SULIT (f) Create Binary Search Tree with this following arithmetic expression. ( 9 + 5 ) * 5 + ( 4 - ( 6 – 3 ) ) . Lakarkan pepohon carian dedua dengan ungkapan aritmetik ini berikut (9 + 5) * 5 + (4 - (6-3)). [4 marks] [4 markah] (g) Show the step on how to solve the searching problems by using the binary search method. Papar langkah bagaimana untuk menyelesaikan masalah carian dengan menggunakan kaedah carian dedua. Target Key Find: 50 The values : {40, 45, 46, 50, 65, 70, 75} [4 marks] [4 markah] SOALAN TAMAT CLO3 C3 CLO3 C3