INSTRUCTION: This section consists of TWO (2) structured questions. Answer ALL questions.

Size: px

Start display at page:

Download "INSTRUCTION: This section consists of TWO (2) structured questions. Answer ALL questions."

Sabrina Harrington
6 years ago
Views:

1 SECTION B : 55 MARKS BAHAGIAN B : 55 MARKAH INSTRUCTION: This section consists of TWO (2) structured questions. Answer ALL questions. ARAHAN: Bahagian ini mengandungi TWO (2) soalan berstruktur. Jawab semua soalan. QUESTION 1 SOALAN 1 (a) Give TWO (2) examples for Non-Primitive Data Type. Berikan DUA (2) contoh untuk Jenis Data Bukan Primitif. (b) State THREE (3) types of linked list. Nyatakan TIGA (3) jenis senarai berpaut. (c) (i) Differentiate between push and pop. (i) Bezakan di antara push dan pop. (ii) Determine the operation when the below condition happen. Tentukan operasi di bawah apabila keadaan di bawah berlaku. (a) Next element being added into stack if stack already full. 18 SULIT

2 Elemen seterusnya dimasukkan ke dalam tindanan jika tindanan sudah penuh. (b) Next element deleted if stack already empty. Elemen seterusnya dihapuskan jika tindanan sudah kosong. C3 (d) Declare a structure named Car which holds the information based on Table above. Istiharkan struktur bernama Kereta yang mengandungi maklumat seperti di dalam Jadual di bawah. Variable Data Type Size Plate_num String 10 Owner_name String 50 Car_type String 50 Table / Jadual (e) (f) Illustrate Circular Linked List with 3 nodes. Lukiskan Senarai Berpaut Bulatan dengan 3 nod. (i) List TWO (2) operation in Linked List. (i) Senaraikan DUA (2) operasi di dalam Senarai Berpaut. 19 SULIT

3 Figure / Rajah (ii) Based on Figure above, illustrate the Linked List for the following questions. (ii) Berdasarkan Rajah di atas, lukiskan senarai berpaut bagi soalan berikut. (a) Insert new node with data = 5 at beginning of Linked List. Masukkan nod baru dengan data = 5 di permulaan Senarai Berpaut. (b) Delete data = 4 by using answer in f (ii) (a). Hapuskan data = 4 dengan menggunakan jawapan di f (ii) (a). (g) Illustrate the Stack by using Linked List implementation with size of stack is 4 for the following operation. Lukiskan Tindanan dengan menggunakan perlaksanaan Senarai Berpaut dengan saiz tindanan adalah 4 untuk operasi berikut. Push(1); pop( ); push(2); push(3); pop( ); push(4); [6 marks] [6 markah] 20 SULIT

4 QUESTION 2 SOALAN 2 (a) First In First Out (FIFO) is a concept in queue operation. Define the concept of FIFO with ONE (1) example. First In First Out (FIFIO) adalah konsep dalam tindanan. Definasikan konsep FIFO dengan SATU (1) contoh. (b) List THREE (3) terminologies in relation with tree. Senaraikan TIGA (3) terminologi yang berkaitan dengan pepohon. [4 marks] [4 markah] (c) Explain Binary Tree. Give ONE (1) example of Complete Binary Tree. Terangkan Pepohon Dedua. Berikan SATU (1) contoh Pepohon Dedua Lengkap. (d) State THREE (3) method of sorting. Nyatakan TIGA (3) kaedah isihan. [3marks] (e) Identify TWO (2) differences between Linear Search and Binary Search. Kenalpasti DUA (2) perbezaan antara Carian Linear dan Carian Dedua (f) Draw a diagram to show dequeue operation using circular queue with size 3. Lukis rajah yang menunjukkan operasi dequeue menggunakan baris gilir membulat dengan saiz SULIT

5 C3 (g) Given below is a list of private data in aqueue. Assume the size of the queue is 2, location of rear and front is at index 0. Diberi senarai data peribadi dalam aqueue. Anggapkan saiz baris gilir ialah 2, kedudukan lokasi bagi rear dan front ialah pada index 0. Data:M Y A Draw the output according to the segment code in Figure B1 after the following operations are executed. Lukiskan output merujuk kepada kod segmen dalam Rajah B1 selepas operasi berikut dilaksanakan. if (isfull(q) == 1) cout<< The Queue is Full"); else { cout<<"\nenter item number: "; cin>>data; q->aqueue[q->rear] = data; q->rear++; } Figure B1 / Rajah B2 22 SULIT

6 C4 (h) Based on Figure B2, sketch a new tree after these instructions are executed. Berdasarkan Rajah B2, lakarkan pokok yang baru selepas arahan berikut dilaksanakan. Figure B2 / Rajah B2 i. delete node H hapuskan nod H ii. delete node Q hapuskan nod Q [6 marks] [6 markah] C3 (i) Solve the problem given by using Binary Search method. Selesaikan masalah yang diberi menggunakan Kaedah Carian Dedua. Target Key: [0] [1] [2] [3] [4] [5] [6] [4 marks] [4 markah] SOALAN TAMAT 23 SULIT

INSTRUCTION: This section consists of TWO (2) structured questions. Answer ALL questions.

SECTION B : 55 MARKS BAHAGIAN B : 55 MARKAH INSTRUCTION: This section consists of TWO (2) structured questions. Answer ALL questions. ARAHAN: Bahagian ini mengandungi DUA (2) soalan berstruktur. Jawab