Differences

This shows you the differences between two versions of the page.

--- user:nbrimme1:portfolio:oct09 [2013/10/24 22:06] – nbrimme1
+++ user:nbrimme1:portfolio:oct09 [2013/10/24 22:41] (current) – nbrimme1
@@ Line 1: / Line 1: @@
+====October 9, 2013====
+Was in the hospital a few days. Matt went over "stacks" while I was gone. A **Stack** uses a //**F**irst **I**n **L**ast **O**ut or **L**ast **I**n **F**irst **O**ut// data structure. A **Queue** uses a //**F**irst **I**n** F**irst **O**ut or **L**ast **I**n **L**ast **O**ut// data structure. Stacks have 3 main functions:
+  - **pop()**: Removes the top element off the stack.
+  - **push()**: Adds an element to the top of the stack.
+  - **peek()**: Shows the top of the stack. It does this by poping an element from the stack then pushing the same element back onto the stack.
+Stacks also have an important pointer, top(), that always points to the top of the stack. This is sometimes called the "Stack Pointer". Matt emailed the code from class (with no comments 8-O :?: :!: :?: :!:). Also, the knowledge assessments should be finished by next week. While brainstorming ideas I realized that it might be easier to write my sortList() function using the appendNode() and removeNode() functions.
+\\
+\\
+**pop.c**
+<code c>
+#include "stack.h"
+Node *pop(Stack **myStack)
+{
+	Node *tmp = NULL;
+	if ((*myStack) != NULL)
+	{
+		tmp = removeNode((*myStack) -> data, (*myStack) -> data -> end);
+		(*myStack) -> top = (*myStack) -> data -> end;
+	}
+	return (tmp);
+}
+</code>
+\\
+**push.c**
+<code c>
+#include "stack.h"
+Stack *push(Stack *myStack, Node *newNode)
+{
+	if ((myStack -> size <= 0) || ((myStack -> data -> qty) < (myStack -> size)))
+	{
+		myStack -> data = append(myStack -> data, myStack -> data -> end, newNode);
+		myStack -> top  = myStack -> data -> end;
+	}
+	return(myStack);
+}
+</code>
+\\
+**peek.c**
+<code c>
+#include "stack.h"
+Node *peek(Stack *myStack)
+{
+	// exercise left to the implementer
+}
+</code>
+\\
+**stackops.c**
+<code c>
+#include "stack.h"
+Stack *mkstack(int size)
+{
+	Stack *myStack;
+	myStack = (Stack *) malloc (sizeof(Stack));
+	myStack -> data = mklist();
+	myStack -> size = size;
+	myStack -> top  = myStack -> data -> end;
+	return (myStack);
+}
+</code>
+\\
+**stack.h**
+<code c>
+#ifndef _STACK_H
+#define _STACK_H
+#include "list.h"
+struct stack {
+	List *data;
+	Node *top;
+	int size;
+};
+typedef struct stack Stack;
+Stack *mkstack(int);
+Stack *push   (Stack *, Node *);
+Node  *pop    (Stack **);
+Node  *peek   (Stack *);
+#endif
+</code>
+**A copy of the code is also available in the ///var/public/data/fall2013/stacks/// directory on lab46.**
+\\
+\\
+Matt also added a few new things that need to be implemented into the doubly linked list program:
+  - Add a qty variable (int) to your Linked List struct.
+  - Update linked list functions to appropriately update qty so it contains an accurate list count
+  - Add a mklist() function, in the spirit of create() function on the knowledge assessments, and a mkstack() in our stack implementation.

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools