Introduction

Taking a journey through the world of programming, stubbing along the road of discovery.

Data Structures Journal

(Get and Set Positions) 10-7-14

    int pos = getpos(mylist,tmp);
    node *tmp2;
    tmp2 = setpos(mylist, pos-1);
    tmp2 -> next = tmp -> next;
    (*tmp) -> next = NULL;
    mylist -> aty --/
    return(mylist);

10-23-2014

Was given a few lines of code, which we were given the challenge to draw a picture of what the output should be.

10-30-2014

Was given a in-class test/assessment project to see what we have learned through the previous weeks, nothing to major.

11-4-2014

Went over stacks and linked lists. Main thing we had learned was what a stack is, which is just a form a linked list.

11-18-2014

Today was the first time we had talked about trees, along with the different types of trees. Also having another project given to us designed to test our abilities on using a tree.

Portfolio

First set of notes. (Tue Sep 2,2014)

Went over a new project for, just for kicks.

Started to play with the class chat.

Went over this:

screen -ls if “no socket” –>screen

irssi /server irc /join csci / lab46

———

* POINTERS *

———

int a; (pointers are used to show were everything is located)

Spent a little time learning the differences between 32 bit and 64 bit systems.

int a; (gives you a part of memory) int b; (also give you the amount you want but it might not be the one right aft$

int *c; (*- dereferencing operator)

Pointers are the same size but we can choose how much memory we want. int a=5; int *c; c=&a;

Pointers are no more than just stomething that contains an address to something$

int *g=(int*)malloc(siveof(int)*4) Went over a new project for, just for kicks.