======Part 3====== =====Entries===== ====Noshavember 9, 2011==== Here we are in November......guess i'm a little behind with my projects......need to figure out how to implement stacks and queues into my program so that I will have one program that uses all the different functions needed for the 7 minimum (it's going to end up using ALOT more than that) that way I only have to write one "main.c" instead of having to write a minimum of 7 "main.c".....hopefully i'll end up getting hit by a stroke of genius and i'll be able to blaze through my work and be able to write my opus without too much of an issue. Balancing work and class is still proving to be a bit challenging but hopefully i'll be able to pull through and scrape by with a C in this class.....but with only one class with Matt it makes it hard to figure out how to write 300 words each week........that's probably my weakest part in this class......that and just remembering to do the thing.....i wish i still had my laptop up and running that way i could just use that during my free time at school when i DO remember about this.....but as the holiday season continues and as work hires more people (giving me less hours because of it) i may be able to use the extra free time effectively and productively for this class.....keep missing the official class time because of my inability to keep track of time.....but in my mind atleast i'm making it up by staying through SysProg all the way through to Joe's class (which is kind of my way of insuring that i'll go to his class since there's next to no urge to skip his class while i'm already down here) ====Nofapvember 13, 2011==== Well it looks like I'm REALLY behind because i STILL haven't figured out how to properly implement the 4 stacks and 4 queues i need for my projects and they learned about Binary Trees this week......so that's ANOTHER thing to add to my ever-growing to-do-list....../sigh i wonder if i'll ever catch back up.......hopefully next weekend i'll be able to get everything caught back up......i really should be able to catch up with like 90% of the week off from work.....at the same time Skyrim just released Friday and that's been the only thing on my mind this entire weekend.......hopefully that doesn't take up all my free time this week.......still facing the issue of not having a laptop and pretty much borderline NEEDING one by being a computer science major......I know i need to find out how to work in 2 binary trees, a graph, and a hash table.......those are the oddest things to try to work into my program......plus i need 1 more thing for file I/O because i can just use the one thing from last sem for my freecell program......actually now that i think about it i can instead of making it freecell i can make it shuffle the deck and then "draw" the top, we'll say 20 cards for argument's sake, then display using a graph the amount of each value upto 4 obviously.......that's actually a great way to use it......because i would end up getting stack, graph, file I/O and maybe a queue if i do the display portion properly.......that's 4 requirements in one go.......not too terrible and that's using an old program.......i may be able to just pull this off if i do it right. ====Movember 27, 2011==== Another Week and no progress made........work keeps dragging my motivation down......looks like i'm gonna have to pound out not only this entire Opus but 90% of these projects in the up coming weeks......no break for CoD or Skyrim or even Reddit........Hopefully i can not end up procrastinating like usual and get atleast the opus done........atleast i know what my keywords are going to be on.......I really need to check the syllabus to see if the keywords have a minimum word count on them or not.......Also i need to study the keyword section for the proper format for them......only one hundred out of three hundred words.......dang.......i really hate this minimum word count at times........it can be really hard to think of 300 words for an entry when i've done no work......granted the final few ones shall be easier since i plan on making 3 more entries so i have 7 total entries versus the minimum 4 making each entry only 100 words needed.....If only i could stop procrastinating for a week or two so i don't end up having to do 80% of this semesters work in 1-2 weeks......knowing my luck that's just how it's gonna happen.......he should be announcing the end of course experience soon......i really need to find out when he's going to post it and what is required on it.......because that's the last thing i need to not meet the deadline for......hopefully some of the stuff he has us do for that will also count towards our requirements on the course because i am still stuck as to how to use a hash table for this class.....Oy i hope i can figure something out soon ====December 4, 2011==== like.....zomg i didn't have a weird name for the month this time.......i kinda ran out of ideas for the months for December.......and i'm actually doing a Opus entry the date i posted it as?!?!? what blasphemous work is this......yes that's right i'm finally kicking myself into high gear......i only have this week and finals week to have all of my work for Data done so i can hopefully pass the class.....tonight i shall work on atleast 6 of the keywords......hopefully i can get all 12 done before the night is up......i have 3 hours to kill......i should have plenty of time......worst case scenario.....i finish them up in class ====December 5, 2011==== Got no work done yesterday.......hopefully i should get the keywords done tonight......also done with the experiments since i can avoid going tomorrow........so due to that it allows me to spend all day (especially since i have the day off from work too) on my EoCE.......i should get Palindrome done.....as well as the string correcter-thingy.....and maybe my hash table and graph that i need done......those being noble goals i REALLY hope i can get them accomplished.......since i have the entire day i should be able to get more than just that......but knowing my luck and skill in procrastination i most-likely will only get that done.....but here's to hoping ====December 6th, 2011==== well ain't this a kick in the teeth.......i can't connect to lab46 through putty......guess i have to reboot my computer and go into linux so i can write the programs and be ready to just ssh into lab46 once i get everything sorted out after some messing around to update my linux......and then problem after problem of trying to do stuff like login to this very site.......SUCCESS!!!.....partly......still can't SSH to lab46......but atleast i can still code my stuff for my EoCE got distracted and decided to work on PrimeNumber but i am get the error "/tmp/ccIA1epd.o: In function `main': PrimeNumbers.c:(.text+0x82): undefined reference to `sqrt' collect2: ld returned 1 exit status " when trying to sqrt the input......why does taking the easy way have to be so hard? =====Keywords===== ====Computational Complexity==== Computational Complexity is a part of the theory of computation. It pretty much classifies computational problems according to difficulty and relates classes to one another. ====Big-O, Theta, Bounds==== Big-O notation is used to show time complexity Theta is used to show a asymptotically tight bound Bounds are used as both Upper and Lower bounds which are just subsets that are greater-than or equal to/lesser-than equal to respectively to the main set ====Sorting Algorithms==== a sorting algorithm is an algorithm that places the input into a certain order for the output ====Selection Sort Algorithm==== Selection sort algorithm has a time complexity of O(n^2) making it inefficient for large lists.....how it works is it runs through the entire list finding the lowest value, then it switches that place with the first position........then runs through to find the next lowest value......rinse and repeat for the entire list. ====Bubble Sort Algorithm==== Bubble Sort Algorithm steps through the input comparing adjacent pairs each time and swapping them if they are in incorrect order (the lower one is the latter one). Each full interation causes one less swap needing to happen because of the higher value of the iteration being placed at the next highest position ====Insertion Sort Algorithm==== Insertion Sorting Algorithm is used by taking a value and placing it into its approximate place. ====Quick Sort Algorithm==== ====Merge Sort Algorithm==== ====Binary Search Algorithm==== ====Binary Trees==== ====Graphs==== ====Hash Tables==== =====data Objective===== ====Objective==== State the course objective; define what that objective entails. ===Method=== State the method you will use for measuring successful academic/intellectual achievement of this objective. ===Measurement=== Follow your method and obtain a measurement. Document the results here. ===Analysis=== Reflect upon your results of the measurement to ascertain your achievement of the particular course objective. * How did you do? * Room for improvement? * Could the measurement process be enhanced to be more effective? * Do you think this enhancement would be efficient to employ? * Could the course objective be altered to be more applicable? How would you alter it? =====Experiments===== ====Experiment 1==== ===Question=== What is the question you'd like to pose for experimentation? State it here. ===Resources=== Collect information and resources (such as URLs of web resources), and comment on knowledge obtained that you think will provide useful background information to aid in performing the experiment. ===Hypothesis=== Based on what you've read with respect to your original posed question, what do you think will be the result of your experiment (ie an educated guess based on the facts known). This is done before actually performing the experiment. State your rationale. ===Experiment=== How are you going to test your hypothesis? What is the structure of your experiment? ===Data=== Perform your experiment, and collect/document the results here. ===Analysis=== Based on the data collected: * was your hypothesis correct? * was your hypothesis not applicable? * is there more going on than you originally thought? (shortcomings in hypothesis) * what shortcomings might there be in your experiment? * what shortcomings might there be in your data? ===Conclusions=== What can you ascertain based on the experiment performed and data collected? Document your findings here; make a statement as to any discoveries you've made. ====Experiment 2==== ===Question=== What is the question you'd like to pose for experimentation? State it here. ===Resources=== Collect information and resources (such as URLs of web resources), and comment on knowledge obtained that you think will provide useful background information to aid in performing the experiment. ===Hypothesis=== Based on what you've read with respect to your original posed question, what do you think will be the result of your experiment (ie an educated guess based on the facts known). This is done before actually performing the experiment. State your rationale. ===Experiment=== How are you going to test your hypothesis? What is the structure of your experiment? ===Data=== Perform your experiment, and collect/document the results here. ===Analysis=== Based on the data collected: * was your hypothesis correct? * was your hypothesis not applicable? * is there more going on than you originally thought? (shortcomings in hypothesis) * what shortcomings might there be in your experiment? * what shortcomings might there be in your data? ===Conclusions=== What can you ascertain based on the experiment performed and data collected? Document your findings here; make a statement as to any discoveries you've made. ====Retest==== If you're doing an experiment instead of a retest, delete this section. If you've opted to test the experiment of someone else, delete the experiment section and steps above; perform the following steps: ===State Experiment=== Whose existing experiment are you going to retest? Prove the URL, note the author, and restate their question. ===Resources=== Evaluate their resources and commentary. Answer the following questions: * Do you feel the given resources are adequate in providing sufficient background information? * Are there additional resources you've found that you can add to the resources list? * Does the original experimenter appear to have obtained a necessary fundamental understanding of the concepts leading up to their stated experiment? * If you find a deviation in opinion, state why you think this might exist. ===Hypothesis=== State their experiment's hypothesis. Answer the following questions: * Do you feel their hypothesis is adequate in capturing the essence of what they're trying to discover? * What improvements could you make to their hypothesis, if any? ===Experiment=== Follow the steps given to recreate the original experiment. Answer the following questions: * Are the instructions correct in successfully achieving the results? * Is there room for improvement in the experiment instructions/description? What suggestions would you make? * Would you make any alterations to the structure of the experiment to yield better results? What, and why? ===Data=== Publish the data you have gained from your performing of the experiment here. ===Analysis=== Answer the following: * Does the data seem in-line with the published data from the original author? * Can you explain any deviations? * How about any sources of error? * Is the stated hypothesis adequate? ===Conclusions=== Answer the following: * What conclusions can you make based on performing the experiment? * Do you feel the experiment was adequate in obtaining a further understanding of a concept? * Does the original author appear to have gotten some value out of performing the experiment? * Any suggestions or observations that could improve this particular process (in general, or specifically you, or specifically for the original author).