Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
A
algo-bsc
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Deploy
Releases
Package registry
Model registry
Operate
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Vuillemot Romain
algo-bsc
Commits
1cc41141
Commit
1cc41141
authored
6 months ago
by
Romain Vuillemot
Browse files
Options
Downloads
Patches
Plain Diff
update syllabus
parent
12e991c8
Branches
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
README.md
+8
-11
8 additions, 11 deletions
README.md
with
8 additions
and
11 deletions
README.md
+
8
−
11
View file @
1cc41141
...
@@ -147,7 +147,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
...
@@ -147,7 +147,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
### Lecture 7 - **Binary trees**
### Lecture 7 - **Binary trees**
-
Data structures (arrays, adjacency lists)
-
Data structures (arrays, adjacency lists)
-
Convertin
g
between tree representations
-
Converti
o
n between tree representations
-
Tree traversal techniques (preorder, inorder, postorder, level-order)
-
Tree traversal techniques (preorder, inorder, postorder, level-order)
<details>
<details>
...
@@ -159,15 +159,15 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
...
@@ -159,15 +159,15 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
</details>
</details>
### Lab 7 - **
Binary tre
es**
### Lab 7 - **
Exercis
es**
---
---
### Lecture 8 - **Trees**
### Lecture 8 - **Trees**
-
Data structures (arrays, adjacency lists)
-
Data structures (arrays, adjacency lists)
-
Converting between tree representation
s
-
Tree properties check
s
-
Tree traversal
techniques (preorder, inorder, postorder, level-order
)
-
Tree traversal
methods (depth-first search, breadth-first search
)
<details>
<details>
<summary>
📖
</summary>
<summary>
📖
</summary>
...
@@ -179,8 +179,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
...
@@ -179,8 +179,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
</details>
</details>
### Lab 8 - **Trees**
### Lab 8 - **Exercises**
---
---
...
@@ -202,7 +201,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
...
@@ -202,7 +201,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
</details>
</details>
### Lab 9
### Lab 9
- **Exercises**
---
---
...
@@ -219,7 +218,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
...
@@ -219,7 +218,7 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
</details>
</details>
### Lab 10
### Lab 10
- **Exercises**
---
---
...
@@ -234,12 +233,10 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
...
@@ -234,12 +233,10 @@ Instructor: [Romain Vuillemot](romain.vuillemot@ec-lyon.fr)
</details>
</details>
### Lab 11
### Lab 11
- **Exercises**
---
---
### Exam
### Exam
-
Final written exam on paper
-
Final written exam on paper
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment