<span>An associate's degree requires two years of academic study and is the highest degree available at a community college</span>
Partition is a logical drive. Large disks have to be partitioned in order to be structured. Knowing what partition is, partition gap refers to the unused space between partitions. It is also "Inter-partition<span> space" which</span><span> can be used to hide data on a hard disk. In this case a disk editor utility is used to access the hidden data in the partition gap.</span>
Answer:
// here is code in java.
public class NAMES
{
// main method
public static void main(String[] args)
{
int n=4;
// print the upper half
for(int a=1;a<=n;a++)
{
for(int b=1;b<=n-a;b++)
{
// print the spaces
System.out.print(" ");
}
// print the * of upper half
for(int x=1;x<=a*2-1;x++)
{
// print the *
System.out.print("*");
}
// print newline
System.out.println();
}
// print the lower half
for(int y=n-1;y>0;y--)
{
for(int z=1;z<=n-y;z++)
{
// print the spaces
System.out.print(" ");
}
for(int m=1;m<=y*2-1;m++)
{
// print the *
System.out.print("*");
}
// print newline
System.out.println();
}
}
}
Explanation:
Declare a variable "n" and initialize it with 4. First print the spaces (" ") of the upper half with the help of nested for loop.Then print the "*" of the upper half with for loop. Similarly print the lower half in revers order. This will print the required shape.
Output:
*
***
*****
*******
*****
***
*
Answer:
see explaination
Explanation:
def words2number(s):
words = s.split()
numbers = ['zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine']
result = ""
for word in words:
if word in numbers:
result += str(numbers.index(word))
return result
Answer:
// program in python
# import math library
import math
#read input from user
num=int(input("enter an integer:"))
while True:
#find square root on input
s_root=math.sqrt(num)
#find remainder of root
r=s_root%1
#if remainder if 0 then perfect square
if r==0:
print("square root of the number is:",s_root)
break
else:
#if number is not perfect square then ask again
num=int(input("input is not perfect square !!enter an integer again:"))
Explanation:
Read an integer from user.Find the square root of the input number and then find the remainder of square root by modulo 1.If the remainder is 0 then number is perfect square otherwise ask user to enter an integer again until user enter a perfect square number.
Output:
enter an integer:12
input is not perfect square !!enter an integer again:16
square root of the number is: 4.0
