AI_Exam_2_25S.doc

Suppose we’re using a 32-bit system with 4 byte pointers. Suppose the system has 4KB pages with a single-level page table. How many entries are there in a page table? Show the steps.

A toddler’s parent/caregiver asks the nurse for suggestions on dealing with temper tantrums. The most appropriate recommendation is to: 

An infant usually begins to fear strangers around this age:

A parent tells the school nurse that his first-grade child is watching screens about 4 hours per day at home. When discussing this issue with the parent, the nurse should consider:

The circular wait condition, where a cycle exists between waiting processes and resources, is sufficient for a deadlock to occur.  Hint: sufficient condition means if there is circular wait then independent of the other three conditions (like mutual exclusion, hold and wait etc) a deadlock will occur.

Spinlocks are often identified as the best locking mechanism of choice on multi-processor systems when the lock is to be held for a short duration.

Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1.    Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? • LRU replacement (4 points) • FIFO replacement (4 points) • Optimal replacement (4 points) Show the sequence to get full marks. Consider initially the cache to be empty. To answer, you may use the following technique: write the page fault on the side of the access that resulted in the page fault, and also note which page will be evicted, if any. Please do not forget to mention the total page fault for each case as well. 7(page fault, no eviction) , 2(page fault, no eviction), ……………………………..  

You are reviewing a system that uses SHA-256 for password hashing with salts. The salts are unique but only 4 bytes long. What is the risk in this setup, and what could be improved?

In which situation is a systems analyst most clearly acting as a supporting expert?