Hen you're working with a word processing document and you press the Del key, what happens?

This exspansion slot essentially replaced PCI and AGP slots

MrRa [10]

PCI and AGP slots have been replaced with PCI-E slot (PCI-Express). There are different types of PCI-E buses:

PCI Express 1x (250 [500] * MB/s)
PCI Express 2x (500 [1000] * MB/s)
PCI Express 4x (1000 [2000] * MB/s)
PCI Express 8x (2000 [4000] * MB/s)
PCI Express 16x (4000 [8000] * MB/s)
PCI Express 32x (8000 [16000] * MB/s)

I hope that's what you meant :)

4 0

4 years ago

How could social media have a negative impact if not used properly when seeking employment

castortr0y [4]

Before hiring someone, employers often check the social media pages of people applying for a job. If their social media account has content not up to the company's standards, they may not get the job.

8 0

4 years ago

Write a program with 2 separate functions which compute the GCD (Greatest Common Denominator) and the LCM (Lowest Common Multipl

Maru [420]

Answer:

The program written in Python is as follows

def GCD(num1, num2):

small = num1

if num1 > num2:

small = num2

for i in range(1, small+1):

if((num1 % i == 0) and (num2 % i == 0)):

gcd = i

print("The GCD is "+ str(gcd))

def LCM(num1,num2):

big = num2

if num1 > num2:

big = num1

while(True):

if((big % num1 == 0) and (big % num2 == 0)):

lcm = big

break

big = big+1

print("The LCM is "+ str(lcm))

print("Enter two numbers: ")

num1 = int(input(": "))

num2 = int(input(": "))

GCD(num1, num2)

LCM(num1, num2)

Explanation:

This line defines the GCD function

def GCD(num1, num2):

This line initializes variable small to num1

small = num1

This line checks if num2 is less than num1, if yes: num2 is assigned to variable small

if num1 > num2:

small = num2

The following iteration determines the GCD of num1 and num2

for i in range(1, small+1):

if((num1 % i == 0) and (num2 % i == 0)):

gcd = i

This line prints the GCD

print("The GCD is "+ str(gcd))

This line defines the LCM function

def LCM(num1,num2):

This line initializes variable big to num2

big = num2

This line checks if num1 is greater than num2, if yes: num1 is assigned to variable big

if num1 > num2:

big = num1

The following iteration continues while the LCM has not been gotten.

while(True):

This if statement determines the LCM using modulo operator

if((big % num1 == 0) and (big % num2 == 0)):

lcm = big

break

big = big+1

This line prints the LCM of the two numbers

print("The LCM is "+ str(lcm))

The main starts here

This line prompts user for two numbers

print("Enter two numbers: ")

The next two lines get user inputs

num1 = int(input(": "))

num2 = int(input(": "))

This calls the GCD function

GCD(num1, num2)

This calls the LCM function

LCM(num1, num2)

See attachment for more structured program

Download txt

5 0

3 years ago

How to recover permanently deleted files from drive

HACTEHA [7]

Go into your trash bin in your computer.

7 0

3 years ago

Write a program that prompts the user to enter in a postive number. Only accept positive numbers - if the user supplies a negati

marusya05 [52]

Answer:

The c++ program to check prime numbers is shown below.

#include <iostream>

using namespace std;

int main() {

int num, prime=0;

do

{

cout<<"Enter a positive number."<<endl;

cin>>num;

if(num<1)

{

cout<<"Invalid number. Enter a positive number"<<endl;

cin>>num;

}

}while(num<1);

if(num==1 || num==2 || num==3)

cout<<num<<" is a prime number."<<endl;

else if(num%2 == 0)

cout<<num<<" is not a prime number."<<endl;

else

{

for(int k=3; k<num/2; k++)

{

if(num%k == 0)

prime++;

}

if(prime>1)

cout<<num<<" is not a prime number."<<endl;

else

cout<<num<<" is a prime number."<<endl;

}

OUTPUT

Enter a positive number.

-7

Invalid number. Enter a positive number

0

Enter a positive number.

79

79 is a prime number.

Explanation:

The user input is validated for positivity. A do while loop along with an if statement is implemented for verification.

do

{

cout<<"Enter a positive number."<<endl;

cin>>num;

if(num<1)

{

cout<<"Invalid number. Enter a positive number"<<endl;

cin>>num;

}

}while(num<1);

The test for prime number is done by using multiple if else statements.

If user inputs 1, 2, or 3, message is displayed.

Else If user inputs an even number, message is displayed for not prime. This is done by taking modulo of the number upon division by 2.

Else if user inputs neither an even number nor a number less than 3, the modulus of the number is taken with divisors beginning from 3 up to half of the input number.

For this, an integer variable prime is initialized to 0. A number can be completely divisible by itself or by its factors.

If the number is divisible by any of the divisors, value of variable prime is increased by 1. If value of prime is greater than 1, this means that the user input is divisible by more than one divisor. Hence, the given number is not a prime number.

5 0

3 years ago