You want to throw 2 dice and get (or show?) their value.
Their value is random, so you need to generate two numbers between 1 & 6.
You may need to display the numbers
The main part of the program needs to know the numbers to limit what the user may do next.
That's most of the first level of decomposition. You need to keep decomposing (breaking into smaller simpler pieces) (think of an outline) and deciding what objects, functions, data structures and logic you're going to use to code this.
Answer:
The page field is 8-bit wide, then the page size is 256 bytes.
Using the subdivision above, the first level page table points to 1024 2nd level page tables, each pointing to 256 3rd page tables, each containing 64 pages. The program's address space consists of 1024 pages, thus we need we need 16 third-level page tables. Therefore we need 16 entries in a 2nd level page table, and one entry in the first level page table. Therefore the size is: 1024 entries for the first table, 256 entries for the 2nd level page table, and 16 3rd level page table containing 64 entries each. Assuming 2 bytes per entry, the space required is 1024 * 2 + 256 * 2 (one second-level paget table) + 16 * 64 * 2 (16 third-level page tables) = 4608 bytes.
First, the stack, data and code segments are at addresses that require having 3 page tables entries active in the first level page table. For 64K, you need 256 pages, or 4 third-level page tables. For 600K, you need 2400 pages, or 38 third-level page tables and for 48K you need 192 pages or 3 third-level page tables. Assuming 2 bytes per entry, the space required is 1024 * 2 + 256 * 3 * 2 (3 second-level page tables) + 64 * (38+4+3)* 2 (38 third-level page tables for data segment, 4 for stack and 3 for code segment) = 9344 bytes.
Explanation:
16 E the answer
Answer:
không nhé học đi bạn đừng có cheat hỏng người đấy
Explanation:
To run applications on your computer
-Apps will run independently from a router.
Answer:
- Step1: Check If the number is Positive or Negative.
- Step2: If it is positive then save the sign of it as 0.
- Step3: If it is negative then save the sign of it as 1.
- Step4: Covert the negative number to Positive.
- Step5: Convert the IEEE 754 to Binary.
- Step6: convert the integer part into binary form
- Step7: Convert fractional part into binary form
- Step8: To convert Integer part, Devide the number by 2 and note down the reminder and Keep deviding unless dividend is less than 2
- Step9: copy all the reminders together
- Step10: Multiply decimal part by 2 unless fractional part is 0.
- Step11: By noting down integral part, keep multiplying decimal part by new value of 2 untill perfect number is reached.
- Step6: Find the Mantissa.
- Step7: Concatinate the Sign, exponent and the mantissa.
Explanation:
For Example : 20.75
First step (converting 50 (in base 10) to binary):
- No is Positive
- By dividing 20 by 2, which gives 10 with no remainder 0.
- Now Devide 10 by 2, which gives 5 with a remainder of 0.
- Now Devide 5 by 2, which gives 2 the reminder as 1
- Now Devide 2 by 2, which gives 1 with reminder as 0
- Now devide 1 by 2, which gives 0 with reminder as 1
- We read the result from bottom to top which is 10100
Second part is to convert 0.75 to binary:
- We have to multiply 0.75 by 2, which gives 1.5. We keep only the integer part, which is 1.
- Now, we do 1.5 - 1, which gives 0.5. Now, We multiply 0.5 by 2, which gives 1.
- Now we do 1 - 1, which gives 0.
- Reading from Top to bottom will give 110
Final Answer is : 10100.110
