Home > Deep Learning 101 > Quizzes > Deep Learning Test
Deep Learning Test
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 65% Most missed: “What are the three popular strategies for allocating free memory blocks to proce…”
Deep Learning Test
Time left 00:00
22 Questions

1. What is the "largest" program that could execute on a machine with a 24-bit virtual address?

2. What precisely does it mean if the 'dirty bit' is set for a page frame?

3. Flags that are contained in a PTE.

4. What interrupt is created when a desired page frame is not currently resident in RAM?

5. While DMA (Direct Memory Access) is taking place - processor is free to do other things. The processor is only involved

6. Explain best fit

7. Explain next fit

8. How does the hardware 'know' that a desired page frame is not currently resident in RAM?

9. DMA uses "cycle stealing" to transfer data on the system bus. The only interupts that occur during DMA transfer is

10. Buddy Strategy always allocates memory in chunks of _________ and uses a data structure based on a binary tree

11. What is a working set model?

12. The address contained in a TLB entry is (a)physical (b)logical

13. Which one of the following is not among the set of events that may take place between the time a page fault occurs and the time the faulting process resumes execution? (a)OS blocks the process the puts it into a wait queue (b)One of the process in the ready queue is selected to run. (c)A DMA is initiated to load the page from disk into main memory. (d)The last page that the faulting process was executing is replaced with the newly loaded page. (e)Page table is updated to reflect the change. f) None of the above

14. Which one of the following is not among the set of events that may take place between the time a page fault occurs and the time the faulting process resumes execution? (a)OS blocks the process & puts it into a wait queue (b)One of the process and puts it into a wait queue (c)A DMA is initiated to load the page from disk into main memory (d)A page replacement strategy is used to find a page frame to load the new page (e)Page table is updated to reflect the change

15. Explain when/how internal fragmentation may occur.

16. What is a global allocation sheme?

17. What are the three popular strategies for allocating free memory blocks to process in dynamic memory partitioning?

18. What is the "largest" program that could execute on a machine with a 24-bit physical address?

19. Compare global allocation VS working set allocation - which would be more adversely affected by a program with 'bad' locality? and WHY would that be true?

20. What is 'good' VS 'bad' program locality?

21. Explain when/how external fragmentation may occur.

22. Explain first fit