User Tools

Site Tools


blog:fall2015:bboynton:journal

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
blog:fall2015:bboynton:journal [2015/11/17 05:01] – [Week Ten] bboyntonblog:fall2015:bboynton:journal [2015/12/01 04:46] (current) – [Week 11] bboynton
Line 105: Line 105:
 Coding has been going well for the most part. Not finishing display before is coming back to haunt me as I have to code it again with new functions. The idea of printing out ascii characters instead of the number values seems like it would be easy to but in. Have a if statement for forward and backwards/with or without spacing then a if for ascii or number values. No problem. Putting qty into the old code gave me some trouble as I forgot that it is ->qty=*number* and not just qty=*number*. This took me way longer to figure out then I would like. Always for getting the same things. I feel like I am doing solid work on these projects as far as the list and nodes are concerned. We are started to work on stacks now along with the list and nodes. I am scared of these as the are confusing. I think a stack is a similar to a list but we can only access it in a backwards order. I have not really had a good look at the functions that use the stacks but I am pretty sure that we can use list functions on them. Obtain insert and append all went very well for the doubly linked list. It went a lot smother then the singly list versions. This mainly do to the fact that they are like the same code. This time the I just had to worry about the priors pointing in the right place. I also ran into a slight problem with my code in that the unit test would give the functions the wrong list and then compare it to a result that was based on the right list. I do not know if this is because of my old code I did not finish.  Coding has been going well for the most part. Not finishing display before is coming back to haunt me as I have to code it again with new functions. The idea of printing out ascii characters instead of the number values seems like it would be easy to but in. Have a if statement for forward and backwards/with or without spacing then a if for ascii or number values. No problem. Putting qty into the old code gave me some trouble as I forgot that it is ->qty=*number* and not just qty=*number*. This took me way longer to figure out then I would like. Always for getting the same things. I feel like I am doing solid work on these projects as far as the list and nodes are concerned. We are started to work on stacks now along with the list and nodes. I am scared of these as the are confusing. I think a stack is a similar to a list but we can only access it in a backwards order. I have not really had a good look at the functions that use the stacks but I am pretty sure that we can use list functions on them. Obtain insert and append all went very well for the doubly linked list. It went a lot smother then the singly list versions. This mainly do to the fact that they are like the same code. This time the I just had to worry about the priors pointing in the right place. I also ran into a slight problem with my code in that the unit test would give the functions the wrong list and then compare it to a result that was based on the right list. I do not know if this is because of my old code I did not finish. 
  
 +
 +====Week 12====
 +
 +Data structures has been going well. I am quite surprised at how well really. The last couple of projects have been iffy. I think mainly because I did not give myself enough time to really work out the code step by step. I feel like my code could be a lot shorter but I understand the basics of each. Since we are nearing the end of the semester we have not really covered new topics in class. We talked about queues which I got really easy once I understood that the list was already there so I did not need to create the list each time just simply give it a pointer name. I was even able to get it done early since the due date was moved till after break. Speaking of break I wish I could say that I coded the whole time and finished the next project. I really wish I could but I can not. So hopefully I can start and finish it before the this Thursday. I feel pretty good about stacks. My understand is that it is like a opposite to queues. So instead of changing the last of the under laying list we are looking at the first then we want to add things we have to append them at the last of list and when we grab we grab from the start of the list. 
blog/fall2015/bboynton/journal.1447736460.txt.gz · Last modified: 2015/11/17 05:01 by bboynton