CSC148 Week 12: Last impression

      Looking back at the course CSC148, I felt that I thought of this course so hard. For the last assignment which was assignment 2, I couldn't finish the minimax part because I didn't understand tree parts. When assignment 3 came out, I started it and thought that I couldn't finish it because it was similar to assignment 2. After I started it, it was easy after I looked though slides again. All questions in the assignments were recursion but it was easy for me. I just thought of recursion of tree as putting child in children as a value so their children can be looked through again. Other parts that required recursion were easy after I used memorization. It is like helper function in a function. I can set an empty list or a set or other things and helper function that has a recursion saves values to that empty list and it keeps it until it reaches the last leaf.
      After the course, I got confidence in recursion. However, I'm still not quite confidence with LLNode even though it is similar to Tree. I'm not familiar to self.front and self.back but I'm going to study on that so I can get good marks in final. I hope the final exam will include everything I studied and I hope I can get good marks.

CSC148 Week 11: Revisiting an Earlier Slog Posting

      For revisiting my earlier Slog posting, I decided to choose week 5 Slog which is about recursion. The reason why I chose recursion Slog is that while I go through CSC148 assignments, most of them was using recursion so I learned more knowledge about recursion.

      After I read my previous post, I agree with most of it and now I learned more about the parts where I was little confused. I'm agreeing with what I described the recursion: function in a function. I learned more about that part which is to make a recursion, a code must have the same function with different variable. The variable is not actually changing but things to put for the variable is different like if a code is like Tree, then it works like some_function(child) for child in children so it can make child as a value and it keeps going until there is no child. In case of no child, we have to make a if statement with condition of no children and return some value we want.

CSC148 Week10 Slog: My impressions of week 9

      In the week 9 lecture, it was about BTNode. BT stands for Binary Tree which has only two children which are left and right. There are only two possibilities for Binary Tree children: one child or two children. We learned about BST to which means Binary Search Tree. It is similar to Binary Tree but the left child is always less than parent node and the right child is always more than parent node.
      Then in the week 9, we had term test 2. It included tree, binary tree, recursion, and linked node. For me, linked node part was hard because I didn't understand linked node more than others. For first parts, it was drawing longest and shortest binary tree. I thought I did well on that but I realized that for longest binary tree, children can be only one child so it was longer than I expected. For other parts, it was similar to lab questions so I think I did good on that parts.

CSC148 Week9 Slog: My impressions of week8

      In the week 8 lecture, it was about Linked Lists. At first, I didn't understand the concept of the Linked Lists. Term test 2 was coming in week 9 and I didn't know much about Tree too so I was scared of new concept. As I understood the concept, I figured out that Linked Lists work together with LLNode. Inside LLNode variables, there is nxt which works as children in Tree class. Then inside the Linked List class, there is two variables: front and back, which works as Binary Tree's left and right variables. Except in the Linked List class, there is self.size which determines how many nodes are there. As I thought the concept that way, it was easy to understand how Linked Lists and LLNode worked.

CSC148 Week 8 Slog: My impressions of Week 7

      Due date of second assignment was in the week 7, so I was busy that time. During the reading week, I spent some time to work on a Tippy game state and it was not that hard because there were starter code to follow. Actually it was fun for me because it worked out well as I planned. At the middle of the week7, I finished codes for Tippy game state. After that I rested for a few days and I was going to work with my group members about strategy Minimax.

     

     At first, I thought Minimax part was going to be easy like Tippy game state but it wasn't. Me and my group members didn't know what we had to do to make strategy Minimax work. As we went to lecture, we heard some hints that we need to use recursion or tree. We planned and worked but it didn't work out and we failed to work it out. At last, we handed it in with failed version. I was depressed about this but it made me determine that I shouldn't be lazy about the assignment like taking a break after one part. 

     In the week 7 lecture, we mostly focused on our assignments, and we learned about binary tree which has two children in one node. I'm not that good about tree concepts so that is what I have to study for the term test 2 on Wednesday.

CSC148 Week7 Slog

This Slog is about summary of recursion. ->Click here

CSC148 Week 6 Slog

     In this week in the lecture, we learned about Object-Oriented Programming. When I first see the lecture slides, I was really confused because it looked like biology to me. There were terms called 'tree', 'leaf', and 'node'. As the lecture goes, I understood that the Object-Oriented Programming was like family tree. Parent is top of the tree which is node and children are below parents and children who doesn't have children is called leaf. To write codes for this programming, as I see lots of codes with Tree class, all of them had same __init__ method. For other methods, we can write recursion codes or other codes that we learned throughout the lectures. These are concepts of Object-Oriented Programming.