无标题

[tonylovesstudy-blog]

CSC148 S last SLOG

We are in Final period now! We are going to take CSC165 Final exam tomorrow, it really took me and my group members quite a lot time to review this course. I am quite familiar with Big O and Omega, Proof by contradiction and contrapositive, etc. Since I got 89% in the CSC165 midterm, and satisfied Quiz results, I am confident to get 90% in the Final grade! Wish me good luck, LOL!

I am going to have 4 exams next week, and two on Monday! I am working so hard on these four reviews, I am sure everybody does hard on reviewing.I believe the grade you get is directly proportional to how hardworking you are! Therefore, wish everybody the best, and get the grades you deserved! Fighting!

[tonylovesstudy-blog]

Week 12 SLOG

The last week of this semester, the topics of this week are ‘hash tables’, ‘tracing code’, and ‘aliasing’. These contents are not that hard. The most thing I care about is the Final Exam. It will be held on April 26th. CSC148 is the last Final I will deal with, and it is the only exam in that week, which means I have quite enough time to review all over the contents of the whole semester again.

We are going to start the Final exam next week, hope all of us can get the best score we deserved!

[tonylovesstudy-blog]

Week 11 SLOG

This week, we learned several kinds of sorting methods, like quick sort and merge sort. I am quite confused what is the different among these sorts at the first time. But I am clear now after checking the website: “http://www.sorting-algorithms.com/”. This website shows the animation of these sorts, and it really does help for me to understand. And I also read the codes of different sorting methods, especially quick sort and merge sort on the slides. The codes seem so straightforward, merge sort is like splitting the sequence into two parts, and calling itself (recursion), until the sequence only contain one number, then just combine the sequences together to become a sorted sequence which has the same size as the original one. Quick sort is like using the first number as a pivot, and putting all the number smaller than it to its left, and bigger ones to its right. Then calling itself (recursion), to compare the first number on the left part, and right part. Return the new sorted list which consists of these three parts. That’s about sort.

We already learned big O in the CSC165 class last week. If there is two algorithm to solve a problem, and n is the size of the sequence, we can sketch the time of the problem solving along the increasing of size, n. If n gets large enough, we can see clearly on the graph that which one is solving faster than the other.

We are quite busy this period, we got crazy many assignments, quizs, tests, and problem sets from all subjects. I am full-loaded this semester, but I am confident I can schedule my time well to do well in all my 6 subjects.

[tonylovesstudy-blog]

Week 10 SLOG

This week we got to know the use of log in computer science, we started to know several kinds of sorting, and how can we speed up the algorithm.

The assignment 2 this semester is about puzzle solving. There are four puzzles, like Sodoku, MNPuzzle. We need to write four kinds of extensions which are the list of the puzzles after moving only one step. The most important part is depth first search and breadth first search in puzzle tool. These two search method is about searching the correct solution to the puzzle, and append it to the stack or deque, and sorting the solution from tracing from children to the top of the tree after solving the puzzle. It is not only about solving the puzzle. After we use all list to contain the seen nodes, we find the order of items in list is random, it may take much more time when the list gets much longer. But, if we use dict, then the current node is the key in the dict, all its extensions would be its answers. That would save many steps to search whether there is the duplicate node.

[tonylovesstudy-blog]

Week 9 SLOG

This is the test week, I am ready for the test 2. I was late for the last test, and I never been late for the test, so I didn’t know actually I got extra time after other people submit their papers. Therefore, I took 30mins to finish 50-minute-test. Luckily, my score is over average, but I am not quite satisfied. This time, I would try my best.

 I finished two sample test posted on the course website. All the contents in the test 2 are Linked list, Linked list node, Binary tree, Binary search tree, three orders like in-order. The most important part is recursion, I love recursion, and I can run recursion by my brain, it’s quite interesting. Wish me good luck!

[tonylovesstudy-blog]

Week 8 SLOG

We have learned Binary Tree this week.

I ran the Tree Burst Function, it impressed me, because all the showing method of data is numbers and letters, it is the first time for me to see the image-like thing in Pycharm. It made me obssessed with Computer Science.

Binary Tree is really fun. All the parents only have no more than two children. So the diagram would be much clearer than the normal trees, which its parent may have infinite number of children. And we knew about the preorder, postorder, inorder and order level about the Binary Tree, it is the search order of the Binary Tree.

I love CS

[tonylovesstudy-blog]

Week 6 SLOG~

We finally started to learn RECURSION, I do love this part. Although sometime, I don’t understand how the recursion codes run only by running it in my mind, I am fond of writing and reading recursion code. Because the recursion code is not like the normal loop, it is repeating calling itself. So, the variable would be running different over and over again, the you need to sum them all or max them to find the biggest one. It is really fun to me.

The recursion this week is not difficult as expected. Like finding the max number in the nested list , “[14, 7, [5, [3, 17, 1], [2, 4], 6], 9]”. We need to use isinstance to find whether the item is list or integer, because only if the item is integer, we can compare it to the current max number. If the item is not integer, it must be a list, then we use for loop, which is “for x in list”, and call the self function to compare the the numbers in x. If the item is integer, just return the max numbers. Finally every list will return its max number, then returning max[ the max number from each lists] will be good.

I am quite interesting in studying recursion, I am looking forward to have some more difficulties about the recursion.

[tonylovesstudy-blog]

Week 5 SLOG

We kept on studing linked list, and starting to learn stack. I did know stack and queue in the high school. So, I know the basic knowledge about the Stack. It is just the “LIFO” typo, which means the last item added into the Stack will be the first out the Stack. We also get Sack, it is just little different with Stack, that it output the item in random order.

Also, assignment 1 has been posted. After this week, reading week is coming, and I would come back to my mother country - China. I’ve a while leaving from China, I am really looking forward to go back home. Meanwhile, I need to facetime with my partner who will be over 10 thousand kilometers away from me.

[tonylovesstudy-blog]

Week4 SLOG

This week, we learned parenthesization, it is really important to balance the parenthesization. I think we should really take care of this in exam, coz it is not like coding on the computer, if the parenthesization is not balanced, it will be red- underlined immediately. So, it would be quite easy for us to balance.

In addition, linked list and node really took me a long while to understand. The annotated note really helped me, especially Prof.Heap’s drawing of Linked List. And I found that linked list and node helped a lot in programming. After I previewing the later knowledge of the following week, understanding node and linked list well can do help to learn more quickly and better later.

[tonylovesstudy-blog]

Week 7 SLOG - Recursion

From last week, we got to study ‘Recursion’. In the beginning, I thought it would be easy due to the easy example given by Prof. Heap, and it made the coding much more straightforward. But things didn’t get well for a long time, soon, I found it was hard to understand how the code ran, because you should jump back to the first line of the function over and over again, and let it return 1 or something. So far, we just use ‘max’, ‘sum’ in the if-else sentence to finish the code of the recursion. 

We really don’t meet this difficulty back from CSC108, but as an improved class, we ought to have greater challenge. And I am ready for this. Assignment 2 is posted, my partner and I had decided to start doing it in this weekend. Good luck to us!

[tonylovesstudy-blog]

Jun148slog

This is the third week that I’m studying CSC148. As I already took CSC108 last semester, so it feels not that hard so far. I was familiar with the UI of Wing, thus it actually took me a while to get used to Pycharm.

The lab of last week was quite good, although there were insufficient computers for everyone, fortunately there was a guy who was willing to share with me. My TA is very nice, he provided some good suggestions for me to solve the problem. Also the quiz of the last ten minutes was fine. To be honest, I don’t have that extraordinary talent in programming, but I am seeking improvements through hard-working. Therefore, I am confident that I will do well on this course. Looking forward to have more deep dig in CS world.