KingKevin23
/ openjdk-12-pi-3-guide.txt
Created
March 29, 2021 14:37
— forked from NotAlexNoyle/openjdk-12-pi-3-guide.txt
A step-by-step tutorial on installing OpenJDK 12 on a Raspberry Pi 3 running Raspbian
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Do you use your Raspberry Pi 3 to develop Java applications using OpenJDK? You may have noticed that the latest version available on the default apt repositories is OpenJDK 9. This is because the armhf architecture is underserved by the Oracle open source community. Luckilly, you can build and run the latest version (OpenJDK 12.x) on your device. It will just take some time, given the minimal power of the Pi 3's CPU. | |
| The first step is to boot into raspbian and launch the shell. | |
| Next, we are going to create 1GB of swap space for the build. | |
| Get the 'pv' package: | |
| > sudo apt-get install pv |
KingKevin23
/ aufgabe6_1.txt
Last active
July 31, 2020 20:55
u steht für die Vereinigung, n für den Schnitt
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Algorithmus SetCoverGreedy(S): | |
| ergebnis <- {} | |
| for i in S do | |
| if i \ ergebnis != {} then | |
| ergebnis <- ergebnis u i | |
| return ergebnis |
KingKevin23
/ aufgabe2_2.py
Created
July 31, 2020 13:05
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def t(n): | |
| if n == 1: | |
| return 1 | |
| else: | |
| return 8 * t(n/2) + n**2 | |
| def f(n, k): | |
| summe = 8**k | |
| for j in range(k): | |
| summe += 8**j * (n / (2**j))**2 |
KingKevin23
/ gps_aufgabe1.py
Created
January 29, 2020 11:34
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import statistics | |
| def avg(): | |
| daten = [] | |
| ergebnis = 0 | |
| while True: | |
| if daten: | |
| ergebnis = statistics.mean(daten) | |
| temp = yield ergebnis | |
| daten.append(temp) |
KingKevin23
/ BinaryTree.py
Created
January 10, 2020 17:12
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class BinaryTree: | |
| def __init__(self, key, value): | |
| self.key = key | |
| self.value = value | |
| self.left = None | |
| self.right = None | |
| def add(self, key, value): | |
| if self.key > key: |
KingKevin23
/ aufgabe3.py
Created
January 9, 2020 22:06
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def interpolate(f): | |
| def _interpolate(x): | |
| try: | |
| ergebnis = f(x) | |
| except TypeError: | |
| ergebnis = f(int(x)) + (x - int(x)) * f(int(x) + 1) | |
| return ergebnis | |
| return _interpolate |
KingKevin23
/ aufgabe3.py
Created
January 2, 2020 20:31
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def next_tuple(): | |
| pass | |
| def is_prime(i): | |
| pass | |
| def summenliste(): | |
| ergebnis = [] | |
| moegliche_primzahl = 0 | |
| while not is_prime(moegliche_primzahl): |