Pseudocode and comments - Revision history

WikiSysop: /* Exercises to be handed in */

2025-10-03T13:53:18Z

Exercises to be handed in

← Older revision		Revision as of 15:53, 3 October 2025
Line 27:		Line 27:
	Again, lists are unnecessary to solve the exercises, but you can make 2 solutions if you want to show your list skills.		Again, lists are unnecessary to solve the exercises, but you can make 2 solutions if you want to show your list skills.
	<font color="#AA00FF">		<font color="#AA00FF">
	# Ask for a file name, read the numbers in the file, calculating the average and print it. Continue to ask for file names and calculate the average in the given file and print it until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.		# Ask for a file name, read the numbers in the file, calculating the average and print it. Continue to ask for file names and calculate the average in the given file and print it until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.<br><br>
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output. Note: using strip() or something similar will be required in this exercise.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.<br><br>
	# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting. If you have difficultly imagining this, write two columns of numbers (no duplicates) on paper and merge the two columns into one by hand.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output. Note: using strip() or something similar will be required in this exercise.<br><br>
	# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No lists, no sorting. Hint: There are 8 bad numbers in ''numbers3.txt''.		# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting. If you have difficultly imagining this, write two columns of numbers (no duplicates) on paper and merge the two columns into one by hand.<br><br>
			# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No lists, no sorting. Hint: There are 8 bad numbers in ''numbers3.txt''.<br><br>
	# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.		# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.

WikiSysop: /* Exercises to be handed in */

2025-09-15T13:02:40Z

Exercises to be handed in

← Older revision		Revision as of 15:02, 15 September 2025
Line 30:		Line 30:
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output. Note: using strip() or something similar will be required in this exercise.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output. Note: using strip() or something similar will be required in this exercise.
	# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.		# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting. If you have difficultly imagining this, write two columns of numbers (no duplicates) on paper and merge the two columns into one by hand.
	# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No lists, no sorting. Hint: There are 8 bad numbers in ''numbers3.txt''.		# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No lists, no sorting. Hint: There are 8 bad numbers in ''numbers3.txt''.
	# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.		# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.

WikiSysop: /* Exercises to be handed in */

2025-09-15T13:00:26Z

Exercises to be handed in

← Older revision		Revision as of 15:00, 15 September 2025
Line 29:		Line 29:
	# Ask for a file name, read the numbers in the file, calculating the average and print it. Continue to ask for file names and calculate the average in the given file and print it until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.		# Ask for a file name, read the numbers in the file, calculating the average and print it. Continue to ask for file names and calculate the average in the given file and print it until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output. Note: using strip() or something similar will be required in this exercise.
	# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.		# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.
	# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No lists, no sorting. Hint: There are 8 bad numbers in ''numbers3.txt''.		# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No lists, no sorting. Hint: There are 8 bad numbers in ''numbers3.txt''.

WikiSysop: /* Exercises to be handed in */

2025-09-15T12:47:19Z

Exercises to be handed in

← Older revision		Revision as of 14:47, 15 September 2025
Line 27:		Line 27:
	Again, lists are unnecessary to solve the exercises, but you can make 2 solutions if you want to show your list skills.		Again, lists are unnecessary to solve the exercises, but you can make 2 solutions if you want to show your list skills.
	<font color="#AA00FF">		<font color="#AA00FF">
	# Ask for a file name, read the numbers in the file, calculating the average. Continue to ask for file names and calculate the average in the given file until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.		# Ask for a file name, read the numbers in the file, calculating the average and print it. Continue to ask for file names and calculate the average in the given file and print it until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.

WikiSysop: /* Exercises to be handed in */

2025-08-27T21:50:44Z

Exercises to be handed in

← Older revision		Revision as of 23:50, 27 August 2025
Line 31:		Line 31:
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.
	# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.		# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.
	# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No lists, no sorting.		# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No lists, no sorting. Hint: There are 8 bad numbers in ''numbers3.txt''.
	# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.		# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.

WikiSysop: /* Exercises to be handed in */

2025-08-27T21:47:33Z

Exercises to be handed in

← Older revision		Revision as of 23:47, 27 August 2025
Line 31:		Line 31:
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.
	# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.		# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.
	# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No ~~list~~, no sorting.		# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No lists, no sorting.
	# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.		# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.

WikiSysop: /* Exercises to be handed in */

2025-08-27T21:45:59Z

Exercises to be handed in

← Older revision		Revision as of 23:45, 27 August 2025
Line 28:		Line 28:
	<font color="#AA00FF">		<font color="#AA00FF">
	# Ask for a file name, read the numbers in the file, calculating the average. Continue to ask for file names and calculate the average in the given file until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.		# Ask for a file name, read the numbers in the file, calculating the average. Continue to ask for file names and calculate the average in the given file until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.
	# 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.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.
	# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.		# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.
			# Unfortunately, some bad numbers got mixed into ''numbers3.txt''. In the file ''badnumbers.txt'' is a sorted list of bad numbers. If any of these numbers are in ''numbers3.txt'' they must be removed and a new file with only the good numbers ''goodnumbers.txt'' must be created. No list, no sorting.
	# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.		# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.

WikiSysop: /* Exercises to be handed in */

2025-08-27T21:16:00Z

Exercises to be handed in

← Older revision		Revision as of 23:16, 27 August 2025
Line 31:		Line 31:
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Now copy/print the lines in the input files into the output file so that the first line of each input file are merged together with a tab and becomes the first line of the output. Continue that way with all the lines in the input file. A mental picture of what is supposed to happen is this: Imagine the 2 input files to be two pieces of paper with lines. In the exercise before the papers were put one after the other in the output. In this exercise the papers are put next to each other (sideways) in the output.
			# The files ''numbers1.txt'' and ''numbers2.txt'' contain 100 different numbers each in sorted order. Write a program that merges these two files in ''numbers3.txt'' which will then contain all 200 numbers in sorted order. No matter what you think, this does not require lists nor extra sorting.
	# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.		# Playing time again. Make the guessing program (lesson 1, exercise 9) count how many attempts it needed to guess the number and print it when done guessing. It must be able to detect if you lie (and say so, of course). Also, if you haven't done it before, make the program guess in the fewest possible guesses (an example of 'binary search'). This is what most people naturally do by themselves when they play the game. You 'just' have to do it in the program. There is a system, a method - find it. Hint: it is probably better to start over than reuse your old program.

WikiSysop: /* Exercises to be handed in */

2025-08-27T17:03:34Z

Exercises to be handed in

← Older revision		Revision as of 19:03, 27 August 2025
Line 27:		Line 27:
	Again, lists are unnecessary to solve the exercises, but you can make 2 solutions if you want to show your list skills.		Again, lists are unnecessary to solve the exercises, but you can make 2 solutions if you want to show your list skills.
	<font color="#AA00FF">		<font color="#AA00FF">
	# Ask for a file name, read the numbers in the file, calculating the average. Continue to ask for file names and calculate the average until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.		# Ask for a file name, read the numbers in the file, calculating the average. Continue to ask for file names and calculate the average in the given file until you enter nothing - no file name. Test on the files ''ex1_1.dat'', ''ex1_2.dat'' & ''ex1_3.dat''.
	# 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.
	# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.		# Ask for 2 input file names (''ex1.acc'' & ''ex1.dat'' are good) and an output file name. Copy (read and write) the input files into the output file, one after the other.

WikiSysop at 15:22, 27 August 2025

2025-08-27T15:22:16Z

← Older revision		Revision as of 17:22, 27 August 2025
Line 36:		Line 36:

	== Exercises for extra practice ==		== Exercises for extra practice ==
			* Ask for a filename. Open the file and read and display the lines in a loop. However, if the line is empty, do not display it. Try on ''mixedlines.txt''.