uml

Alone because I have not friend haha (jk)

.gitignore

@@ -1,2 +1,16 @@
 __pycache__/
 *.tar
+*.class
+*.toc
+*.synctex.gz
+*.snm
+*.out
+*.aux
+*.fbd_latexmk
+*.fls
+*.log
+*.nav
+*.fdb_latexmk
+a.out
+*.o
+ex[0-9]

.gitmodules

@@ -0,0 +1,3 @@
+[submodule "bac2/latex/beamer-umons"]
+	path = bac2/latex/beamer-umons
+	url = git@github.com:Chris00/beamer-umons

01dec/compress.py

@@ -1,39 +0,0 @@
-#!/bin/python
-""" Compression
-Usage:
-    compression.py (-c|-d) -t <type> --in <input> [--out <output>]
-    compression.py -h | --help
-    compression.py --version
-
-Options:
-    -h --help   Show this screen
-    --version   Show Version
-    -c          Compress
-    -d          Decompress
-    -t          Choose Compression Type
-    --in        Input file
-    --out       Output file
-"""
-
-def read_file(filename:str):
-    try:
-        with open(filename) as file:
-            return file.readall()
-    except e:
-        print(e)
-
-
-def lz_compression(text:str):
-    """compress all duplicate word
-    put each word into a list and make make a string of all the occurence
-
-    :text: string to compress
-    :returns: tuple with (list of word, decoding string)
-
-    """
-    splitted_text = text.split()
-
-
-if __name__ == "__main__":
-    from docopt import docopt
-    argument = docopt(__doc__, version="V1")

bac1/q1/01dec/compress.py

@@ -0,0 +1,90 @@
+#!/bin/python
+""" Compression
+Usage:
+    compression.py (-c|-d) -t <type> --in <input> [--out <output>]
+    compression.py -h | --help
+    compression.py --version
+
+Options:
+    -h --help   Show this screen
+    --version   Show Version
+    -c          Compress
+    -d          Decompress
+    -t          Choose Compression Type (currently supported: lz, rle)
+    --in        Input file
+    --out       Output file
+"""
+
+def read_file(filename:str) -> str:
+    try:
+        with open(filename) as file:
+            return file.read()
+    except e:
+        print(e)
+
+
+def lz_compression(text:str):
+    """compress all duplicate word
+    put each word into a list and make make a string of all the occurence
+
+    :text: string to compress
+    :returns: tuple with (list of word, decoding string)
+
+    """
+    splitted_text = text.split()
+    word_list = list()
+    key = dict()
+    key_value = 0
+    for v in splitted_text:
+        if v not in key.keys():
+            key[v] = key_value 
+            key_value += 1
+        word_list.append(key[v])
+    return word_list, key
+
+def save_lz(filename, word_list, key_list):
+    with open(filename, 'w') as file:
+        word_list = map(str, word_list)
+        file.writelines(' '.join(word_list))
+        file.writelines(' '.join(list(key_list.items())))
+
+
+def lz_decompression(text:str):
+    pass
+
+
+def rle_compression(text:str):
+    """compress all duplicate word
+    put each word into a list and make make a string of all the occurence
+
+    :text: string to compress
+    :returns: tuple with (list of word, decoding string)
+
+    """
+    splitted_text = text.split()
+
+
+def rle_decompression(text:str):
+    pass
+
+
+if __name__ == "__main__":
+    from docopt import docopt
+    argument = docopt(__doc__, version="V1")
+    print(argument)
+    if argument['<type>'].lower() == 'lz':
+        if argument['-d']:
+            result = lz_decompression(read_file(argument['<input>']))
+            print(result)
+        if argument['-c']:
+            w_list, k_list = lz_compression(read_file(argument['<input>']))
+            save_lz('test.Ltxt', w_list, k_list)
+    elif argument['<type>'].lower() == 'rle':
+        if argument['-d']:
+            result = rle_decompression(read_file(argument['<input>']))
+            print(result)
+        if argument['-c']:
+            result = rle_compression(read_file(argument['<input>']))
+            print(result)
+    else:
+        raise TypeError("choose a type between lz and rle")

bac1/q1/15dec/fonctions.py

@@ -0,0 +1,27 @@
+def plus_grand_bord(w):
+    for k, v in enumerate(w[1:]):
+        if v == w[0]:
+            if w[k+1:] == w[:len(w[k+1:])]:
+                return w[k+1:]
+    return None
+
+def intersection(v, w):
+    max_inter = ''
+    for (k, v) in enumerate(v):
+        if v in w:
+            i = 1
+            while v[k:k+i] in w:
+                i += 1
+                if i >= len(w):
+                    break
+            if len(v[k:k+i]) > len(max_inter):
+                max_inter = v[k:k+i]
+    return max_inter
+
+
+def palyndrome(mot):
+    inv = [mot[len(mot)-1-i] for i in range(len(mot))]
+    return inv
+
+if __name__ == "__main__":
+    print(palyndrome('anticonstitutionnelement'))

bac1/q1/renforcement/entrainement_0712/cup.py

@@ -0,0 +1,16 @@
+tab = map(int, input().split)
+
+def nombre_tasse(tab):
+    """count the ammount of tasse following weird set of rules """
+    start_cup = 0 
+    in_cup = False
+    for k, v in enumerate(tab):
+        if v < tab[k+1]:
+            in_cup = True
+            start_cup = k
+        elif v < tab[k-1]:
+            if 
+
+    return count
+
+print(nombre_tasse(tab))

bac1/q1/renforcement/entrainement_0712/member_list.py

@@ -0,0 +1,68 @@
+from datetime import datetime
+
+class Member:
+
+    """Represente un membre dans la base de donnee de l'umons """
+
+    def __init__(self, name, surname, faculty, section, register_date = datetime.now().strftime("%Y%m%d"), seen = 0, seen_dates = list()):
+        """TODO: to be defined.
+
+        :seen: number of time he came to CPUMONS 
+        :seen_dates: date when he came 
+
+        """
+
+        self._name = name
+        self._surname = surname
+        self._mail = f"{name}.{surname}@studen.umons.ac.be"
+        self._faculty = faculty
+        self._section = section
+        self._register_date = register_date
+        self._seen = seen
+        self._seen_dates = seen_dates
+
+    def __str__(self):
+        return f"{self._name} {self._surname}, {self._faculty} -> {self._section}; seen {self._seen} time(s)"
+
+    def addSeen(self, date = datetime.now().strftime("%Y%m%d")):
+        self._seen += 1
+        self._seen_dates.append(date)
+
+def interaction_menu(mbr_list):
+    print("""
+1) Insert new member
+2) List members
+3) Delete a member
+4) Update member
+5) Quit
+          """)
+    try:
+        menu_selection = int(input("select your action: "))
+    except:
+        return True
+
+    if menu_selection == 1:  # Insert new member
+        name, surname, faculty, section = input("enter: <name surname faculty section> (with space between each input): ").split(' ')
+        mbr_list.append(Member(name, surname, faculty, section))
+    elif menu_selection == 2:  # List members
+        for k, v in enumerate(mbr_list):
+            print(k, v)
+    elif menu_selection == 3:  # Delete a member
+        toDelUser = input("enter the index of the user you want to delete: ")
+        mbr_list.pop(toDelUser)
+    elif menu_selection == 4:  # Update member
+        toUpdateUser = int(input("enter the index of the user you want to update: "))
+        datetime = input("enter the date where he has been seen ( let blank for the current date ): ")
+        if not datetime:
+            mbr_list[toUpdateUser].addSeen()
+        else:
+            mbr_list[toUpdateUser].addSeen(datetime)
+    else:  # Menu error/quit
+        return False
+    return True
+
+if __name__ == "__main__":
+    user_list = list()
+    exit = False
+    while not exit:
+        exit = not interaction_menu(user_list)

bac1/q1/renforcement/entrainement_0712/stringdiff.py

@@ -0,0 +1,14 @@
+def diff(in1: str, in2: str) -> list:
+    ret = list()
+    for k, v in enumerate(in1):
+        if in2[k] != v :
+            ret.append((k, v, in2[k]))
+    return ret
+
+if __name__ == "__main__":
+    in1, in2 = input("entrez la phrase 1:") , input("entrez la phrase 2")
+    diff_ins = diff(in1, in2)
+    if len(diff_ins) == 0:
+        print("Phrases identiques")
+    else:
+        print(diff_ins)

bac1/q2/algo/.idea/.gitignore

@@ -0,0 +1,8 @@
+# Default ignored files
+/shelf/
+/workspace.xml
+# Editor-based HTTP Client requests
+/httpRequests/
+# Datasource local storage ignored files
+/dataSources/
+/dataSources.local.xml

bac1/q2/algo/.idea/algo.iml

@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

bac1/q2/algo/.idea/misc.xml

@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="MarkdownSettingsMigration">
+    <option name="stateVersion" value="1" />
+  </component>
+  <component name="ProjectRootManager" version="2" project-jdk-name="20" project-jdk-type="JavaSDK" />
+</project>

bac1/q2/algo/.idea/modules.xml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/algo.iml" filepath="$PROJECT_DIR$/.idea/algo.iml" />
+    </modules>
+  </component>
+</project>

bac1/q2/algo/.idea/vcs.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$/../.." vcs="Git" />
+  </component>
+</project>

bac1/q2/algo/cours2/Couple.java

@@ -0,0 +1,27 @@
+public class Couple {
+
+	private int q;
+	private int r;
+
+	public Couple(int q, int r) {
+		this.q = q;
+		this.r = r;
+	}
+
+	public void setQ(int q) {
+		this.q = q;
+	}
+
+	public int getQ() {
+		return q;
+	}
+
+	public void setR(int r) {
+		this.r = r;
+	}
+
+	public int getR() {
+		return r;
+	}
+
+}

bac1/q2/algo/cours2/Division.java

@@ -0,0 +1,11 @@
+public class Division {
+	public static void main(String[] args) {
+		Couple test = Division(5, 3);
+		System.out.println(test.getQ() + ": " + test.getR());
+
+	}
+	public static Couple Division(int a, int b){
+		return new Couple(a/b, a%b);
+		
+	}
+}

bac1/q2/algo/cours3/test.java

@@ -0,0 +1,8 @@
+public class test {
+	public String testM(){
+		return "yay";
+	}
+	public static void main(String[] args) {
+		System.out.println(testM());
+	}
+}

bac1/q2/algo/cours6/Question.java

@@ -0,0 +1,21 @@
+public class Question {
+	private String text;
+	private String response;
+
+	private String user_input;
+
+	public Question(text, response){
+		this.text = text;
+		this.response = response;
+	}
+
+	public void Poser(){
+		Scanner resp = new Scanner(System.in);
+		System.out.println(text + ": ")
+		user_input = resp.nextLine();
+	}
+
+	public boolean Verifier(){
+		return user_input == response;
+	}
+}

bac1/q2/algo/cours6/Questionnaire.java

@@ -0,0 +1,18 @@
+public class Questionnaire {
+	private Question[] questions;
+
+	public void add_question;
+
+	public void poser_tout(){
+		for(Question q: questions){
+			q.Poser();
+			if(q.Verifier())
+				System.out.println("Bravo");
+			else
+				System.out.println("Pas ouf");
+
+		}
+	}
+
+
+}

bac1/q2/algo/cours6/TestsQuestionnaire.java

@@ -0,0 +1,4 @@
+public class TestsQuestionnaire {
+	public static void main(String[] args) {
+	}
+}

bac1/q2/algo/hashmap.java

@@ -0,0 +1,49 @@
+public class hashmap implements Map{
+
+	public static final TAB_SIZE = 1024;
+	LinkedList[] values = new Object[TAB_SIZE];
+	class HashEntry{ public Object key, values; 
+		public HashEntry(Object key, Object value){
+			this.key = key;
+			this.value = value;
+		}
+	
+	}
+
+	public void put(Object key, Object value){
+		int pos = key.hashCode() % values.lenght();
+		if (values[pos] == null){
+			values[pos] = value;
+			return;
+		}
+		if(value[pos] instanceof ArrayList<HashEntry> t){
+			t.add(new HashEntry(key, value));
+			return;
+		}
+		Object temp = values[pos];
+		values[pos] = new ArrayList<HashEntry>;
+		value[pos].add(temp);
+		value[pos].add(new HashEntry(key, value));
+	}
+
+	public Object get(Object key){
+		int pos = key.hashCode() % values.lenght();
+		if(values[pos].equals(key)){
+			return values[pos].value;
+		}
+		if(values[pos] instanceof ArrayList<HashEntry> t){
+			for (v : t) {
+				if (v.key.equals(key)){
+					return v.value
+				}
+			}
+		}
+		return null;
+
+	}
+
+	public static void main(String[] args) {
+		System.out.println("test");
+
+	}
+}

bac1/q2/algo/hashmap/.idea/.gitignore

@@ -0,0 +1,8 @@
+# Default ignored files
+/shelf/
+/workspace.xml
+# Editor-based HTTP Client requests
+/httpRequests/
+# Datasource local storage ignored files
+/dataSources/
+/dataSources.local.xml

bac1/q2/algo/hashmap/.idea/misc.xml

@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="MarkdownSettingsMigration">
+    <option name="stateVersion" value="1" />
+  </component>
+  <component name="ProjectRootManager" version="2" languageLevel="JDK_X" default="true" project-jdk-name="20" project-jdk-type="JavaSDK">
+    <output url="file://$PROJECT_DIR$/out" />
+  </component>
+</project>

bac1/q2/algo/hashmap/.idea/modules.xml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/hashmap.iml" filepath="$PROJECT_DIR$/hashmap.iml" />
+    </modules>
+  </component>
+</project>

bac1/q2/algo/hashmap/.idea/vcs.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$/../../.." vcs="Git" />
+  </component>
+</project>