Differences

This shows you the differences between two versions of the page.

--- blog:fall2015:hju:journal [2015/10/29 02:42] – hju
+++ blog:fall2015:hju:journal [2015/12/01 00:17] (current) – hju
@@ Line 53: / Line 53: @@
 ====October 28, 2015====
 So now we are learning about doubly linked list! The good thing about doubly linked list is that now I can use the pointer that points to the before node(prior). Also, the new thing is that now the return type has changed. Now I have to return the status which is expressed as hex value. We did this kind of return when we did 'compare'. I didn't started the project yet. However, I assume it wouldn't be so different from the projects that we did before.
+====October 29, 2015====
+I got some error when I try to assign value to the newnode. I thought I just had to do
+*(newNode) -> VALUE = info;
+However, it gave me error. I should find out today. Other than that, I think this is fine start.
+Since I didn't finish the mknode, I wasn't able to start cpnode. Of course I am done with rmnode.
+====November 5, 2015====
+ugh... I forgot to do make submit for dln0. So I did it today. However, I was pressing upward arrow key for doing my project, I accidently submitted dll1. Oh, well.. I don't care. I will submit once again whenever I finish my project. So far, I finished rmlist, emptylist and obtain. Not so hard. It was similar to what we did with singly linked node. Just adding prior pointer.
+====November 11, 2015====
+I finally finished my dll1. I was really scared of swapnode and sortnode. However, I think I did well. Actually, I had problem with compare. I wasn't able to assign values to the difference. However, the problem was solved. I forgot to put pointer there. Other than that, I had swapnode issue. I didn't think of the case where I have to swap the first and the second node in the list. Because of the error, I couldn't do anything for the sortnode. But, Matt found the error for me. :) So nice. Now, I have to deal with dll2 and stack. I forgot the name of the project.. However, it looked fun. I can't wait to be started! dll2 was just adding qty values to the lists, I assume. Last time when I was dealing with qty values, it took me about half hour to finish. I was so proud of myself :P So I guess dll2 won't be so challenging..
+====November 18, 2015====
+It was matter of pointers!! @_@ I had hard time figuring out the pointers that are all over the place. Returning status code wasn't hard. Dealing with double pointers was harder. So I completed the dls0. Stacks are fun and easy. It is because there are only top pointer and size. I didn't know that I had to make things up for the cpstack and pop function. I actually figured out by myself by making one more if statement.
+else if( (*node) == NULL )
+By adding this line into the code, I recognized that all successful cases fell in to this if statement. Smart way to check it. :) Another part that made trouble was removing the thing that I made. Because I didn't recognize it earlier, I lost all my bonus points.. T_T... But not a big deal, I will shoot for it during the break.
+====November 30, 2015====
+I finished dlq0. It wasn't hard because it was similar to the last project. Queue was just time consuming project. Now I really got the concept of the pointer, address and so on. I can't wait for the last project eoce!

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools