How many Lair creatures dose it take to make a video cam move in a room unassisted by human hands

• 1.1 Matt Haas has issued a challenging concept of putting a cam on a track to move around the room to record project progress and for security reasons
• 1.2 i took the challenge as i thought it would be awesome to try and it would be on par with the makers or such as weasel-bot and the video wall

i did some research to find the hardware needed isn't hard to find but the programing required is almost nonexistent

• 1.3 i will be requiring help from presley and haas and any who will amuse me while i work with questions and problems i might encounter

you can not call a pointer before you have made it pointie and set the pointer to the pointie

• 1.4 you must use the wand of dereferencing only after you have established an element able to be pointed too.
• 1.5 you can have more then one pointer set to the same element which you can modify the element and both pointers will read the new element data.
• 1.6 you can also have a pointer point to a pointer that points to a element or another pointer.

Today is the first Friday of the first week of my 5th semester at CCC

• the action of coming early to class around surprisingly 8:45 it was empty and i was able to start basic programs for the HPC project im attempting
• clear head no distractions in a friendly familiar environment
• what concepts aren't perfect yet hell all of them but at least I'm at ease here my life been hell for the past few months
• challenges i face well not sure what a pointer is just yet or how to utilize it but i have a vague sense to what i need to do

this was the first day of week two

• i found a schematic of a bread board DC motor control unit the only problem is how to make i work for two
• Thursday i did more research and found open source code usable for the camera instead of downloading a file to run it with out knowing what is in it
• Friday i was introduced to link lists which helped me a lot to finish my programs for discrete

this was the 2nd day in the 3rd week when i got to sit down and type this so bare with it im a bit tired and grouchy i have to move my shit out of one house to another for some family and personal reason which i didn't want to do.

• Monday we discussed Double link lists and the applications and utilization.
• have to remember all the pointers must be pointing at something and it helps if each is pointing is to something different in most cases.
• you can also make this work for char and string by changing all %d to %c or %s and the variables to char instead of int or others.
• I have started a new project for HPC1 which is the measurement of power usage in the lair.
• with a Wattage monitor and a rough estimate to how much we spend for one Kilo/Watt hr which is based on 11cents

• did nothing for no one was sick

• 1.1 Monday fun with linked lists and more confusing programing i really need to review my C/C++ syn text
• 1.2 Tuesday more Opus done with HPC1 topics all objectives and most of my SysProg need to do the experiments YAY (sarcasm)
• 1.3 Thursday YAY all terms done and most have examples if you read this Matt i apologize for not all the examples being done but at the moment I'm more focused on getting some experiments done.
• 1.3.2 Thursday YAY two experiments done need to finish HPC1 experiments
• 1.4 Friday in at 8:30 feel like crap tired as hell woke up at 3:30am and went to bed at 11:30 not enough sleep might fall asleep before class and possible during

]

Fun Facts about the lair with no terminology or reason just for fun.

• Long cat is ceiling cat's apprentice and basement horse is there nemesis.

• Not-Z is a grading tool implemented by Matt to check if opus and journals are completed on time

• The cake is a lie!

• It's a trap!!

• Some one this week flipped off Einstein and broke the universal speed limit “mind=blow”

• Blue-“The door is everything that once was and ever will be the door controls happiness and sadness, anger and fear, space and time, The door can see into your mind, The door can see in to your soul!” Charlie-“The door can do all that!?!” Blue-“no.. not really”

• “ehs a pretty cool guy and dosnet afraid of anything”

• Compiler Complaint

• Password Strength

• Version control: The use of Subversion documentation and recording in a central and secure location presented to you by your employer, yourself, or a class instructor EXP. svn add “YOUR FILE NAME HERE” / svn commit -m “YOUR FILE NAME HERE” / svn update “THE DIRECTORY YOU MADE CHANGES TOO”
• Pointers: in the Use of pointers u are Referencing a known location of allocated memory in two possible ways the address or its contents EXP.

int main() {

 int *i;
 int s[];
 int i = s[i];

}

• Pointers to Pointers: These are a bit different how ever u can do it but you need to use the right pointer type or you will get a segfualt a segfualt is when a computer basically hiccups and lose all train of thought and stop running the program it was using. EXP

int main() {

 int *i;
 int *h;
 int s[];
 int *i=s[i]'
 int *h->*i

}

• Null Pointers: Null pointers are used to reference a end of a node stream or a end point in part of the program there used as return points or end points to the entire program EXP. A double link list while tmp→end next→Null
• Void Pointers: All I know at the moment about Void its self is its a empty data type. So I'm guessing a void pointer could point to both int and char with out given you much trouble. That wold be useful when having multiple data type sets with in a program that needs to be reference using 1 or 2 pointers, Instead of multiplying the number of pointers you might be able to use a void pointer instead I will need to experiment with this. EXP. See Experiment #1 Data Structures
• Function Pointers: A function pointer is nothing but a Referencing Scope to change the way the program is ran, run, or running. EXP. could think of a few but to lazy to copy and paste at the moment.
• Memory Allocation: the Use of malloc is one of the best function commands there is. As well as one of the most unique with it u are able to physically able to take or use space on your computers Ram and basically say this area is just for this program and nothing else. EXP. Doubly linked list Program for node creation.
• Memory De- Allocation: the use of Free is another unique program commands that allows you to empty and give the Ram space that you allocated for use and completely erases it and gives it back to the computer for its own use.
• Linked list: is a Node utilizing program allowing you to free your self form a array which is a predetermined size to one thats not predetermined which can be made short or longer by adding program functions how ever single linked list only use 2-3 pointers total to manipulate its data which means you can not insert or replace data that needs to be changed.
• Double linked list: is another Node utilizing program that allows you better access and can fill nodes with arrays making them larger and more expansive and in many ways more effective and efficient this linked list type always s able to if done right delete replace and insert other data with in the string of node ordered data.
• Stacks: Stacks are a structure in computer programing allowing limited access to a data base of information (not a real Data base but figuratively) Stacks are a abstract data structure following a last in first out system of data organization. EXP. i could copy and paste one but it wouldn't be one of my own work or an example of what i learned it would be from another wiki.
• Pushing:Is the way to initialize or place things into a stack which always goes on top of the stack. EXP. Don't have one yet
• Popping:is the way to take off the top thing of the stack. EXP. Don't have one yet

• User Space: users space is determined by the free space on the RAM (program workspace) user space is also defined by the user itself in what it can use and what it wants to use on a multi seat system its defined by the client and how it works with the user to meet its needs. EXP. the use of the multi seat systems in the lab are each terminal is a dummy terminal which the docking bay controls all O/I responses form the USER then ends those to the intelligent Tower which in return either decides to send back the info the user is looking for or go to another source for the information.
• Kernel Space: Kernel space is the Operating systems basic command lists and what it do for the organization of files with in the computer aka File systems and commands. EXP. UNIX/Linux uses Directories to organize its files where as Windows will use Folders
• File Access: file access is the permission of of the USER and or kernel on how to handle a file. EXP. i have viewing access to /var/public/data which allows me to copy or look at the files in side that directory but while its in that directory i an unable to make changes edit or save over those files.
• File Descriptors: these are the error in and out codes included insed of the libaries that are instlalled and used on a computer to indecate weather or not the program is running properly or not. EXP. when compling an code you often find your self a list of errors. EXP. one i becoming more farmillar with is Segmentation fualt errors which is when a a program you or some one else has written uses pointers and one of the pointrs or more then one of the pointers is pointing at the wroung position.
• Buffering: is the are of phyiscal memory that stores temp data for a short peroid of time its used to calling programs or commands when entered. EXP. when u bring up a web browser it may seem instantanius but it accutly takes a minute section of time this is what the time is between u sending the request and it appering on the screen.
• System Calls: is what happends when the system itself calls to the OS kernal for a request of service it may be for a file a program a set of commands or even some physical space on a hard wear device to start running. EXP. using Malloc to allocate memory space for a node or an array u use a system call to tell the kernal tyhis is what i want please do this and the kernal then says to teh ram free up this space using for nother but this.
• Bit Sets & Bit Masks: mostly used for netowrking poruposes these sieres of 1s and 0s are vital to the communication between computers in effort to create a network: Bit sets are a sieres of 8 1s and 0s and bit masks are the encription for the bit set usinf the ANDing system and the free unsed data space to create a encription.
• User ID & Group ID: User ID is set up for use for a single person to use his or her own directories much like a multiple users on a single system, Group ID is used for people either looking in on you or on users form the same seat array (aka the multi seat systems). EXP. Flake is one of the group ID systems it is the first set of tables in the class as you walk in.
• Links
• Device files: device files are usually object code for using I/O hard war on a computer which u should never try to mes with unless u have the proper instruction OR a lot of spare copies of that part and time. EXP the driver software for a DVD burning should be never messed with when u have sound on it will make unnerving noises.
• processes and programs: Processes are not necessarily programs but programs are always processes. Processes are either executed programs or executed commands. where as Programs are software that manipulate certain inputs that it is program to handle. EXP. run form command line top

you'll notice that u have top as a process but your programs you have open are also processes but then notice that top is a command and not a program.

• C/C++ Syn text Review and Refresher: working on it EXP. Double link list manipulation of string and chars
• Watt: Watt is a unit of measurement used to measure the flow of electrical current through a viable medium. EXP. the Standard Edison light bulb emits light when electrical current flows through a filament the power it requires is usually labeled on the top of the light bulb
• KW/H: stands for kilowatt per hour which is a measurement of electrical current into a resource for a given hour usually done with ratios. EXP. your NYSEG bill if your in NYS or your light and gas bill you will see a ratio like $0.00 per KW/H
• Motion Cam & Software: a Security system which enables a camera with the right hard wear to move around in a circle and/or up and down the software that might come with is possible something that you can control the cameras movement. EXP. Although i do not know how to work it or how it works the lairs current camera is able to take pictures stream live video feed and move up down as well as right and left
• Hobby Motor: A hobby motor is a small electrical DC motor which produces 20-60lbs of torque that i know of it runs off a 1.5 to 3.0 volt DC battery. if I'm not mistaken the floppy disk drive motors on the lair cam works on the same concept as the hobby motor just scaled way down and unable to move much more then a few ounces.
• Multi-seat systems: is a system of computer monitors which can be directly controlled by a single user for each while only using one computer tower to process and out put. EXP. the front half the Lair minus Juice box and Caprison.
• thin multi seat client: a thin multi seat client is the use of Docking Station and a single central intelligence hub to direct Traffic from multiple users and a single seat on different terminal systems working on there own things are there own speed with out causing problems to the other users. EXP the lair thin client using 4 USB toggle units to run four separate monitors to one single tower unit which in returns only deals with easy and simple I/O commands anything more involved such as compiling code or accessing the web the processor pipes it out into the central two servers which in returns sends the gooey and I/O requested.
• USB Docking Station: is essentially a I/O hub which directs traffic between key board mouse and monitor of each multi seat station to the Tower which then either deals with the simple I/O commands or pipes them to the servers. this is what makes the thin client multi seat in the lair work as well as it dose. EXP. the Docking Stations next to each terminal with the video power and USB 2.0 ports
• Documentation: vital piece of any project is recording your results process and/or explanations. EXP. Sano's Portfolio
• Upgrading: upgrading doesn't always necessarily making physical changes to a program or even a hard ware set up of a system in use some times its just updating to run on newer protocols or even making the file or hardware more efficient. EXP.
• Logging: is what a computer dose to check for changes to any of its directors files or libraries and basically sets a time stamp on them saying when it happened and when it ended. EXP. if you had ever needed to run system restore u will be giving a list of events that have occurred prior to the system restore on the computer.
• Accessibility: is a fancy way of saying this is what your able to do on this system and nothing more which also depends on the system you are using and who the super administrator is. EXP. Lair users on all the machines have there own account and password which are saved on the two servers i know of only 2 people who have administrator super rights and they are Presley and Matt which when they enter there user ID and password the servers know that they have access and rights to everything in the system no matter how critical is it to the system or how mundane the file however they are not allowed to see others users files or directors with out permission. EXP. /var/public/data i can look at everything in there but i can change any of it till i copy from its location to my home directory or a directory that is linked to my home

the current objective of the course is to get us to understand how pointers work how to implement Structures and how to use linked lists

the method I will be using to tell if I'm making progress is that for most of these early implementations I will be using them to do other assignments and if and when I understand enough to write one from near scratch which wont be for a while till then i will measure my results and record them as submitted assignments

I'm not sure what this means but so far i have been able to manipulated Characters and integers fairly well using some basic search algorithms how ever I'm finding that trying to take in command line arguments is proving and showing my apparent weak understanding of some basic fundamentals of C and C++ programing

Thew Results i have been getting and the out put is correct for most part and i been getting positive reviews but not nearly where i think i should be and I'm am failing and falling behind in the logical and understanding of what is actuality happening.

• I Did fairly well as to be expected i am still having a hard time refreshing my mind and remembering all the syn text for C and C++
• there is much room for improvement my code is command line driven not menu or gooy driven
• at this point the process of measurement is working fine and i have yet to exceed my own standards so it will remain where it is till i have a better understanding
• if i were to enhance it i would try to rewrite the entire code form standard C to C++ and make a better menu system
• the Application I'm attempting to write is a string/char manipulation library which allows the user to make changes to data if needed if i were to change it it any way i would make it into a semester long project to make a simple word processor.

At the moment I'm not quite sure what i am attempting to do in system programing but if i could tie this in with my major HPC1 project i would probably see a better reason why to read the book (i“ve read the first 2 chapters)

the method of measure i will be using is the book and the experiments i will attempt currently no experiments or projects are being done by me for this class

Unfortunately as of Tuesday September 27,2011 i have neglected this course do to my focus on HPC1 Discrete math and Data Structures hwo ever i am working on an experimental idea that i will try either Thursday afternoon or Friday morning

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?

the objective in this class is to broaden are field of knowledge and use of Linux UNIX environments to better serve are future employers where ever and whom ever they may be are selfs or others.

the method i will base my results on is the variety of projects i do and how i can improve upon the concept

Currently my Motion Room tracks cam is a research state awaiting approval to move to the prototype stage which i have no clue how to attempt Currently my Lair power usage project is on going and fairly straight forward i am on the second week of testing will be testing new systems next week

most results are promising but there are minor concerns by myself and my instructor as to the actuality software implementation for the Motion cam system and as well as the degree of power usage there is in the lab may be more then expected.

• Fairly well i believe better then i thought got farther then hoped which means my neglected System program class will most likely improve next month
• need a better understanding of electrical systems and how to operate them
• Not sure
• again not sure
• it could but it would lose sight of the broad focus to what it is use to and accustomed too.

What if i used a void pointer to point to a int then to a char with the same pointer in a single program.

Double and single linked list from Data class

I believe if u did this it would solve the problem of initialization your pointer to a certain variable type.

The reason i believe this s that void is a undetermined variable type which when pointed to one variable type to another should change with it.

I'm going to make a simple program and run it to point and print out each variable type data using a void pointer

the code Dose not let you dereference a void as a pointer

Based on the data collected:

• was your hypothesis correct? No
• was your hypothesis not applicable? Yes it was but it didn't show the result i was hoping for
• is there more going on than you originally thought? yes one short coming is that void is indeed a variable type but how ever it is suppose to be empty which has made me some one perplexed to the fact that it wont point to both int and char variable types
• what shortcomings might there be in your experiment? the lack of coding might be the problem i better if i over loaded the void variable function it might work but in this experiment i was trying to do the it the simplest way possible.
• what shortcomings might there be in your data? problems with the syn text and my rusty memory of the C language syn text

if u are to over load the void pointer u might be able to get it to point to any variable type u want with out much problem and with very little repercussion do to the fact that it is defined as a empty variable type able to manipulate other variable types with out much harm. How ever from the conclusion I've witness and hand programed is that void by itself with out over loading it will not point to other variable types at all.

What is the question you'd like to pose for experimentation? State it here.

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.

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.

How are you going to test your hypothesis? What is the structure of your experiment?

Perform your experiment, and collect/document the results here.

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?

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.

the qeustion is at what rate can a single process be performed using multiple terminals and the same process or command

past experiences have seen many different findings and one we recently noticed was the use of a xtv terminal screen to share sight of a single persons terminal.

based on what I've seen and done in the past with a small program or command running once and not continuously it will not be as difficult or as one that continues and updates periodically.

when Matt Haas first started to use the XTV environment to show us what he was doing on his terminal the delay and relay timer was set as fast as it could go and with about 10-13 people running it as is started to take up close to 90% of the CPU power on the servers and the delay times were closing in on 10 seconds per person.

I'm going to use Matt's XTV test to prove the bases that a constantly running program or command is more taxing then a simple quick command by getting people on Friday about 7 or more to run the same command line command of either top or who is less taxing then the XTV program

Perform your experiment, and collect/document the results here.

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?

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.

• 1.1 Monday leaned about function pointers worked a bit on stacks and my double linked list (i was really tired i caught most of what Matt said but not all)
• 1.2 Friday learned about queues and FIFO structure didn't get much done had to leave earlier even before discrete because of my ride home had a doctors appointment

• 1.1 Thursday I hope I get to work on some project or at least get some better ides as well as get a refresher course in C++ so im not entirely lost like I have been.

i can not recall what i did last week other then making the mistake of inheritance in a double link list manipulation by utilizing the possible code syntax as (this)start→(that)start=(this)start→(that)start→next

Monday-Absent Tuesday-Absent Wednesday-Absent Thursday-start second part of opus and finished double link list library Friday-continued work on opus, set up a new station for testing for HPC1 project, continued working on stacks and queues

Top refers to the first piece of a FILO Data Struck much like in a Stack

#include <stdio.h>
 
int main()
{
    return(0);
}

Overflow condition only occurs i believe with an array based Stacks and Queues to do there finite size of usable Data Space.

Underflow condition is a common error with using stacks and Queues with out properly filling in either the data in the array or node structure for at least one element so when you go to look at the first chunk of data there isn't one so you end up with a Underflow Condition.

/*
 * Sample code block
 */
#include <stdio.h>
 
int main()
{
    return(0);
}

LIFO refers to a last in first out Data Structure which can be be best represent by a Stack the idea of last in first out can be also compared to much of the United States Instructors system where the longer your there at one place the more likely u will keep your job even if your piss poor at it (not naming names) but there are those of them out there.

FIFO refers to first in first out Data Structure which can be represented by a Queue, the Idea of Queue are common many of use experience Queues on a daily bases in one way or another. A good example of a Queue would be a grocers check out line or a line for a sporting or even the movie theater ticket line the first there is the first served and the first one out of the line/Queue.

Queues much like stacks are used to order data and for reference quickly there are some times more efficient and more effective ways to do this but often times Queues are more practical for what the implementation is for, Such as if u wish for a FIFO Data Structure in stead of a double link list or a stack Queues are much more handy then rewriting programs or software to reference parts in a different order then what was initially intended for example when a company starts to take either take sale distributions either by volume or my name of person and i would be pissed if i went to pre-order a game in a high volume market area and not be able to get a reserve copy that i ordered before like a Joe Shmoe off the street got his before me with/out a pre-order coupon, or like when a concert or early viewing of a movie or a sport event and your first on the waiting list but some one goes to the ticket booth and buy the ticket meant for u

#include <stdio.h>
 
int main()
{
    return(0);
}

Enqueuing is how to get the Queue started and place the first chunk of data into it all others fall after/behind, and Enqueuing is how u fill nt just the first part of data into a queue but every other part as well. think of it as like a first come first serve bases.

Dequeuing is the process in which after a enqueue occurs can be used to retrieve the data that was set in but how ever it only takes the first segment of data in the Queue any other then the first other wise it would be a considered a Doublelinklist modifier.

#include <stdio.h>
 
int main()
{
    return(0);
}

overrun condition is a over run of queue line usually only happens when the Queue has been established and wont or isn't willing to take nay new data and in effect when you try to place it into the queue it just falls to the floor flailing its arms gasping for air. (using Enqueuing)

a Underrun condition is a lack of data in the queue while using the Dequeue when there is no data to retrieve. (using Dequeue)

definition: the binary tree is a sorted structure consisting of nodes Rules: No duplication nodes(aka this is not a rule i cant happen if it dose your code is busted) greater node take priority(the quintessential greater node will always take priority) there can be no more then two branches for a BINARY TREE Other uses for binary trees: algebraic notation in the forms of prefix/infix/postfix

Example of Algebraic notation in a Binary Tree Structure

                            (*)
                            / \
                         (/)   (+)
                         / \   / \
                       (6) (2)(1) (2)

Computational complexity is the statement of how much of a resource or how many resources will have to be used to solve a algorithm such as saying how many operations are in the expression of 6/2(1+2) the answer is 4 (parenthesis multiplication division addition)

the use of algorithm in an already established binary tree to find a given parameter if it doesn't exist it adds it or it returns its location.

Identification and definition of the chosen 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);
}

Identification and definition of the chosen keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

there are 3 basic types of files. They are normal, special, and directories. File properties usually range from read, wright, and execute. usually you cant execute special files or directories. cant usually write special files. properties are read write and execute.

inodes are much like nodes of preallocated memory space as well as being a pointer to a full data stream telling if its bigger then the preallocated spot the inode acts as a pointer to link the data in a one continuous on broken data stream

Data Blocks are the large sections of inodes linked together used by the file system for organization.

a condition that the flow of electrical system or processes where by the output is unexpected.

is a uninterrupted and repetitive program that concurrently runs along other programs

a reference to a file with in another file for either a description or as a header for that file to run that way it dose.

is a form of input/output processing that permits another process to continue to be processed and then transmits the input or output requested or needed

parent processes usually starts by taking in inputs and spawns other processes or calls other processing systems to either find other answers or other outputs to solve the requested command or program logic

this is considered a type of coding method or a syntactical event that happens during a programs run time where parts of code are waiting for an input from a separate process or the users input.

EXP printf(“enter a number here: “\n); scanf(”%d”, &input);

where as scanf waits for the user to enter an input

this is a coding option that allows the programmer with in the run time of the program to spawn multiple processes with in the same processes using a stepping speed time method allowed on the hard ware some CPU do not allow this becuase it can end up in a hyper thread.

hyper threading is the method of process control that allows the hardware on the computer to assign multiple processes the same work space multiple times

buffering is the hardwares way of telling the user that the data required for the next sequence of events is being gathered and processed

trying to finish the stack and queue libraries

brute force and try to get it done together

was aiming to get them all done by the 31st but it looks like i might only get 2 libraries done

the analysis of what I've done is satisfactory considering my life problems and complications with staying on task in discrete.

• I did fairly well considering i came into this month well behind.
• always room for improvement like trying to get it done before my predetermined deadline.
• well the measurement of brute forcing it for hours on end and not thinking it through.
• well if i find another measurement method I will try.

the objective idea for a power legend reference for one semester electrical use in the lair is one that can be useful in determining radicals or an influx of pricing or power usage to determine if we are over or under budget

measure all lab stations in the lair including large student projects like the lair wall or multiple powered servers.

based on the data I'm collecting as of a price of 11cents per K/W hr im currently a little over 700 dollars for all front room student terminals and the 2 large servers in the room.

• Very well only 4 more systems to test.
• always room.
• possible but upon my reflection cant think of any
• Don't know haven't had one presented to me yet
• i don't want it to change its simple compared to my other project which false into the realm of resreach and no possible way to complete with out at least 5 other people one with some CNC back round to teach me or the group

use stacks and queues to make a solitaire card game for system programing

method of doing it making a function to flip cards face up and down and using multiple manipulation of stacks and queues to run the loop to fill the field then use a stack and a queue in a continues fashion to run and be click able and usable by the user.

well this project I'm doing for system programing the solitaire game with Brian E not to be confused for Aninja. the measurement of progreess is steadily increasing due to the fact that i have my double link list done and i need to implement is the tack and queue libraries.

Fairly good considering Brian E is the only one actuality completely done with his stack and Queue libraries and i am nearing the end of mind after wards we would need to make a program to implement the game.

• 50/50
• always room for improvement like not waiting till the day before this is do to finish what i can on it.
• the measurement no becuase mine is in comparison to one of the highest achievers in class
• the course objective is fine for the most part how ever with out some lecture time i feel im at a lost and way behind where i should be i;ve read up to chapter 5 in the SYSPROG book but still dosnet seem to be enough

What is the question you'd like to pose for experimentation? State it here.

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.

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.

How are you going to test your hypothesis? What is the structure of your experiment?

Perform your experiment, and collect/document the results here.

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?

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.

What is the question you'd like to pose for experimentation? State it here.

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.

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.

How are you going to test your hypothesis? What is the structure of your experiment?

Perform your experiment, and collect/document the results here.

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?

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.

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:

Whose existing experiment are you going to retest? Prove the URL, note the author, and restate their question.

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.

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?

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?

Publish the data you have gained from your performing of the experiment here.

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?

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).

• i had a minor awakening to my problems understanding pointers stacks and nodes i have no revised many of my poorly constructed programs and functions and not they run almost perfectly
• this is significant do to the fact i now have the ability to right better more effective code for the remainder of the semester
• Stacks and Queues are more of a pain then i first thought and have decided to stop doing them till i have a better understanding and more time to try them out
• the best challenge i have at the moment is the binary search tree i have the insert and fill functions done i am currently working on the delete and search
• i have also begun a 3 week long journey into resuscitating my home desktop after the RAM fail and then the CPU my Mother board basic BIOS kicked the bucket and when purchasing a new mother board found that my RAM i had was not the proper type

• i hit a wall with my computer recently when i went to buy a new mother board i could not find the proper socket or RAM system so i was forced to find a correct socket type and a upgrade in RAM
• becuase till now for 45 yrs my computer was perfect ran like a clock and never gave me a head ache or in this case wallet pains
• the concept that a Mother Board BIOS would go bad with out any warning
• this is a HPC type project and in so i am exploring the innards of my PC and diagnosing the problems in which it has

• VACATION STARTS WEDNESDAY, this has no dealing with the courses but i need and i know others need this break to catch the fuck up on things even Brian Ewanyk is looking worn out
• this is significant do to the fact i will be able to catch up most likely in doing the project for Joe's class and the stacks and queues for Matt's class
• the concept of discrete math in programing is the most confusing i understand its in there but its highly unlikely to promote usage on a wide scale
• well now that i have time to focus on stacks queues and one of the 2 projects for Joe i can now most likely get help via IRC and be able to understand what its looking for

• i final finished the coding for stacks and hoping it will work when compiled and ran on Friday i don't plan to work on it till then since i have the rest of my opus and few my projects to finish
• this is significant since now all i need to do if it works is to finish queues and then i will have 3 projects for sysprog done 6 for Data Structures and 4 HPC the best I've ever done which in the big picture is kinda sad and pathetic.
• the concept that makes the least amount of since at the moment is the alphabetical sorting algorithm
• pick one anyone numerous i feel like iI'm running out time and i have a lot left to do thus why instead of working on projects for HPCV im working on my EOCE's and my Opus

Definition: Hash tables are used to reference the location of large chunks of related Data or info to the subject the Hash table its self represents.

Example:

Hash table count bases base2|base8|base10|base16

0     0      0     0
1     1      1     1
      2      2     2
      3      3     3
      4      4     4
      5      5     5
      6      6     6
      7      7     7
             8     8
             9     9
                   A
                   B
                   C
                   D
                   E
                   F

the act of insertion is just a basic way of say fill in a node structure with values of some kind

Example int main(Node *root,Node *next,Node *prev) {

       Node *tmp;
       int input;
       printf("please enter a value to add to the binary tree: ");
       scanf("%d", &input);
       tmp=root;
       while( input != -1)
       {
               if (tmp == NULL)
               {
                       tmp=(Node *) malloc (sizeof(Node));
                       tmp->value=input;
               }
               else
               {
                       if (input > tmp->value)
                       {
                               tmp=tmp->next;
                               if (tmp == NULL)
                               {
                                       tmp=(Node *) malloc (sizeof(Node));
                                       tmp->value=input;
                                       tmp=root;
                               }
                       }
                       else
                       {
                               tmp=tmp->prev;
                               if (tmp == NULL)
                               {
                                       tmp=(Node *) malloc (sizeof(Node));
                                       tmp->value=input;
                                       tmp=root;
                               }
                       }
              }
       }

removal of a node from a binary tree is difficult how ever a search function is not as difficult Definition Search in binary tree: transverse the tree by greater or less then comparison till you end up at your destination Definition removal in binary tree: “freeing” the node's selected value and removing the entire tree around to make sense with out losing and nodes that are still desired. Example

       Node *tmp,*tmp2,*tmp3,*tmp4;
       tmp=root;
       int choice,flag=0;
       while(input != -1)
       {
               if(input > tmp->value)
               {
                       while(tmp->value < input)
                       {
                               tmp=tmp->next;
                               tmp4=tmp->next->next;
                               if(tmp->next->value == input)
                               {
                                       printf("%d is the number your searching for, enter 1 to delete or 0 to skip deletion: \n", tmp->value);
                                       scanf("%d", &flag);
                                       tmp=tmp4->prev;
                                       tmp2=tmp->prev;
                                       if(flag == 1)
                                       {
                                               while(tmp2->prev->prev != NULL)
                                               {
                                                       tmp3=tmp2->prev;
                                                       tmp2->prev=tmp3->next;
                                                       tmp3->prev=tmp->prev;
                                                       tmp3->next=tmp->next;
                                                       tmp4->prev=tmp3;
                                                       tmp->prev=tmp->next=NULL;
                                                       free(tmp);
                                               }
                                       }
                               }
                       }
               }

definition: a sorting algorithm is a process with in a program that compares to a set standard or rules

Example the binary tree requires a algorithm to sort the numbers by greater than or less than and then keeps that comparison going till it finds a place to set the entered value

Definition: a selection statement is a basic algorthm that requires a true or flase answer in the binary environment or a greater to or less then for the natural environment.

Example: Natural selection and the food chain is a basic natural selection algorithm just as an if statement in comparison of two or more variables, or a while loop with a condition statement

Definition: a Graph by definition is a set or intersecting edges aka a system to compare or show information or data

Example:

the binary search tree is the best example of a greater then or less then graph and its simple to understand but difficult to implement.

these are equations that measure the practicality of algorithm based on its simplicity and complexity simple to read complex to implement.

definition: bubble sorting to my understanding is a swap in and out sort that will take one values or place and swap it with another to make corrections or to change a pattern if desired.

Definition: by definition insertion sort algorithms work by inserting a variable one at a time in a single D list or array.

Definition: Quick sorting is the method that when u take the average or a set number of varible list lengths and start sorting them by length not by relevance its going to run more quickly and smoothly.

Conceptually, a merge sort works as follows

 1. If the list is of length 0 or 1, then it is already sorted. Otherwise:
 2. Divide the unsorted list into two sublists of about half the size.
 3. Sort each sublist recursively by re-applying the merge sort.
 4. Merge the two sublists back into one sorted list.

Merge sort incorporates two main ideas to improve its runtime:

 1. A small list will take fewer steps to sort than a large list.
 2. Fewer steps are required to construct a sorted list from two sorted lists than from two unsorted lists. For example, you only have to traverse each list once if they're already sorted (see the merge function below for an example implementation).

ALL INFO ABOVE FOR DEFINITION IS BY WIKIEPIDIA

Identification and definition of the chosen 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);
}

Identification and definition of the chosen keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

a server socket is a end point and access point to communicate bidirectional to a server for either for information or just Data it is monitored and limited by user access administrator access or a roots access in hopes of not causing to much chaos and problems usually a server sockets are used for lagre programs or an Internet protocol or a website(which this can be ran off a simple computer not a server)

a client socket is an end point where the data is either received or transmitted via an CLI request not an automated response like a server socket now there are some server sockets that require a CLI input or request but then it would be a server client system where you are managing your server and not automating it

a Unix Domain socket or IPC socket is an end point to where request either form a server socket or a client socket is orginized and some times processed and moved along to its destination or back to its transmission

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

Identification and definition of the chosen keyword. Substitute “keyword” with the actual 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);
}

Identification and definition of the chosen keyword. Substitute “keyword” with the actual keyword.

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$ 

State the course objective; define what that objective entails. this months objective was to finish the opus and to do the binary tree

State the method you will use for measuring successful academic/intellectual achievement of this objective. completion and ability to run is the to measure successfulness.

Follow your method and obtain a measurement. Document the results here. its complete and i have used it twice and runs correctly

Reflect upon your results of the measurement to ascertain your achievement of the particular course objective.

• How did you do?

i did well

• Room for improvement?

always able to im prove but i cant see one

• Could the measurement process be enhanced to be more effective?

more checks and more people to test it

• Do you think this enhancement would be efficient to employ?

yes to be tested by more people and more times proves the effectiveness

• Could the course objective be altered to be more applicable? How would you alter it?

don't know of one and didn't alter anything

State the course objective; define what that objective entails. to finish the stuff

State the method you will use for measuring successful academic/intellectual achievement of this objective. if i get it done

Follow your method and obtain a measurement. Document the results here. still going

Reflect upon your results of the measurement to ascertain your achievement of the particular course objective.

• How did you do?

doing well

• Room for improvement?

always

• Could the measurement process be enhanced to be more effective?

breakdown instead of true or false

• Do you think this enhancement would be efficient to employ?

yes

• Could the course objective be altered to be more applicable? How would you alter it?

maybe don't know

State the course objective; define what that objective entails.

State the method you will use for measuring successful academic/intellectual achievement of this objective.

Follow your method and obtain a measurement. Document the results here.

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?

What is the question you'd like to pose for experimentation? State it here.

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.

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.

How are you going to test your hypothesis? What is the structure of your experiment?

Perform your experiment, and collect/document the results here.

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?

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.

What is the question you'd like to pose for experimentation? State it here.

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.

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.

How are you going to test your hypothesis? What is the structure of your experiment?

Perform your experiment, and collect/document the results here.

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?

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.

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:

Whose existing experiment are you going to retest? Prove the URL, note the author, and restate their question.

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.

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?

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?

Publish the data you have gained from your performing of the experiment here.

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?

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).