00:01
Here are some of the questions that have been provided to garbage the collection algorithm in the context memory management and bring the question.
00:09
For the first one, a writes mark and compact algorithm.
00:22
Here after markup and compact algorithm only reachable objects will remain on the heap.
00:30
Here the objects that are reachable are a, b, c, d, e, and f are reachable from pointer on the stack at least q and p and q.
01:06
The compact which involves moving reachable objects to a continuous plot.
01:31
So they not may stay in the same location after the allocation.
01:35
And for the b that is objects visited during collection.
01:57
Here the mark and sweep algorithm.
02:07
First one is start from mark p that is mark a, b, c, d, and e.
02:22
Second is start from q that is mark g.
02:31
And for third is sweep phase...