diff options
| author | mo khan <mo.khan@gmail.com> | 2020-07-04 12:10:40 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-07-04 12:10:40 -0600 |
| commit | 06478f92ad5d696c9b6d128edd0700f27b893120 (patch) | |
| tree | c7b4a75b481dd3c0bc82e5875e0f9479858ad02d /src/01 | |
| parent | acd51492a20ce4ac6c55bda5760bdf251b89d3c2 (diff) | |
Add program profile
Diffstat (limited to 'src/01')
| -rw-r--r-- | src/01/01a/README.md | 12 |
1 files changed, 11 insertions, 1 deletions
diff --git a/src/01/01a/README.md b/src/01/01a/README.md index 5cd106a..b0accc8 100644 --- a/src/01/01a/README.md +++ b/src/01/01a/README.md @@ -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: |