Erman Wellem's Weblog

IT602 – Pemrograman Internet Mobile

ermanwellem — Tue, 14 Oct 2008 02:00:31 +0000

Materi PIM dapat di download di sini

Materi 1 – XHTML

New!!!: Kuliah hari Rabu, 15 Oktober 2008 dikosongkan

IT130 – Pengantar Teknologi Mobile

ermanwellem — Thu, 25 Sep 2008 01:59:58 +0000

Untuk mahasiswa PTM Kelas D (Kamis 7-9), anda dapat mendownload materi kuliah di sini. Jika ada pertanyaan silakan berikan pertanyaan melalui comment

Rencana Kuliah (harap dibaca) – Rencana_Kuliah_1_0809

Materi 1 – Introduction - Materi Intro 2

Materi 2 – Bisnis Mobile

Materi 3 – Intro to HTML

PERHATIAN!!!

Test akan diadakan pada tanggal 9 Oktober 2008. Materi diambil dari 4 file di atas

Materi untuk Test Akhir: 5 file

XHTML
XHTML MP +Mobile Web
Mobile Application Architecture
Intro to Java ME

Materi 4 – XHTML

Materi 5 – XHTML MP + Mobile Web

Materi 6 – Mobile Apps. Architecture

Materi 7 – Intro Java ME

Test Akhir akan diadakan pada hari Kamis, 4 Desember 2008, jam kuliah, ruang akan diumumkan kemudian. Bentuk soal multiple choice (Bobot 70%)

Nilai Akhir dihitung dari: Tugas Web (5%), Test 1 (25% – bobot ditambah 10% ), Test 2 (70%)

IT635 – Network Programming (Pemrograman Jaringan)

ermanwellem — Tue, 23 Sep 2008 06:48:06 +0000

Materi Kuliah Pemrograman Jaringan

Silabus – Silabus

Materi 1 – Intro to Networking

Materi 2 – TCP/IP Overview

Materi 3 – Socket (new)

Materi 4 – Socket Type and Protocols

Test Tengah Semester akan diadakan pada hari Selasa, 28 Oktober 2008, Pukul 07.00 (Jam kuliah) di Lab RX-302

Materi 5 – Socket Binding

Materi 6 – UDP

Materi 7 – TCP

Materi 8 – download from maven.smith.edu/~jfrankli/350s01/lect6.ppt (Socket Programming with example using Java – by Judy Franklin)

Presentasi Tugas: Selasa, 25 November (8 Kelompok @15 menit, Total 120 menit, dimulai dari Topik 1 – 8

Topik:

1. Web Chatting (Java-based)

2. Web Chatting (PHP-based)

3. Voice (SIP programming)

4. Exploits Programming 1 (DDoS)

5. Exploits Programming 2 (SQL Injection)

6. Bluetooth Socket Programming (Linux-based)

7. IrDA socket (Linux-based)

8. Simple LAN Game

Test Akhir Semester akan diadakan pada Selasa, 25 November 2008, sesuai jam kuliah 07.00. Bobot 40%, Bahan dari materi 6, 7, dan 8

Mobile Programming – Fall Semester 2008

ermanwellem — Thu, 04 Sep 2008 04:31:27 +0000

ATTENTION : Class will start on Wednesday, September 10th, 2008 in E201A

Contents

Mobile Application Development (application architecture, mobile device and operating system, developer’s choices)
Server-side application development (XML, XHTML, WAP, JSP, Servlet, Web Service)
Client-side application development (Java ME CLDC/MIDP, C/C++)

References

Jonathan Knudsen, Sing Li, Beginning J2ME From Novice to Professional, Third Edition, Apress 2005

Peter den Haan, Beginning JSP 2 From Novice to Professional, Apress 2004

Jim Crume, Beginning Java EE 5 From Novice to Professional, Apress 2005

Software:

Netbeans IDE 6.1 + GlassFish (www.netbeans.org)
MySQL
WAP Browser (Nokia Emulator, OpenWave SDK, etc)

Automata: Final Exam

ermanwellem — Sat, 24 Nov 2007 09:55:21 +0000

Final Exam will be held on Wednesday, 28th November 2007 in class

-Context-Free Grammar, BNF, EBNF, and Pushdown Automata

Programming Assignment : Pattern Matching

ermanwellem — Sat, 20 Oct 2007 07:20:02 +0000

Programming Assignment #1 due date is October 24th, 2007. Submit your file (.c or .cpp) and report ( .pdf) to ermanwellem@gmail.com

Assignment #1 (due date Sept 12th, 2007)

ermanwellem — Wed, 05 Sep 2007 03:31:44 +0000

* Read Edward Moore’s paper “Gedanken-Experiments on Sequential Machines” and write a resume from that paper

* Design a Moore machine which the output is 1 when the input sequence is 00111. Draw the state diagram and transition table

* Prove with Inductive: if B is a binary tree with n leaves, then B has 2n-1 nodes

* Prove by Inductive: 1 + 2 + … + n = (n(n+1))/2 for all integer n>= 1

Submit your answer to erman_wellem@yahoo.com

Books on Automata Theory

ermanwellem — Tue, 04 Sep 2007 00:27:00 +0000

Class will start on Sept 5th. I suggest all of you must have the Hopcroft’s Book (buy it yourself or borrow it from the library).

Read chapter 1 of the book

Assignment will be posted soon, so check this blog regularly. Thank you

Automata Theory

ermanwellem — Wed, 08 Aug 2007 00:51:38 +0000

Prereq: Discrete Mathematics, Algorithm and Data Structures

Course content

1. Introduction (Formal Proof, etc)

2. Finite State Automata (DFA and NFA)

3. Regular Expressions

4. Context-Free Grammar

5. Pushdown Automata

6. Turing Machine

7. Other topics (Undecidability, NP)

Courses – Fall Semester 2007

ermanwellem — Sat, 04 Aug 2007 11:35:27 +0000

I will teach these courses below in Fall 2007/2008

Mobile Programming
Language and Automata Theory

I will use Hopcroft’s book “Automata Theory, Language, and Computation – 2nd Edition” and Sipser’s book “Introduction to Theory of Computation” for the Language and Automata Theory course