The system partition must be marked active
A. marked active
<u>Explanation:</u>
To boot on bootmgr and load the operating system, first it should be formatted with fat32 or ntf32 and make it active the partition. Partition is made through windows disk manager from control panel or DISKPART tools which is available in operating system.
These tools are ready and handy which is available. When we make partition it will prompt for number GIGA BYTE OR MEGA BYTE size after end user input or select, next step to select disk format type such as FAT32 or NTFS.
Partition can be made at during installing operating system and made active (BOOTMGR).
Virtual memory may provide a reasonably large storage capacity in an affordable cost.
<u>Virtual Memory:</u> the operating systems of all modern computers have virtual memory where a disk is used to transfer the data temporarily from the RAM when physical memory of the computer falls short. Though it is cheap but it does not allow computers to have more memory and frequent swapping even makes the PC slow.
<u>Tiered memory:</u> has the fastest data storage and even has a good storage capacity but is pretty expensive.
<u>Volatile memory:</u> volatile memories have good performance in terms of speed and storage but they still are a little expensive in comparison to non-volatile memory.
<u>Non-volatile memory:</u> they do not provide with large storage capacities.
Answer:
// program in Python to check perfect number
#function to find number is perfect or not
def is_Perfect_Number(n):
#total variable
tot = 1
i = 2
#sum of all divisor of number
while i*i<=n:
if n%i==0:
tot = tot + i + n/i
if tot == n and n != 1:
return 1
i = i+1
return 0
#read until user enter a perfect number
while True:
#read integer
num = int(input("Input an integer: "))
#call the function
if(is_Perfect_Number(num)):
print(num,"is perfect number")
#if perfect number break
break
else:
print(num,"is not a perfect number")
#ask again
print("try again.")
Explanation:
Read number from user and then call the function is_Perfect_Number() with parameter "num".This will find the sum of all divisor of number.If sum is equal to number then it will return 1 else return 0.If the number is not perfect then it will again ask to enter a number until user enter a perfect number.
Output:
Input an integer: 24
24 is not a perfect number
try again.
Input an integer: 28
28 is perfect number
Answer:
Time Complexity of Problem - O(n)
Explanation:
When n= 1024 time taken is t. on a particular computer.
When computer is 8 times faster in same time t , n can be equal to 8192. It means on increasing processing speed input grows linearly.
When computer is 8 times slow then with same time t , n will be 128 which is (1/8)th time 1024.
It means with increase in processing speed by x factor time taken will decrease by (1/x) factor. Or input size can be increased by x times. This signifies that time taken by program grows linearly with input size n. Therefore time complexity of problem will be O(n).
If we double the speed of original machine then we can solve problems of size 2n in time t.
