vault backup: 2023-08-01 17:36:57
This commit is contained in:
40
.obsidian/workspace.json
vendored
40
.obsidian/workspace.json
vendored
@@ -23,17 +23,7 @@
|
||||
"state": {
|
||||
"type": "pdf",
|
||||
"state": {
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/VL09 - Sortieren 1/VL09-Sortieren_1.pdf"
|
||||
}
|
||||
}
|
||||
},
|
||||
{
|
||||
"id": "0fd4f7bfbf2ab7da",
|
||||
"type": "leaf",
|
||||
"state": {
|
||||
"type": "pdf",
|
||||
"state": {
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/Alte Klausuren/36-Klausur vom 08.09.2021_MI_WI_final_ohnePW.pdf"
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/VL03 - Listen/VL03-Listen.pdf"
|
||||
}
|
||||
}
|
||||
},
|
||||
@@ -48,17 +38,17 @@
|
||||
}
|
||||
},
|
||||
{
|
||||
"id": "7e083105ca3f4c6c",
|
||||
"id": "0fd4f7bfbf2ab7da",
|
||||
"type": "leaf",
|
||||
"state": {
|
||||
"type": "release-notes",
|
||||
"type": "pdf",
|
||||
"state": {
|
||||
"currentVersion": "1.3.7"
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/Alte Klausuren/39-Klausur vom 08.02.2023_final.pdf"
|
||||
}
|
||||
}
|
||||
}
|
||||
],
|
||||
"currentTab": 4
|
||||
"currentTab": 3
|
||||
}
|
||||
],
|
||||
"direction": "vertical"
|
||||
@@ -132,7 +122,7 @@
|
||||
"state": {
|
||||
"type": "backlink",
|
||||
"state": {
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/VL11 - Suchen/VL11-Suchen.pdf",
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/Alte Klausuren/39-Klausur vom 08.02.2023_final.pdf",
|
||||
"collapseAll": false,
|
||||
"extraContext": false,
|
||||
"sortOrder": "alphabetical",
|
||||
@@ -149,7 +139,7 @@
|
||||
"state": {
|
||||
"type": "outgoing-link",
|
||||
"state": {
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/VL11 - Suchen/VL11-Suchen.pdf",
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/Alte Klausuren/39-Klausur vom 08.02.2023_final.pdf",
|
||||
"linksCollapsed": false,
|
||||
"unlinkedCollapsed": true
|
||||
}
|
||||
@@ -172,7 +162,7 @@
|
||||
"state": {
|
||||
"type": "outline",
|
||||
"state": {
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/VL11 - Suchen/VL11-Suchen.pdf"
|
||||
"file": "Algorithmen und Datenstrukturen/Ilias/Alte Klausuren/39-Klausur vom 08.02.2023_final.pdf"
|
||||
}
|
||||
}
|
||||
},
|
||||
@@ -233,19 +223,19 @@
|
||||
"obsidian-wordnet-plugin:WordNet Dictionary": false
|
||||
}
|
||||
},
|
||||
"active": "7e083105ca3f4c6c",
|
||||
"active": "0fd4f7bfbf2ab7da",
|
||||
"lastOpenFiles": [
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL03 - Listen/VL03-Listen.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/Alte Klausuren/39-Klausur vom 08.02.2023_final.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL11 - Suchen/VL11-Suchen.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL04 - Listen, Collections/VL04-Listen_Collections.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL01 - Algorithmen/VL01-Algorithmen.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL09 - Sortieren 1/VL09-Sortieren_1.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL08 - B-Bäume, Collections/VL08-B-Baeume, Collections.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL10 - Sortieren 2/VL10-Sortieren_2.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL09 - Sortieren 1/VL09-Sortieren_1.pdf",
|
||||
"CCN/Ilias/Lecture/CCN-4 - NetworkLayer.pdf",
|
||||
"CCN/Ilias/Lecture/CCN-3 - DataLinkLayer.pdf",
|
||||
"CCN/Ilias/Lecture/CCN-2-PhysicalLayer.pdf",
|
||||
"CCN/Ilias/Lecture/CCN-6 - ApplicationLayer.pdf",
|
||||
"Informationssicherheit/Ilias/Vorlesungen/10-sichere-software-entwicklung-handout.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/Alte Klausuren/36-Klausur vom 08.09.2021_MI_WI_final_ohnePW.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL07 - AVL-Bäume/VL07-AVL-Baeume.pdf",
|
||||
"Algorithmen und Datenstrukturen/Ilias/VL03 - Listen/VL03-Listen.pdf",
|
||||
"Informationssicherheit/Ueb9/UEB_09.md",
|
||||
"English/KW26.md",
|
||||
"Informationssicherheit/Ueb7/Ueb07.md",
|
||||
|
||||
Reference in New Issue
Block a user