iamoracle:
tanks to everyone for your support, i am grateful

Coret! Congratulations man!

Hi guys

been on this for the past couple of hours

what mistakes am i making?

help!!!!!!

class BankAccount (object):
def __init__(self, balance = 0):
self.balance = balance
def deposit (self, amount):
self.amount = amount
self.balance += amount
return self.balance
def withdraw (self, amount):
if amount > self.balance:
return ("invalid transaction"
self.balance -= amount
return self.balance
def __init__(self, minimumbalance):
self.minimumbalance = 1000
print (minimumbalance)

Alleybuy:
Hi guys

been on this for the past couple of hours

what mistakes am i making?

help!!!!!!

class BankAccount (object):
def __init__(self, balance = 0):
self.balance = balance
def deposit (self, amount):
self.amount = amount
self.balance += amount
return self.balance
def withdraw (self, amount):
if amount > self.balance:
return ("invalid transaction"
self.balance -= amount
return self.balance
def __init__(self, minimumbalance):
self.minimumbalance = 1000
print (minimumbalance)

Hmmm... Try not to give values to the parameters like balance unless you are asked to. Then, your 'if' statement should go with an 'else', to state what should happen when the if-condition isn't met.

Remove the brackets after return. Then the Invalid transaction should be in single quotes.

From your script, you didn't make another class called MinimumBalanceAccount as asked. Make it a subclass of BankAccount, as in...

class MinimumBalanceAccount(BankAccount):

Then you can go on to define it in terms of the parameters of BankAccount.

Don't print anything unless asked.

Thanks Oahray. Its improved now but still threw the following error. See code and error below: Hellllp!

THERE IS AN ERROR/BUG IN YOUR CODE
Results:
Internal Error: runTests aborted: TestOutcomeEvent(handled=False, test=, result=, outcome='error', exc_info=(, AttributeError("'BankAccount' object has no attribute 'balance'",), ), reason=None, expected=False, shortLabel=None, longLabel=None) is not JSON serializable
90
90
90
90
90

class BankAccount (object):
def __init__(self, balance):
self.balance = balance
def deposit (self, amount):
self.amount = amount
self.balance += amount
return self.balance
def withdraw (self, amount):
if amount > self.balance:
return 'invalid transaction'
else:
self.balance -= amount
return self.balance
class MinimumBalanceAccount(BankAccount):
def __init__(self, minimumbalance):
self.minimumbalance = minimumbalance

The problem is in your subclass MinimumBalanceAccount. Since MinimumBalanceAccount is inheriting from BankAccount, it takes the attributes of BankAccount ie self and balance (not minimumbalance). Something like this...

def __init__(self, balance):
BankAccount.__init__(self)

What that means is that you are creating a MinimumBalanceAccount subclass that inherits every BankAccount holder represented as (self).

Yaaay thanks a lot Oahray. It finally passed. Now onto the DS lab.

To God be the glory.

enigmatique:

Here are the problems/quirks I see in your script:
1. You don't need that "continue" statement on line 6. The for loop will continue normally.
2. int is a built-in function of Python! Just like len(), range(), str(), it can't be used as a varible name. The Proctor interpreter also shows this coz it gave len() and range() the same color as int. So use another variable name e.g some_int, num, number etc.
3. The range stipulated on line 11 is accurate, but you need to rethink line 12-15. The way it is, it's only testing the input with one number, the first number of the range you gave, which is 2. This is due to the return statements on lines 13 and 15, which end any further execution/iteration. Therefore, those lines are testing for ODD numbers, not prime ones.
SOLUTION: Use your loop to check if any of the numbers in the stipulated range is a factor of the input. Immediately you find a factor, return False. But if the loop completes without finding a factor, then put a "return True" statement OUTSIDE the loop (TIP: that should be on line 17 ).

Pls Kindly assist me with this problem, it passes all the test but refuses to be submitted. It's 2am and still battling
dabanzy, Oahray

Hello people. I have been on this algo lab for a while. It keeps giving errors on the prime number part.

Please can anyone point out anomalies in this code?


Thanks in anticipation.

Alleybuy:
Hello people. I have been on this algo lab for a while. It keeps giving errors on the prime number part.

Please can anyone point out anomalies in this code?


Thanks in anticipation.

Start by indenting your factor function.

spartanian:

Pls Kindly assit me with this problem, it passes all the test but refuses to be submitted.
dabanzy

I'm suprised that it passes all the tests bro. Why? Coz there's a major bug in there: that while loop in prime_number() is an infinite loop! You forgot to increment it in your loop.

Secondly, lines 14 and 16 are PREMATURELY returning True/False. You should test EVERY integer less than the input, which is why you correctly used the while loop. However, as it is, your function is only testing for whether a number is odd or not.
SOLUTIONS:
1. Increment i in the body of your while loop.
2. Use this pseudocode for your while loop:

create a variable is_prime and initialize it to True
while i is less than test_num
>>if i divides test_num without a remainder(i.e i is a factor of test_num)
>>>>assign False to is_prime
>>>>break out of the loop
>>else
>>>>increment i and let the loop go on
when the loop ends, return is_prime

Good luck!

PS: I used those > at the start of some lines for indentation. Replace them with whitespace.
PPS: You're obviously through with other labs. Well done!

Job done

Pls when I the actual date for the interview sef... 18th to 25th or 25th to 2nd?

enigmatique:

I'm suprised that it passes all the tests bro. Why? Coz there's a major bug in there: that while loop in prime_number() is an infinite loop! You forgot to increment it in your loop.
Secondly, lines 14 and 16 are PREMATURELY returning True/False. You should test EVERY integer less than the input, which is why you correctly used the while loop. However, as it is, your function is only testing for whether a number is odd or not.
SOLUTIONS:
1. Increment i in the body of your while loop.
2. Use this pseudocode for your while loop:

create a variable is_prime and initialize it to True
while i is less than test_num
>>if i divides test_num without a remainder(i.e i is a factor of test_num)
>>>>assign False to is_prime
>>>>break out of the loop
>>else
>>>>increment i and let the loop go on
when the loop ends, return is_prime

Good luck!
PS: I used those > at the start of some lines for indentation. Replace them with whitespace.
PPS: You're obviously through with other labs. Well done!

Thank you for your assistance but I am still stuckon 87% completion with Algo Lab and DS Lab not yet solved , will i be disqualified for not completing the test 100%?

spartanian:

Thank you for your assistance but I am still stuckon 87% completion with Algo Lab and DS Lab not yet solved , will i be disqualified for not completing the test 100%?

Can't say for sure. But assume you will, and thus hurry up and complete those tests! You're a Red Hat geek na. The next 4 hours should be more than enough to finish the rest.

enigmatique:

Can't say for sure. But assume you will, and thus hurry up and complete those tests! You're a Red Hat geek na. The next 4 hours should be more than enough to finish the rest.

It will close by 00:00 tomorrow

enigmatique:

Can't say for sure. But assume you will, and thus hurry up and complete those tests! You're a Red Hat geek na. The next 4 hours should be more than enough to finish the rest.

lolz, I am newbie in Python programming.Can I get assistance with the Algo and DS lab codes, thanks.

The algo labs gives a error still after passing the tests on clicking submit.

Anyone who has figured it out should pls give points on how we can too. BTW, may be I will b d first... will let you guys know when the code I just wrote works.

I don't know how to help you because all my solutions submit once they pass the test.

Anyway post your code if you want someone to help you.

tr3y:
I don't know how to help you because all my solutions submit once they pass the test.

Anyway post your code if you want someone to help you.

Thanks for the help tr3y. Here...

1st the get_algorithm_result:

def get_algorithm_result(mylist):
largest = mylist[0]
for i in range(1, len(mylist)):
if largest < mylist[i]:
largest = mylist[i]
continue
return largest

OR

def get_(mylist):
if type(n) == type([]):
largest = mylist[0]
for i in mylist:
if largest < i:
largest = i
return largest

Believe me my Indentation is on point. I just quickly typed this on mobile phone now(10% charge left on battery).

Shoot sir, whenever you are ready.

dammylola6:



Thanks for the help tr3y. Here...

1st the get_algorithm_result:

def get_algorithm_result(mylist):
largest = mylist[0]
for i in range(1, len(mylist)): Your index is out of range
if largest < mylist[i]:
largest = mylist[i]
continue No need for this
return largest Your function should return largest unless your indentation is not right

OR

def get_(mylist):
if type(n) == type([]):
largest = mylist[0]
for i in mylist:
if largest < i:
largest = i
return largest

Modified your second algorithm is perfect. Unless your indentation is not right. Hope you know the name is not right?

yes I do.
2nd: Checking for Prime Numbers:
def prime_number(): if num > 1: for i in range( 2, num): if (num % i) == 0: return False else : return True else : return False

dammylola6:
yes I do.
2nd: Checking for Prime Numbers:
def prime_number(): if num > 1: for i in range( 2, num): if (num % i) == 0: return False else : return True else : return False

I think this should help and I hope d home-study test has not yet closed?

spartanian:

lolz, I am newbie in Python programming.Can I get assistance with the Algo and DS lab codes, thanks.

Sorry bro. Our code of conduct in this thread makes us debug only and not share source code. (At least I speak for myself.) You'll have to write those on your own.

dammylola6:
yes I do.
2nd: Checking for Prime Numbers:
def prime_number(): if num > 1: for i in range( 2, num): if (num % i) == 0: return False else : return True else : return False

This should also help 4 d DS LAB

dammylola6:
yes I do.

2nd: Checking for Prime Numbers:

def prime_number():
if num > 1:
for i in range( 2, num):
if (num % i) == 0:
return False
else :
return True
else :
return False

Your function has no argement.
The algorithm is wrong. The for loop will run only once and stop when i=2. Bottomline, your function is checking for odd numbers.

You have to check if num is divisible by two and three, check if num is not <= 1 and return True or False accordingly .

Another way is most prime number are of the form 6x + 1 and 6x - 1. If you can use that to generate a list and check for num in that list.

enigmatique:

Sorry bro. Our code of conduct in this thread makes us debug only and not share source code. (At least I speak for myself.) You'll have to write those on your own.

ok bro

The codes screen shot above have one re-occurring syntax error-- the use of semicolons after each statement and the use of semicolons instead of colon after the function name declaration....

The codes screen shot above have one re-occurring syntax error-- the use of semicolons after each statement and the use of semicolons instead of colon after the function name declaration....

The codes screen shot above have one re-occurring syntax error-- the use of semicolons after each statement and the use of semicolons instead of colon after the function name declaration....

yay! finally done 100%, thanks to you all for your assistance and encouragement.... gracias
enigmatique

spartanian:
yay! finally done 100%, thanks to you all for your assistance and encouragement.... gracias
enigmatique

You're very welcome! Congratulations!

iamoracle:


I think this should help and I hope d home-study test has not yet closed?

That help has few thorns in it. Dig?

tr3y:


Your function has no argement.
The algorithm is wrong. The for loop will run only once and stop when i=2. Bottomline, your function is checking for odd numbers.

You have to check if num is divisible by two and three, check if num is not <= 1 and return True or False accordingly .

Another way is most prime number are of the form 6x + 1 and 6x - 1. If you can use that to generate a list and check for num in that list.

Yeah, i did not take time to debug the code well. And your help sir; is loaded with honey. Dig? I mean; every bite was a hit!

I can now say... 100% completion status reached!

Gracias amigos.