-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmodule-3-programming-assignment.html
241 lines (174 loc) · 4.92 KB
/
module-3-programming-assignment.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
<!doctype html>
<html>
<head>
<meta charset="utf-8">
<title>CMPS 260: Module 3 Programming Assignment</title>
<style>* { font-family: monospace; }</style>
<script>
// NOTE: You must implement the data structures using the no prototype approach.
// This is what the book uses, so you can copy it.
// See also: https://it.pointpark.edu/tutorials/no-prototype-vs-prototype/
// NOTE: Please review the following links regularly:
// https://it.pointpark.edu/tutorials/arrays-vs-objects/
// https://it.pointpark.edu/tutorials/no-prototype-vs-prototype/
// https://it.pointpark.edu/tutorials/implementation-vs-interface/
//--------------------------------//
// The linked list data structure //
//--------------------------------//
console.log("The linked list data structure");
// 1. Suppose you have an array with 1,000 elements and a linked list with 1,000
// elements. For both data structures, you want to retrieve the last entry.
// Does one data structure complete that operation before the other (i.e.,
// is it faster)? If yes, how much faster? If no, why does it take the same
// amount of time?
//Answer: A linked list should be faster becasue it doesn't have to traverse
//the entire array.
//------------------------//
// Creating a linked list //
//------------------------//
console.log("Creating a linked list");
// We are going to implement the linked list data structure described in the
// book. Instead of using 'let' we use 'var' everywhere. Note that this
// implementation does not use the prototype (see homework). Here is a skeleton
// that we will work on completing:
function LinkedList() {
// helper class
var Node = function Node(element) {
this.element = element;
this.next = null;
}
// store length and head
var length = 0;
var head = null;
this.append = function(element) {
var node = new Node(element);
var current;
if (head === null) { //first node in the List
head = node;
} else {
current = head;
while(current.next) {
current = current.next;
}
current.next = node;
}
length++;
};
this.remove = function(element) {
// remove a specific element from the list
// ...
};
this.removeAt = function(position) {
if (position > -1 && position < length) {
var current = head;
var previous;
var index = 0;
if (position === 0) {
head = current.next;
} else {
while (index++ < position ) {
previous = current;
current = current.next;
}
previous.next = current.next;
}
length--;
return current.element;
} else {
return null;
}
};
this.insert = function(position, element) {
if (position >= 0 && position <= length) {
var node = new Node(element);
current = head;
var previous;
index = 0;
if (position === 0) {
node.next = current;
head = node;
} else {
while (index++ < position) {
previous = current;
current = current.next;
}
node.next = current;
previous.next = node;
}
length++;
return true;
} else {
return false;
}
}
this.toString = function() {
// overwrite the default toString method
var current = head;
var string = "List: ";
while (current) {
string += current.element + (current.next ? " -> " : "");
current = current.next;
}
return string;
};
this.indexOf = function(element) {
var current = head;
var index = -1;
while (current) {
if (element === current.element) {
return index;
}
index++;
current = current.next;
}
return -1;
}; //end of indexOf()
this.isEmpty = function() {
return length === 0;
};
this.size = function() {
return length;
};
this.getHead = function() {
return head;
};
this.print = function() {
// print to the console
console.log(this.toString());
};
}; //end of function LinkedList
// create a linked list to operate on
var list = new LinkedList();
list.append(25);
list.append(30);
list.append(46);
list.append("hello world");
list.append(99);
list.append("pino noir");
list.indexOf(99);
list.size();
list.toString();
list.insert("malbec");
list.toString();
list.isEmpty();
list.
// 1. Write pseudo code (meaning; use comments) to describe how you would
// implement the append method. HINT: What two scenarios can you distinguish?
/*
pseudo code
*/
// 2. Translate your pseudo code into actual code and test it.
// HINT: Use list.print() to test your code.
// 3. Repeat (1) and (2) for insert.
// 4. Repeat (1) and (2) for removeAt.
// 5. Repeat (1) and (2) for remove.
// 6. Repeat (1) and (2) for indexOf.
// 7. Repeat (1) and (2) for isEmpty.
// 8. Repeat (1) and (2) for size.
// 9. Repeat (1) and (2) for getHead.
</script>
</head>
<body>
See console!
</body>
</html>