forked from aaronbloomfield/pdr
-
Notifications
You must be signed in to change notification settings - Fork 228
/
Copy path02-lists.html
786 lines (686 loc) · 23.4 KB
/
02-lists.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
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
<!doctype html>
<html lang="en">
<head>
<meta charset="utf-8">
<title>CS 2150: 02-lists slide set</title>
<meta name="description" content="A set of slides for a course on Program and Data Representation">
<meta name="apple-mobile-web-app-capable" content="yes" />
<meta name="apple-mobile-web-app-status-bar-style" content="black-translucent" />
<meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no, minimal-ui">
<link rel="stylesheet" href="../slides/reveal.js/dist/reset.css">
<link rel="stylesheet" href="../slides/reveal.js/dist/reveal.css">
<link rel="stylesheet" href="../slides/reveal.js/dist/theme/black.css" id="theme">
<link rel="stylesheet" href="../slides/css/pdr.css">
<!-- Code syntax highlighting -->
<link rel="stylesheet" href="../slides/reveal.js/plugin/highlight/zenburn.css">
<!-- Printing and PDF exports -->
<script>
var link = document.createElement( 'link' );
link.rel = 'stylesheet';
link.type = 'text/css';
link.href = window.location.search.match( /print-pdf/gi ) ? '../slides/reveal.js/css/print/pdf.scss' : '../slides/reveal.js/css/print/paper.scss';
document.getElementsByTagName( 'head' )[0].appendChild( link );
</script>
<!--[if lt IE 9]>
<script src="../slides/reveal.js/lib/js/html5shiv.js"></script>
<![endif]-->
<style>.reveal li { font-size:93%; line-height:120%; }</style>
</head>
<body>
<div class="reveal">
<!-- Any section element inside of this container is displayed as a slide -->
<div class="slides">
<section data-markdown><script type="text/template">
# CS 2150
### Program and Data Representation
<p class='titlep'> </p>
<div class="titlesmall"><p>
<a href="http://www.cs.virginia.edu/~mrf8t">Mark Floryan</a> ([email protected])<br>
<a href="http://www.cs.virginia.edu/~asb">Aaron Bloomfield</a> ([email protected])<br>
<a href="http://github.com/uva-cs/pdr">@github</a> | <a href="index.html">↑</a> | <a href="./02-lists.html?print-pdf"><img class="print" width="20" src="../slides/images/print-icon.png" style="top:0px;vertical-align:middle"></a>
</p></div>
<p class='titlep'> </p>
## Lists (and a bit more C++)
</script></section>
<section>
<h2>CS 2150 Roadmap</h2>
<table class="wide">
<tr><td colspan="3"><p class="center">Data Representation</p></td><td></td><td colspan="3"><p class="center">Program Representation</p></td></tr>
<tr>
<td class="top"><small> <br> <br>string<br> <br> <br> <br>int x[3]<br> <br> <br> <br>char x<br> <br> <br> <br>0x9cd0f0ad<br> <br> <br> <br>01101011</small></td>
<!-- image adapted from http://openclipart.org/detail/3677/arrow-left-right-by-torfnase -->
<td><img class="noborder" src="images/red-double-arrow.png" height="500" alt="vertical red double arrow"></td>
<td class="top"> <br>Objects<br> <br>Arrays<br> <br>Primitive types<br> <br>Addresses<br> <br>bits</td>
<td> </td>
<td class="top"><small> <br> <br>Java code<br> <br> <br>C++ code<br> <br> <br>C code<br> <br> <br>x86 code<br> <br> <br>IBCM<br> <br> <br>hexadecimal</small></td>
<!-- image adapted from http://openclipart.org/detail/3677/arrow-left-right-by-torfnase -->
<td><img class="noborder" src="images/green-double-arrow.png" height="500" alt="vertical green double arrow"></td>
<td class="top"> <br>High-level language<br> <br>Low-level language<br> <br>Assembly language<br> <br>Machine code</td>
</tr>
</table>
</section>
<section data-markdown><script type="text/template">
# Contents
[Standard Library: vector](#/vector)
[C++ Templates](#/templates)
[Stacks](#/stacks)
[Queues](#/queues)
[Abstract Data Types: Lists](#/adts)
[Standard Template Library: string](#/string)
</script></section>
<section>
<section data-markdown id="vector" class="center"><script type="text/template">
# Standard Library: vector
</script></section>
<section data-markdown><script type="text/template">
## Standard Library
- C++ package that implements standard data structures
- `vector `
- Replacement for C++ built-in array
- Array problems:
- Can't be copied with =
- Does not have a notion of capacity
- No index validity checking
- `string`
- Replacement for C-style strings (array of characters)
- C strings (char array or char*) cannot compare correctly with ==
</script></section>
<section data-markdown><script type="text/template">
## Vector: a "growable" array
- `#include <vector>`
- Operations:
- Object & operator\[\](int idx): no bounds checking
- Object & at(int idx): does do bounds checking
- int capacity() const
- void reserve(int newCapacity)
- int size() const
- void clear()
- bool empty() const
- void push_back(Object e)
- void pop_back()
- const Object & back() const
- const Object & front() const
</script></section>
<section data-markdown><script type="text/template">
## Iterators
- iterator
- Nested type that represents *position*
- STL's `vector` provides:
- iterator begin()
- iterator end()
- iterator methods
- itr++, ++itr // moves forward
- itr--, --itr // moves backward
- *itr //returns ref to obj at itr loc.
- itr1==itr2 // true if same location
- itr1!=itr2 //true if different location
</script></section>
<section data-markdown><script type="text/template">
## Vector iterator usage
- Assume you have a vector defined as:
```
vector<int> v;
```
- Then you can iterate as follows:
```
for ( vector<int>::iterator it = v.begin();
it != v.end(); it++ )
cout << *it << endl;
```
- Note that it looks much like `int` code with the various operators overrides!
</script></section>
<section data-markdown><script type="text/template">
## Iterators (cont'd)
- Vector operations that require iterators
- iterator insert(iterator pos, const Object &x)
- iterator erase(iterator pos)
- iterator erase(iterator start, iterator end)
</script></section>
</section>
<section>
<section data-markdown id="templates" class="center"><script type="text/template">
# C++ Templates
</script></section>
<section data-markdown><script type="text/template">
## Templates
- Java
- Uses inheritance to write type-independent code
- Or generics
- C++
- Uses templates (which is what generics were based on)
- function templates
- class templates
</script></section>
<section data-markdown><script type="text/template">
## Function Templates
- Not an actual function
- A pattern for a function; expanded by compiler as needed
- Example (source code: [findMax.cpp](code/02-lists/findMax.cpp.html) ([src](code/02-lists/findMax.cpp)))
```
// Return the maximum item in array a.
// Comparable objects must provide operator<
template <typename Comparable>
const Comparable & findMax (const vector<Comparable> & a) {
int maxIndex = 0;
for( int i = 1; i < a.size(); i++ )
if( a[ maxIndex ] < a[ i ] ) // note the use of '<'
maxIndex = i;
return a[ maxIndex ];
}
```
</script></section>
<section data-markdown><script type="text/template">
## Example, continued
Source code: [findMax.cpp](code/02-lists/findMax.cpp.html) ([src](code/02-lists/findMax.cpp))
```
#include <iostream>
#include <vector>
#include <string>
#include "IntCell.h"
using namespace std;
// findMax() defined here
int main() {
vector<int> v1(37);
vector<double> v2(40);
vector<string> v3(80);
vector<IntCell> v4(75);
// intervening code omitted for space reasons...
cout << findMax(v1) << endl; // ok: Comparable = int
cout << findMax(v2) << endl; // ok: Comparable = double
cout << findMax(v3) << endl; // ok: Comparable = string
cout << findMax(v4) << endl; // Illegal: no operator<
return 0;
}
```
</script></section>
<section data-markdown><script type="text/template">
## findMax() Expanded
What the compiler is doing with the findMax() function template...
(no external source code)
```
const int & findMax(const vector<int> &a) {
/* body of function template */
}
const double & findMax(const vector<double> &a) {
/* body of function template */
}
const string & findMax(const vector<string> &a) {
/* body of function template */
}
const IntCell & findMax(const vector<IntCell> &a) {
/* body of function template */
/* this is where the error is, but it is not in your
code, exactly -- it's in the code the compiler
expanded from your code */
}
```
</script></section>
<section data-markdown><script type="text/template">
## Class Templates
- Similar to function templates, but for classes
- Not an actual class
- But instead a pattern for a class
</script></section>
<section data-markdown><script type="text/template">
## ObjectCell Template Class
Source code: [objectCell.h](code/02-lists/objectCell.h.html) ([src](code/02-lists/objectCell.h))
```
#ifndef OBJECTCELL_H
#define OBJECTCELL_H
template <typename Object>
class ObjectCell {
public:
ObjectCell(const Object & initValue = Object())
: storedValue(initValue) {}
const Object & getValue() const {
return storedValue;
}
void setValue(const Object & val) {
storedValue = val;
}
private:
Object storedValue;
};
#endif
```
</script></section>
<section data-markdown><script type="text/template">
## Using ObjectCell class template
Source code: [objectCellMain.cpp](code/02-lists/objectCellMain.cpp.html) ([src](code/02-lists/objectCellMain.cpp))
```
#include <iostream>
#include "objectCell.h"
using namespace std;
int main() {
ObjectCell<int> m1;
ObjectCell<double> m2(3.14);
m1.setValue(37);
m2.setValue(m2.getValue() * 2);
// ...
return 0;
}
```
</script></section>
<section data-markdown><script type="text/template">
## Templates Miscellaneous
- Templates can have more than one parameter
```
template <typename Keytype, typename ValueType>
Map<string,Date> birthdays;
```
- Can have non-type parameters
```
template <typename Object, int size>
class Buffer{};
```
- Can have default values for the template parameters
```
template <typename Object=char, int size=4096>
class Buffer{};
```
- But non-type parameters must be compile-time constants
```
Buffer<> buf1; // Buffer<char,4096>
Buffer<int> buf2; // Buffer<int,4096>
Buffer<string,2048> buf2; // Buffer<string,2048>
```
</script></section>
<section data-markdown><script type="text/template">
## STL usage
- You may use any STL class during this course, with the following restriction:
- Unless otherwise specified, you can ***NOT*** use an STL data structure which is the purpose of the lab
- So you can't use `hash_map` for the hash lab, for example
- Typically, people use:
- `vector` throughout the course
- `string` throughout the course
- `stack` in pre-lab 3 and in-lab 3 (but *NOT* post-lab 3)
</script></section>
</section>
<section>
<section data-markdown id="stacks" class="center"><script type="text/template">
# Stacks
</script></section>
<section data-markdown><script type="text/template">
## Stacks
- List with restrictions
- Insert, delete, and find can only be performed at one end (the 'top') of the list
- LIFO: Last In, First Out
- Attributes
- top of stack
- Fundamental operations (all constant time)
- Push: insert at the top
- Pop: delete from the top
- on empty stack causes exception
- Top: examine top of the stack
- on empty stack causes exception
</script></section>
<section data-markdown><script type="text/template">
## Stack Applications
- Undo operation in programs
- Operator precedence
- Symbol balancing (i.e., parenthesis matching)
- Postfix calculators
- Activation records: list of active procedures and associated information
</script></section>
<section data-markdown><script type="text/template">
## Stack Applications: Symbol Balancing
- Read characters to end of file
- If opening symbol, push onto stack
- If closing symbol
- If stack empty, then error
- Else pop stack
- If popped symbol is not corresponding opening symbol, then error
- If at EOF and stack not empty, then error
</script></section>
<section>
<h2>Stack Applications: Symbol Balancing</h2>
<p> </p>
<code>{ ( [ ] ) }</code>
<p> </p>
<code class="fragment">{ [ ( } ) ]</code>
<script type="text/javascript">insertCanvas();</script>
</section>
<section data-markdown><script type="text/template">
## Stack Applications: Postfix Calculator
- For each input token (number or operator):
- If number
- Push number onto stack
- If operator
- Apply operator to 2 numbers popped from stack, then place result on stack
- After end of input, there should be exactly one number left on the stack
</script></section>
<section>
<h2>Stack Applications: Postfix Calculator</h2>
<p> </p>
<code>6 5 2 3 + 8 * + 3 + *</code>
<script type="text/javascript">insertCanvas();</script>
</section>
<section data-markdown><script type="text/template">
## Stack Applications: Activation Records
![Activation record image](images/02-lists/stack-activation-record.png)
</script></section>
<section data-markdown><script type="text/template">
## Stack: Linked List Implementation
- Singly linked list
- Push: insert at front of list
- Pop: remove element at front of list
- Top: examine element at front of list
</script></section>
<section data-markdown><script type="text/template">
## Stack: Linked List Implementation
(no external source code)
```
#include "StackNode.h"
// assumes a stack of ints stored in StackNodes
class Stack {
public:
Stack(); // constructor
~Stack(); // destructor
bool isEmpty() const; // checks for empty
void push(int value); // push value onto stack
void pop(); // pop top of stack
int top() const; // returns topOfStack
private:
StackNode *head; // like a ListNode...
};
```
</script></section>
<section>
<h2>Stack: Linked List Implementation Diagram</h2>
<img src="images/02-lists/stack-diagram.svg" alt="Stack (linked list) UML diagram" style="width:100%;background-color:white">
</section>
<section data-markdown><script type="text/template">
## Stack: Array Implementation
- Avoids links, *most* operations are very fast (constant) time
- Stack consists of
- theArray // the stack
- topOfStack // current index of the top
- Push
- Increment topOfStack
- Set theArray[topOfStack] to value
- Pop
- Set return value = theArray[topOfStack]
- Decrement topOfStack
- Top
- Return theArray[topOfStack]
- But what if the array is full?
</script></section>
<section data-markdown><script type="text/template">
## Stack: Vector Implementation
(no external source code)
```
#include <vector>
using namespace std;
class Stack {
public:
Stack(); // constructor
~Stack(); // destructor
bool isEmpty() const; // checks for empty
void push(int value); // push value onto stack
void pop(); // pop top of stack
int top() const; // returns topOfStack
private:
vector<int> theStack;
};
```
</script></section>
<section data-markdown><script type="text/template">
## Stack: Vector Implementation
- isEmpty(): return true if stack is size 0
```
bool Stack::isEmpty() const {
return (theStack.size()==0);
}
```
- push() implementation
```
void Stack::push(int value){
theStack.push_back(value);
}
```
</script></section>
<section data-markdown><script type="text/template">
## How Would You Implement these?
- pop()
void Stack::pop(){
}
- top()
int Stack::top(){
}
</script></section>
<section data-markdown><script type="text/template">
## Stacks
- List with restrictions
- Insert and delete can only be performed at the top of the list
- LIFO: Last In, First Out
- Attributes
- top of stack
- Fundamental operations (constant time)
- Push
- Pop
- Top
- Implementations
- Linked List
- Array
- Vector (variable size "array")
</script></section>
</section>
<section>
<section data-markdown id="queues" class="center"><script type="text/template">
# Queues
</script></section>
<section data-markdown><script type="text/template">
## Queues
- Also a list, but inserts happen at one end (the "back") and removals happen at the other end (the "front")
- Operations
- Enqueue: insert at one end (back)
- Dequeue: delete at other end (front)
- FIFO: First In, First Out
- Linked list and array implementations are constant time for all operations
- (minor disclaimer about a full vector queue...)
</script></section>
<section data-markdown><script type="text/template">
## Queue Applications
- Print queues
- Lines in general
- File serving
- Call queues
</script></section>
<section data-markdown><script type="text/template">
## Implementations
- Array or vector
- theArray
- front position/index
- back position/index
- current size
- Linked list
</script></section>
<section data-markdown><script type="text/template">
## Queue: Array Implementation
- Operations
- enqueue
- increment current size
- increment back
- set `theArray[back] = element`
- dequeue
- set return value to `theArray[front]`
- decrement current size
- increment front
- front() and back() are the find operations
- Again, have to handle the situation when the array is full
</script></section>
<section data-markdown><script type="text/template">
## Queue: Linked List Implementation
(no external source code)
```
#include "QueueNode.h"
// assumes a queue of ints stored in QueueNodes
class Queue{
public:
Queue(); // constructor
~Queue(); // destructor
// enqueue item to back of list
void enqueue(int value);
// remove item from front of list
int dequeue();
// other supporting methods...
private:
// pointers to front and back of list
QueueNode *front, *back;
};
```
</script></section>
<section>
<h2>Queue: Linked List Implementation Diagram</h2>
<img src="images/02-lists/queue-diagram.svg" alt="Queue (linked list) UML diagram" style="width:100%;background-color:white">
</section>
<section data-markdown><script type="text/template">
## Queue: Linked List Implementation
- enqueue()
void Queue::enqueue(int value) {
}
- dequeue()
int Queue::dequeue() {
}
</script></section>
</section>
<section>
<section data-markdown id="adts" class="center"><script type="text/template">
# Abstract Data Types: Lists
</script></section>
<section data-markdown><script type="text/template">
## Abstract Data Types (ADT)
- Collection of "things" with a set of operations that can be performed on the data structure
- Definition of a type
- A C++ class is a way to implement an ADT, as is a Java class, or C code (which is not object oriented)
- An ADT hides implementation details from the programs that use them
- Why?
- We are using lists as an example to show *what* an ADT is
- You all should be familiar with lists from your previous courses...
</script></section>
<section data-markdown><script type="text/template">
## Lists ADT
- A<sub>0</sub>, A<sub>1</sub>, A<sub>2</sub>, A<sub>3</sub>, ...
- size N
- empty list -- list of size 0
- A<sub>0</sub> is the first element
- A<sub>i</sub> follows A<sub>i-1</sub>
- position of element A<sub>i</sub> is i
- Extended the language by adding a new type
</script></section>
<section data-markdown><script type="text/template">
## List ADT Operations
- printList: print the list
- makeEmpty: make the list empty
- find: find the position of an item in the list
- insert: insert an item to the list
- remove: remove an item from the list
- findKth: find the element at position K
- next: return the position of the successor
- previous: return the position of the predecessor
</script></section>
<section data-markdown><script type="text/template">
## Example
- Given the list:
```
34, 12, 52, 16, 12
A0, A1, A2, A3, A4
```
- find(52)
- returns 2 (position of 52)
- insert('x',2)
- 34, 12, 'x', 52, 16, 12
- remove(52)
- find(1)
</script></section>
<section data-markdown><script type="text/template">
## Implementation of Lists: Arrays
![Lists ADT as an array](images/02-lists/lists-adt-arrays.png)
- Fixed capacity
- Operations
- printList, find: linear time
- findKth: constant time
- insert and delete: varies (can be constant, but worst case linear)
</script></section>
<section data-markdown><script type="text/template">
## List Implementation: Linked List
![Lists ADT as an array](images/02-lists/lists-adt-linked.png)
- Nodes
- element
- link (pointer!) to node containing successor
- Operations
- printList, find, findKth: linear time
- remove: change one pointer and call `delete`, so constant time
- insert: get a new node (`new`) and adjust 2 pointers, so constant time
</script></section>
<section data-markdown><script type="text/template">
## Linked List insert()
- Special cases
- inserting at the front (head)
- inserting at the end (tail)
- removing last node
</script></section>
<section data-markdown><script type="text/template">
## List Iterators
- Why are they needed?
- position is needed for some list operations
- find()
- insert()
- remove()
- ListItr
- maintains notion of position by maintaining a pointer to a particular ListNode
</script></section>
</section>
<section>
<section data-markdown id="string" class="center"><script type="text/template">
# Standard Library: string
</script></section>
<section data-markdown><script type="text/template">
## C++ string
- C++ <string> library
- provides string class and member functions
- Operations
- size() & length()
- They do the same thing
- at()
- operator[]
- operator+=
- c_str()
- substr()
</script></section>
<section data-markdown><script type="text/template">
## Selected Method Descriptions
- at(int pos)
- access character within string at index position, pos
- someString.at(3);
- operator[]
- access character within string using array-style notation
- someString[3];
- c_str()
- converts C++ string to C-style string
- used to convert c++ string to C-style which is char *
- substr()
- returns substring of a string given some parameters
- See source code
</script></section>
<section data-markdown><script type="text/template">
## Closing thoughts on strings
- You can enter Control-D for input
- This will set cin.eof() to true, and then you can break
- So something like: cin >> x; if(cin.eof()) break; //or similar
- Like Java, to compare strings, you need to compare the characters that they point to
- .equals() in Java
- But in the STL string class, the == operator is overloaded to do this!
- So you can compare STL strings with ==
- But not standard C strings (i.e. `char*`)
- And this doesn't work if you have *pointers* to the strings
</script></section>
</section>
</div>
</div>
<script src='../slides/reveal.js/dist/reveal.js'></script><script src='../slides/reveal.js/plugin/zoom/zoom.js'></script><script src='../slides/reveal.js/plugin/notes/notes.js'></script><script src='../slides/reveal.js/plugin/search/search.js'></script><script src='../slides/reveal.js/plugin/markdown/markdown.js'></script><script src='../slides/reveal.js/plugin/highlight/highlight.js'></script><script src='../slides/reveal.js/plugin/math/math.js'></script>
<script src="js/settings.js"></script>
</body>
</html>