Computer Common Basic Course Homework Meeting Comes to Answer!!

The first question has someone.。。。

But it's so troublesome to say ...

It's all from our freshman year.,It's in a lot of books.。。。

1.Tubes, transistors, integrated circuits.

2.It consists of 5 parts: combinator, controller, memory, input and output. You can search the Internet for a working schematic. I'm sure you have it in your textbooks.

1.You can't, and you can't, change the window size. Unless you're pulling the original window to maximize it, you can move it around or change the size.

2.Hold down Ctrl, select and hold all three icons, then right-click and select "Open". If it's in order, just use the left mouse button to pull the selection.

3.Directly off the "x"; Right-click in the taskbar and select "Close"; Click on the title bar and select "Close". After changing to the current running program, press Alt+F4 to close the application window; Click on the taskbar, select Task Manager, select the Applications tab, select the program, click "End Task", and you can also close the ...... with DOSYou can write the first few and you're good to go.

4.There are ways to switch windows, close the current window and open a new window; Click New Window in the taskbar to overwrite the old window.

5。Logging out means that the current user of the computer stops using the computer and related configurations, and switching means that the computer can choose a new user name (+ password) to log in to the machine in the case of multiple user names, and use the relevant configuration and storage information under the user name.

Is it? with the exit command.

In fact, if it is an exam question in a public basic course, you will have "standard answers" when you flip through the book. It's just that sometimes, the location of those answers is a little remote Don't be lazy to find it on the Internet, in fact, this kind of question is not as high as the answer score given to you in the book. It's not hard to see more.

The computer grade exam recommends the 2017 computer level 2 "public foundation" knowledge points for you to help you understand the relevant knowledge of the computer level 2 exam, I believe that after you understand these, the level will be greatly improved.

Computer Level 2 Exam 2017 "Public Foundation" Knowledge Points (5).

Test Center 9 Sequential Search

Test point 9 has a 30% assessment probability in the pen rough model change test, and the score is 2 points in the multiple-choice questions, and the reader should specifically master the algorithm of sequential search.

A lookup is the search for a rock judgment in a given data structure. Starting from the first element of the linear table, the elements in the linear table are compared with the elements to be found, if they are equal, the search is successful; If all the elements in the linear table are compared to the elements being searched but are not equal, the lookup fails.

Sequential searches can only be used in the following two cases:

1) If the linear table is unordered, it can only be searched sequentially, regardless of whether it is a sequential storage structure or a chain storage structure.

2) Even if an ordered linear table is stored in a chain structure, it can only be searched sequentially.

Test Center 10 Dichotomy Search

Test point 10 has a 30% assessment probability in the written test, and the score is 2 points in the fill-in-the-blank questions.

The dichotomy applies only to sequentially stored, non-decreasing ordered tables in the following ways:

Let the length of the ordered linear table be n and the element to be found is i, 1) compare i with the middle term of the linear table;

2) If the value of i and the middle term is equal, the search is successful;

Troubleshooting: Where does binary search work?

The binary search method is only available for ordered tables that are stored sequentially. An ordered table in this context refers to a linear table in which the elements are arranged in non-decreasing order of value (i.e., from smallest to largest, but allowing equal values of adjacent elements).

This process continues until the lookup is successful or the child table length is 0.

For an ordinal linear table of length n, in the worst-case scenario, a binary lookup would only need to compare log2n times.

A:1. Click right to create a new word document -- right-click to rename -- enter the file name of the document. doc

2.Look at the input yourself.

3.(1) Drag the cursor to select the title -- to click "Format" -- Font on the menu, and select the settings as required.

2) Press Ctrl+A to select all content menu "Format" - paragraph (3) menu "View" - click on the header corner - insert "Creation Date" - enter text manually--- press Ctrl+A to select all and repeat the operation (1) to set.

4.Menu "Insert" --**--Operate by yourself as you like.

5.Menu "Insert" --**--WordArt - Own entered by content.

It's very simple, how to do it?