This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
blog:fall2015:mp010784:intro [2015/08/30 00:12] – [Week 1] mp010784 | blog:fall2015:mp010784:intro [2015/09/05 17:14] (current) – mp010784 | ||
---|---|---|---|
Line 82: | Line 82: | ||
--Matthew Page 08/ | --Matthew Page 08/ | ||
- | ======Data Structures====== | ||
- | |||
- | ====Week 1==== | ||
- | |||
- | I think I'm changing formats from writing stuff every single day to just writing a general synopsis for every week for each class to preserve my sanity.\\ | ||
- | |||
- | For data structures this week we discussed the general idea of linked lists and looked at our first project (dsi0) which is pertaining to making an array list and having a user driven menu that changes data in the array list. We also talked about pointers and nodes.\\ | ||
- | |||
- | "To achieve enlightenment you'll want to draw pictures in each stage." | ||
- | |||
- | Pointers have: | ||
- | 1) a name\\ | ||
- | 2) an address\\ | ||
- | 3) contents at address\\ | ||
- | |||
- | %%*%% - means get the contents of what's at address.\\ | ||
- | %%&%% - means give me the address.\\ | ||
- | |||
- | " | ||
- | |||
- | Node code:\\ | ||
- | < | ||
- | struct node //defining struct node | ||
- | { | ||
- | signed short int value; | ||
- | struct node *next; | ||
- | }; | ||
- | |||
- | typedef struct node Node; | ||
- | |||
- | Node *tmp; // | ||
- | struct node tmp2; //does the same thing | ||
- | |||
- | Node *tmp=NULL; | ||
- | struct node *tmp2=NULL; | ||
- | |||
- | tmp=(Node*)malloc(sizeof(Node)); | ||
- | |||
- | tmp-> | ||
- | |||
- | tmp-> | ||
- | |||
- | tmp-> | ||
- | tmp-> | ||
- | |||
- | tmp2=tmp-> | ||
- | |||
- | tmp2-value=13; | ||
- | |||
- | </ | ||
- | |||
- | |||
- | |||
- | |||
- | ======HPC Experience 1====== | ||
- | |||
- | ======Data Communications====== | ||