A brief history of personal computer development

First, the definition of PC (personal computer) computer: that is, personal computer, designed for personal use alone.

Second, a brief history of PC development (that is, the history of Intel's chip development)

Compatible computer refers to a computer that is not produced by IBM but has the same characteristics as the microcomputer produced by IBM;

Microcomputer composition

A PC consists of an arithmetic unit, a controller, a memory and input/output devices.

First, understand the PC (understand the key reset and power supply of the main chassis, etc. )

Second, the internal structure of PC (physical demonstration)

1. Motherboard: the core component of a computer.

2. Floppy disk drive

(1) classification: 3.5 inches (capacity 1.44MB) and 5.25 inches (capacity 1.2M).

(2) track, sector and write protection of floppy disk

Note: Once the floppy disk is formatted, all the information stored in it will be lost.

3. Hard disk drive (450m-60g)

(1) hard disk interface standard (IDE interface and SCSI interface)

(2) hard disk partition (for a large-capacity hard disk, it can be divided into several logical drives)

(3) Features: large capacity, high speed and high price.

4. CD-ROM (650m)

(1) CD

(2) Optical disc types: read-only CD-ROM, write-once CD-R and read-write CD-RW.

Third, the central processing unit CPU

1.The basic function of CPU is to fetch and execute programs (realized by instructions) from main memory.

2.2 instruction system. cpu

3. The main performance index is 3. CPU (i.e. main frequency)

Such as Pentium ii 466,700, etc.

Fourth, memory.

1. Memory capacity (related to the overall running speed of the computer)

The basic unit of memory is byte, and a byte consists of 8-bit binary numbers,1KB =1024b1MB =1024kb1GB =1024mb.

2. Fast access, memory and virtual memory.

3.RAM and ROM CMOS

(1)RAM random access memory, commonly known as memory, also known as main memory. Mainly using DRAM and s DRAM technology. Its characteristics are: high speed, once the power is cut off, all the information inside will be lost.

(2)ROM, which stores some programs, one is the power-on self-test program and 20 basic input and output programs.

(3)CMOS stores the important system parameters of the microcomputer.

Verb (abbreviation for verb) input and output device

1. Use of Keyboard (Keyboard and Example of Keyboard Operation Method) (p39)

2. Other input devices (such as mouse, scanner, digital camera, light pen and touch screen, etc.). )

3. Monitor

(1) Classification of monitors: single monitor and color monitor.

(2) The main technical index of the display: resolution (horizontal point * vertical point)

(3) Graphics card (AGP graphics card, multiple colors)

Note: Flicker can be eliminated when the refresh frequency reaches 75HZ.

4. Printer

Classification of printers: needle printers, inkjet printers and laser printers.

5. Other output devices &; (=NationalBureauofStandards)

Such as: audio, video recorder and projector.

6. Data transmission

(1) Data transmission is the main way for computers to exchange information with the outside world.

(2) Two ways of information exchange: analog and digital.

Note: A modem is an electronic device that converts digital signals and analog signals.

Basic principles of computer work:

The basic working principle of a computer is to store programs and control programs. Input the instruction sequence (called program) and the original data into the computer memory in advance. Each instruction clearly specifies which address the computer takes the data from, what operation to perform and where to send it. When the computer is running, it first takes the 1 th instruction from the memory, accepts the instruction request through the decoder of the controller, then takes the data from the memory for the specified operation and logical operation, and then sends the result to the memory according to the address. Next, take out the second instruction, complete the specified operation under the command of the controller, and continue like this until you meet the stop instruction.

The exact website address:/paper/article/20061230/paper _1674593492340.html.

At least one high-level programming language:

Baidu/View/128511.htm

Data structures commonly used in programming;

Calculation of unary polynomial

Task: Be able to create and output polynomials in descending order of exponent; Can complete the addition and subtraction of two polynomials, and record the results output. (Four sub-functions: create, add, subtract and output)

2。 Sum of two 4×4 two-dimensional arrays

Task: It is required to input the array initialization through the keyboard and ensure the correct output.

1.// storage structure: deque

//The basic process of polynomial addition: (1), the one with the higher power of the two polynomials is stored in endPower; ;

// (2), starting from ix=0, operate the corresponding term of the polynomial;

// (3), increasing if IX >；; =endPower, end Otherwise, repeat 2 and 3.

# include & lt Dirk & gt

# include & ltiostream & gt

Use namespace std

Category expression {

Public:

expression(){ int highestPower = 0； factors = deque & ltdouble & gt(0.0); }

~ Expression(){ factors . clear()； }

bool create()；

Void display ();

Expression & amp (expression & another);

Expression & minus (expression & another);

int HighestPower()const；

Double factor (int index) constant;

Private:

Int highestPower// maximum power

Dirk & ltdouble & gt factor; //Coefficient (all coefficients from the highest power to 0 are saved, and if a power does not exist, the coefficient is 0).

};

Bending piece

Expression:

Create () {

Cout < < "Input maximum power:";

CIN & gt； & gt supreme power;

double dTemp

for(int IX = highest power； ix & gt=0; - ix ) {

Cout & lt& lt "input x"< factors; & ltix & lt& lt“(double):”；

CIN & gt； & gtdTemp

factors . push _ front(dt EMP)；

}

Return true

}

empty

Expression:

Show () {

for(int IX = highest power； ix & gt=0; - ix ) {

if(IX & lt； Supreme power & factors. at (ix) > 0)

cout & lt& lt"+";

if( factors.at(ix)！ =0 ) {

The factor at cout < < (ix);

if(IX & gt； 0 )

cout & lt& lt" x " & lt& lt“^"<； & lt 9;

}

}

cout & lt& ltendl

}

Expression &

Expression:

Add (expression & another) {

int end power =(highest power & gt； Another one. HighestPower())？ Another one. HighestPower()；

for(int IX = 0； ix & lt= endPower++ix ) {

if(IX & gt； highestPower ) {

Factors.push_back (another. Factor (IX))；);

highestPower = ix

} else if(IX & lt； = another one. HighestPower() ){

The factor at(ix) += another. Factor (9);

}

}

Return * this

}

Expression &

Expression:

Subtract (expression & another) {

int end power =(highest power & gt； Another one. HighestPower())？ Another one. HighestPower()；

for(int IX = 0； ix & lt= endPower++ix ) {

if(IX & gt； highestPower ) {

Factors. push _ back (-1) * another one. Factor (IX))；);

highestPower = ix

} else if(IX & lt； = another one. HighestPower() ){

Factor. At(ix) -= another. Factor (9);

}

}

Return * this

}

Internationalorganizations (same as international organizations)

Expression:

HighestPower () constant {

Return to highestPower

}

double；twofold

Expression:

Factor (integer index) constant {

Return factors.at (index);

}

int main() {

Expression aExpression, bExpression

if( aExpression.create())

a expression . display()；

if(be expression . create())

be expression . display()；

cout & lt& lt" a expression . add(b expression):" & lt； & ltendl

a expression . add(be expression)；

a expression . display()；

cout & lt& lt" a expression . subtract(b expression):" & lt； & ltendl

a expression . subtract(be expression)；

a expression . display()；

}

2 . char * a；

int m；

Cout & lt& lt "Enter the number of monkeys:" < & ltendl.

CIN & gt； & gtm；

A = new character [m];

Cout & lt& lt "Enter n:"

int n；

CIN & gt； & gtn；

If (n>m)

{

Cout & lt& lt is entered incorrectly and must be less than m =.

CIN & gt； & gtn；

}

for(int I = 0； I & ltm；; i++)

{

a[I]= 1；

}

bool c = true

for(int j = 0； ; j++)

{

for(int k = 0； k & ltm； k++)

{

If (a[k]! =0)

{

C = false;

Break;

}

else c = true

}

If (c! = true)//Exit the judgment.

Break;

if(j%n==0)

a[j % m]= 0；

}

int result = j % m；

Cout & lt& lt "The serial number of the last monkey is:"

- 2 -

insert(int arry[]，int address，int data)

{

int l = arry . length()；

for(int I = l- 1； My> address; I-)

{

arry[I]= arry[I- 1]；

}

Arry[I]= data;

}

sort0 1(int a[])

{

Internal temperature;

int l = a . length()；

temp = a[0]；

for(int I = 1； I & ltl；; i++)

{

if(a[I]& lt； Temperature)

Insert (a, i- 1, temp);

temp = a[I]；

}

}

-

swap(int *x，int *y)

{

Internal temperature;

temp = * x；

* y = temperature

* x = * y；

}

L = a. length;

temp 1 = a[0]； temp 2 = a[ 1]；

for(int k = 0； k & ltl； k++)

for(int I = k； I & ltl；; i++)

{

if(a[I]& gt； a[i+ 1])

swap(a[i]，a[I+ 1)；

}

3.// Binary tree

Structural node {

Int key;

Left side of node *;

Node * right;

};

//Link list

Structure list {

Node * data;

list * next

};

//Queue

Structure queue {

list * front

Int count;

Behind the list *;

};

//Queue for breadth-first traversal

Queue * BST:: _ enqueue (queue * q, node * n)//

{

List* pNew = new list;

pNew-& gt； Data = n；;

pNew-& gt； next = NULL

If (q->; Count == 0)

q->； front = pNew

other

q->； Rear-> next = pNew

q->； rear = pNew

q->； count++；

Return q;

}

//width-first traversal dequeue

node * BST::_ dequeue(queue * & amp； Q) // Leave the team

{

If (q->; Count == 1)

q->； Rear = empty;

list * pDel = Q-& gt； Positive;

node * temp = pDel-& gt； Data;

q->； front = Q-& gt； Heads-> Next;

q->； count-；

Delete pDel

pDel = NULL

Return temperature;

}

///breadth first traversal (sequential traversal)

void BST::_traverse (const node* T)

{

Queue* Q = new queue;

q->； front = Q-& gt； Rear = empty;

q->； count = 0；

while (T！ = empty)

{

cout & lt& ltt->； key & lt& lt" ";

if(T->； Left! = empty)

Q = _enqueue (Q, T- > left); //Left child joins the team

if(T->； Yes! = empty)

Q = _enqueue (Q, T- > pair); //The right child enters the team.

If (q->; Count! = 0) // Queue the next node to be processed.

t = _ dequeue(Q)；

Else // Queue is empty, jump out.

T = NULL

}

Return;