prep fin

Author: katarzynakaz

implement-shell-tools/cat/notes.js

@@ -0,0 +1,38 @@
+import process from "node:process";
+import { promises as fs } from "node:fs";
+// const fs = promises
+
+// * `cat sample-files/1.txt`
+// * `cat -n sample-files/1.txt`
+// * `cat sample-files/*.txt`
+// * `cat -n sample-files/*.txt`
+// * `cat -b sample-files/3.txt`
+
+//from coursework
+// const content = await fs.readFile(path, "utf-8");
+// const countOfWordsContainingEs = content
+//   .split(" ")
+//   .filter((word) => word.includes("e"))
+//   .length;
+// console.log(countOfWordsContainingEs);
+
+// process.argv documentation that process.argv[0] will be the path to node
+// process.argv[1] will be the path to this file
+// the arguments start at index 2
+
+
+
+// 1 `cat sample-files/1.txt`
+// async function caseOne(oneFile) {
+//     const content = await fs.readFile(file, "utf-8");
+//     console.log(content);
+// }
+// 3 `cat sample-files/*.txt`
+// async function caseThree(listOfFiles) {
+//     for (const file of listOfFiles) {
+//         const content = await fs.readFile(file, "utf-8");
+
+//         console.log(content);
+//   }
+// }
+

implement-shell-tools/ls/index.js

@@ -0,0 +1,50 @@
+// fs.readdir
+import process from "node:process";
+import { promises as fs } from "node:fs";
+
+
+//  `ls -1`
+async function showAllFilesInDir(directory) {
+    const listOfFiles = await fs.readdir(directory); 
+    
+    for (const eachFile of listOfFiles) { 
+        console.log(eachFile);
+    }
+}
+
+// `ls -1 sample-files`
+async function showVisibleInSampleFiles() {
+        const listOfFiles = await fs.readdir('sample-files'); 
+    
+    for (const eachFile of listOfFiles) { 
+        if (eachFile[0] !== '.') {
+             console.log(eachFile);
+        }
+       
+    }
+}
+
+
+// `ls -1 -a sample-files`
+async function showAllInSampleFiles() {
+        const listOfFiles = await fs.readdir('sample-files'); 
+    
+    for (const eachFile of listOfFiles) { 
+        
+        console.log(eachFile);
+    
+    }
+}
+
+
+
+const argv = process.argv.slice(2);
+
+if (argv.includes('-a')) {
+    await showAllInSampleFiles();
+} else if (argv.includes('sample-files')) {
+    await showVisibleInSampleFiles();
+} else {
+    await showCurrentDir();
+}
+

individual-shell-tools/ls/script-02.sh

@@ -4,3 +4,4 @@ set -euo pipefail
 
 # TODO: Write a command which lists all of the files in the directory named child-directory.
 # The output should be a list of names: helper-1.txt, helper-2.txt, helper-3.txt.
+ls child-directory

prep/12.py

@@ -10,7 +10,6 @@ def __init__(self, first_name: str, last_name: str):
     def get_name(self) -> str:
         return f"{self.first_name} {self.last_name}"
 
-
 class Child(Parent):
     def __init__(self, first_name: str, last_name: str):
         super().__init__(first_name, last_name)
@@ -27,15 +26,15 @@ def get_full_name(self) -> str:
         return f"{self.first_name} {self.last_name}{suffix}"
 
 person1 = Child("Elizaveta", "Alekseeva")
-print(person1.get_name())
-print(person1.get_full_name())
-person1.change_last_name("Tyurina")
-print(person1.get_name())
-print(person1.get_full_name())
+print(person1.get_name()) # prints Elizaveta Alekseeva
+print(person1.get_full_name()) # prints Elizaveta Alekseeva
+person1.change_last_name("Tyurina") # no print
+print(person1.get_name()) # prints Elizaveta Tyurina
+print(person1.get_full_name()) # prints Elizaveta Tyurina (née Alekseeva)
 
 person2 = Parent("Elizaveta", "Alekseeva")
-print(person2.get_name())
-print(person2.get_full_name())
-person2.change_last_name("Tyurina")
-print(person2.get_name())
-print(person2.get_full_name())
+print(person2.get_name()) #print Elizaveta Alekseeva
+print(person2.get_full_name()) #no full name method
+person2.change_last_name("Tyurina") #no change last name method
+print(person2.get_name()) # print Elizaveta Alekseeva
+print(person2.get_full_name()) #no full name method so err

sprint 5/laptop.py

@@ -0,0 +1,50 @@
+In the prep, there was an exercise around finding possible laptops for a group of people.
+
+Your exercise is to extend this to actually allocate laptops to the people.
+
+Given these class definitions:
+
+from dataclasses import dataclass
+from enum import Enum
+from typing import List
+
+class OperatingSystem(Enum):
+    MACOS = "macOS"
+    ARCH = "Arch Linux"
+    UBUNTU = "Ubuntu"
+
+@dataclass(frozen=True)
+class Person:
+    name: str
+    age: int
+    # Sorted in order of preference, most preferred is first.
+    preferred_operating_system: List[OperatingSystem]
+
+
+@dataclass(frozen=True)
+class Laptop:
+    id: int
+    manufacturer: str
+    model: str
+    screen_size_in_inches: float
+    operating_system: OperatingSystem
+Write a function with this signature:
+
+def allocate_laptops(people: List[Person], laptops: List[Laptop]) -> Dict[Person, Laptop]:
+Every person should be allocated exactly one laptop.
+
+If we define "sadness" as the number of places down in someone's ranking the 
+operating system the ended up with (i.e. if your preferences were [UBUNTU, ARCH, MACOS] 
+
+and you were allocated a MACOS machine your sadness would be 2), we want to minimise the total sadness of 
+all people. If we allocate someone a laptop with an operating system not in their preferred list, treat 
+them as having a sadness of 100.
+
+def ranking():
+    
+
+def minimize_sandess():
+
+
+def allocate_laptops():
+