kikyo2006

Parental Level,Game Title,File Offset,PlayStation PRO Support,Current Version,Instant Download,Package Size,PlayStation VR,Piece,SHA1 Hash,Title ID,Play Together
3,THE PLAYROOM,0,No,1.07,http://gs2.ww.prod.dl.playstation.net/gs2/ppkgo/prod/CUSA00001_00/9/f_ef965b581d35637dabc96366f29f1f0ece58c8fa9158b0eb7de9407ae72272e8/f/IP9100-CUSA00001_00-PLAYROOM00000000-A0107-V0100.pkg,34.9MB,No,0,22774b6c655f47dffce0eb7e15c5e865dce6a849,CUSA00001_00,
9,KILLZONE SHADOW FALL,0,No,1.81,http://gs2.ww.prod.dl.playstation.net/gs2/ppkgo/prod/CUSA00002_00/58/f_0882efa770fbf5b9a03b4decce248e8f07fd9585cbe43c44791799952c62fd14/f/EP9000-CUSA00002_00-KZ4RELEASE000041-A0181-V0100.pkg,2.9GB,No,0,552b7127dac3ee8ab5ce2ae051f6436c3ec605fc,CUSA00002_00,
7,inFAMOUS Second Son,0,Yes,1.07,http://gs2.ww.prod.dl.playstation.net/gs2/ppkgo/prod/CUSA00004_00/28/f_2881c3732328a643917aeb4c1e73b916c1d6baa7ea09e2e81f33d5f139ea9449/f/EP9000-CUSA00004_00-SECONDSONSHIP000-A0107-V0100.pkg,3.7GB,No,0,0538bdff843286013877ab92e5dc936b1407ddcb,CUSA00004_00,

kikyo2006

# Create a program that will play the "cows and bulls" game with the user. The game works like this:
#
# Randomly generate a 4-digit number. Ask the user to guess a 4-digit number. For every digit that the user guessed correctly in the correct place, they have a "cow". For every digit the user guessed correctly in the wrong place is a "bull." Every time the user makes a guess, tell them how many "cows" and "bulls" they have. Once the user guesses the correct number, the game is over. Keep track of the number of guesses the user makes throughout teh game and tell the user at the end.
#
# Say the number generated by the computer is 1038. An example interaction could look like this:
#
#   Welcome to the Cows and Bulls Game!
#   Enter a number:
#   >>> 1234
#   2 cows, 0 bulls

kikyo2006

"""
Write a password generator in Python. Be creative with how you generate passwords - strong passwords have a mix of lowercase letters, uppercase letters, numbers, and symbols. The passwords should be random, generating a new password every time the user asks for a new password. Include your run-time code in a main method.

Extra:

    Ask the user how strong they want their password to be. For weak passwords, pick a word or two from a list.
"""
import random

kikyo2006

"""
Write a program (using functions!) that asks the user for a long string containing multiple words. Print back to the user the same string, except with the words in backwards order. For example, say I type the string:

  My name is Michele

Then I would see the string:

  Michele is name My

shown back to me.

kikyo2006

"""
Write a program (function!) that takes a list and returns a new list that contains all the elements of the first list minus all the duplicates.

Extras:

    Write two different functions to do this - one using a loop and constructing a list, and another using sets.
    Go back and do Exercise 5 using sets, and write the solution for that in a different function.

"""

kikyo2006

"""
Write a program that asks the user how many Fibonnaci numbers to generate and then generates them. Take this opportunity
to think about how you can use functions. Make sure to ask the user to enter the number of numbers in the sequence to
generate.
(Hint: The Fibonnaci seqence is a sequence of numbers where the next number in the sequence is the sum of the previous
two numbers in the sequence. The sequence looks like this: 1, 1, 2, 3, 5, 8, 13...)
"""

def fibonnaci():
    input_num = int(raw_input("Your input: ") or 0)

kikyo2006

"""
Write a program that takes a list of numbers (for example, a = [5, 10, 15, 20, 25]) and makes a new list of only the first and last elements of the given list. For practice, write this code inside a function.
"""

def new_list(numbers):
    return [numbers[0], numbers[len(numbers)-1]]


a = [5, 10, 15, 20, 25]
print new_list(a)

kikyo2006

"""
Ask the user for a number and determine whether the number is prime or not. (For those who have forgotten, a prime number is a number that has no divisors.). You can (and should!) use your answer to [Exercise 4](/exercise/2014/02/26/04-divisors.html to help you. Take this opportunity to practice using functions, described below.
"""

def is_prime_number(num):
    a = range(2, 10)
    result = True
    for x in a:
        if num != x and num % x == 0:
            result = False

kikyo2006

"""
This week's exercise is going to be revisiting an old exercise (see Exercise 5), except require the solution in a different way.

Take two lists, say for example these two:

	a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
	b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]

and write a program that returns a list that contains only the elements that are common between the lists (without duplicates). Make sure your program works on two lists of different sizes. Write this in one line of Python using at least one list comprehension. (Hint: Remember list comprehensions from Exercise 7).

kikyo2006

"""
Generate a random number between 1 and 9 (including 1 and 9). Ask the user to guess the number, then tell them whether
they guessed too low, too high, or exactly right. (Hint: remember to use the user input lessons from the very first
exercise)

Extras:

    Keep the game going until the user types "exit"
    Keep track of how many guesses the user has taken, and when the game ends, print this out.