diff --git a/.obsidian/plugins/various-complements/histories.json b/.obsidian/plugins/various-complements/histories.json
index 0353ad1..f0fbcfe 100644
--- a/.obsidian/plugins/various-complements/histories.json
+++ b/.obsidian/plugins/various-complements/histories.json
@@ -1 +1 @@
-{"algorithm":{"algorithm":{"currentFile":{"count":1,"lastUpdated":1736360369637}}},"computing":{"computing":{"currentFile":{"count":2,"lastUpdated":1736427522780}}},"tasks":{"tasks":{"currentFile":{"count":1,"lastUpdated":1736428160890}}},"parallelization":{"parallelization":{"currentFile":{"count":1,"lastUpdated":1736428239757}}},"Implicit":{"Implicit":{"currentFile":{"count":1,"lastUpdated":1736429811730}}},"Semi-implicit":{"Semi-implicit":{"currentFile":{"count":1,"lastUpdated":1736429857427}}},"Agent":{"Agent":{"currentFile":{"count":1,"lastUpdated":1736527234430}}},"Agents":{"Agents":{"currentFile":{"count":3,"lastUpdated":1736528265726}}},"actions":{"actions":{"currentFile":{"count":1,"lastUpdated":1736527553391}}},"successful":{"successful":{"currentFile":{"count":1,"lastUpdated":1736527687166}}},"agents":{"agents":{"currentFile":{"count":3,"lastUpdated":1736529446424}}},"environment":{"environment":{"currentFile":{"count":4,"lastUpdated":1736962288019}}},"actuators":{"actuators":{"currentFile":{"count":1,"lastUpdated":1736528278631}}},"Sensors":{"Sensors":{"currentFile":{"count":1,"lastUpdated":1736528280975}}},"state":{"state":{"currentFile":{"count":1,"lastUpdated":1736529437831}}},"types":{"types":{"currentFile":{"count":1,"lastUpdated":1736529458373}}},"Operatiosn":{"Operatiosn":{"currentFile":{"count":1,"lastUpdated":1736530551849}}},"Algorithms":{"Algorithms":{"currentFile":{"count":1,"lastUpdated":1736792441945}}},"Problem":{"Problem":{"currentFile":{"count":2,"lastUpdated":1736963119655}}},"parallel":{"parallel":{"currentFile":{"count":2,"lastUpdated":1736858881146}}},"processing":{"processing":{"currentFile":{"count":1,"lastUpdated":1736858379041}}},"resources":{"resources":{"currentFile":{"count":1,"lastUpdated":1736858873851}}},"Reduce":{"Reduce":{"currentFile":{"count":1,"lastUpdated":1736859169038}}},"minimized":{"minimized":{"currentFile":{"count":1,"lastUpdated":1736860208884}}},"oriented":{"oriented":{"currentFile":{"count":1,"lastUpdated":1736860250593}}},"Memory":{"Memory":{"currentFile":{"count":1,"lastUpdated":1736860492193}}},"nodes":{"nodes":{"currentFile":{"count":1,"lastUpdated":1736861731850}}},"benefit":{"benefit":{"currentFile":{"count":1,"lastUpdated":1736963283168}}},"weight":{"weight":{"currentFile":{"count":1,"lastUpdated":1736963351487}}},"Science":{"Science":{"currentFile":{"count":3,"lastUpdated":1736978641182}}},"philosophy":{"philosophy":{"currentFile":{"count":1,"lastUpdated":1736978932932}}},"scientists":{"scientists":{"currentFile":{"count":1,"lastUpdated":1736979775741}}},"knowledge":{"knowledge":{"currentFile":{"count":1,"lastUpdated":1736982926940}}},"Design":{"Design":{"currentFile":{"count":1,"lastUpdated":1737031267035}}},"Model":{"Model":{"currentFile":{"count":1,"lastUpdated":1737464038874}}},"customers":{"customers":{"currentFile":{"count":1,"lastUpdated":1737553912552}}}}
\ No newline at end of file
+{"algorithm":{"algorithm":{"currentFile":{"count":1,"lastUpdated":1736360369637}}},"computing":{"computing":{"currentFile":{"count":2,"lastUpdated":1736427522780}}},"tasks":{"tasks":{"currentFile":{"count":1,"lastUpdated":1736428160890}}},"parallelization":{"parallelization":{"currentFile":{"count":1,"lastUpdated":1736428239757}}},"Implicit":{"Implicit":{"currentFile":{"count":1,"lastUpdated":1736429811730}}},"Semi-implicit":{"Semi-implicit":{"currentFile":{"count":1,"lastUpdated":1736429857427}}},"Agent":{"Agent":{"currentFile":{"count":1,"lastUpdated":1736527234430}}},"Agents":{"Agents":{"currentFile":{"count":3,"lastUpdated":1736528265726}}},"actions":{"actions":{"currentFile":{"count":1,"lastUpdated":1736527553391}}},"successful":{"successful":{"currentFile":{"count":1,"lastUpdated":1736527687166}}},"agents":{"agents":{"currentFile":{"count":3,"lastUpdated":1736529446424}}},"environment":{"environment":{"currentFile":{"count":4,"lastUpdated":1736962288019}}},"actuators":{"actuators":{"currentFile":{"count":1,"lastUpdated":1736528278631}}},"Sensors":{"Sensors":{"currentFile":{"count":1,"lastUpdated":1736528280975}}},"state":{"state":{"currentFile":{"count":1,"lastUpdated":1736529437831}}},"types":{"types":{"currentFile":{"count":1,"lastUpdated":1736529458373}}},"Operatiosn":{"Operatiosn":{"currentFile":{"count":1,"lastUpdated":1736530551849}}},"Algorithms":{"Algorithms":{"currentFile":{"count":1,"lastUpdated":1736792441945}}},"Problem":{"Problem":{"currentFile":{"count":2,"lastUpdated":1736963119655}}},"parallel":{"parallel":{"currentFile":{"count":2,"lastUpdated":1736858881146}}},"processing":{"processing":{"currentFile":{"count":1,"lastUpdated":1736858379041}}},"resources":{"resources":{"currentFile":{"count":1,"lastUpdated":1736858873851}}},"Reduce":{"Reduce":{"currentFile":{"count":1,"lastUpdated":1736859169038}}},"minimized":{"minimized":{"currentFile":{"count":1,"lastUpdated":1736860208884}}},"oriented":{"oriented":{"currentFile":{"count":1,"lastUpdated":1736860250593}}},"Memory":{"Memory":{"currentFile":{"count":1,"lastUpdated":1736860492193}}},"nodes":{"nodes":{"currentFile":{"count":1,"lastUpdated":1736861731850}}},"benefit":{"benefit":{"currentFile":{"count":1,"lastUpdated":1736963283168}}},"weight":{"weight":{"currentFile":{"count":1,"lastUpdated":1736963351487}}},"Science":{"Science":{"currentFile":{"count":3,"lastUpdated":1736978641182}}},"philosophy":{"philosophy":{"currentFile":{"count":1,"lastUpdated":1736978932932}}},"scientists":{"scientists":{"currentFile":{"count":1,"lastUpdated":1736979775741}}},"knowledge":{"knowledge":{"currentFile":{"count":1,"lastUpdated":1736982926940}}},"Design":{"Design":{"currentFile":{"count":1,"lastUpdated":1737031267035}}},"Model":{"Model":{"currentFile":{"count":1,"lastUpdated":1737464038874}}},"customers":{"customers":{"currentFile":{"count":1,"lastUpdated":1737553912552}}},"Greedy":{"Greedy":{"currentFile":{"count":1,"lastUpdated":1737567102192}}}}
\ No newline at end of file
diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json
index a90eb3a..b2944c4 100644
--- a/.obsidian/workspace.json
+++ b/.obsidian/workspace.json
@@ -13,12 +13,12 @@
             "state": {
               "type": "markdown",
               "state": {
-                "file": "UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md",
+                "file": "UNB/Year 5/Semester 2/CS3383/Lecture Notes.md",
                 "mode": "source",
                 "source": false
               },
               "icon": "lucide-file",
-              "title": "Tutorial Notes"
+              "title": "Lecture Notes"
             }
           }
         ]
@@ -167,8 +167,8 @@
   },
   "active": "a4868a0d0ec2cb3a",
   "lastOpenFiles": [
-    "UNB/Year 5/Semester 2/CS3383/Lecture Notes.md",
     "UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md",
+    "UNB/Year 5/Semester 2/CS3383/Lecture Notes.md",
     "UNB/Year 5/Semester 2/CS4745/Lecture Notes.md",
     "UNB/Year 5/Semester 2/CS4725/Lecture Notes.md",
     "UNB/Year 5/Semester 2/CS4613/Lecture Notes.md",
diff --git a/UNB/Year 5/Semester 2/CS3383/Lecture Notes.md b/UNB/Year 5/Semester 2/CS3383/Lecture Notes.md
index a582c93..547af27 100644
--- a/UNB/Year 5/Semester 2/CS3383/Lecture Notes.md	
+++ b/UNB/Year 5/Semester 2/CS3383/Lecture Notes.md	
@@ -34,3 +34,5 @@ Given a set S of n items, with each item i having a positive benefit factor, b,
 Goal: Choose items with maximum total benefit but with weight at most W.
 
 If we are allowed to take factional amounts, then this is the fractional knapsack problem. The objective is to maximize the benefit given the amount divided by the weight, with the constraint that the amount is less than the total amount W.
+
+### Interval Partitioning: Greedy 
diff --git a/UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md b/UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md
index 92d7840..32b46c8 100644
--- a/UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md	
+++ b/UNB/Year 5/Semester 2/CS3383/Tutorial Notes.md	
@@ -1,5 +1,5 @@
 # Schedule Problem
-A singler server has n customers to serve. The sere time t_i required by each customer i is known in advance. Goal is to minimize T, the time in the system for customer i.
+A single server has n customers to serve. The sere time t_i required by each customer i is known in advance. Goal is to minimize T, the time in the system for customer i.
 
 For example, t_1=5, t_2=10, t_3=3. Schedule 1: 123, Schedule 2: 231