Added plans for the while, set, and for loop tutorials

mGalarnyk · mGalarnyk · commit 95078dba9dbe · 2017-05-22T20:18:32.000-07:00
diff --git a/Python_Basics/Intro/.ipynb_checkpoints/Python3Basics_Part1-checkpoint.ipynb b/Python_Basics/Intro/.ipynb_checkpoints/Python3Basics_Part1-checkpoint.ipynb
@@ -1335,7 +1335,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 87,
+   "execution_count": 1,
    "metadata": {},
    "outputs": [
     {
@@ -1351,16 +1351,27 @@
       "7\n",
       "8\n",
       "9\n",
-      "10\n"
+      "10\n",
+      "0 steve\n",
+      "1 rachel\n",
+      "2 michael\n",
+      "3 adam\n",
+      "4 monica\n"
      ]
     }
    ],
    "source": [
     "# Range forms a list. \n",
-    "# Mention difference between python \n",
+    "# Mention difference between python 2 and 3 for range function\n",
+    "# mention xrange in python 2, \n",
+    "# mention enumerate for loop \n",
     "\n",
     "for i in range(1,11):\n",
-    "    print(i)"
+    "    print(i)\n",
+    "\n",
+    "bunnies = ['steve', 'rachel', 'michael', 'adam', 'monica']\n",
+    "for index, bunny in enumerate(bunnies):\n",
+    "    print(index,bunny)"
    ]
   },
   {
@@ -1390,7 +1401,10 @@
     "\n",
     "while i<3:\n",
     "    i = i + 1\n",
-    "    print(i)"
+    "    print(i)\n",
+    "    \n",
+    "# Task see DSE 200\n",
+    "# Write a program to make a list of all prime numbers less than 3000. A prime number can only be divided evenly by 1 and itself."
    ]
   },
   {
@@ -1548,6 +1562,19 @@
    "source": [
     "https://www.youtube.com/watch?v=JqGjkNzzU4s"
    ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Tuples (see DSE 200 ASSIGNMENT 1, fibonacci, and plus string manip ) and \n",
+    "\n",
+    "# Sets: intersection, union, embed picture of both showing how similar to join "
+   ]
   }
  ],
  "metadata": {
diff --git a/Python_Basics/Intro/Python3Basics_Part1.ipynb b/Python_Basics/Intro/Python3Basics_Part1.ipynb
@@ -1335,7 +1335,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 87,
+   "execution_count": 1,
    "metadata": {},
    "outputs": [
     {
@@ -1351,16 +1351,27 @@
       "7\n",
       "8\n",
       "9\n",
-      "10\n"
+      "10\n",
+      "0 steve\n",
+      "1 rachel\n",
+      "2 michael\n",
+      "3 adam\n",
+      "4 monica\n"
      ]
     }
    ],
    "source": [
     "# Range forms a list. \n",
-    "# Mention difference between python \n",
+    "# Mention difference between python 2 and 3 for range function\n",
+    "# mention xrange in python 2, \n",
+    "# mention enumerate for loop \n",
     "\n",
     "for i in range(1,11):\n",
-    "    print(i)"
+    "    print(i)\n",
+    "\n",
+    "bunnies = ['steve', 'rachel', 'michael', 'adam', 'monica']\n",
+    "for index, bunny in enumerate(bunnies):\n",
+    "    print(index,bunny)"
    ]
   },
   {
@@ -1390,7 +1401,10 @@
     "\n",
     "while i<3:\n",
     "    i = i + 1\n",
-    "    print(i)"
+    "    print(i)\n",
+    "    \n",
+    "# Task see DSE 200\n",
+    "# Write a program to make a list of all prime numbers less than 3000. A prime number can only be divided evenly by 1 and itself."
    ]
   },
   {
@@ -1548,6 +1562,19 @@
    "source": [
     "https://www.youtube.com/watch?v=JqGjkNzzU4s"
    ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Tuples (see DSE 200 ASSIGNMENT 1, fibonacci, and plus string manip ) and \n",
+    "\n",
+    "# Sets: intersection, union, embed picture of both showing how similar to join "
+   ]
   }
  ],
  "metadata": {
