2014 soft test programmer-frequent test knowledge point review notes [Chapter 7]

51cto college specially sorted out "2014 soft test programmer-General test knowledge point review notes [summary]" in the soft test preparation season to help schools pass through smoothly! MoreSoftware Proficiency TestFor more information about tutoring and questions, see51cto school-soft test category!

View summary: 2014 soft test programmer-frequent test knowledge point review notes [summary] 650) This. width = 650; "alt =" popular article "src =" http://www.exam8.com/images/hot.gif "style =" padding: 0px; margin: 0px; Vertical-align: middle; Border: 0px; "/>

Advantages and disadvantages of arrays and linked lists

Array, giving continuous space in the memory. The memory address of the linked list can be discontinuous. each node in the linked list includes the original memory and the information of the next node (one-way, two-way linked lists ).

Arrays are better than linked lists:

A. the memory space usage is small, because the linked list node will append the information of the previous or two nodes.

However, the array is fixed when it is created. Therefore, memory problems may also occur due to the large or insufficient array.

B. The data in the array can be accessed randomly, but the linked list does not have random access. This is easy to understand. arrays are contiguous spaces in the memory. For example, if an array address ranges from 100 to 200, and each element occupies two bytes, therefore, any even number between and is the address of the array element and can be accessed directly.

The linked list may be scattered in the memory address. Therefore, you must find the next node through the information in the previous node.

C. Search speed. This is also because of the continuity of the memory address.

The linked list is better than the array:

A. insert and delete operations. If an element is inserted in the middle of the array, the memory address of all elements after the element is moved backwards. The same is true for deletion. It is faster to insert or delete the last element of data. The linked list only needs to change the node information in the nodes that need to be changed. You do not need to change the node memory address.

B. Memory Address utilization. No matter how much space you have in the memory, if you cannot provide the space required by the array at a time, you will be prompted that the memory is insufficient. One of the reasons for disk space sorting is here. The linked list can be scattered space addresses.

C. the scalability of the linked list is better than that of the array. Because the space occupied by an array is fixed after it is created. If it is full, it cannot be expanded. Only one larger space array can be created. The linked list is not fixed and can be easily expanded.

recommended articles:

Preparing for the 2014 soft exam! Recommendation of high-quality video tutorials (Comprehensive review + experience sharing + pre-test Sprint)

Knowledge points of Network Management in 2014 computer soft examination [summary]

exercise questions and answers for the 2014 soft exam Network Administrator examination [summary]

2014 soft test programmer-test-pre-test exercise questions [summary]

For online soft test video tutorials, click:

Http://edu.51cto.com/course/courseList/id-44.html 

650) This. width = 650; "src =" http://s3.51cto.com/wyfs02/M02/3D/9F/wKioL1PE_n3z629yAACXIHScsJM092.jpg "alt =" wkiol1pe_n3z629yaacxihscsjm092.jpg "style =" padding: 0px; margin: 0px; Vertical-align: Top; Border: none; "/>

This article is from the "51cto college official blog" blog, please be sure to keep this source http://51edu.blog.51cto.com/8899635/1539399