blog:fall2015:hju:journal
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| blog:fall2015:hju:journal [2015/10/12 23:42] – [October 6, 2015] hju | blog:fall2015:hju:journal [2015/12/01 00:17] (current) – hju | ||
|---|---|---|---|
| Line 46: | Line 46: | ||
| I finished sll2 today! I wish this project would been last week's project. It was much easier than last one. Less time consuming. I think it is because now I really got the concept. For obtain, the basic shape of the code was similar. I had to check 5 things: NULL, empty, one node, first node, last node and other cases. For rmlist, it was very similar to the rmnode. For clearlist, I removed nodes one at a time until the list is empty. Next was swapnode. For this function, I used a lot of obtain, append and insert. The real thing was sortlist. :-o In order to complete sortlist, I had to use arrays. I was really confused between int and char. Because the char was used for searchlist. I didn't figured out why char can be int, too. | I finished sll2 today! I wish this project would been last week's project. It was much easier than last one. Less time consuming. I think it is because now I really got the concept. For obtain, the basic shape of the code was similar. I had to check 5 things: NULL, empty, one node, first node, last node and other cases. For rmlist, it was very similar to the rmnode. For clearlist, I removed nodes one at a time until the list is empty. Next was swapnode. For this function, I used a lot of obtain, append and insert. The real thing was sortlist. :-o In order to complete sortlist, I had to use arrays. I was really confused between int and char. Because the char was used for searchlist. I didn't figured out why char can be int, too. | ||
| + | |||
| + | ====October 20, 2015==== | ||
| + | |||
| + | Awesome! I finished all of the projects that is due 28th. I was stuck on last unit test for lobtain not knowing what the problem was. Today, I figured it out. It was the [place] part in insert. I thought considering 5things would work perfectly at any circumstances. However, I considered null group, null newList. But, not null place. If place is not given, all I have to do is return as it is. This part was little bit tricky, because, I didn't have any problem with obtain function (obtaining node). I am not actually used to the gdb. But today, I saw magic running gdb that provides a lot of information. sll3 and sll4 wasn't big deal. Actually, better than sll2. So I am looking for the new project! doubly linked list! I heard that it has previous pointer in there. I think that makes my life so much easier. Because I finished all of my projects, I will walk away from the lab46 for a while. ~_~ and eventually I will come back. | ||
| + | |||
| + | ====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 ' | ||
| + | |||
| + | ====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' | ||
| + | |||
| + | ====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! | ||
blog/fall2015/hju/journal.1444693378.txt.gz · Last modified: 2015/10/12 23:42 by hju
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
