Changes made to Computer Science Minor Program..

I just received an email from the Computer Science Program saying that the minor programs will require the students to have 75% in CSC148H1..
I am confident in acquiring over 75% in CSC165, but now I am not so sure if I will be able to acquire the mark of 75%.
It even said that satisfying the mark will not guarantee the admission to it.
Applying after second or third year might work for me if I achieve above 75% from CSC207H1 and CSC236H1.
I think the work is getting harder and harder as the years pass.
The major program requires average marks of 67% from CSC148H1 and CSC165H1, or 70% from CSC207H1 and CSC236H1 after second year.
I understand why the Computer Science program is limiting the admission of Computer Science Minor students..
But I think it's quite unfair for the students whose only option to study Computer Science is to do the minor.
But again! If I get the mark above 75%, the case is solved!
Haha, so! let's study harder to get that mark!! :'(

P.S. 75% is still B, 3.0!

Skipped last week's entry T_T

Whoa, there was a 2nd term test last week.
I guess I was so panicked out that I forgot about this blog (lol excuses)
I lacked of time, and I honestly thought that it was impossible to solve them all in an hour...
But it looks like it was possible after all, it's just I didn't know how to make the code concisely yet.
I thought I was actually doing okay understanding the lecture materials, but I realized that I had to try harder than that.
As for now, final is the only chance I can make it up for.
In the lectures this week, I learned the reduce method, which I thought it was cool stuff.
The structure is hard to understand when you see it for the first time, as in coming up with how to use it without any explanations. (at least for me)
Then I went to the lab... I saw all the codes that are hard to understand and was difficult to come up with, haha.
After looking at the code for over two hours, I sort of get what those codes do.
However, now I lost my confidence again..

I still hope that I can do well in the final after doubling up my effort!

So for now! Enjoy your weekends for now! XD

Happy long weekend everybody!

Although the weekend has already been officially passed, the weekend hasn't ended yet!
Happy Remembrance day, and thank you for the opportunities you have made in North America.

After this long weekend is over, there will be my second term test for CSC148.
I need to prepare for it, and luckily, from the last lab, I feel like I have gained some understanding on the Tree node and the Linked List node.

Frankly speaking, I wasn't able to finish it by myself.. and thank you my TA for walking through the code!
I had to understand the difference in the structure of the two different nodes.
Without thinking it, I just treated the Linked List node like a Tree Node. (Obviously, the result wasn't what I wanted)

I enjoy the tutorial more than the lectures..to be honest, haha.
When I'm in the lectures, I understand everything and I know that I know those stuffs professor delivers..but then, when I start to code all by myself, nothing turns out to be what I expected.
So I am really thankful for the lab times!
and.. the reason I brought this up is.. that there are only two labs left from now..
What a shame T_T

But hey, enjoy the rest of the long weekend! and good luck to everyone who has the CSC148 term test!

After exercise 6

Okay, so after the assignment and the exercise #6..
I think I finally start to understand something at least.

First of all, Binary Search Tree seems like a better structure than just the Binary Tree.
Obviously, that must be the reason there is a separate name for Binary Search Tree.
So what is this Binary Search Tree?
The items in tree is in order.
By that means, the smaller items are located in the left children of a root, and the larger items are located in the right children.
Of course, the children have the same behavior of having smaller items in left branch, else the right branch.
I like this structure because unlike the normal Binary Tree has its values randomly everywhere, Binary Search Tree is more neat when you see it.

However, I still don't understand the use of the Tree nodes.
Yes, the Tree nodes represent the hierarchical data and it makes the data more easily searchable.
But what is the practical use of it?
Maybe I don't know this quite well because I am still in the learning stage..
Because the Wikipedia gave me an answer of a "workflow for compositing digital images for visual effects" as one of the Tree nodes' common uses.
..Just to be honest, I don't really want to know about it, haha.

P.S. Oh wow, I didn't know BST also applied to strings as well!
       Cool stuff, lol