Exceptions and bug handling - Revision history

WikiSysop: /* Exercises to be handed in */

2025-10-03T13:54:29Z

Exercises to be handed in

← Older revision		Revision as of 15:54, 3 October 2025
Line 22:		Line 22:

	== Exercises to be handed in ==		== Exercises to be handed in ==
	# In the file ''dna.fsa'' is some DNA. Construct a program that finds possible translation starts :-)<br>All proteins start with the amino acid methionine (at least when translating, Met might be removed in later processing states). Methionine is coded with ATG. The exercise is therefore; find the position of all ATG's in the sequence. The first position is 83 as humans count. <br>In some organisms different start codons are possible. If you really want to, you can make the program handle those cases too.		# In the file ''dna.fsa'' is some DNA. Construct a program that finds possible translation starts :-)<br>All proteins start with the amino acid methionine (at least when translating, Met might be removed in later processing states). Methionine is coded with ATG. The exercise is therefore; find the position of all ATG's in the sequence. The first position is 83 as humans count. <br>In some organisms different start codons are possible. If you really want to, you can make the program handle those cases too.<br><br>
	# Connecting to the previous exercise; Assuming that the first Met at position 83 is translation start, find the corresponding translation stop (which is the first one in frame). Stop codon is coded by TAA, TAG, or TGA. Remember that the stop codon has to be in the same reading frame as ATG. Notice: There are two ways to solving this exercise. The primitive way is to start at the position given. The more general and better way is to find the first ATG and then find the corresponding stop codon, which is on position 128.		# Connecting to the previous exercise; Assuming that the first Met at position 83 is translation start, find the corresponding translation stop (which is the first one in frame). Stop codon is coded by TAA, TAG, or TGA. Remember that the stop codon has to be in the same reading frame as ATG. Notice: There are two ways to solving this exercise. The primitive way is to start at the position given. The more general and better way is to find the first ATG and then find the corresponding stop codon, which is on position 128.<br><br>
	# Read the file ''orphans.sp'' and find all accession numbers (and only the accession numbers), save them in another file of your choosing. Hint: an accession number might look like this AB000114.CDS.1 or like this AB000114 or like this AB000114.CDS.3. CDS means CoDing Sequence followed by a number. If the accession number contains the CDS part, consider .CDS.1 as a part of the accession number. Accession numbers differ in length for historical reasons. You can assume that the accession number comes straight after the '''>''', which is first on the line.		# Read the file ''orphans.sp'' and find all accession numbers (and only the accession numbers), save them in another file of your choosing. Hint: an accession number might look like this AB000114.CDS.1 or like this AB000114 or like this AB000114.CDS.3. CDS means CoDing Sequence followed by a number. If the accession number contains the CDS part, consider .CDS.1 as a part of the accession number. Accession numbers differ in length for historical reasons. You can assume that the accession number comes straight after the '''>''', which is first on the line.<br><br>
	# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>		# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font><br><br>
	# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).		# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).<br><br>
	# The file ''studentweight.txt'' contains both text lines and numbers. Make a program that can ask for a file name and sum the numbers and ignore the text lines using exceptions. Result is 1035.		# The file ''studentweight.txt'' contains both text lines and numbers. Make a program that can ask for a file name and sum the numbers and ignore the text lines using exceptions. Result is 1035.

WikiSysop: /* Exercises for extra practice */

2025-09-29T12:08:15Z

Exercises for extra practice

← Older revision		Revision as of 14:08, 29 September 2025
Line 33:		Line 33:
	* Write a program that asks for an integer, and then determines if the number was a prime number or not.		* Write a program that asks for an integer, and then determines if the number was a prime number or not.
	* Write a program that prints a "bulls-eye" to the screen using characters like; '.', '+', '', '#', etc.<br>You have to import the math library, in order to access the squareroot (sqrt), sine (sin), cosine (cos), and so forth functions. The square root of x is gotten like math.sqrt(x). I only used: for, if, elif, print, +, -, /, *, int, sqrt for this 40x40 example.<br>Hint: Think of a grid where one point is the center of the eye/circle. The positions in the grid will use different chars, depending how far away they are from the center. You might get an oval shape - think about why.<br>[[File:BullsEye.png]]		* Write a program that prints a "bulls-eye" to the screen using characters like; '.', '+', '', '#', etc.<br>You have to import the math library, in order to access the squareroot (sqrt), sine (sin), cosine (cos), and so forth functions. The square root of x is gotten like math.sqrt(x). I only used: for, if, elif, print, +, -, /, *, int, sqrt for this 40x40 example.<br>Hint: Think of a grid where one point is the center of the eye/circle. The positions in the grid will use different chars, depending how far away they are from the center. You might get an oval shape - think about why.<br>[[File:BullsEye.png]]
			* Make a small program that asks for input - any input. It should output 1 of 3 simple lines:<br>1) You gave me a string<br>2) You gave me a number<br>3) You gave me a floating point number

WikiSysop: /* Exercises to be handed in */

2025-08-28T10:18:14Z

Exercises to be handed in

← Older revision		Revision as of 12:18, 28 August 2025
Line 27:		Line 27:
	# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>		# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>
	# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).		# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).
	# The file ''studentweight.txt'' contains both text lines and numbers. Make a program that can ask for a file name and sum the numbers and ignore the text lines using exceptions.		# The file ''studentweight.txt'' contains both text lines and numbers. Make a program that can ask for a file name and sum the numbers and ignore the text lines using exceptions. Result is 1035.

	== Exercises for extra practice ==		== Exercises for extra practice ==

WikiSysop: /* Exercises to be handed in */

2025-08-28T10:12:05Z

Exercises to be handed in

← Older revision		Revision as of 12:12, 28 August 2025
Line 27:		Line 27:
	# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>		# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>
	# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).		# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).
	# The file ''studentweight.txt'' contains both text lines and numbers. Make a program that can sum the numbers and ignore the text lines using exceptions.		# The file ''studentweight.txt'' contains both text lines and numbers. Make a program that can ask for a file name and sum the numbers and ignore the text lines using exceptions.

	== Exercises for extra practice ==		== Exercises for extra practice ==

WikiSysop: /* Exercises to be handed in */

2025-08-28T09:55:35Z

Exercises to be handed in

← Older revision		Revision as of 11:55, 28 August 2025
Line 23:		Line 23:
	== Exercises to be handed in ==		== Exercises to be handed in ==
	# In the file ''dna.fsa'' is some DNA. Construct a program that finds possible translation starts :-)<br>All proteins start with the amino acid methionine (at least when translating, Met might be removed in later processing states). Methionine is coded with ATG. The exercise is therefore; find the position of all ATG's in the sequence. The first position is 83 as humans count. <br>In some organisms different start codons are possible. If you really want to, you can make the program handle those cases too.		# In the file ''dna.fsa'' is some DNA. Construct a program that finds possible translation starts :-)<br>All proteins start with the amino acid methionine (at least when translating, Met might be removed in later processing states). Methionine is coded with ATG. The exercise is therefore; find the position of all ATG's in the sequence. The first position is 83 as humans count. <br>In some organisms different start codons are possible. If you really want to, you can make the program handle those cases too.
			# Connecting to the previous exercise; Assuming that the first Met at position 83 is translation start, find the corresponding translation stop (which is the first one in frame). Stop codon is coded by TAA, TAG, or TGA. Remember that the stop codon has to be in the same reading frame as ATG. Notice: There are two ways to solving this exercise. The primitive way is to start at the position given. The more general and better way is to find the first ATG and then find the corresponding stop codon, which is on position 128.
	# Read the file ''orphans.sp'' and find all accession numbers (and only the accession numbers), save them in another file of your choosing. Hint: an accession number might look like this AB000114.CDS.1 or like this AB000114 or like this AB000114.CDS.3. CDS means CoDing Sequence followed by a number. If the accession number contains the CDS part, consider .CDS.1 as a part of the accession number. Accession numbers differ in length for historical reasons. You can assume that the accession number comes straight after the '''>''', which is first on the line.		# Read the file ''orphans.sp'' and find all accession numbers (and only the accession numbers), save them in another file of your choosing. Hint: an accession number might look like this AB000114.CDS.1 or like this AB000114 or like this AB000114.CDS.3. CDS means CoDing Sequence followed by a number. If the accession number contains the CDS part, consider .CDS.1 as a part of the accession number. Accession numbers differ in length for historical reasons. You can assume that the accession number comes straight after the '''>''', which is first on the line.
	# Connecting to the previous exercise; Assuming that the first Met at position 83 is translation start, find the corresponding translation stop (which is the first one in frame). Stop codon is coded by TAA, TAG, or TGA. Remember that the stop codon has to be in the same reading frame as ATG. Notice: There are two ways to solving this exercise. The primitive way is to start at the position given. The more general and better way is to find the first ATG and then find the corresponding stop codon, which is on position 128.
	# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>		# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>
	# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).		# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).

WikiSysop: /* Exercises for extra practice */

2025-08-28T09:46:59Z

Exercises for extra practice

← Older revision		Revision as of 11:46, 28 August 2025
Line 30:		Line 30:

	== Exercises for extra practice ==		== Exercises for extra practice ==
	* In a file you make yourself are numbers and words with one number/word on each line. Now make a program that reads the file and sums the numbers and displays the result. The words are ignored.
	* In the file ''mixedlines.txt'' how many 4 letter words exists? A word is here defined as consecutive visible characters, i.e. "12", "ipsum." are both words.		* In the file ''mixedlines.txt'' how many 4 letter words exists? A word is here defined as consecutive visible characters, i.e. "12", "ipsum." are both words.
	* Write a program that asks for an integer, and then determines if the number was a prime number or not.		* Write a program that asks for an integer, and then determines if the number was a prime number or not.
	* Write a program that prints a "bulls-eye" to the screen using characters like; '.', '+', '', '#', etc.<br>You have to import the math library, in order to access the squareroot (sqrt), sine (sin), cosine (cos), and so forth functions. The square root of x is gotten like math.sqrt(x). I only used: for, if, elif, print, +, -, /, *, int, sqrt for this 40x40 example.<br>Hint: Think of a grid where one point is the center of the eye/circle. The positions in the grid will use different chars, depending how far away they are from the center. You might get an oval shape - think about why.<br>[[File:BullsEye.png]]		* Write a program that prints a "bulls-eye" to the screen using characters like; '.', '+', '', '#', etc.<br>You have to import the math library, in order to access the squareroot (sqrt), sine (sin), cosine (cos), and so forth functions. The square root of x is gotten like math.sqrt(x). I only used: for, if, elif, print, +, -, /, *, int, sqrt for this 40x40 example.<br>Hint: Think of a grid where one point is the center of the eye/circle. The positions in the grid will use different chars, depending how far away they are from the center. You might get an oval shape - think about why.<br>[[File:BullsEye.png]]

WikiSysop: /* Exercises to be handed in */

2025-08-27T21:53:42Z

Exercises to be handed in

← Older revision		Revision as of 23:53, 27 August 2025
Line 24:		Line 24:
	# In the file ''dna.fsa'' is some DNA. Construct a program that finds possible translation starts :-)<br>All proteins start with the amino acid methionine (at least when translating, Met might be removed in later processing states). Methionine is coded with ATG. The exercise is therefore; find the position of all ATG's in the sequence. The first position is 83 as humans count. <br>In some organisms different start codons are possible. If you really want to, you can make the program handle those cases too.		# In the file ''dna.fsa'' is some DNA. Construct a program that finds possible translation starts :-)<br>All proteins start with the amino acid methionine (at least when translating, Met might be removed in later processing states). Methionine is coded with ATG. The exercise is therefore; find the position of all ATG's in the sequence. The first position is 83 as humans count. <br>In some organisms different start codons are possible. If you really want to, you can make the program handle those cases too.
	# Read the file ''orphans.sp'' and find all accession numbers (and only the accession numbers), save them in another file of your choosing. Hint: an accession number might look like this AB000114.CDS.1 or like this AB000114 or like this AB000114.CDS.3. CDS means CoDing Sequence followed by a number. If the accession number contains the CDS part, consider .CDS.1 as a part of the accession number. Accession numbers differ in length for historical reasons. You can assume that the accession number comes straight after the '''>''', which is first on the line.		# Read the file ''orphans.sp'' and find all accession numbers (and only the accession numbers), save them in another file of your choosing. Hint: an accession number might look like this AB000114.CDS.1 or like this AB000114 or like this AB000114.CDS.3. CDS means CoDing Sequence followed by a number. If the accession number contains the CDS part, consider .CDS.1 as a part of the accession number. Accession numbers differ in length for historical reasons. You can assume that the accession number comes straight after the '''>''', which is first on the line.
	# ~~<font color="AA00FF">~~Connecting to the previous exercise; Assuming that the first Met at position 83 is translation start, find the corresponding translation stop (which is the first one in frame). Stop codon is coded by TAA, TAG, or TGA. Remember that the stop codon has to be in the same reading frame as ATG. Notice: There are two ways to solving this exercise. The primitive way is to start at the position given. The more general and better way is to find the first ATG and then find the corresponding stop codon, which is on position 128.~~</font>~~		# Connecting to the previous exercise; Assuming that the first Met at position 83 is translation start, find the corresponding translation stop (which is the first one in frame). Stop codon is coded by TAA, TAG, or TGA. Remember that the stop codon has to be in the same reading frame as ATG. Notice: There are two ways to solving this exercise. The primitive way is to start at the position given. The more general and better way is to find the first ATG and then find the corresponding stop codon, which is on position 128.
	# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>		# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>
	# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).		# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).

WikiSysop: /* Exercises to be handed in */

2025-08-27T21:46:27Z

Exercises to be handed in

← Older revision		Revision as of 23:46, 27 August 2025
Line 23:		Line 23:
	== Exercises to be handed in ==		== Exercises to be handed in ==
	# In the file ''dna.fsa'' is some DNA. Construct a program that finds possible translation starts :-)<br>All proteins start with the amino acid methionine (at least when translating, Met might be removed in later processing states). Methionine is coded with ATG. The exercise is therefore; find the position of all ATG's in the sequence. The first position is 83 as humans count. <br>In some organisms different start codons are possible. If you really want to, you can make the program handle those cases too.		# In the file ''dna.fsa'' is some DNA. Construct a program that finds possible translation starts :-)<br>All proteins start with the amino acid methionine (at least when translating, Met might be removed in later processing states). Methionine is coded with ATG. The exercise is therefore; find the position of all ATG's in the sequence. The first position is 83 as humans count. <br>In some organisms different start codons are possible. If you really want to, you can make the program handle those cases too.
			# Read the file ''orphans.sp'' and find all accession numbers (and only the accession numbers), save them in another file of your choosing. Hint: an accession number might look like this AB000114.CDS.1 or like this AB000114 or like this AB000114.CDS.3. CDS means CoDing Sequence followed by a number. If the accession number contains the CDS part, consider .CDS.1 as a part of the accession number. Accession numbers differ in length for historical reasons. You can assume that the accession number comes straight after the '''>''', which is first on the line.
	# <font color="AA00FF">Connecting to the previous exercise; Assuming that the first Met at position 83 is translation start, find the corresponding translation stop (which is the first one in frame). Stop codon is coded by TAA, TAG, or TGA. Remember that the stop codon has to be in the same reading frame as ATG. Notice: There are two ways to solving this exercise. The primitive way is to start at the position given. The more general and better way is to find the first ATG and then find the corresponding stop codon, which is on position 128.</font>		# <font color="AA00FF">Connecting to the previous exercise; Assuming that the first Met at position 83 is translation start, find the corresponding translation stop (which is the first one in frame). Stop codon is coded by TAA, TAG, or TGA. Remember that the stop codon has to be in the same reading frame as ATG. Notice: There are two ways to solving this exercise. The primitive way is to start at the position given. The more general and better way is to find the first ATG and then find the corresponding stop codon, which is on position 128.</font>
	# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>		# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>

WikiSysop: /* Exercises to be handed in */

2025-08-27T20:46:02Z

Exercises to be handed in

← Older revision		Revision as of 22:46, 27 August 2025
Line 26:		Line 26:
	# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>		# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>
	# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).		# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).
	# The file ''~~studentweigth~~.txt'' contains both text lines and numbers. Make a program that can sum the numbers and ignore the text lines using exceptions.		# The file ''studentweight.txt'' contains both text lines and numbers. Make a program that can sum the numbers and ignore the text lines using exceptions.

	== Exercises for extra practice ==		== Exercises for extra practice ==

WikiSysop: /* Exercises to be handed in */

2025-08-27T20:45:48Z

Exercises to be handed in

← Older revision		Revision as of 22:45, 27 August 2025
Line 26:		Line 26:
	# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>		# <font color="AA00FF">Make a program that asks for an organism, like 'HUMAN' or 'RAT'. The program should then count the number of lines/times a SwissProt identifier in the file ''orphans.sp'' is present with said organism, ie. PARG_HUMAN and LUM_HUMAN are the two first for HUMAN. Hint: you should probably think twice in this exercise. The position is significant. Check what happens if you search for RAT.</font>
	# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).		# Count the ATCG's in the sequence in ''dna.fsa''. Display the percentage of ATCG's with 2 digits after the dot. Make it look really structured. Just to be exceedingly clear; the percentage of A's is 100*(NumberOfA/LengthOfSequence).
	# The file ''~~mixedbag~~.txt'' contains both text lines and numbers. Make a program that can sum the numbers and ignore the text lines using exceptions.		# The file ''studentweigth.txt'' contains both text lines and numbers. Make a program that can sum the numbers and ignore the text lines using exceptions.

	== Exercises for extra practice ==		== Exercises for extra practice ==