[Disclaimer] If there is any infringement, please inform the content of this blog. Non-commercial use will be deleted. If there is any infringement, please inform me and I will delete it
If the response is not timely, or do not understand, please add me WeChat island68 QQ823173334 If you can, please indicate from CSDN
I hope to communicate with you through the platform of CSDN
Keep for own use
Offline assessment of "Data Structure (Gaoqi College)"
1. Short answer questions
1. What is a rooted directed graph?
2. What is a load factor?
3. Try to analyze the advantages and disadvantages of the sequential storage structure.
4. Is the time complexity of the algorithm only related to the scale of the problem?
5. An example illustrates that the average lookup length of a hash table does not increase with the number of nodes in the table, but increases with the load factor.
Second, the picture problem
1. Let the initial sorting code sequence of the files to be sorted be {32, 38, 10, 53, 80, 69, 32, 05}, and write the state at the end of each pass when sorting using the bubble sorting algorithm.
2. The set of keywords is {16,05,28,10,09,17}, the length of the hash table is 8, the hash function is constructed by the remainder of the division method, the conflict is resolved by the linear probing method, and the keywords are in the set Insert in the order in, please draw this hash (hash) table, and find the average search length of the search success under the same probability.
Third, the algorithm problem
1. The binary tree uses a binary linked list (lchild-rchild notation) as the storage structure. Try to write an algorithm for calculating the number of leaf nodes in the binary tree (requires to write a description of the storage structure) and analyze the time complexity of the algorithm.
2. Write an algorithm for finding the number of nodes in a single circular linked list, and analyze the time complexity of the algorithm (requires to write a description of the storage structure).
