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
n200080 [17]
3 years ago
10

State all the generations of computers.

Computers and Technology
2 answers:
vaieri [72.5K]3 years ago
8 0

Answer:

1 1st generation =vacuum tube based

2 nd generation =transistor based

3 rd generation intergrated circuit based

4rd generation =vlsi microprocessor based

5th generation =ulsi microprocessor based

svetoff [14.1K]3 years ago
6 0

Answer:

   1940 – 1956: First Generation – Vacuum Tubes. These early computers used vacuum tubes as circuitry and magnetic drums for memory. ...

   1956 – 1963: Second Generation – Transistors. ...

   1964 – 1971: Third Generation – Integrated Circuits. ...

   1972 – 2010: Fourth Generation – Microprocessors.

Explanation:

You might be interested in
What are the binary symbols?
alexgriva [62]

Answer:

Explanation:

a binary number is a number expressed in the base-2 numeral system or binary numeral system

4 0
3 years ago
Read 2 more answers
Code is the code or instructions used to create a Web page or<br> program.
Paha777 [63]
Answer:
HTML
Explanation:

5 0
2 years ago
Help me help you...........
lyudmila [28]

Answer:

the 4th answer

Explanation:

w stage for width, h for height.

6 0
2 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
3 years ago
Hy <br> Anyone from kerala?
Lera25 [3.4K]

Answer:

i dont know

Explanation:

7 0
2 years ago
Read 2 more answers
Other questions:
  • When a relationship is established between two or more arrays by using the same subscript to relate entries between the arrays,
    14·2 answers
  • A(n) ____________________ stores copies of data or programs that are located on the hard drive and that might be needed soon in
    9·1 answer
  • Write a calculator program using a switch statement that: a) Prompts the user to enter two numbers b) Prompts the user to select
    13·1 answer
  • When a user runs an application, what transfers from a storage device to memory?
    8·1 answer
  • Consider the following statements: #include #include class Temporary { private: string description; double first; double second;
    9·1 answer
  • What is WEB 1.0 to WEB3.0
    11·1 answer
  • Question 1 :George, a user, is having trouble connecting to network resources, including shared folders on the local network and
    7·1 answer
  • What is the point of brainy when other people have to answer your questions but not the cumputer
    9·1 answer
  • People are still buying printed magazines?
    12·1 answer
  • Which of the following statements holds true for the term plug-in? Group of answer choices It refers to a program (typically a m
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!