Week 10 Term Test 2
We didn’t learn too much thing
just extension of Binary Search Tree this week because of the big event: term
test 2!
- Term test 2
1. Preparation
Before term test 1, I spent a bunch of time on slides and lecture examples,
and the most practice I did was on the past tests, which maybe emphasized
differently from this term. Although I did exercise in labs, I didn’t rewrite
it. Hence, I lacked a lot of exercise on key points. When I was doing term test
1, I found a number of problems were familiar with lab’s examples. However,
what made me regret was I didn’t value labs that much, and even didn’t correct
my answers with professor’s. Therefore, due to thinking from beginning, I wrote
slowly, and I could not make sure whether my answers was correct. Gradually, I
lost my confidence and testing strategies. Awful time arrangement and
self-doubt emotions lead to my unnormal behavior in term test 1.
Consequently, I learnt a lesson from test 1. This time, revising and
rewriting lab’s exercise cost my majority of reviewing time. I found redoing
labs not only stimulated me apply what I learnt into real problems, but also
helped me solidify and obtain better understanding of lecture knowledge. What’s
more, I did not give up to review other materials because of labs. I still
distributes reasonable time to lecture slides and others.
2.Behavior during the test
“No pains, no gains.” Based on hard practice and deep understanding on
previous labs. For last two main parts, writing codes, I did really well. The
second question really resembled to the example I copied on the cheat paper, so
I finished rapidly. Although there is no similar examples to the last question.
I have already mastered the LinkList through lab exercise. There is no doubt
that I addressed this problem smoothly.
Nevertheless, what surprised me was I was stuck on the first question! I was
confused about the definition on branching factor. When I checked after the
test, I realized that I had an entirely wrong impression on branching factor.
The branching factor is the max number of children for any node, which means
any nodes’ children number cannot exceed this branching factor. More
specifically, branching factor is a bound and a tree does not has a exactly
number as is branching factor. However, I thought branching factor was the max
number of children of one of the nodes.
The test asked me that suppose we have a tree of height 3 with a branching
factor of 3, the least number of nodes this tree would have is____?
Because of the incorrect understanding in definition, I answered 5. I
thought at least one level of three has 3(branching factor) children, and other
two has one. (3+1+1 = 5) The correct answer is 3(e.g. the root, with a right
children that also has a right children).
Maybe I focus too much on labs and lecture examples, but ignore the basic
simple definition.
3. What I learnt from this test
In the final, I will pay more attention to the basic definition, even
detailed knowledge. On account of test strategy, I will do my best to calm my self
down during the test and allocate time reasonably. As to preparation, I think
practice enough is the most important!
- Reaction on classmate’s slog
Yahui Liu was in a same dilemma as mine in term test 1. I want to
没有评论:
发表评论