1. In a relational database, the logical structure of the data stored in the database istwo-dimensional tableMainly.
2. The meaning of ASCII code isAmerican Standard Code for Information Interchange.
3. There is no algorithm that can determine whether an infinite loop will occur for any program and corresponding input data. Therefore, any compilation system does not perform infinite loop testing.
4. ∧ = and丶∨ = or 丶¬ = negation.
5. Using comparison as the basic operation, the minimum number of operations to find the smallest number among N numbers isN − 1.
6. G is a non-connected simple undirected graph with a total of 28 edges, then the graph has at least9a vertex.
[In a connected undirected graph, if there are n vertices, there are n(n – 1) / 2 edges (similar to a handshake problem). A non-connected simple undirected graph must have 28 edges, which is at least larger than a connected undirected graph. The 8 vertices in are 9
7. The address bus width between the CPU and memory of a certain computer is 32 bits (bit). This computer can use up to4GBof memory. [2^32B = 4GB]
8. If the height of the root is 1, the height of a complete binary tree with 61 nodes is6.
[The height of a complete binary tree is the number of nodes, which is the number of log nodes, rounded down and plus 1]
9. Assume that the calculation time of an algorithm is expressed as the recursion relationship T(n) = T(n – 1) + n (n is a positive integer) and T(0) = 1, then the time complexity of the algorithm isO(n2).
T(N) = T(N – 1) + N
= T(N – 2) + N – 1 + N
= N (N + 1) / 2
=O(N2)
10. A graph with n vertices and e edges uses an adjacency list storage structure, and the time complexity of depth-first traversal and breadth-first traversal operations is both Θ(n + e).
11. In the application of data compression coding, the Huffman algorithm is a method that usesgreedyThe algorithm of thought.
12. In a Huffman tree, the number of leaf nodes is 1 more than the number of non-leaf nodes. [N0 = N2 + 1]
13. There are two pointer fields in the doubly linked list, llink and rlink, which point back to the predecessor and successor respectively. Suppose p points to a node in the linked list, and q points to a node to be inserted. Now it is required to insert q before p, then it is correct. The insertion isD.
D. p->llink->rlink = q; q->rlink = p;q->llink = p->llink; p->llink = q;
15. There are total binary trees of different shapes with 5 nodes.42Kind.
[Cattleya tree: A binary tree with N nodes has (2N)!/(N!*N!)/(N+1) different forms]
16.A(n,m) = n! / (n – m)!
17.C(n,m) = n! / m!(n – m)! = C(n-1,m) + C(n-1,m-1)
18. For an ordered singly linked list of length n, if the probability of retrieving each element is equal, then the average retrieval length of any element in the list is sequentially retrieved. (n+1)/2 .
19. The complete graph with n vertices has a total of C(n,2) Edge.
20. A graph with an odd number of edges forming a simple circuit satisfies m >= n^2 / 4 + 1. [Toland's theorem]
21. In the plane, if the edges of the graph do not intersect, m <= 3n – 6 is satisfied. [Euler's formula]