Merge pull request #153 from uw-ssec/workshop-m1p4-tweaks

Tweaks to module 1 page 4

Author: nikiburggraf

AI_Postdoc_Workshop/module1/4-algorithms-prompting-with-olmo.ipynb

@@ -22,7 +22,8 @@
     "* Which search algorithms are better choices for sorted data vs for unsorted data, and why?\n",
     "* Explain why binary search's time complexity is O(logn) on a sorted set.\n",
     "* Does recursion make space complexity a more or less important consideration, and why?\n",
-    "* Which data structures have the most efficient lookup time?"
+    "* Which data structures have the most efficient lookup time?\n",
+    "* What is circuit satisfiability?"
    ]
   },
   {
@@ -48,7 +49,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 1,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -85,8 +86,8 @@
     "    callbacks=[StreamingStdOutCallbackHandler()],\n",
     "    temperature=0.8,\n",
     "    verbose=False,\n",
-    "    n_ctx=2048,\n",
-    "    max_tokens=512,\n",
+    "    n_ctx=2048,  # input context length\n",
+    "    max_tokens=512,  # max tokens to generate\n",
     ")"
    ]
   },
@@ -100,7 +101,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 5,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -109,7 +110,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 6,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -151,7 +152,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 8,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -168,7 +169,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 9,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -208,7 +209,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 11,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -266,7 +267,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 13,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -300,7 +301,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 15,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -334,7 +335,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 17,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -359,7 +360,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 19,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -393,7 +394,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 21,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -404,16 +405,16 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 22,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
-    "question = \"What is the runtime of mergeSort?\""
+    "question = \"How can you prove that a problem is NP-Hard?\""
    ]
   },
   {
    "cell_type": "code",
-   "execution_count": 23,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [
@@ -445,7 +446,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 24,
+   "execution_count": null,
    "metadata": {},
    "outputs": [],
    "source": [