-
Anonymous users2024-02-06The fourth problem is less certain.
-
Anonymous users2024-02-05This is the standard answer, you should look at the questions when answering the questions, maybe the order of each set of questions is not the same, please pay attention.
1.Among the following cell references, (a) is an absolute reference.
2.The placeholder in PowerPoint is (C).
3.The extension of a PowerPoint presentation document is (a).
4.Small distribution, small investment, and simple configuration are the characteristics of (a).
5.In general, excel can be widely used in (a).
6.The (a) function in Excel returns the number of days in the month on the current date.
7.An IP address can uniquely identify each computer and each user on the Internet (C).
8.The objects that can be inserted in PowerPoint are (D).
9.The following domain names are incorrectly represented in (d).
10.In Excel, sort the data of the worksheet once, and excel allows sorting (C) keywords at the same time.
1.In a computer network, only software resources can be shared, not hardware resources.
b.False 2Excel 2003 contains 1 to 255 worksheets per workbook.
a.Pair 3In normal view, you can insert sound into a slide by selecting the Movie & Sound command in the Insert menu, selecting Sound in File, selecting the sound file you want to insert, and clicking OK.
a.Right 4After modifying the Excel document, save it with a new name, and click the "Save As" command in the "File" menu.
a.Right 5Select the A4 cell in Excel and press the delete key to delete the contents of the A4 cell.
a.To 6In excel worksheet, the default width and height of cells are fixed and cannot be changed.
b.False 7When a user accesses the Internet by dial-up, the user's computer is given a temporary IP address.
a.To 8To animate a slideshow customly, you can use the Custom Animation command in the Slideshow menu.
a.Right 9For Excel data copying operations, you can use the method of dragging and dropping cell fill handles.
a.To 10In PowerPoint, text that is inserted into a placeholder cannot be modified.
b.Wrong 100% answer! Hehe.
-
Anonymous users2024-02-04The 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.
（1）√ 2）√ 3）√ 4）√ 5）× 6）√ 7）√
I checked it and the answer was fine. >>>More
Some common knowledge of computers, such as basic components: combinators, controllers, memory, IO devices DOS knowledge Development and use of electronic computers Composition and working principle of electronic computer systems Computer maintenance Chinese Windows operating system, use of Chinese word, use of Chinese excel, basic knowledge of computer network and computer guidance Basic knowledge of computer network and security, etc.
The first question has someone.。。。
But it's so troublesome to say ... >>>More
Methods of learning English.
1. "Reading through" a reading comprehension every day means not letting go of a word or sentence in order to truly master English. >>>More
It is recommended to buy Tan Haoqiang's C language book, and you have to be patient... When I first came into contact, there were a lot of things I didn't understand, don't be discouraged, continue to look at the bottom, I really can't understand it, don't think about it. Go out and have fun, and in the process of playing, don't think about problems... >>>More