Sidebar
Table of Contents
Part 3
Entries
Entry 1: November 27, 2012
I am getting started on the Binary Tree project. I looked into function pointers and got that all figured out. Now I just need to figure out the algorithm for inputting the queued values into the binary tree in a way that the traversal will actually print from least to greatest and so on. Also printing it in a 'tree' format will be tricky. I think once I figure it out iteratively then recursively and stack based should be easier.
Entry 2: November 27, 2012
For DataComm we setup strings and cans and managed to get a few bytes of data across them! Despite the fact that only about 1% of the data could make it through, it was still pretty cool. I would like to try to setup like a cardboard tube system and see if that transmits the sound cleanly enough for it to have a better transfer success rate. We also think that the sound may be becoming morphed, making it impossible for the receiving computer to pick it up. It was still pretty cool.
Entry 3: November Day, 2012
For Comp. Org. I got my increment working! Now that I have fully working code, I can work on the scripts that will make increment work for every possibility (every register, basically). Then I can modify increment to make a decrement. Then I can use increment and decrement for the addition and subtraction. I just wonder if it would be possible since they take command line arguments — I am planning on asking Matt. If so - then it is all go-ahead with the simulator!
Entry 4: November 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
asm Keyword 3
Addition
Definition
Addition may not seem significant - but it's a huge part of the simulator. Understanding how it would be implemented will help greatly. If increment and decrement can be called (they need command line arguments though, so not sure how that would work) then it would be a matter of incrementing the first register whilst decrementing the other one to zero. If that is not possible, however, then it will be a case of manually adding the bits together (using a loop) with an if counter for the carry. It will be very similar to the increment logic. There is also the possibility of using XOR logic to add - but there will have to be an if to take care of the carrying over.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Reference 1
- Reference 2
- Reference 3
asm Keyword 3 Phase 2
Identification of chosen keyword.
Definition
Definition (in your own words) of the chosen keyword.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Reference 1
- Reference 2
- Reference 3
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() { return(0); }
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 hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$
data Keyword 3
Tree Transversal
Definition
Tree traversal is the way that one can move around a binary tree. The method in which you move around and use the data can change what you are doing (sorting, printing from least to greatest, etc.). Because of the way that the tree works, one can do it iteratively, recursively, or stack based. The values have to be manipulated / stored outside of the tree as you traverse it, using a queue or a stack etc.
References
data Keyword 3 Phase 2
Recursion
Definition
Recursion is one technique for representing data that's size is not always known by the programmer. The implementation of recursion would be a function calling it's self in the function, there fore creating an infinite number of computations.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- class
- wikipedia
data Keyword 3 Phase 2 Phase 2
Identification of chosen keyword.
Definition
Definition (in your own words) of the chosen keyword.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Reference 1
- Reference 2
- Reference 3
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() { return(0); }
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 hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$
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() { return(0); }
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 hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$
datacomm Keyword 3
Identification of chosen keyword.
Definition
Definition (in your own words) of the chosen keyword.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Reference 1
- Reference 2
- Reference 3
datacomm Keyword 3 Phase 2
Identification of chosen keyword.
Definition
Definition (in your own words) of the chosen keyword.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Reference 1
- Reference 2
- Reference 3
datacomm Keyword 3 Phase 2 Phase 2
Identification of chosen keyword.
Definition
Definition (in your own words) of the chosen keyword.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Reference 1
- Reference 2
- Reference 3
datacomm Keyword 3 Phase 2 Phase 2 Phase 2
Identification of chosen keyword.
Definition
Definition (in your own words) of the chosen keyword.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Reference 1
- Reference 2
- Reference 3
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() { return(0); }
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 hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$
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() { return(0); }
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 hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$
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() { return(0); }
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 hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$
discrete Keyword 3
Karnaugh Mapping
Definition
Karnaugh Mapping is a method by which one can take a truth table, or an expression, and simplify it. The working example on wikipedia is VERY useful in understanding this - I would recommend drawing it all out on a whiteboard and going by step-by-step. That is how I was able to grasp an understanding of it.
I'll attach a photo as well showing how I worked through the example.
References
discrete Keyword 3 Phase 2
kleene star
Definition
Definition (in your own words) of the chosen keyword.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Reference 1
- Reference 2
- Reference 3
discrete Keyword 3 Phase 2 Phase 2
Karnaugh Mapping
Definition
Karnaugh Mapping is a method by which one can take a truth table, or an expression, and simplify it. The working example on wikipedia is VERY useful in understanding this - I would recommend drawing it all out on a whiteboard and going by step-by-step. That is how I was able to grasp an understanding of it.
I'll attach a photo as well showing how I worked through the example.
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 */ #include <stdio.h> int main() { return(0); }
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 hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$
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() { return(0); }
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 hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$
Experiment 3
Question
What is wrong with this hard drive?
Resources
Didn't collect info - just kind of winged it.
Hypothesis
According to my friend, the hard drive is dead. He says he can't install an OS onto it, but he says it can store files just fine. I find this rather weird. He said I could keep it, so I want to get it working.
Experiment
I'm going to see what's on the hard drive right now, delete everything on it, and try to install an OS onto it.
Data
I checked the hard drive - it was completely un-formatted. I installed ubuntu onto it - it checked out okay.. but when I try to boot into it, it says that there is an error reading device. Something about a name mismatch or something. Weird. Wiped ubuntu off of it… installed debian. This time I noticed it actually installed grub - maybe that's what was wrong? No way to boot it? Yes! That was it! The hard drive is bootable now. Went ahead and put Windows 7 on it for gaming (since its a faster HD). I use the slower one for work, this new one for play. Fun.
Analysis
from what I can tell, I think my friend had an issue getting the hard drive to boot because he wasn't giving it a boot partition which I think a hard drive needs. Installing grub fixed that, and then installing windows 7 installed the windows boot partition deal as well, so now the hard drive is happy. I have yet to run into the file lost horror stories he's told me about.
Conclusions
I'm happy I got a nice hard drive for free and got it to work.
