Commit 06478f9

@@ -1,4 +1,9 @@
-# Assignment 1 - Question 1a - Computer Science 272: Data Structures and Algorithms
+# Learning Profile for Assignment #1 - Question #1a - Computer Science 272: Data Structures and Algorithms
+
+Name: Mo Khan
+Student ID: 3431709
+
+1. Problem Statement:
 
 * Describe the meaning of the essential methods `add(x)`, `deleteMin()`, and `size()` that are supported by the priority queue interface.
 * Implement those methods using a singly-linked list.
@@ -8,3 +13,8 @@
   * The `size()` method is used to determine how many items are in the queue.
   * The `add(x)` function is linear time O(n).
   * The `deleteMin(x)` function is constant time O(1).
+
+2. Description of the Code:
+3. Errors and Warnings:
+4. Sample Input and Output:
+5. Discussion: