From 1fd617c85e127e0705e98a3ddbf4c178199cea7f Mon Sep 17 00:00:00 2001
From: mo khan <mo.khan@gmail.com>
Date: Sat, 4 Jul 2020 13:01:28 -0600
Subject: Start program profiles

---
 src/01/01b/README.md |  6 ++++++
 src/01/06/README.md  | 15 +++++++++++++++
 2 files changed, 21 insertions(+)
 create mode 100644 src/01/06/README.md

(limited to 'src')

diff --git a/src/01/01b/README.md b/src/01/01b/README.md
index 41f7d40..e1d3b90 100644
--- a/src/01/01b/README.md
+++ b/src/01/01b/README.md
@@ -4,6 +4,12 @@ Name: Mo Khan
 Student ID: 3431709
 
 1. Problem Statement:
+
+Design and implement a MinStack data structure that can store comparable elements and supports the stack operations `push(x)`, `pop()`, and `size()`,
+as well as the `min()` operation, which returns the minimum value currently stored in the data structure.
+
+All operations should run in constant time.
+
 2. Description of the Code:
 3. Errors and Warnings:
 4. Sample Input and Output:
diff --git a/src/01/06/README.md b/src/01/06/README.md
new file mode 100644
index 0000000..ceab17a
--- /dev/null
+++ b/src/01/06/README.md
@@ -0,0 +1,15 @@
+# Learning Profile for Assignment #1 - Question #1b - Computer Science 272: Data Structures and Algorithms
+
+Name: Mo Khan
+Student ID: 3431709
+
+1. Problem Statement:
+
+Implement the stack methods `push(x)` and `pop()` using two queues.
+
+Analyze the running time of the push(x) and pop() operations based on this implementation.
+
+2. Description of the Code:
+3. Errors and Warnings:
+4. Sample Input and Output:
+5. Discussion:
-- 
cgit v1.2.3