Note that this paper is more difficult due to the fact that it is from C and not java. i have previously printed wrongly, but decided to go on with it since the concepts are the same. My answer maybe not be correct, so u might wanna comment on it
1) c
2) unsure
3) d
4) a
5) c
6) d
7) c
8) b
9) b (not sure)
10) i thought it was b but junkai make me think that it has no answer
7 件のコメント:
hmmm i put answer as C for question 9 initially, but i think b may be more specific if we see it as 2 unconnected graph then it will satisfy the the statement vertices that it can reach.
Yoyo.. I preferably think that Q(9) is b. & for Q(5), i would think is b eh as it changes to the bigger num which is '6', double check ya.. '
Then for Q(8), how come is d?
Lastly, i don understand Q(1), hee.. need explanation, hehe.. >.<
Jia you o guys!!
ne~ daphne~ u very sotong leh..
1) the different between b and c is q5 is the position of 1 and 2, can u check again?
2) for qns 8, my answer is b, where got d?
I have all the same except qs5 which my ans is the same as Daphne... When 15 is deleted, 1 is moved up to the top, then compare 1, 13 n 9, 13 will go up, then 1 will be at the left subtree, afterwhich, compare 1, 5 n 12, 12 will go up, then i will be at the right subtree, then compared 1, 6 n 2, 6 will go up and 1 will be at the left subtree. My vote goes to ans b.
For qs9, I think we have to confirm if graph-traversal can have unconnected graph or not, if yes, then b will be e ans if not c will be.
For qs10, I have the same thing as u all... no ans...
BFS: A B C D E G F H
DFS: A B E G C D F H
Topological: A B C D E F H G
For qns10, i gotten c as my ans >.<
shufen and dap , why u move 1 up hmmmmm..... the right subtree will not be affected at all what only the left needs to bubble, i think the method u use is for bst delete lor
ok hmmm after reading the notes i think i am wrong ahahahha
コメントを投稿