Merge branch 'master' of https://github.com/Khrisefzm/master-python-programming-exercises into bug-exercise-23

Author: Khrisefzm

exercises/021-square_root/README.es.md

@@ -0,0 +1 @@
+# Your code here

exercises/021-square_root/README.md

@@ -0,0 +1,9 @@
+# Your code here
+import math
+
+def square_root(number):
+    result = round(math.sqrt(number), 2)
+    return result
+
+
+print(square_root(50))

exercises/021-square_root/app.py

@@ -0,0 +1,39 @@
+import io, sys, os, re, pytest
+import app
+
+@pytest.mark.it('You should create a function named square_root')
+def test_square_root_exists(app):
+    try:
+        from app import square_root
+        assert square_root 
+    except AttributeError:
+        raise AttributeError("The function 'square_root' should exist on app.py")
+
+@pytest.mark.it('The function must return something')
+def test_function_return(capsys, app):
+    assert app.square_root(25) != None
+
+@pytest.mark.it('The function must return a float number')
+def test_function_return_type(capsys, app):
+    assert type(app.square_root(25)) == type(1.0)
+
+@pytest.mark.it('Testing the function square_root with the number 50, it should return 7.07')
+def test_square_root_50(app):
+    try:
+        assert app.square_root(50) == 7.07
+    except AttributeError:
+        raise AttributeError("The function 'square_root' should return the value 7.07")
+
+@pytest.mark.it('Testing the function square_root with the number 2.25, it should return 1.5')
+def test_square_root_2_25(app):
+    try:
+        assert app.square_root(2.25) == 1.5
+    except AttributeError:
+        raise AttributeError("The function 'square_root' should return the value 1.5")
+
+@pytest.mark.it('Testing the function square_root with the number 0, it should return 0')
+def test_square_root_0(app):
+    try:
+        assert app.square_root(0) == 0
+    except AttributeError:
+        raise AttributeError("The function 'square_root' should return the value 0")

exercises/021-square_root/solution.hide.py

@@ -0,0 +1 @@
+# Your code here

exercises/021-square_root/test.py

@@ -0,0 +1,5 @@
+# Your code here
+def lines(text):
+    return text.upper()
+
+print(lines('Hello world, practice makes perfect'))

exercises/22-Integral/README.es.md exercises/022-Integral/README.es.md

@@ -9,6 +9,6 @@ def test_function_existence(capsys, app):
 def test_expected_output(capsys, app):
     assert app.lines("hello world") == "HELLO WORLD"
 
-@pytest.mark.it('The function should return the expected output')
+@pytest.mark.it('The function should return the expected output. Testing with a different value')
 def test_another_output(capsys, app):
     assert app.lines("LeT the WOrld know YoU") == "LET THE WORLD KNOW YOU"

exercises/22-Integral/README.md exercises/022-Integral/README.md

@@ -0,0 +1 @@
+# Your code here

exercises/22-Integral/app.py exercises/022-Integral/app.py

@@ -0,0 +1,6 @@
+# Your code here
+def remove_duplicate_words(text):
+    words = text.split()
+    return (" ".join(sorted(list(set(words)))))
+
+print(remove_duplicate_words("hello world and practice makes perfect and hello world again"))

exercises/22-Integral/solution.hide.py exercises/022-Integral/solution.hide.py

@@ -8,11 +8,11 @@ def test_function_existence(capsys, app):
 def test_expected_output(capsys, app):
     assert app.remove_duplicate_words("hello world and practice makes perfect and hello world again") == "again and hello makes perfect practice world"
 
-@pytest.mark.it('The function should work with other entries')
+@pytest.mark.it('The function should work with other entries. Testing with different values')
 def test_expected_output_2(capsys, app):
     assert app.remove_duplicate_words("lets try this again with another try") == "again another lets this try with"
 
-@pytest.mark.it('The function should work with other entries')
+@pytest.mark.it('The function should work with other entries. Testing with different values')
 def test_expected_output_3(capsys, app):
     assert app.remove_duplicate_words("Jacke was Named Jacke by his mother") == "Jacke Named by his mother was"
 

exercises/22-Integral/test.py exercises/022-Integral/test.py

@@ -0,0 +1 @@
+# Your code here

exercises/23-list-and-tuple/README.es.md exercises/023-list-and-tuple/README.es.md

@@ -0,0 +1,12 @@
+# Your code here
+def divisible_binary(binary_sequence):
+    divisible_numbers = []
+    binary_numbers = [x for x in binary_sequence.split(',')]
+    for binary_num in binary_numbers:
+        int_binary_num = int(binary_num, 2)
+        if not int_binary_num % 5:
+            divisible_numbers.append(binary_num)
+
+    return ','.join(divisible_numbers)
+
+print(divisible_binary("1000,1100,1010,1111"))