9th Slog (WEEK 12)

Mostly work were done!!! There is only Exercise 4 left before the final and it will due next week. So I am having a lazy and enjoyable weekend. However, I was actually having a blue mood a few days ago, since I failed the second term test. Most of the students did bad though, so i guess it really upseted Prof.Dan. He used the whole Friday lecture to discuss the term test questions even though he planned to talk about E4. So I felt like I should work harder for the final exam! 

This week we had a funny lab. It asked us to record the data about different types of sorting techniques. Definitely bubblesort would be the worst one and we better try to avoid using bubblesort. Interestingly, there existed different effects according to the type of data. We tested them in random data, sorted data and reversed sorted data. Then compared their consuming time. People were talktive and energetic; maybe it was the last lab!

Time to have a look at E4 and work it. Bye-bye!

8th Slog (WEEK 11)

Couldn't wait for the end of this week!!! Two tests from other courses and having the second part of Assignment 2 due this Thursday. I guess it was one of the most depressive week for me in this semester. It was so unexpected that Dan didn't decide to extend the due date of the assignment; so this assignment actually killed all of my leisure time. Even so, I still couldn't finish it, but perfect is tough and impossible for me~

This week lab was about binary trees and likned lists. It was difficult, but the Ta gave us a lot of hints and showed us the codes by words. Also, she finally decided to do the function with us. I actually pretty like this type of lab, since there were many times I cannot finish the lab, and definitely I would not try to do them after the lab. 

Sadly, the second term test is coming next week with one additional test from other course. Well, I better start to review them rather than keep complaining...

7th Slog (WEEK 10)

This week we started to learn time complexity with certain types of algorithms to determine the number of steps they take and have a comparison of runtime. In lecture, Prof.Dan began with the word Anagrams, and then provided two different approach which are permutation approach and signature approach to realize how their total work look like. Then, Big Oh notation was introduced. Contant factors and lower-order terms are not necessary in Big Oh. I felt like Big Oh proof was kinda easy to understand since it was relative to math proofs. However, I still couldn't figure out different types of time efficience.

In addition, it is great that the due date of Exercise 3 have been exteneded to this Sunday night. I did not spend too much time to figure out how to do part A of E3, but part B was tough and I spent so much time in thinking. Hopefully I can get it right today!!

6th Slog (WEEK 9)

More than half of the semester passed by, and the remaining exercise, assignment and 2nd term test are coming soon. Keep busy!!! This week, we studied BST (Binary Search Tree) for the purpose of searching a collection of data efficiently. For example, maximun and minimun values can be easily found by BST; since every node value is greater than all node value of its left subtree, and less than all node value of its right subtree. According to this characterist, we can always verify whether a BST exist or not. 

Also, the first part of A2 was due this week, and what we need to be done was to design a collection of classed to represent different sructure of regular expression trees. Honestly, I found it was pretty hard to get stared on it since I have never design a class before. And definitely the first thing I did was to check out the discussion borad to get some ideas. Overall, I thought my design was so so~ Last thing to mention, continue doing the linked list lab from last week, sick of this time...

5th Slog (WEEK 8)

This week we learned a new common data structure called linked list which made up of nodes.  A linked list is also a recursive data structure that contains head and rest. Since we all knew how the linked list should look like, I am not going to specify anymore. After the lectures and having some reading, we can probably understand how the linked list methods work and get a better comprehension of the usage of them. However, one thing that made me went crazy was the linked list lab for this week. It required us to implement the Queue ADT using a linked list. I just felt like I wasted two hours lab time since I can only inplement few of them.

One more sad thing here. I made a little mistake in the first term test about inorder traversal, and I lost the whole mark of that question! (I deserve part mark....)