1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
vodomira [7]
3 years ago
6

What do you if your sd card does not appear on your computer

Computers and Technology
2 answers:
VladimirAG [237]3 years ago
8 0
Take it out and try one more time
jonny [76]3 years ago
6 0

take it out, wait 30 sec and put it back in

You might be interested in
How many panes can Pablo view in a spreadsheet if he chooses the split worksheet option?
ddd [48]
Pablo can be a minimum of two pains and a maximum of four panes in a split screen worksheet.
6 0
3 years ago
Read 2 more answers
How to do a linear equations
Dimas [21]
Hey, there are many videos on the internet like youtube that you can watch. Juust type in your questions and there will be many videos that give a brief explanation :) hope it helped u
8 0
3 years ago
What is the name of this tool and what can it be used for?<br> Thanks!!
Iteru [2.4K]
That is a corqet tool it is used for fixing tires
6 0
3 years ago
What is Scrum?
Wittaler [7]

Answer:

A lightweight process for cross-functional, self-organized teams.

Explanation: The process in which teams are cross functional and self organizing to complete a particular task. This term is used in software development. Progress towards well defined goal with by emphasizing on teamwork and accountability.

5 0
4 years ago
The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is
gavmur [86]

Answer:

False

Explanation:

The scheme where you can find the greatest common divisor (GCD) of two integers by repetitive application of the division algorithm is known as Euclidean Algorithm.

The Euclidean Algorithm for calculating GCD of two numbers X and Y can be given as follows:

  • If X=0 then GCD(X, Y)=Y since the Greatest Common Divisor of 0 and Y is Y.
  • If Y=0 then GCD(X, Y)=X since the Greates Common Divisor of 0 and X is X.
  • Let R be the remainder of dividing X by Y assuming X > Y. (R = X % Y)
  • Find GCD( Y, R ) because GCD( X, Y ) = GCD(Y, R ).
  • Repeat the above steps again till R = 0.

4 0
4 years ago
Other questions:
  • Only the _________ can add users with passwords and limit user access to selected areas.
    5·1 answer
  • Write a program in C++ to implement bubblesort using the swap function ?
    11·1 answer
  • Ive looked everywhere on brainly and we have no answers for computers and technology
    7·1 answer
  • Programming CRe-type the code and fix any errors. The code should convert non-positive numbers to 1.
    12·1 answer
  • Write a c++ function, largestnum, that takes as parameters a double array and its size and returns the index of the last occurre
    14·1 answer
  • ​Lisa mentions that a program is developed to interact with other programs, and she wants to begin by testing the programs indiv
    12·1 answer
  • Why is there no ide length or timing for study breaks?​
    12·1 answer
  • Jack wants to save his PowerPoint file electronically. He should store his file in:
    6·2 answers
  • Create a function called is_list_empty that takes a single argument of type list. Your function should return True if the list i
    7·1 answer
  • How do you code to find the surface area 6 s2, volume s3 in python
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!