blog:spring2016:kdarling:journal
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| blog:spring2016:kdarling:journal [2016/02/12 03:20] – [January, ALL, 2016] kdarling | blog:spring2016:kdarling:journal [2016/03/17 15:22] (current) – [January-Feb, ALL, 2016] kdarling | ||
|---|---|---|---|
| Line 32: | Line 32: | ||
| who.c | who.c | ||
| and our very own chmod.c for those who did it and attempted it. Other cool features will be listed later inside the blog. | and our very own chmod.c for those who did it and attempted it. Other cool features will be listed later inside the blog. | ||
| + | |||
| + | ====March, 2016==== | ||
| + | Currently in March, we have playing more with primes and utilizing primefork, primethread, | ||
| + | |||
| + | PrimeFork.c | ||
| + | |||
| + | Contain(s) | ||
| + | Primebrutefork.c | ||
| + | Primesqrtfork.c | ||
| + | |||
| + | Primebrute utilizes our brute force method of accessing each individual number from 2 to the max number specified for that range. | ||
| + | |||
| + | Primesqrt utilizes our square root approach and lowers the number it has to search for in order to determine if it's prime. | ||
| + | |||
| + | The fork uses a process of quite literally multiplying the program itself but then the program has a check statement to make sure that the program multiplied is either the true parent or a child/ | ||
| + | |||
| + | |||
| + | |||
| + | PrimeThread | ||
| + | Contain(s) | ||
| + | Primebrutethread.c | ||
| + | Primesqrtthread.c | ||
| + | |||
| + | Primebrutethread again uses the brute force method but instead of multiplying the process and causing a ton of memory over head, instead we actually just enact a small void statement that loops until it's finished. | ||
| + | |||
| + | Like our friend fork, the thread divides up the number by using the threads given to it but like I said, it doesn' | ||
| + | |||
| + | Basically Thread -> void statement to run. | ||
| + | |||
| + | The Primebrutethread does our traditional brute force method but with divided numbers and smaller memory allocation. | ||
| + | |||
| + | Primesqrthread.c does the same thing as the Primesqrtfork.c but with less memory overhead. | ||
| + | |||
| + | |||
| + | Sockets | ||
| + | Next we have been playing with sockets and created two network like programs. | ||
| + | |||
| + | The first is timeserv.c that when you use your client/ | ||
| + | |||
| + | The second is ipaddr which returns to the user different network interfaces and the ip associated with them. | ||
blog/spring2016/kdarling/journal.1455247229.txt.gz · Last modified: 2016/02/12 03:20 by kdarling
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
