Sidebar
Table of Contents
Part 1
Entries
Entry 1: September 6th, 2012
- We started building a truth table program.
- This is important because I don't want to have to write this table out every time i need it
- The Problems I'm having is trying to think of the code needed to write these programs
- The challenge I currently have is trying to fit time for this course in with all my other course
Entry 2: September 13, 2012
- Started to learn VI text editor
- Vi is a lot better text editor than the highly inferior nano
- I seem to want to use the arrow keys is Vi instead of the h,j,k,l keys
- There are a lot of commands to learn in Vi that will take a lot of practice
Entry 3: September 28 2012
- trying to do the puzzle-box project
- to finish it before it is late
- trying to rearrange files so it doesn't upset my Hg repository
- trying to keep all of my courses separate from each other
Entry 4: August 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
Data Structures Keyword
Void Pointers
Definition
The void pointer is a generic pointer type. A pointer to void can store an address to any non-function data type, and, in C is implicitly converted to any other pointer type on assignment, but it must be explicitly cast if dereferenced inline.
References
data Keyword 1 Phase 2
dynamic memory allocation (malloc/free)
Definition
dynamic memory allocation is the task of allocating a free chunk of memory specific to the size you predetermine in bytes, by using the malloc function. The chunk of memory is not always in the same location hence being “dynamic” instead of static. By using the “free” function, that will release the block of memory back to the system.
References
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
- wikipedia
- class
- Reference 3
Demonstration
Demonstration of the indicated keyword.
/* * Sample code block */ #include <stdio.h> int main() { int array[10]; return(0); }
Discrete Keyword
nonconjunction/not both … and.
Definition
Definition (in your own words) of the chosen keyword.
References
discrete Keyword 1 Phase 2
left projection
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).
- wikipedia
- class
- 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$
Unix Keyword
File Compression.
Definition
involves encoding information using fewer bits than the original file. It helps reduce resources usage such as data storage space or transmission capacity. In order to use the data again though you must uncompress the file.
References
Unix Keyword 1 Phase 2
Links to Files
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.
Alternatively (or additionally), if you want to demonstrate something on the command-line, you can do so as follows:
brett@ubuntu: cd closet brett@ubuntu:~/closet$ ls robes spells skeleton brett@ubuntu:~/closet$ ln -s skeleton torch brett@ubuntu:~/closet$ ls robes skeleton spells torch brett@ubuntu:~/closet$ ls -l total 8 drwxrwxr-x 2 brett brett 4096 Aug 31 22:27 robes -rw-rw-r-- 1 brett brett 0 Sep 30 19:22 skeleton drwxrwxr-x 2 brett brett 4096 Aug 31 22:49 spells lrwxrwxrwx 1 brett brett 8 Sep 30 19:23 torch -> skeleton brett@ubuntu:~/closet$
Experiment 1
Question
How important are DLL files?
Resources
http://en.wikipedia.org/wiki/Dynamically_linked_library:
http://en.wikipedia.org/wiki/Shared_library#Shared_libraries
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.
Hypothesis
Without any .dll files, certain programs will stop functioning properly.
After downloading files, many have additional extensions in the .dll format. Without these they might not be able to function fully.
Experiment
Im going to find a simple file with .dll extensions and see what happens after I delete a few of these files one by one.
Data
- Program still runs without .dll files
- severely limited functionality
- states that certain function are missing or invalid
Analysis
Based on the data collected:
- My hypothesis was partially correct, the program still functions partially without them rather than just seizing up.
- Not getting enough data to check if it was just this program that can run without .dll files or if others can do it too.
Conclusions
The conclusion that I'm having is that although you can run certain files without there extensions, it isn't very wise. Therefor .dll files are quite important in dealing with files that need them.
