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

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! For more software proficiency test counseling and questions, please pay attention to the 51cto college-soft exam classification!

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; "/>

2. Linear table

(1) chain storage of sex tables and the features and operations of the following common linked lists: Single-Chain tables, cyclic linked lists, two-way linked lists, and two-way cyclic linked lists.

(2) The merge algorithm of a single-chain table, the merge algorithm of a circular linked list, the insert and delete algorithms of a two-way linked list and a two-way circular linked list are common methods of examination.

(3) the respective advantages of setting the header pointer and the ending pointer in the circular linked list instead of the header pointer and the index storage structure in a single-link table.

3. Stack and queue

You can ask if you already know the following:

(1) definitions of stacks and queues and related data structures, including sequential stacks, chain stacks, shared stacks, cyclic queues, and chain queues. Stack and queue access data (Note: Save and take two parts) features.

(2) recursive algorithms. The Relationship Between Stack and recursion, and the use of stack to switch recursion to a non-recursive classic algorithm: n! Factorial problem, FIB series problem, Hanoi Problem, backpack problem, binary tree recursive and non-recursive traversal problem, the relationship between deep traversal and stack of graphs, etc. Most of the questions about trees and graphs are examined in related sections of trees and graphs.

(3) Application of the stack: the solution of the numerical expression and the matching principle of parentheses are only used for understanding the principle. There are not many questions about the algorithm design of this question.

(4) In the cyclic queue, the team is determined to be empty and the team is full. In the cyclic queue, the team enters and leaves the queue. (when inserting the cyclic queue, you must also determine whether it is full, when deleting an algorithm, you must determine whether it is empty.

[Full condition for empty queues in cyclic queue

For convenience, it is agreed that when an empty team is initially created

Front = rear = 0,

When the team is empty: Front = rear,

When the team is full: Front = rear is also set up,

Therefore, we cannot determine whether the team is empty or full only by using the equation front = rear.

There are two ways to solve the problem:

(1) set another flag to distinguish whether the queue is empty or full.

(2) Use less than one element space. It is agreed that "the queue head pointer front is at the next position of the team's tail pointer rear" will be used as a sign of the queue's "full" status.

Team blank: Front = rear,

When the team is full: (Rear + 1) % maxsize = front]

If you are familiar with the above points, you can skip the stack and queue chapter. Note: I am talking about not reading a book, but not answering questions.

Main Operations of cyclic queue:

(1) create a cyclic queue

(2) initialize the cyclic queue

(3) Determine whether the cyclic queue is empty

(4) Determine whether the cyclic queue is full

(5) joining and leaving

// An element between the empty start and end does not need to be used

# Include

# Include

# Define Max size 100

Typedef struct

{

Intelem [maxsize];

Intfront, rear;

} Quque; // define the team Header

Int initque (quque ** q) // Initialization

{

(* Q)-> front = 0;

(* Q)-> rear = 0;

}

Int isfull (quque * q)

{

If (Q-> front = (Q-> rear + 1) % maxsize) // judge full (leave an element empty)

Return 1;

Else

Return 0;

}

Int insertque (quque ** Q, int ELEM)

{

If (isfull (* q) Return-1;

(* Q)-> ELEM [(* q)-> rear] = ELEM;

(* Q)-> rear = (* q)-> rear + 1) % maxsize; // insert

Return0;

}

Int isempty (quque * q)

{

If (Q-> front = Q-> rear) // empty

Return 1;

Else

Return 0;

}

Int deleteque (quque ** Q, int * pelem)

{

If (isempty (* q ))

Return 0;

* Pelem = (* q)-> ELEM [(* q)-> front];

(* Q)-> front = (* q)-> front + 1) % maxsize;

Return0;

}

Recommended high-quality 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-exercise questions before the test [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/1539368