| Week number |
Study time |
New Line of code |
Blog post Volume |
Knowledge Summary |
| 1th Week |
After class |
#define ADD_SIZE 2 typedef int DATATYPE; typedef struct LIST {DataType *data;//point to storage space Base address int size;//set current table length int max_size;////Linear table may reach maximum length, current allocated storage capacity} Seqlist; |
1 |
Sequential table |
| height= |
After school | height=
Access data element:head->next->data; Initialize head= (lnode *) malloc ( sizeof (Lnode)); P=head; p->next=null; |
1 |
single-linked list |
| 3rd week |
|
typedef int datatype; typedef struct lnode { DataType data; lnode * Prior,*next; } lnode, * linklist; |
1 |
doubly linked list |
| 4th Week |
Class and extracurricular |
/into the stack-if the stack is full then the new element e-stack void Push (Stack *s, elemtype e) {if (s->top = = MaxStackSize-1) {printf ("stack full. \ n "); Return } s->top++; S->stack[s->top] = e; Add new Element} |
1 |
Stack |
| 5th week |
After class |
50 |
1 |
Html |
| 6th week |
class and after school | TD class= "Et3" width= "237" height= "276" >void pop (stack *s, elemtype *e) {//the stack S top element pops up, Put the if ( s->top ==-1) { printf in the storage space referred to by E ("Stack is empty.") \ n "); return ; } *e= S->stack[S->top]; s->top--; }
1 |
out of stack |
| 7th Week |
In class |
void Initqueue (QUEUE *q) {Q->front = (Lnode *) malloc (sizeof (Lnode)); q->rear=q->front; Q->front->next = NULL; } |
1 |
Queue |
| 8th Week |
Class and extracurricular |
30 |
1 |
Network IP Computing |
| 9th Week |
In class |
30 |
1 |
Mid-term web design |
| 10th Week |
Class and extracurricular |
typedef struct node{DataType data;//node Information struct node *firstchild;//first child struct node *nextsibling;//next brother}cstypenode, *cstypetree; |
1 |
C-language tree |
| 11th week |
class |
void createbitree (BITREE *BT) { char ch; ch = getchar (); if (ch== ' # ') *bt=NULL; else { *bt= (binode *) malloc (sizeof (Binode)); (*BT)->data=ch; createbitree (& (*BT)->lchild); //generation 左子树 createbitree (& (*BT)->rchild); //Create right sub-tree }} |
1 |
two fork Tree |
| 12th Week |
After class |
50 |
1 |
Javascrip |
| 13th Week |
In class |
60 |
1 |
HTML page Layout |
| 14th Week |
In class |
100 |
1 |
CSS Styles |
|
Supplement Study Progress Chart
