summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMadhusudan.C.S2010-09-07 12:09:06 +0530
committerMadhusudan.C.S2010-09-07 12:09:06 +0530
commitb5421c9914b4615cf6a615396efb6b8ce6d6309e (patch)
treed5e358fbd8517c7fb833c1f1ec5842692fd5a14a
parent5ea64343d0c72b7bfafa6c5f84a68d6f4f468c7b (diff)
downloadsees-b5421c9914b4615cf6a615396efb6b8ce6d6309e.tar.gz
sees-b5421c9914b4615cf6a615396efb6b8ce6d6309e.tar.bz2
sees-b5421c9914b4615cf6a615396efb6b8ce6d6309e.zip
First Lab exercise questions. Sorry for very small commits. I paid the penalty of losing my entire file on which I had worked on 1 and half days.
-rw-r--r--tdd/lab-workbook.rst34
1 files changed, 34 insertions, 0 deletions
diff --git a/tdd/lab-workbook.rst b/tdd/lab-workbook.rst
new file mode 100644
index 0000000..949f131
--- /dev/null
+++ b/tdd/lab-workbook.rst
@@ -0,0 +1,34 @@
+======================================
+Lab Workbook - Test Driven Development
+======================================
+
+The notation that follows every question denotes the level on the
+Revised Bloom's Taxonomy.
+
+Lab - 1
+=======
+
+ 1. Write a stub function for calculating the LCM of two numbers.
+ 2. Write the tests for the LCM function, place the tests in if
+ __name__ == '__main__': part of the Python file. Demonstrate that
+ the tests fail.
+ 3. Implement the code for the LCM function, using the gcd function
+ provided in the examples in the chapter. Demonstrate the tests
+ pass. (For the algorithm refer to Wikipedia - [0])
+ 4. Alternatively, build a set of test cases, preferably a large
+ number of cases, place it in a text file and use these test cases
+ to test your LCM function. Demonstrate that tests still continue
+ to pass.
+
+[0] - http://en.wikipedia.org/wiki/Least_common_multiple#Reduction_by_the_greatest_common_divisor
+
+Lab - 2
+=======
+
+ 1.
+
+
+Lab -3
+======
+
+ 1.