Kisi-Kisi UAS(update) Buat Anak-Anak BINUS Semester 3 Jurusan TI

UAS telah tiba waktunya kita serius.Maksih bwt Tony yang udah kasih gw refernsi bhan UAS.thnks bro...neh kisi2nya ud di update sedikit thnks Novi :

kisi2 PBO dari Pa Soebandijo

PBO
1. PG 10 soal (20 %)
2. Essay 4 soal (40 %)
- Constructor / Destructor
- Reference VS Pointer
- Pass Parameter
- Inline / Const Function
3. Kasus 1 soal (berupa coding) (40 %)
- ADT
- Class Design
- Definisi Fungsi Anggota -> dalam class
- Main Function


Kisi2 PAA :
- Dynamic Programing
- Basic Tranverse search (BSF,DFS)
- Backtracking (N-Queens)
- Branch Bound (LIFO,FIFO)
- Algebraic Problem

Anapersis
Essay
1. Sistem Proposal 10%
2. Sistem desain 10%
3. Database desain 10%
4. Input/output user interface desain 10%
kasus
1. DFD 30%
2. ERD 30%
3. Diagram decomposition 10%

PBO
I. PG 10 soal, 20 %

jawabannya A -> 3 (maksudnya yg jawabannya A ada 3 soal, dst)
B -> 2
C -> 2
D -> 3

II. Essay
1. Inheritance 1 -> why 10 %
2. Inheritance 2 -> code 10 %
3. Polymorphism -> definisi 10 %
4. Copy constructor -> code 10 %

III. Kasus : Template sort (tipe data bisa integer, float, ato char/string)
a. Design class string 10 %
b. Definisi fungsi anggota 10 %
c. Template sort 10 %
d. Template pring 5 %
e. main 5 %

KALKULUS2 dr Sangadji
1. tranformasi laplace untuk solusi PD
2. volume tetrahedron
3. integral lipat 3
4. teorema green
5. curl

Kisi2 Kalkulus versi sms:
- Penyelesaian dengan laplace
- Hitung vol tetrahedron
- Integral lipat
- Teorema green
- Gradien
- Divergensi
- Curl

b.ing
passive 282-286
add adv 301
reading esp unit 6 46-51
problem with adj 308-313\
preposision 321-324
reading toefl 379-407

Saya tadi ngobrol dengan koordinator matakuliah PBO. Kisi-kisi dari beliau:
- Bentuk Soal: PG 10 soal (bobot 20%), Essay 4 soal (bobot 40%) dan Kasus 1 soal (bobot 40%)
- PG: bahan semuanya
- Essay: constructor/destructor, Inline Function, Passing by Value, passing by reference
- Kasus: buatlah kelas yang menggunakan friend function, constructor overloading, operator overloading
Demikian dari saya mudah2an bermanfaat. Thanks
Nofriyadi Nurdam

KALKULUS II

1. tranformasi laplace untuk solusi PD
2. volume tetrahedron
3. integral lipat 3
4. teorema green
5. curl

- Penyelesaian dengan laplace
- Hitung vol tetrahedron
- Integral lipat
- Teorema green
- Gradien
- Divergensi
- Curl

PBO
I. PG 10 soal, 20 %
jawabannya
A -> 3 (maksudnya yg jawabannya A ada 3 soal, dst)
B -> 2
C -> 2
D -> 3

II. Essay
1. Inheritance 1 -> why 10 %
2. Inheritance 2 -> code 10 % //overriding
3. Polymorphism -> definisi 10 %
4. Copy constructor -> code 10 %

III. Kasus : Template sort (tipe data bisa integer, float, ato char/string)
a. Design class string 10 %
b. Definisi fungsi anggota 10 %
c. Template sort 10 %
d. Template pring 5 %
e. main 5 %

//nih gw buat soal kasusnya buat data int, double dan char
//agak mirip ma taon lalu
//tapi bedanya skrg kita disuruh pake class
//klo dlu kgk.. hehehe

#include
#define n 5

template class sort
{

public :
void sortBubble(T arr[]);
void print(T arr[]);
};

template void sort :: sortBubble(T arr[])
{
int i,j;
T temp;
cout<<"Before : "<print(arr);
for(i=1 ; ifor(j=n-1 ; j>=i ; j--)
if(arr[j-1] > arr[j])
{
temp = arr[j-1];
arr[j-1] = arr[j];
arr[j] = temp;
}
cout<<"\nafter : "<print(arr);
}

template void sort :: print(T arr[])
{
for(int i=0 ; icout<}

void main()
{
int dataint[] = {20,30,10,50,40};
double datadouble[] = {5.12, 1.23, 2.56, 4.69, 3.13};
char datachr[]= {"BCDAE"};
sort obj1;
sort obj2;
sort obj3;
obj1.sortBubble(dataint);
cout<obj2.sortBubble(datadouble);
cout<obj3.sortBubble(datachr);
getch();
}

ANAPERSIS
Essay
1. Sistem Proposal 10%
2. Sistem desain 10%
3. Database desain 10%
4. Input/output user interface desain 10%

kasus
1. DFD 30%
2. ERD 30%
3. Diagram decomposition 10%


PAA
1. Multistage
2. 5-Queens // JAWABAN PASTI
3. Knapsack 0/1
4. LCBB
5. Single Sort

- Dynamic Programing
- Basic Tranverse search (BSF,DFS)
- Backtracking (N-Queens)
- Branch Bound (LIFO,FIFO)
- Algebraic Problem


MPP 03PDT

PG 20 soal

KASUS 40%
=========
- Use case dgn skenarionya
- Sequence diagram

ESSAY
=====
Pertanyaan definisi :
- Iheritance, dll.(lupa)

PAA
1. Optimasi code + colouring
2. Dynamic Programming
- Multistage Graph
- TSP
- I/O Knapsack
- Reability
- Flow Shop
3. Backtracking (N queen, sum of subset)
4. Branch and Bound
- Job Sequential
LIFO
FIFO
- Least Code Travel Sales Person

KISI2 pbo dr subandijo:
I. PG
II. essai:
1. inheritance
2. dominating vs overriding
3. overloading vs overiding
4. constructor & scope2nya a,b,c,d
III. Bikin program template :sort, print, main

Bahan buat uaskalkulus kta dosen gw dodi...
tp lupa dodi sapa...
hehehe...



-Laplace smp yang tingkat 2 (wikarya 136-139)
-vektor(panjang vektor,sudut antara 2 vektor,perkalian dot sm cross,luas segitiga sama jajarangenjang)
-integral lipat 2 dan 3 (wikarya 153 & 216)
-teorema green (wikarya 186)
-divergensi silinder (wikarya 235)



-=-=-=-=-=-=-=-=-=-
Kalkulus :

1. Transformasi Laplace & aplikasinya
2. Vektor
3. Integral Lipat 2 dan 3
4. Integral Garis (metode langsung, dan metode green)
5. Integral permukaan (metode gauss)

-=-=-=-=-=-=-=-=-=-=-=-=-
PBO :

PG 20 soal ; point 40
Essay 4 soal ; point 40
1. constructor dan destructor
2. inheritance, dominating, overriding, class member
3. polymorphism>4. consturctor & scopenya (a,b,c,d) /*
Program ; point 20 (template utk sort data, bisa utk sort int, char, string)

Dari kelas PDT:
1. Inheritance
2. Virtual Function
3. pure virtual function & abstrack class
4. template

program -> template (stack/queue/sort(*));

-=-=-=-=-=-=-=-=-=-=-=-=-
PAA :

Dari kelas PKT :
1. dynamic programming (multistage graph)
- knapsack, dll
2. backtracking
- chromatic number, dll
3. branch and bound
4. greedy technique

Dari Kelas PBT :
1. optimasi code + coloring (1 soal)
2. dynamic programming (2 soal)
- multistage graph
- TSP
- Knapsack
- Reliability
- Flow shop
3. Backtracking
- N queen problem
- sum of subset
4. Branch and bound
- job sequential (FIFO, LIFO)
- LC STP

-=-=-=-=-=-=-=-=-=-=-=-=
MPP :

Dari kelas pdt
1. Class diagram
2. use case
3. colaboration diagram
4. sequence diagram
5. PG : pert 23 - pert 24

--=-=-=-=-=-=-=-=-=-=-=-
Anapersis
Pert 14-26
Essay (40%)
1. Design input, output (data design)
2. Database design
3. Arsitektur aplikasi / Architecture application
4. studi kelayakan / feasibility study
5. implementasi & support -> pert 25,26

kasus (60%)
1. logical DFD
2. Physical ERD / logical

kasus (60%)
1. DFD dan ERD
2. Context diagram (level 0 ke level 1)

-=-=-=-=-=-=-=-=-=-=-=-
Inggris :
Unit 8-13
1. Reading :
- Referents(Longman) -> they refer to … hal 261
- Restatement (NTC) hal 240
2. Structure
- Inverted (Longman) -> T / F hal 130
- Modifier -> multiple choice (NTC) hal 128
3. Vocabulary (NTC) hal 156
4. Writing -> rewrite the sentences (5 questions)
{adjectivenya yg salah (dipindah-pindah)}
Letak enough -> we don’t have enough money (modifier)
-> big enough
Cause & effect using such, as
Such…that(follow by noun)
So…that(meaning) -> bias adj, bias verb

PAA
jumlah soal : 5
soal essay :
1. Dynamic programming(2 soal)
-multi stage
-TSP
-0/1 knapsack
-reliability
-flow shop
2. Backtracking(1 soal)
-nQueenproblem
-son of subset
3. Optimasi kode dan colouring(1 soal)
4. BAB(1soal)
-job sequential
-TSP

Untuk Kalkulus :
1. Transformasi Laplace (aplikasi) dan invers
2. Integral Lipat 2 dan 3
3. Integral Garis, Green
4. Vektor

Untuk Anapersis:
Essay 40 %
1. Visibility Study
2. Arsitektur Application
3. Data Desain
4. Interface desain
5. Implementation and support
Kasus 60 %
1. DFD dan ERD
2. Context Diagram (dari level 0 ke level 1)
Maksud Level 0 adalah suatu context diagram yang tidak ada data store


semoga bermanfaat...???