Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 17 additions & 0 deletions DataLatihan/answer1.py
Original file line number Diff line number Diff line change
Expand Up @@ -7,3 +7,20 @@ def readData(data1):
for line in data :
x = line.split()
return x

x = readData(data1)
txt = []
for i in x:
if i == 'I':
txt.append('*')
elif i == 'and':
txt.append('*'*3)
elif i == 'The':
txt.append('*'*3)
elif i == 'you':
txt.append('*'*3)
else:
txt.append(i)

txt = ' '.join(txt)
print (txt)
13 changes: 12 additions & 1 deletion DataLatihan/answer2.py
Original file line number Diff line number Diff line change
Expand Up @@ -6,4 +6,15 @@ def readData(data1):
with open(data1) as data :
for line in data :
x = line.split()
return x
return x

x = readData(data1)
y = readData(data2)

txt = []
for i in x:
if i in y:
if i not in txt:
txt.append(i)

print (txt)
28 changes: 28 additions & 0 deletions DataTugas/answer.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
data1 = "DataSet.txt"

def readData(data1):
x = []
with open(data1) as data :
for line in data :
x = line.split()
return x

teks = readData(data1)
arr = []
idx = []
word = (teks[0])[0].upper() + (teks[0])[1:]
teks[0] = word
for i, x in enumerate(teks):
if(x[len(x)-1] == ".") and (i != len(teks)-1):
word = (teks[i+1])[0].upper() + (teks[i+1])[1:]
teks[i+1] = word
if(x.isdigit()):
arr.append(x)
idx.append(i)

j = len(arr)-1
for x in idx:
teks[x] = arr[j]
j-= 1

print (" ".join(teks))
7 changes: 7 additions & 0 deletions Pertemuan 2/Latihan.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
SOAL

Buatlah tranpose matriks tanpa menggunakan library.

[[12,7],
[4 ,5],
[3 ,8]]
2 changes: 2 additions & 0 deletions Pertemuan 2/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@

# Pertemuan ke-2 SG-Basic-computing
10 changes: 10 additions & 0 deletions Pertemuan 2/Tugas.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
SOAL

1. buatlah perkalian matriks dibawah tanpa menggunakan library!
[1] [1,2,3]
[2] x [4,5,6]
[3] [7,8,9]
2. cari nilai dan vektor eigen dari matriks dibawah ini!
[0,0,-2]
[1,2,1]
[1,0,3]
13 changes: 13 additions & 0 deletions Pertemuan 2/jawaban.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
X = [[12,7],
[4 ,5],
[3 ,8]]

result = [[0,0,0],
[0,0,0]]

for i in range(len(X)):
for j in range(len(X[0])):
result[j][i] = X[i][j]

for r in result:
print(r)
20 changes: 20 additions & 0 deletions Pertemuan 2/matriks.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
import numpy as np

a = np.array([[1,2,3],
[4,5,6],
[7,8,9]])
b = np.array([[1,2,3],
[4,5,6],
[7,8,9]])
c = np.array([[1],
[4],
[7]])

d = np.array([[1,4,7]])

print(a+b,'\n')
print(np.dot(a,b),'\n')
print(np.transpose(c),'\n')
print(np.transpose(d),'\n')


26 changes: 26 additions & 0 deletions Pertemuan 3 ( Stack & Queue )/Contoh Program/queue.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
class Queue:
def __init__(self):
self.items=[]
def isEmpty(self):
return self.items==[]
def enqueue(self,item):
self.items.insert(0,item)
def dequeue(self):
return self.items.pop()
def size(self):
return len(self.items)
def getList(self):
return self.items

q = Queue()
print q.isEmpty()
q.enqueue(4)
q.enqueue('dog')
q.enqueue('true')
print q.size()

print q.isEmpty()
q.enqueue(8.5)
q.dequeue()
q.dequeue()
print q.size()
29 changes: 29 additions & 0 deletions Pertemuan 3 ( Stack & Queue )/Contoh Program/stack.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
class Stack:

def __init__(self):
self.items = []
def isEmpty(self):
return self.items == []
def push(self, item):
self.items.append(item)
def pop(self):
return self.items.pop()
def peek(self):
return self.items[len(self.items)-1]
def size(self):
return len(self.items)

s = Stack()
print s.isEmpty()
s.push(4)
s.push('dog')
print s.peek()

s.push('true')
print s.size()
print s.isEmpty()

s.push(8.5)
s.pop()
s.pop()
print s.size()
Binary file not shown.
1 change: 1 addition & 0 deletions Pertemuan 3 ( Stack & Queue )/Tugas/Kurung.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
((nama saya adalah gias))
37 changes: 37 additions & 0 deletions Pertemuan 3 ( Stack & Queue )/Tugas/Stack.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
data1 = "Kurung.txt"

def readData(data1):
x = []
with open(data1) as data :
for line in data :
x = line
return x

x = readData(data1)

stack = []
z = " "
for i in x:
#print (i)
if i == '(':
stack.append(i)
elif i == ')':
if len(stack) != 0:
for j in stack:
#print (j)
if j == '(':
z = "Valid"
stack.remove('(')
break
elif j != '(':
z = "Not Valid"
break
elif len(stack) == 0:
z = "Not Valid"
break
#print(stack)
print (stack)
if len(stack) != 0:
z = "Not Valid"

print (z)
3 changes: 3 additions & 0 deletions Pertemuan 3 ( Stack & Queue )/Tugas/Tugas.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
Buatlah program stack untuk mengecek apakah sebuah tanda kurung seimbang atau tidak

NB : Tidak boleh menggunakan library, dan juga harus menggunakan array