lolol 发表于 2012-10-8 18:43:42

EE2008 Quiz


lolol 发表于 2012-10-8 21:03:35

第一题是prove big O
第二题是calculate the order of growth
第三题是write a program such that it returns to the reference of min。value a tree

Locket_J 发表于 2012-10-9 20:23:43


lolol 发表于 2012-10-10 13:39:37

qn 3 is either bts deletion or wrte program such that it returns to reference minimum value of tree

nuubie2244 发表于 2012-10-10 13:43:36

everybody got the same paper? hahaha!
monday ppl damn sian. lololol

nuubie2244 发表于 2012-10-10 13:44:22

ya. qn3 just note that min value is always on left sub tree. ^^

power_123 发表于 2012-10-10 16:47:22

谢谢分享~ 听起来好像考题都一样的。。。XD

lolol 发表于 2012-10-10 17:26:17

回复 6# nuubie2244

    isn't this only true for binary search tree

lwt 发表于 2012-10-10 20:10:48

I heard my friends said they got big o, summation and algorithm bst too so is it standardlize?

lolol 发表于 2012-10-10 20:21:12

回复 9# lwt
the big o and summation qns are similar but different in terms of variables and values

nuubie2244 发表于 2012-10-10 20:28:07

回复 8# lolol

    yes. u are right. qn3 is specifically asking on bst.

lolol 发表于 2012-10-10 20:44:02

is it bst deletion or finding e minimum value of binary tree??

lolol 发表于 2012-10-10 20:54:45

回复 11# nuubie2244
i heard the bst qn is on bst deletion

nuubie2244 发表于 2012-10-10 21:07:49

qn 3 is find min. value in bst.

the solution is found under bst deletion chapter.

lolol 发表于 2012-10-10 21:29:23

本帖最后由 lolol 于 2012-10-10 21:33 编辑

回复 14# nuubie2244

its only a few lines right???

lwt 发表于 2012-10-10 23:35:14

Think should be qte short...
So heaps not tested right?

lolol 发表于 2012-10-11 07:43:22

回复 16# lwt

    yup...heaps not tested only till bst deletion

duomeng 发表于 2012-10-11 15:01:16


messi99 发表于 2012-10-11 22:55:45


shunni 发表于 2012-10-11 23:17:29

第一题是prove big O
第二题是calculate the order of growth
第三题是write a program such t ...
lolol 发表于 2012-10-8 20:51

xie xie
页: [1] 2 3
查看完整版本: EE2008 Quiz