Free List Quiz

Test understanding of free list management

Get every question correct to pass this checkpoint. You can review feedback, revise your answers, and submit again.

1. First fit scans A(20 free), B(96 used), C(56 free), D(40 free) for 36 bytes. What does it return? Select one.

Select one answer.

C A B D

2. Repeat the same search immediately, with no caller claim. What should happen? Select one.

Select one answer.

It unlinks C from the list It returns C again and changes no metadata It returns D because searching consumes C It allocates a new block from sbrk

3. An exact 32-byte free block is encountered for request 32. Is it eligible? Select one.

Select one answer.

Yes; capacity >= request No; one extra payload byte is required Only if it is the tail Only if all preceding nodes are free

4. Appending D to A→B→C→NULL requires which links? Select one.

Select one answer.

C.next=NULL and head=D C.next=D and D.next=NULL A.next=D and D.next=NULL D.next=A and A.next=D

5. A(20 free), B(96 used), C(56 free), D(40 free): what is total_free_space in payload bytes?

6. A(20 free), B(96 used), C(56 free), D(40 free) contain 116 free payload bytes. Can find_free_block(100) succeed? Select one.

Select one answer.

Yes; B has the largest capacity Yes; return the first free address and write 100 bytes No; no individual free block is large enough Yes; automatically join A,C,D

7. Two free nodes are adjacent in the logical list. May they always be coalesced? Select one.

Select one answer.

Yes; next pointers encode byte distances Yes; free flags erase any gap Only if their capacities are equal No; physical adjacency must also be established

8. What are get_last_block(), count_free_blocks(), and total_free_space() for an empty list? Select one.

Select one answer.

NULL, 1, 0 NULL, 0, sizeof(header) NULL, 0, 0 A new allocated header, 1, 0

Auto-advance on pass

Join Discord