It's hard to believe another Midterm is already upon us, and I have made it my goal to very well on this coming midterm. It will cover binary search trees, complexity, and sorts. All of which I had no trouble understanding.
My only worry is:
1. the fact that I have been able to find very few previous midterms, to give me any kind of an idea as to what the next exam will look like.
2. Recursion rears its head again, although I have been able to write a few recursive functions, it takes me quite some time to write it, and I fear I might run out of time on the exam.
My only worry is:
1. the fact that I have been able to find very few previous midterms, to give me any kind of an idea as to what the next exam will look like.
2. Recursion rears its head again, although I have been able to write a few recursive functions, it takes me quite some time to write it, and I fear I might run out of time on the exam.
With respect to recursion, try developing some steps of how to approach a generic problem: 1) how many base cases are needed? 2) how many sub-problems need to be solved recursively (e.g. bt - left & right)? 3) What amount of work needed to be done at this level (e.g. compare? create a node and return it?)
RépondreSupprimerThese kind of predefined steps makes you organized and efficient during exam.
Good luck!
C'est beau de voir qqn qui parle le francais! estce que cest ta premiere langue?
RépondreSupprimerMine's English so if my French is sketch my bad haha