Table of Contents
Part 2
Entries
Entry 1: October 10, 2012
Today in data structures, we talked about stacks. Stacks are pretty much like a linked list ecxept you can not insert or delete “nodes” from where ever you want. When you add an object it gets put at the top of the stack. And when you delete an object it takes it off of the top of the stack.
As an aid, feel free to use the following questions to help you generate content for your entries:
- pop,push
- these are the two commands to use for stacks
Entry 2: October 11, 2012
Today in discrete stuctures we went back to talking about functions. We talked about the function signature. The function signature is basically the type, return value,function name, and parameter list. The main point of the lecture was that when you declare your parameters as somthing, what ever you pass into them need to be the same type.
As an aid, feel free to use the following questions to help you generate content for your entries:
- parameter passing is significant
- parameter passing is significant because if you do not pass things into the parameters the same excact way that you declared them the program will not run.
Entry 3: October 25, 2012
Today in discrete we talked some more about recusion. We worked more on our inclass recursion program. Recursion is a good concept to learn because it can make your program be more efficient.
- recursion is significant
- it is significant because it can make your program more efficient
- What concepts are you dealing with that may not make perfect sense?
- What challenges are you facing with respect to the course?
Entry 4: October 31, 2012
Today in Data we talked about a binary tree. To navigate from left to right in a binary tree you “traverse”. You can not loop in a tree, if you do it is no longer a tree but a graph. Trees are like linked list but automatically sort.
- binary trees are signigicant
- compares inputs and traverses them to the correct side of the tree
- What concepts are you dealing with that may not make perfect sense?
- What challenges are you facing with respect to the course?
Keywords
data Keyword 2
stack pop operation
Definition
Stack is a data structure that is used to keep things in order. A stack allows adding and removing items in order. When something is added to the stack it goes to the top of the stack, and the first item added to the stack is the last item to be removed.Pop is the operation used to remove an item from a stack.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- Wikipedia
- class
- c book
data Keyword 2 Phase 2
stack underflow condition
Definition
When a command in a program tries to pop an element from an empty stack causing it to error out.
References
- http://en.wikipedia.org/wiki/Stack_(abstract_data_type)
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:
Stack A=NULL
Alternatively (or additionally), if you want to demonstrate something on the command-line, you can do so as follows:
lab46:~$ ./stack 1. to pop : 1 error stack underflow! lab46:~$
discrete Keyword 2
subset
Definition
A subset is a set which every element in the set is contained in a larger or equal size set. In other words a set with in a set.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- wikipedia
- Matt
- Class
discrete Keyword 2 Phase 2
union
Definition
Union is the combination of the elements of two sets, without any duplicates.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- “Union (computer science)” http://en.wikipedia.org/wiki/Union_%28computer_science%29
Demonstration
Demonstration of the indicated keyword.
A={1,3,5,7,9,} B={1,2,4,6,8} A U B={1,2,3,4,5,6,7,8,9}
Experiment 2
Question
Can you load windows 7 onto a macbook pro?
Resources
*http://www.digitaltrends.com/computing/how-to-install-windows-7-on-an-imac/
*http://www.zdnet.com/news/windows-7-works-great-on-the-macbook-pro/337007
Hypothesis
Based on what i have read, i think that it is very possible and easy to install windows7 onto a macbook.
All of the articles are saying to upgrade your version of bootcamp and then just follow the on screen instructions in book camp to install windows.
Experiment
I am going to test this experiment by using my macbook pro, and attempting to load my copy of windows7 onto it. I still want the ability to use mac as well, so i am going to attempt to duel boot this bitch.
Data
I preformed the experiment.
It took around an hour to complete.
I partitioned the HDD in half and used one half for windows7 and one half for mac osx.
Boot camp then asked me to put the mac os cd in to load the drivers into windows(so that i can use the hardware).
It seems to be working fine, i can choose to boot into windows or mac, when i start up the computer.
Analysis
Based on the data collected:
- My hypothesis was correct, you can install windows7 onto a macbook!
- Although windows7 is installed, some features do not work( some of the key board buttons). I also get the BSOD often.
- There may be some shortcomings in my experiment. Maybe i did not download the correct drivers(even though i used the ones provided)
Conclusions
You can most definitely load windows7 onto a macbook. It is a great idea if you like the features and security that mac provides, but also need access to the business side of computing(Microsoft office, and other common programs)
If you do not care about mac and only want to use windows i would not suggest putting windows on a macbook for a couple reasons:
1. macbooks are a lot more expensive for the hardware that you get.
2. windows7 is not as stable when loaded on a macbook with boot camp.