0% found this document useful (0 votes)
34 views10 pages

P 20 J C F: M: Raktikum AVA Ollection Ramework AP

1. The document discusses 10 experiments using Java Collection Framework's Map, specifically HashMap and TreeMap. The experiments cover basic operations like adding, removing and iterating over keys and values. 2. It also discusses obtaining subsets from TreeMap like headMap, tailMap and subMap. 3. The document concludes with exercises to solidify understanding of TreeMap usage.

Uploaded by

isaditya96
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views10 pages

P 20 J C F: M: Raktikum AVA Ollection Ramework AP

1. The document discusses 10 experiments using Java Collection Framework's Map, specifically HashMap and TreeMap. The experiments cover basic operations like adding, removing and iterating over keys and values. 2. It also discusses obtaining subsets from TreeMap like headMap, tailMap and subMap. 3. The document concludes with exercises to solidify understanding of TreeMap usage.

Uploaded by

isaditya96
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

PRAKTIKUM 20

JAVA COLLECTION FRAMEWORK : MAP


PERCOBAAN
Percobaan 1 : Penggunaan HashMap, menambahkan data, menghapus data
tertentu dan menghapus semua data pada objek HashMap.
import java.util.HashMap;

public class RemoveValueFromHashMapExample {

public static void main(String[] args)


{ //create HashMap object
HashMap hMap = new HashMap();

//add key value pairs to HashMap


hMap.put("1","One");
hMap.put("2","Two");
hMap.put("3","Three");
Object obj = hMap.remove("2"); System.out.println(obj
+ " Removed from HashMap"); hMap.clear();

System.out.println("Total key value pairs in HashMap are : " +


hMap.size());
}
}

Capture

Analisis dan Kesimpulan

Percobaan 2 : Melakukan iterasi pada value HashMap

import java.util.Collection;
import java.util.HashMap;
import java.util.Iterator;

public class IterateValuesOfHashMapExample {

public static void main(String[] args)


{ //create HashMap object
HashMap hMap = new HashMap();
//add key value pairs to HashMap
hMap.put("1","One");
hMap.put("2","Two");
hMap.put("3","Three");

Collection c = hMap.values();
//obtain an Iterator for Collection
Iterator itr = c.iterator();

//iterate through HashMap values iterator


while(itr.hasNext())
System.out.println(itr.next());
}

}
Capture

Analisis dan Kesimpulan

Percobaan 3 : Mendapatkan key, melakukan iterasi pada key dan menghapus key
tertentu pada objek HashMap
public class GetSetViewOfKeysFromHashMapExample {

public static void main(String[] args)


{ //create HashMap object
HashMap hMap = new HashMap();

//add key value pairs to HashMap


hMap.put("1","One");
hMap.put("2","Two");
hMap.put("3","Three");
Set st = hMap.keySet();

System.out.println("Set created from HashMap Keys contains :");

//iterate through the Set of keys


Iterator itr = st.iterator();
while(itr.hasNext())
System.out.println(itr.next());

//remove 2 from Set


st.remove("2");
}
}
Capture

Analisis dan Kesimpulan

Percobaan 4 : Mengecek apakah objek HashMap mempunyai value tertentu.


import java.util.HashMap;

public class CheckValueOfHashMapExample {


public static void main(String[] args) {

//create HashMap object


HashMap hMap = new HashMap();

//add key value pairs to HashMap


hMap.put("1","One");
hMap.put("2","Two");
hMap.put("3","Three");

boolean blnExists = hMap.containsValue("Two");

System.out.println("Two exists in HashMap ? : " + blnExists);


}

}
Capture

Analisis dan Kesimpulan

Percobaan 5 : Mengecek apakah objek HashMap berisi key tertentu


import java.util.HashMap;

public class CheckKeyOfHashMapExample {

public static void main(String[] args)


{ //create HashMap object
HashMap hMap = new HashMap();

//add key value pairs to HashMap


hMap.put("1","One");
hMap.put("2","Two");
hMap.put("3","Three");

boolean blnExists = hMap.containsKey("3");


System.out.println("3 exists in HashMap ? : " + blnExists);
}
}
Capture

Analisis dan Kesimpulan

Percobaan 6 : Menambahkan objek Hash Map ke objek Hashtable dan penggunaan


Enumeration.
import java.util.Enumeration;
import java.util.Hashtable;
import java.util.HashMap;

public class CreateHashtableFromHashMap {

public static void main(String[] args)


{ //create HashMap
HashMap hMap = new HashMap();

//populate HashMap
hMap.put("1","One");
hMap.put("2","Two");
hMap.put("3","Three");

//create new Hashtable


Hashtable ht = new Hashtable();

//populate Hashtable
ht.put("1","This value would be REPLACED !!");
ht.put("4","Four");

//print values of Hashtable before copy from HashMap


System.out.println("Hashtable contents before copy");
Enumeration e = ht.elements();
while(e.hasMoreElements())
System.out.println(e.nextElement());

ht.putAll(hMap);

//display contents of Hashtable


System.out.println("Hashtable contents after copy");
e = ht.elements();
while(e.hasMoreElements())
System.out.println(e.nextElement());
}
}
Capture

Analisis dan Kesimpulan

Percobaan 7 : Mendapatkan key terendah dan tertinggi dari objek TreeMAp.


import java.util.TreeMap;

public class GetLowestHighestKeyTreeMapExample {

public static void main(String[] args) {


//create TreeMap object
TreeMap treeMap = new TreeMap();

//add key value pairs to TreeMap


treeMap.put("1","One");
treeMap.put("3","Three");
treeMap.put("2","Two");
treeMap.put("5","Five");
treeMap.put("4","Four");

System.out.println("Lowest key Stored in Java TreeMap is : "


+ treeMap.firstKey());

System.out.println("Highest key Stored in Java TreeMap is : "


+
treeMap.lastKey());

}
}
Capture

Analisis dan Kesimpulan


Percobaan 8 : Mendapatkan TailMap dari objek TreeMap
import java.util.SortedMap;
import java.util.TreeMap;

public class GetTailMapFromTreeMapExample {

public static void main(String[] args) {

//create TreeMap object


TreeMap treeMap = new TreeMap();

//add key value pairs to TreeMap


treeMap.put("1","One");
treeMap.put("3","Three");
treeMap.put("2","Two");
treeMap.put("5","Five");
treeMap.put("4","Four");

SortedMap sortedMap = treeMap.tailMap("2");

System.out.println("Tail Map Contains : " + sortedMap);


}
}
Capture

Analisis dan Kesimpulan

Percobaan 9 : Mendapatkan SubMap dari objek TreeMap


import java.util.TreeMap;
import java.util.SortedMap;

public class GetSubMapFromTreeMapExample {

public static void main(String[] args) {


//create TreeMap object
TreeMap treeMap = new TreeMap();

//add key value pairs to TreeMap


treeMap.put("1","One");
treeMap.put("3","Three");
treeMap.put("2","Two");
treeMap.put("5","Five");
treeMap.put("4","Four");

SortedMap sortedMap = treeMap.subMap("2","5");


System.out.println("SortedMap Contains : " + sortedMap);
}
}
Capture

Analisis dan Kesimpulan

Percobaan 10 : Mendapatkan HeadMap dari objek TreeMap


import java.util.SortedMap;
import java.util.TreeMap;

public class GetHeadMapFromTreeMapExample {

public static void main(String[] args) {

//create TreeMap object


TreeMap treeMap = new TreeMap();

//add key value pairs to TreeMap


treeMap.put("1","One");
treeMap.put("3","Three");
treeMap.put("2","Two");
treeMap.put("5","Five");
treeMap.put("4","Four");

SortedMap sortedMap = treeMap.headMap("3");


System.out.println("Head Map Contains : " + sortedMap);
}
}

Capture

Analisis dan Kesimpulan


E. LATIHAN
Latihan 1 : Mengetahui penggunaan class TreeMap
Inputkan kalimat, buatlah sebagian kata-kata dalam kalimat tersebut ada yang sama, output
berupa kata (sebagai key) dan jumlah kata (value) dalam kalimat tersebut yang tersimpan
dalam TreeMap, selanjutnya tampilkan.
Input : televisi kursi televisi kursi meja televisi monitor.
Output : kursi = 2 meja = 1 monitor = 1 televisi = 3

import java.util.*;
public class Latihan1{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Input : ");
String kalimat = input.nextLine();
System.out.print("Output : ");
TreeMap<String,Integer> cari = new TreeMap();
for(String cetak : kalimat.split(" ")){
if(cari.containsKey(cetak)){
cari.put(cetak, cari.get(cetak).intValue()+1);
}else{
cari.put(cetak,1);
}
}
System.out.println(cari);
}
}

Capture

Analisis dan Kesimpulan

Latihan 2 : Mengetahui penggunaan class TreeMap


Melanjutkan latihan 1, tampilkan :
 Tampilkan nilai terendah dan tertinggi
Output :
Nilai terendah : Meja = 1
Nilai tertinggi : Televisi = 3

 Tampilkan berdasarkan key dengan awalan m.


Output :
meja = 1 monitor = 1

import java.util.*;
public class Latihan2{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Input : ");
String kalimat = input.nextLine();
System.out.println("Output : ");
TreeMap<String,Integer> cari = new TreeMap();
for(String cetak : kalimat.split(" ")){
if(cari.containsKey(cetak)){
cari.put(cetak, cari.get(cetak)+1);
}else{
cari.put(cetak,1);
}
}
System.out.println("Nilai Terendah : "
+Collections.min(cari.entrySet(), new Latihan2compare()));
System.out.println("Nilai Tertinggi : "
+Collections.max(cari.entrySet(), new Latihan2compare()));
System.out.println("Dengan awalan s adalah : "
+cari.tailMap("s"));
}
}
class Latihan2compare implements Comparator<Map.Entry<String,
Integer>>{
public int compare(Map.Entry<String, Integer> banding1,
Map.Entry<String, Integer> banding2){
return
banding1.getValue().compareTo(banding2.getValue());
}
}

Capture

Analisis dan Kesimpulan


F. TUGAS
Tugas 1 : Ibukota propinsi di Indonesia
Terdapat objek TreeMap 1 yang berisi pulau(sebagai key) beserta propinsi-
propinsinya(value). Terdapat objek TreeMap 2 yang berisi propinsi(sebagai key) beserta
ibukotanya(value). Tampilkan :
 Ibukota propinsi yang terdapat di pulau Sumatera
 Ibukota propinsi yang terdapat di pulau Jawa
 Ibukota propinsi yang berawalan S (Sumatera Utara, Sumatera Barat, Sumatera Selatan,
Sulawesi Barat, Sulawesi Tengah, Sulawesi Utara, Sulawesi Tenggara, Sulawesi
Selatan)

import java.util.*;
public class Tugas1{
public static void main(String[] args) {
TreeMap<String, TreeMap<String, String>> pulau = new TreeMap();
pulau.put("Sumatra", new TreeMap<String, String>());
TreeMap<String, String> sumatra = pulau.get("Sumatra");
sumatra.put("Sumatra Barat", "Padang");
sumatra.put("Sumatra Utara", "Medan");
sumatra.put("Sumatra Selatan", "Palembang");
sumatra.put("Aceh","Banda Aceh");

pulau.put("Jawa", new TreeMap<String, String>());


TreeMap<String, String> jawa = pulau.get("Jawa");
jawa.put("Jawa Barat", "Bandung");
jawa.put("Jawa Tengah", "Semarang");
jawa.put("Jawa Timur", "Surabaya");

System.out.println("Ibukota provinsi yang ada di pulau Sumatra :


");
System.out.println(pulau.get("Sumatra"));
System.out.println("");
System.out.println("Ibukota provinsi yang ada di pulau Jawa : ");
System.out.println(pulau.get("Jawa"));
System.out.println("");

System.out.println("Ibukota provinsi dengan awalan S : ");


for(TreeMap<String, String> a : pulau.values()){
SortedMap<String, String> b = a.tailMap("S");
System.out.println(b);
}
}
}

Capture

You might also like