DCT1093 OOP. Selamat Hari Raya. Maaf Zahir & Batin

/**
 * @(#)MaafRaya0_0.java
 */
 import java.util.Scanner;
public class MaafRaya0_0 {
  
    public static void main(String[] args) {
        String answer;
        boolean maaf=false;
        Scanner input = new Scanner(System.in);
        System.out.println("Selamat Menyambut Hari Raya");
        do {
            System.out.println("Mohon Maaf Zahir & batin : ya / tidak");
            answer = input.next();
            if (answer.equals("ya")){
                maaf=true;    }
        }while(maaf!=true);
       System.out.println("Terima Kasih kerana sudi maafkan kami, 0-0 ya. ");   
    }
}
 

DCT1093 Object Oriented Programming

Pelajar Diploma Information Technology (DIT) akan mengambil subjek Object Oriented Programming (di sebut OOP).

Berikut adalah bahan-bahan pengajaran bagi subjek berkenaan:-

1) Perancangan Pengajaran
Sila klik di sini untuk ' Lesson Plan  '

 



2) Buku Rujukan 
Y. Daniel Liang, Introduction to Java™ Programming, Brief Version, 9 Edition. 2013. Pearson Education. Sila cari di perpustakaan TATIUC, pelajar boleh samada menggunakan edisi 9 atau edisi 8. 'Power point slide boleh di dapati dari link di sini.

Buku Rujukan (Edisi 8)

Buku Rujukan (Edisi 9)

4. Perisian
 

 Bagi membangunkan aplikasi java dalam pc masing-masing . Pelajar perlu melakukan 'installation' JDK (java development kit) dan mana-mana editor untuk java (seperti NetBeans, Eclipse, BlueJ ).

5. Contoh Penilaian

Quiz

Assignment

Test

Final Exam

BCS2233 OOP: Solution for Assignment3 (Q2 and Q3)

Jawapan untuk Assignment 3.

Soalan 2 a) 

class time {

double secs, mins, hours;

 

time(){

secs=0; mins=0; hours=0;

}

public void showdata(){

System.out.Println(“Saat =” +secs);

System.out.Println(“Minit =” +mins);

System.out.Println(“Jam =” +hours);

}

Soalan 2 b)  

class rectangle {

double height,length;

date(){

height=0; length=0;

}

public void showdata(){

System.out.Println(“Tinggi =” +height);

System.out.Println(“Panjang =” + length);

} 

Soalan 3

class point {

int x,y;

point(){

x=0;y=0;

} 

double area(){

return 0;

}

double distance(int x1 ,int y1, int x2, int y2) {

return Math.sqrt((x2-x1)*(x2-x1)-(y2-y1)*(y2-y1));

}

}

class circle extends point {

int radius;

double area() {

return (3.14 * (radius* radius));

}

}

UML diagram  for the class Point and class Circle

BCS 3822 Final Year Project 1

Pelajar tahun 2 BCSC akan mengambil BCS 3822 Final Year Project 1 pada semester depan (sem 1 15/16). Bagi melancarkan proses berkenaan- pelajar di minta untuk mencadangkan tajuk yang sesuai pada semester ini (sem 2 2014/2015).

Berikut adalah contoh tajuk-tajuk projek yang sedang di siapkan oleh pelajar BCSC dan BCBM.

1	Learning Numbers in Multiple Language
2	Phonetic Alphabet Application Android
3	Booking Ticket Football Online System
4	Car Rent Booking Online
5	Android Application of Navigation SP Bumi’s Bus Towards TATIUC Students
6	Android SP Bumi Bus Booking Ticket
7	e-Attendance (Android)
8	Asma Ul-Husna Mobile Zikir
9	Personal Water Meter Calculation Using Android Application
10	Doa-doa Harian (Android)
11	Mobile Application for Taxi Booking
12	The Basic of Iqra’ Learning for Beginner
13	Rosdi Farm Web System
14	My Calendar Tracker
15	Health Monitor
16	Broiler Farm Calculator for Android Application

17	Final Year Project Information System
18	e-Maintenance Hostel System
19	PMIT Fees Collection System
20	Workshop Inventory System
21	Laboratory Information System for FTKK
22
23	Research Information System
24	TATIUC Online Summon System
25	Online Ordering System at Wannur’s Restaurants
26	Management and Notification Event System for TATIUC Student
27	Chinta Hair Saloon Online System
28	eTajweed (Basic Knowledge of Reciting Al-Quran)
29	Interactive Application Software for Pre-School Using JAVA
30	e-Appointment System
31	Hotel Registration
32	TATIUC Shortest Route Guidance Using Dijkstra Algorithm
33	Online Transport Booking at TATIUC

BCS2233 OOP: Array

Write program statements that will do the following to array X shown below: -

int[]  X= new int[20];
for(i=0;i<=19;i++)
X[i]=i;

i) Print all elements (use loop).

ii)  Replace third element with 5.

iii)  Copy the elements in the fifth location into the first one.

iv)  Increase the sixth element by 10.

v)  Print all elements in reverse (use loop).

vi) Sum All elements.

vii) Find the largest element.

BCS1333 OS: Exercise

Soalan Tambahan untuk persediaan 'Final Exam'

1. A password may become known to other users in a variety of ways. Is there a simple method for detecting that such event has occurred? Explain your answer.



2. What is advantage and disadvantage of a system providing mandatory locks instead of providing advisory locks whose usage is left to the users’ discretion?

you may find the answer here:-

http://faculty.kfupm.edu.sa/ICS/salah/092/ics431/assignments/solution5.html
http://answers-by-me.blogspot.com/2010/11/operating-system-concepts-8e-exercise_3925.html

BCS1333 OS: Chapter 7 (Deadlocks) Exercise