A certain college graduate admissions examination: (data structure & operating system) (only remember a few questions)
Data structure: 1.1. How many nodes are mostly H-AVL trees, fewer nodes? 1.2. Give the pre-sequence and order of the binary tree, seeking the sequence
2. A data structure that can be dynamically adjusted so that the data structure that can be quickly retrieved from nodes in the near future, explains how to reach "Retrieval of nodes accessed in the near future"
3. The program is incorporated: (source of the source) 3.1. Use the stack to make a debugging of the prefix expression. 3.2. String KMP matching change
4. A program for recursive depth topology is given, and there are three empty in the middle, requiring the program to fill in the blanks (the source engine is not clear)
Operating system: 1. In virtual page memory management, there are other items in the memory page table? What are these entrys? 2. How does the file system improve performance, and how these methods achieve performance? 3. Process communication method, and its main features
4. A batch of processes (given the estimated execution time, start time, priority), scheduling execution in time slice rotation, robbing priority, non-robbed priority) 5. At the same time, there is a batch of disk access (give the column number, track number, sector number), what order is the best?
6. PV operation, the existing PV operation is defined as follows: (P with ordinary P) v: Semophore f (Semophore <= 0) {Wake Semophore Waiting for the "Final" in the queue, insert the ready queue (attention, is the tail process……)}
There are 4 processes, all to access a mutually exclusive resource multiple access using the above PV operation to solve the mutual exclusive access to resources.
I will help you add PV questions, interested friends can look
6. PV operation
A system is so definition P, V operation: p (s): s = s - 1; if S <0 This process is waiting for the end of the queue, it will continue to run.
V (s): s = s 1; if S> = 0 releases the process waiting for the end of the queue, it will continue to run.
The existing four processes P1, P2, P3, P4 competition uses a certain resource that needs to be mutually exclusive (each process may be repeatedly used multiple times), trying such a P, V operation to correctly realize the mutual exclusion.
For the second question: Assume that the node domain has 2: int DATA1, INT DATA2; can design node data structure: struct node1 {int data1; int data2;} struct node {structure node queen [n]; // Take it When the cycle queue is used, each time you visit a node to enter the queue INT DATA1; int DATA2;}
