Sidebar
Table of Contents
Part 2
Entries
Entry 1: October 11, 2012
- the need for indentation in code
- without indentation the code is significantly harder to read and check for errors
- the stack program
- trying to implement arrays into my programs without the proper knowledge needed
Entry 2: October 29, 2012
- Finishing up my opus
- So i can get ready for the opus part 3
- the concept of the stack program
- No challenges to speak of at the moment
Entry 3: October 31, 2012
- Binary Trees
- it will help with sorting anything
- The stack program is a little difficult to think about
- I have to stop trying to leave everything till the last minute
Entry 4: October Day, 2012
This is a sample format for a dated entry. Please substitute the actual date for “Month Day, Year”, and duplicate the level 4 heading to make additional entries.
As an aid, feel free to use the following questions to help you generate content for your entries:
- What action or concept of significance, as related to the course, did you experience on this date?
- Why was this significant?
- What concepts are you dealing with that may not make perfect sense?
- What challenges are you facing with respect to the course?
Remember that 4 is just the minimum number of entries. Feel free to have more.
Keywords
data Keyword 2
linked list
Definition
A linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of data and a link to the next node in the sequence; more complex variants add additional links. This structure allows for efficient insertion or removal of elements from any position in the sequence.
References
data Keyword 2 Phase 2
stack overflow condition
Definition
A stack overflow is when to much memory is used when creating a stack. when a stack is created it uses something called a push which is basically the append function in a linked list. The push will “Push” something on the stack. similar to a stack of papers the “push” puts a paper on the top of the stack. A stack overflow is when you put to many papers on the stack.
References
Demonstration
Demonstration of the indicated keyword.
If you wish to aid your definition with a code sample, you can do so by using a wiki code block, an example follows:
/* * Sample code block */ int foo() { return foo(); }
Alternatively (or additionally), if you want to demonstrate something on the command-line, you can do so as follows:
lab46:~$ cd src lab46:~/src$ gcc -o sample lab46:~/src$ ./sample Segmentation Fault lab46:~/src$
discrete Keyword 2
cycle sort
Definition
Cycle sort is an in-place, unstable sorting algorithm, a comparison sort that is theoretically optimal in terms of the total number of writes to the original array, unlike any other in-place sorting algorithm. It is based on the idea that the rearranging of things to be sorted can be factored into cycles, which can individually be rotated to give a sorted result.
References
discrete Keyword 2 Phase 2
venn diagrams
Definition
A pictorial way to compare two things and also show what they have in common, often shown with two circles overlaying each other.
References
Demonstration
Demonstration of the indicated keyword.
unix Keyword 2
quotes
Definition
A helpful tool that allows you to print characters just as you input them
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Reference 1
- Reference 2
- Reference 3
unix Keyword 2 Phase 2
variables (environment/local)
Definition
A variable is a storage location with an associated name (an identifier) which contains some known or unknown quantity or information, a value.
References
- http://en.wikipedia.org/wiki/Variable_(computer_science)
Demonstration
Demonstration of the indicated keyword.
If you wish to aid your definition with a code sample, you can do so by using a wiki code block, an example follows:
/* * Sample code block */ #include <stdio.h> int main() { int a=1, b; b = b + 3; a = a * b; printf("%hhd\n",a); return(0); }
lab46:~$ gcc -o sample sample.c lab46:~/src$ ./sample 3 lab46:~/src$
Experiment 2
Question
How can I mod my Minecraft Pocket Edition on my ipad to change my skin
Resources
Hypothesis
I will have to go into the containing level folders on my ipad and replace the current skin pack. My rational is that this file is what tells the game what the current skin is
Experiment
By plugging my ipad into my laptop I can view all the files on it. By looking in the mojang file under games directory i can find the skin file. by replacing the char.png file I can change how I look
Data
Perform your experiment, and collect/document the results here.
by downloading the skin from this website: http://www.planetminecraft.com/skin/dirtman-reloaded/download/file/1113090/ renaming the file char.png and replacing the current one with this the end result looks like this: http://i1175.photobucket.com/albums/r621/minecraftmanager/IMG_0370.png
Analysis
My hypothesis was correct and I found it is a lot easier to change things other than the skin rather easily. By just replacing a file you can change the entire minecraft world and the way it looks.
Conclusions
The world of Minecraft is easily changeable, however if you make a mistake changing the core files you could possibly lose your precious world.
