Yahoo company C # pen Questions and answers

Question 1. (single choice)

In a computer network, the index for data transmission reliability is -- 2.

1. Transfer Rate
2. Error Rate
3. Information Capacity
4. bandwidth utilization

Question 2. (single choice)

Which of the following statements about the chain storage structure is incorrect? -- 3

1. Besides its own information, the node also includes pointer fields. Therefore, the storage density is less than the sequential storage structure.
2. Logically adjacent nodes do not need to be adjacent physically
3. You can determine the storage address of the I-th node through computation.
4. Easy operation of insert and delete operations without moving nodes

Question 3. (single choice)

Which of the following is NOT the basic operation of the stack? -- 2

1. Delete the top element of the stack.
2. Delete the elements at the bottom of the stack.
3. Check whether the stack is empty.
4. Empty Stack

Question 4. (single choice)

Which of the following statements about generalized tables is true? -- 1

1. A generalized table is a finite sequence composed of 0 or more single elements or sub-tables.
2. At least one element of a generalized table is a sub-table.
3. Generalized tables cannot be their own subtables.
4. The generalized table cannot be empty.

Question 5. (single choice)

If the first sequence of A binary tree node is A, B, C, and then C, B, And A, then the symmetric sequence of the Binary Tree node is-1

1. It must be A, B, and C.
2. It must be A, C, and B.
3. B, C, and
4. uncertain

Question 6. (single choice)

In the virtual page-based storage management solution, which part of the following completes page transfer to memory? -- 1

1. Handling of page missing interruptions
2. Page elimination process
3. Work set model application
4. Tightening Technology Utilization

Question 7. (single choice)

In the DOS system, the data structure used to record and manage disk data zone usage -- 3

1. Bit chart
2. Idle block table
3. File Allocation Table
4. File Control Block

Question 8. (single choice)

There is a link R (S, D, M), and its function dependency set F = {S → D, D → M }. Then the relational R satisfies at most -- 2