Commit 24700ad

@@ -1,14 +1,13 @@
-# Learning Profile for Assignment #1 - Question #6 - Computer Science 272: Data Structures and Algorithms
+# Learning Profile for Assignment #1 - Question #1b - Computer Science 272: Data Structures and Algorithms
 
 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.
+Implement the stack methods `push(x)` and `pop()` using two queues.
 
-All operations should run in constant time.
+Analyze the running time of the push(x) and pop() operations based on this implementation.
 
 2. Description of the Code:
 3. Errors and Warnings:

@@ -1,13 +1,14 @@
-# Learning Profile for Assignment #1 - Question #1b - Computer Science 272: Data Structures and Algorithms
+# Learning Profile for Assignment #1 - Question #6 - 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.
+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.
 
-Analyze the running time of the push(x) and pop() operations based on this implementation.
+All operations should run in constant time.
 
 2. Description of the Code:
 3. Errors and Warnings: