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.
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.
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.
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:
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:
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:
State their experiment's hypothesis. Answer the following questions:
Follow the steps given to recreate the original experiment. Answer the following questions:
Publish the data you have gained from your performing of the experiment here.
Answer the following:
Answer the following: