ITGenerations

라운드 로빈(RR) 평균반환 계산법 작업 제출시간 실행시간 작업1 0 8 작업2 1 4 작업3 2 9 작업4 3 5 1 2 3 4 1 3 4(1) 3(1) 4 8 12 16 20 24 25 26 작업1 반환시간 20-0=20작업2 반환시간 8-1=7작업3 반환시간 26-2=24작업4 반환시간 25-3=22반환시간 총합 20+7+24+22=73 평균반환시간=(반환시간총합)/작업수 =73/4=18.25 Thank you.

작업 도착시간 사용시간 job1 0 13 job2 3 35 job3 8 2 job1: 반환시간 13 대기시간 0job2: 반환시간 13+35=48 대기시간 10job3: 반환시간 13+35+2=50 대기시간 40 13+48+50/3 = 33.3

가변길이 메모리 최소적합, 최적적합, 최악적합 강의 동영상(English) Variable size|First, Best, Worst|Memory Management|OS|Operation System This video contains some the basic of variable size partitioning along with space allocation methods like first fit, best fit, worst fit and will help you to develop you concepts and help you in various competitive exams like GATE , NET, PSU'S etc. https://youtu.be/EO4MlDEO89U

2진수->10진수http://www.binaryhexconverter.com/binary-to-decimal-converter 10진수->2진수http://www.binaryhexconverter.com/decimal-to-binary-converter 10진수 decimal2진수 binary

8장 솔루션http://emfls.tistory.com/entry/%EC%9A%B4%EC%98%81%EC%B2%B4%EC%A0%9C-8%EC%9E%A5-%EC%97%B0%EC%8A%B5%EB%AC%B8%EC%A0%9C-%ED%95%B4%EB%8B%B5 7장 솔루션http://emfls.tistory.com/entry/%EC%9A%B4%EC%98%81%EC%B2%B4%EC%A0%9C-%EC%97%B0%EC%8A%B5%EB%AC%B8%EC%A0%9C-7%EC%9E%A5-%ED%95%B4%EB%8B%B5 6장 솔루션 http://emfls.tistory.com/entry/%EC%9A%B4%EC%98%81%EC%B2%B4%EC%A0%9C-%EC%97%B0%EC%8A%B5%EB%AC%B8%EC%A0%9C-6%EC..