-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmedium.html
More file actions
36 lines (23 loc) · 785 Bytes
/
Copy pathmedium.html
File metadata and controls
36 lines (23 loc) · 785 Bytes
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
<html>
<head>
<title> Sample Input to an HTML Filter </title>
</head>
<body>
<center><h2><b>Computer Science 2</b></h2></center>
<center><b><font color="#800080"><font size=+1>Southwest Baptist University</font></font></b>
<p>
<hr>
You should learn some things about queues when you write this program. In particular,
You should learn that:
<hr>
<ul>
<li> queues are FIFO data structures</li>
<li> adding to a queue is called "enqueue" </li>
<li> enqueues always happen at the end of the queue </li>
<li> removing an item from a queue is called "dequeue" </li>
<li> dequeues always happen at the front of the queue </li>
<li> like stacks, you can't add to a full queue </li>
<li> like stacks, you can't remove something from an empty queue </li>
</ul>
</body>
</html>