Object-oriented OO 5-7 homework summary
After studying OO for seven weeks, I deeply feel the unfriendliness of this course. The first three assignments can be considered to be barely passed, but from the fifth assignment, it is completely GG. These three jobs, starting from the multi-threaded elevator, then file monitoring, and then to the taxi, have not written a valid job. Therefore, it is not necessary to analyze its own program structure according to the given metric.
Fifth job multithreaded elevator
This homework is rewritten based on the third homework. I think the first two elevators are not bad, but the elevator piggyback function lacks a few judgment conditions. I think this time I can add multi-threading to run perfectly. But the actual writing is not satisfactory, each thread itself is written, but there is a serious problem in the mutual cooperation of each thread. The read-in thread is perfect and passed all the tests, but the elevator actually ran into an infinite loop. Later, it was checked that there was a problem with the control system assigning instructions to the elevator and removing the instructions after the elevator completed the task.
**************************************************** *******************Dividing line***************************** ****************************************************
The sixth job file monitoring
This homework thread personally thinks that I have mastered a lot. The main problem is about the structure of the file tree. I have no idea at all in this regard. I searched the Internet for a code about scanning files to generate a hash tree, and was sentenced to plagiarism, GG.
||||||||||||||||||||||||||||||||||||||||||||| ||||||||||||||||||||||||||||||||||||||||||||| ||||||||||||||Separation line||||||||||||||||||||||||||||||| ||||||||||||||||||||||||||||||||||||||||||||| ||||||||||||||||||||||||||
The seventh operation taxi
I found that the last two assignments were not a thread problem. Indeed, I made up my own knowledge of this aspect after I finished writing the elevator. This assignment was about how to calculate the shortest path. I didn’t see any discussion about this function in the group. , After the last painful experience, this time I didn't dare to use the operation code available on the Internet. It took a long time to write one, but it takes a long time to actually run it on an 80*80 map, which is completely unsatisfactory. program requirements.