SULIT

FP305: DATA STRUCTURE

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 subjektif. Jawab semua soalan.
QUESTION 1
SOALAN 1
CLO2
C2

(a) Based on the following declaration, write the statement to print the data structure
member using looping condition.
Berdasarkan pengisytiharan berikut, tuliskan kenyataan untuk mencetak ahli
struktur data yang menggunakan kaedah gelungan.
struct product
{
int weight;
float price;
};
product apple[3];

[3 marks]
[3 markah]
CLO2
C3

(b) Based on the information in Table B1, write down the appropriate struct declaration.
Merujuk kepada maklumat di dalam Jadual B1, tuliskan pengistiharan struktur yang
sesuai.
Table B1 / Jadual B1
Type/Jenis

Name/ Nama

Data Type/Jenis Data

Structure name

Business

Member-1

Co_Name

30 characters

Member-2

Location

15 characters

Member-3

Reg_Number

7 characters

Variable structure-1

Co_1

Until 15 records
[5 Marks]
[5 markah]
2

SULIT

SULIT

FP305: DATA STRUCTURE

CLO3 (c) Describe the type of checking operation in linked list.

C2
Terangkan jenis operasi penyemakan dalam senarai berpaut.
[3 marks]
[3 markah]

CLO2
C1

(d) Last In First Out (LIFO) is a concept in stack. Describe the concept of LIFO with
ONE (1) example.
Last In First Out (LIFO) adalah konsep dalam timbunan. Jelaskan konsep LIFO
berserta SATU (1) contoh.
[3 marks]
[3 markah]

CLO1
C2

(e) List FOUR (4) operations of List.

Senaraikan EMPAT (4) operasi Senarai.
[4 marks]
[4 markah]

CLO2
C3

(f) Draw a diagram before and after each of the following of linked list operation are
executed according to figure B1 below.
Lukis gambar rajah sebelum dan selepas operasi ke atas senarai berpaut
dilaksanakan di rajah B1 bawah.

3
Figure B1 / Rajah B1
i.

Insert item at the middle

Memasukkan item di tengah senarai

ii.

Delete the in front item

Memadam item di bahagian depan senarai
[4 marks]
[4 markah

SULIT

SULIT

CLO2
C1

FP305: DATA STRUCTURE

(g) Explain the concept of overflow in stack and draw the diagram of overflow.
Terangkan konsep limpahan atas dalam timbunan dan lakarkan gambar rajah
limpahan atas.
[3 marks]
[3 markah]

SULIT

SULIT

FP305: DATA STRUCTURE

QUESTION 2
SOALAN 2
CLO2
C1

(a) Write algorithm to dequeue an item from a queue.

Tuliskan algoritma unuk membuang item dari barisan.
[3 marks]
[3 markah]

CLO2
C3

(b) Based on Figure B1, answer the following questions:

Berdasarkan Rajah B1, jawab soalan-soalan berikut:

Figure B1 / Rajah B1
i. Sketch binary search tree after deleting the item with value 30
Lakarkan pepohon carian dedua selepas menghapus item yang bernilai 30.
ii. Based on your answer in (i), sketch binary search tree after insert item with
value 27.
Berdasarkan jawapan anda dalam (i), lakarkanan pepohon cariandedua
selepas memasukkan itemyang bernilai 27
iii. Based on your answer in (ii), write the node sequence of the following
traversals:
berdasarkan jawapan anda di (ii), tuliskan urutan nod bagi penyusuran
penyusuran berikut:
a) Pre-order / Penyusuran pra tertib
b) Post-order / Penyusuran pasca tertib
[10 Marks]
[10 markah]

SULIT

SULIT

CLO1
C2

FP305: DATA STRUCTURE

(c) Write THREE (3) advantages of sorted list.

Tulis TIGA (3) kelebihan senarai yang disusun.
[3 marks]
[3 markah]

CLO2
C2

(d) List FOUR (4) types of sorting method.

Senaraikan EMPAT (4) jenis kaedah isihan.
[4 marks]
[4 markah]

CLO3
C3

(e) Sort this data set {7, 8, 3, 1, 6} using selection sort. Show the list of array after each
swap takes place.
Isihkan kumpulan data {7, 8, 3, 1, 6} menggunakan isihan pilihan. Tunjukkan senarai
tatasusunan selepas setiap pertukaran berlaku.
[5 marks]
[5 markah]

SOALAN TAMAT

SULIT