Path: csiph.com!fu-berlin.de!uni-berlin.de!not-for-mail From: Joel Goldstick Newsgroups: comp.lang.python Subject: Re: Need help on a project To :"Create a class called BankAccount with the following parameters " Date: Wed, 30 Dec 2015 15:06:44 -0500 Lines: 84 Message-ID: References: <5ec1d759-a2ab-4193-a4aa-869c0bf0506c@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8 X-Trace: news.uni-berlin.de SqMGn7oipehDDPwClFfzmwPrD0jICGfIuXrC/VCiL4RQ== Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.001 X-Spam-Evidence: '*H*': 1.00; '*S*': 0.00; 'else:': 0.03; 'true,': 0.04; 'false,': 0.07; 'unittest': 0.07; 'subject:help': 0.07; 'cc:addr:python-list': 0.09; '34,': 0.09; 'spec': 0.09; 'assume': 0.11; 'def': 0.13; 'wed,': 0.15; 'argument': 0.15; 'subject: \n ': 0.15; '"test': 0.16; 'boolean': 0.16; 'code?': 0.16; 'received:io': 0.16; 'received:psf.io': 0.16; 'subject:class': 0.16; 'subject:parameters': 0.16; 'traceback.': 0.16; 'wrote:': 0.16; 'string': 0.17; '<': 0.18; 'integer': 0.18; 'skip:g 40': 0.18; 'subject:project': 0.18; 'email addr:gmail.com>': 0.18; 'tests': 0.18; '2015': 0.20; 'cc:2**0': 0.20; 'cc:addr:python.org': 0.20; 'algorithm': 0.20; 'saying': 0.22; 'parameter': 0.22; 'pass': 0.22; 'dec': 0.23; 'import': 0.24; 'header:In-Reply-To:1': 0.24; 'error': 0.27; 'question': 0.27; 'message-id:@mail.gmail.com': 0.27; 'function': 0.28; 'url:mailman': 0.30; 'code': 0.30; 'skip:g 30': 0.30; 'task': 0.30; 'largest': 0.31; 'implement': 0.32; 'run': 0.33; 'class': 0.33; 'url:python': 0.33; 'int': 0.33; 'url:listinfo': 0.34; 'list': 0.34; 'skip:& 20': 0.35; 'received:google.com': 0.35; 'next': 0.35; 'done': 0.35; 'false': 0.35; 'level': 0.35; 'item': 0.35; 'step': 0.36; 'but': 0.36; 'there': 0.36; 'url:org': 0.36; 'received:209.85': 0.36; 'pm,': 0.36; 'subject:: ': 0.37; 'skip:& 10': 0.37; '12,': 0.37; 'received:209.85.213': 0.37; 'starting': 0.37; 'received:209': 0.38; 'wrong': 0.38; 'anything': 0.38; 'skip:p 20': 0.38; 'test': 0.39; 'does': 0.39; 'subject:the': 0.39; 'takes': 0.39; 'url:mail': 0.40; 'subject:with': 0.40; 'some': 0.40; 'your': 0.60; 'subject:Need': 0.61; 'skip:n 10': 0.62; '30,': 0.63; 'above,': 0.63; 'complete': 0.63; 'believe': 0.66; 'results': 0.66; 'repeat': 0.67; 'prime': 0.72; 'won': 0.76; 'to:none': 0.91; 'joel': 0.91 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:date:message-id:subject:from:cc :content-type; bh=vNTSyl1w+MK+FR60BBEVkkY/RtGAseM5o//QVG7Vuyw=; b=F8w7eTp773Ry7gOIAxnEy5uMtHQGpakJ2DumsWjNkQWZ5lZLQAb1hTugvcNNC2mOaC MUW9PnRP00kQQA0t2hcRPyozGKblDTlXfZDONmYOIoEB3IMCC0uTHoR+dQrTjujZVq1g 0uOyMYIr+gynhoQ4vnfkdbWb/aoDpNqyaUD878h7aJ1FYRb/JIqV3RCehCI2C6VtWWbE bF517ks7qlP6KzDu1lfs7ELp0L2PP0DMoh0yV81P+yzAN9sGPws88MzCfxZ55hr2oxBk Mt12bgiYoB8SitbWhniN0V/9OiGZdMmBTwEOaHMapw9KRXyE4aVv6IW3IUsTKEcY2MLj sr3A== X-Received: by 10.50.141.161 with SMTP id rp1mr63474888igb.28.1451506005078; Wed, 30 Dec 2015 12:06:45 -0800 (PST) In-Reply-To: X-Content-Filtered-By: Mailman/MimeDel 2.1.20+ X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.20+ Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Xref: csiph.com comp.lang.python:101006 On Wed, Dec 30, 2015 at 1:21 PM, Won Chang wrote: > > i have these task which i believe i have done well to some level > > Create a function get_algorithm_result to implement the algorithm below > > 1- Get a list of numbers L1, L2, L3....LN as argument 2- Assume L1 is the > largest, Largest = L1 3- Take next number Li from the list and do the > following 4- If Largest is less than Li 5- Largest = Li 6- If Li is last > number from the list then 7- return Largest and come out 8- Else repeat > same process starting from step 3 > > Create a function prime_number that does the following Takes as parameter > an integer and Returns boolean value true if the value is prime or Returns > boolean value false if the value is not prime > > so i came up with this code below > > def get_algorithm_result(my_list): > if not any(not type(y) is int for y in my_list): > largest = 0 > for item in range(0,len(my_list)): > if largest < my_list[item]: > largest = my_list[item] > return largest > else: > > return(my_list[-1]) > > def prime_number(integer): > if integer%2==0 and 2!=integer: > return False > else: > return True > > get_algorithm_result([1, 78, 34, 12, 10, 3]) > get_algorithm_result(["apples", "oranges", "mangoes", "banana", "zoo"]) > prime_number(1) > prime_number(78) > prime_number(11) > for the question above, there is a unittes which reads > > import unittest > > class AlgorithmTestCases(unittest.TestCase): > def test_maximum_number_one(self): > result = get_algorithm_result([1, 78, 34, 12, 10, 3]) > self.assertEqual(result, 78, msg="Incorrect number") > > def test_maximum_number_two(self): > result = get_algorithm_result(["apples", "oranges", "mangoes", > "banana", "zoo"]) > self.assertEqual(result, "zoo", msg="Incorrect number") > > def test_prime_number_one(self): > result = prime_number(1) > self.assertEqual(result, True, msg="Result is invalid") > > def test_prime_number_two(self): > result = prime_number(78) > self.assertEqual(result, False, msg="Result is invalid") > > def test_prime_number_three(self): > result = prime_number(11) > self.assertEqual(result, True, msg="Result is invalid") > but once i run my code ,it returns error saying Test Spec Failed > > Your solution failed to pass all the tests > what is actually wrong with my code? > You need to copy and paste the complete results and or traceback. There is no string "Test Spec Failed" in anything you have shown > -- > https://mail.python.org/mailman/listinfo/python-list > -- Joel Goldstick http://joelgoldstick.com/stats/birthdays