Algorithms For Dynamic Automatic Memory Management# The Mark and Sweep Algorithm, The Copying Algorithm,the Reference Counting Algorithm, Compaction Algorithms, Generational Garbage Collection, The Train Algorithm, Incremental Algorithms, Concurrent Algorithms, Parallel Algorithms, Real-time Algorithms, Cycle Collection For Reference Counting, Algorithms For Distributed Systems, Allocation Techniques, Cache-conscious Algorithms.

Faculty: Computer Science
|Undergraduate Studies |Graduate Studies
Pre-required courses

(234123 - Operating Systems and 234247 - Algorithms 1)

Semestrial Information

Weekly Hours

2 Academic Credit • 2 Lecture Hours

Go to Course Page

Go to Course Page


Responsible(s)

Erez Petrank


Exams
Session A: 16-04-2024
  • אולמן 500. 501.
Session B: 04-06-2024
Registration Groups
10
Lecture Sunday 10:30 - 12:30 טאוב 8 | Erez Petrank
Weekly Hours

2 Academic Credit • 2 Lecture Hours

Go to Course Page

Go to Course Page


Responsible(s)

Erez Petrank


Exams
Session A: 15-02-2022 13:00 - 16:00
  • טאוב 3. 5.
Session B: 15-03-2022 13:00 - 16:00
  • אמדו 231. 234.
Session C: 05-04-2022 17:00 - 20:00
  • אולמן 203.

Registration Groups
10
Lecture Tuesday 10:30 - 12:30 טאוב 3 | Erez Petrank
69
Enrollment Group No information regarding course hours
Weekly Hours

2 Academic Credit • 2 Lecture Hours

Go to Course Page

Go to Course Page


Responsible(s)

Erez Petrank


Exams
Session A: 11-02-2021 09:00 - 12:00 Session B: 08-03-2021 09:00 - 12:00
Registration Groups
10
Lecture Monday 10:30 - 12:30 טאוב 9 | Erez Petrank