DSA Projects - Revizia istoricului

Rhobincu la 24 august 2014 10:56

2014-08-24T10:56:16Z

Rhobincu la 7 iulie 2014 09:36

2014-07-07T09:36:34Z

Rhobincu la 7 iulie 2014 09:34

2014-07-07T09:34:06Z

Rhobincu la 7 iulie 2014 09:27

2014-07-07T09:27:14Z

Rhobincu la 7 iulie 2014 09:25

2014-07-07T09:25:35Z

Rhobincu la 7 iulie 2014 08:24

2014-07-07T08:24:31Z

Rhobincu: Pagină nouă: The following projects may be implemented for increasing the continuous evaluation grade for SDA. The projects will be accompanied by a slide presentation. You may do the project in a...

2014-06-15T21:40:04Z

Pagină nouă: The following projects may be implemented for increasing the continuous evaluation grade for SDA. The projects will be accompanied by a slide presentation. You may do the project in a...

Pagină nouă

The following projects may be implemented for increasing the continuous evaluation grade for SDA. The projects will be accompanied by a slide presentation. You may do the project in any programming language you want.

# Involvement in any OpenSource projects for development or bug fixing (e.g: The Linux Kernel: http://eudyptula-challenge.org/, the Ubuntu Linux Distribution: http://community.ubuntu.com/contribute/, The Netbeans IDE: https://netbeans.org/community/contribute/, etc.). Any involvement, no matter how small, counts, as long as it is included in a release.
# Learn a new programming language (Java, Python, C#, Scheme, ObjectiveC, etc.) and re-do the homework exercises in that language.
# Join a software & programming summer school or internship.

More particular requirements will be added soon.

← Versiunea anterioară		Versiunea de la data 24 august 2014 10:56
Linia 10:		Linia 10:
	#* a password should not contain any three consecutive characters from the old password;		#* a password should not contain any three consecutive characters from the old password;
	# Write an application that parses a text file and creates a statistic with every word that appears in the text and the number of occurrences. Then write a basic compression algorithm for text files that works by replacing the most common words with a code that represents a dictionary entry. For example, you can encode "and" as 0 so you replace "and" everywhere in the text with 0. Don't replace a word unless the length of the code is less than the length of the word (so don't replace "and" with 1234) and the addition of the dictionary entry doesn't make the file larger (for example, if there are two "and" in the text, and they are replaced by 0, you save 4 characters, however, if you add the dictionary entry "0=and", you lose 6 characters -- newline char is the sixth --, so overall, your file is two characters larger). Also make sure you properly handle the numbers that appear in the original text, so that decompression doesn't accidentally replace them with words (you can, for example, add an escape character before them, so you know that they aren't dictionary entries). The dictionary must be added to the compressed file. Also write a decompression algorithm that replaces the numbers with the corresponding dictionary entry and removes the dictionary from the file. The usage of the application should be: "./comdecom -c source.txt compressed_file.comp" and "./comdecom -d compressed_file.comp decompressed_file.txt". The flags "-c" and "-d" stand for "compress" and "decompress" and they are followed by file names. After running both commands above, the file "compressed_file.comp" should be smaller than "source.txt" and "source.txt" and "decompressed_file.txt" must be identical.		# Write an application that parses a text file and creates a statistic with every word that appears in the text and the number of occurrences. Then write a basic compression algorithm for text files that works by replacing the most common words with a code that represents a dictionary entry. For example, you can encode "and" as 0 so you replace "and" everywhere in the text with 0. Don't replace a word unless the length of the code is less than the length of the word (so don't replace "and" with 1234) and the addition of the dictionary entry doesn't make the file larger (for example, if there are two "and" in the text, and they are replaced by 0, you save 4 characters, however, if you add the dictionary entry "0=and", you lose 6 characters -- newline char is the sixth --, so overall, your file is two characters larger). Also make sure you properly handle the numbers that appear in the original text, so that decompression doesn't accidentally replace them with words (you can, for example, add an escape character before them, so you know that they aren't dictionary entries). The dictionary must be added to the compressed file. Also write a decompression algorithm that replaces the numbers with the corresponding dictionary entry and removes the dictionary from the file. The usage of the application should be: "./comdecom -c source.txt compressed_file.comp" and "./comdecom -d compressed_file.comp decompressed_file.txt". The flags "-c" and "-d" stand for "compress" and "decompress" and they are followed by file names. After running both commands above, the file "compressed_file.comp" should be smaller than "source.txt" and "source.txt" and "decompressed_file.txt" must be identical.
−
−	~~More particular requirements will be added soon.~~

@@ Linia 9: / Linia 9: @@
 #* a password should not contain the username;
 #* a password should not contain any three consecutive characters from the old password;
-# Write an application that parses a text file and creates a statistic with every word that appears in the text and the number of occurrences. Then write a basic compression algorithm for text files that works by replacing the most common words with a code that represents a dictionary entry. For example, you can encode "and" as 0 so you replace "and" everywhere in the text with 0. Don't replace a word unless the length of the code is less than the length of the word (so don't replace "and" with 1234) and the addition of the dictionary entry doesn't make the file larger (for example, if there are two "and" in the text, and they are replaced by 0, you save 4 characters, however, if you add the dictionary entry "0=and", you lose 5 characters, so overall, your file is one character larger). Also make sure you properly handle the numbers that appear in the original text, so that decompression doesn't accidentally replace them with words (you can, for example, add an escape character before them, so you know that they aren't dictionary entries). The dictionary must be added to the compressed file. Also write a decompression algorithm that replaces the numbers with the corresponding dictionary entry and removes the dictionary from the file. The usage of the application should be: "./comdecom -c source.txt compressed_file.comp" and "./comdecom -d compressed_file.comp decompressed_file.txt". The flags "-c" and "-d" stand for "compress" and "decompress" and they are followed by file names.
+# Write an application that parses a text file and creates a statistic with every word that appears in the text and the number of occurrences. Then write a basic compression algorithm for text files that works by replacing the most common words with a code that represents a dictionary entry. For example, you can encode "and" as 0 so you replace "and" everywhere in the text with 0. Don't replace a word unless the length of the code is less than the length of the word (so don't replace "and" with 1234) and the addition of the dictionary entry doesn't make the file larger (for example, if there are two "and" in the text, and they are replaced by 0, you save 4 characters, however, if you add the dictionary entry "0=and", you lose 6 characters -- newline char is the sixth --, so overall, your file is two characters larger). Also make sure you properly handle the numbers that appear in the original text, so that decompression doesn't accidentally replace them with words (you can, for example, add an escape character before them, so you know that they aren't dictionary entries). The dictionary must be added to the compressed file. Also write a decompression algorithm that replaces the numbers with the corresponding dictionary entry and removes the dictionary from the file. The usage of the application should be: "./comdecom -c source.txt compressed_file.comp" and "./comdecom -d compressed_file.comp decompressed_file.txt". The flags "-c" and "-d" stand for "compress" and "decompress" and they are followed by file names. After running both commands above, the file "compressed_file.comp" should be smaller than "source.txt" and "source.txt" and "decompressed_file.txt" must be identical.
 More particular requirements will be added soon.

@@ Linia 9: / Linia 9: @@
 #* a password should not contain the username;
 #* a password should not contain any three consecutive characters from the old password;
-# Write an application that parses a text file and creates a statistic with every word that appears in the text and the number of occurrences. Then write a basic compression algorithm for text files that works by replacing the most common words with a code that represents a dictionary entry. For example, you can encode "and" as 0 so you replace "and" everywhere in the text with 0. Don't replace a word unless the length of the code is less than the length of the word (so don't replace "and" with 1234) and the addition of the dictionary entry doesn't make the file larger. Also make sure you properly handle the numbers that appear in the original text, so that decompression doesn't accidentally replace them with words (you can, for example, add an escape character before them, so you know that they aren't dictionary entries). The dictionary must be added to the compressed file. Also write a decompression algorithm that replaces the numbers with the corresponding dictionary entry and removes the dictionary from the file. The usage of the application should be: "./comdecom -c source.txt compressed_file.comp" and "./comdecom -d compressed_file.comp decompressed_file.txt". The flags "-c" and "-d" stand for "compress" and "decompress" and they are followed by file names.
+# Write an application that parses a text file and creates a statistic with every word that appears in the text and the number of occurrences. Then write a basic compression algorithm for text files that works by replacing the most common words with a code that represents a dictionary entry. For example, you can encode "and" as 0 so you replace "and" everywhere in the text with 0. Don't replace a word unless the length of the code is less than the length of the word (so don't replace "and" with 1234) and the addition of the dictionary entry doesn't make the file larger (for example, if there are two "and" in the text, and they are replaced by 0, you save 4 characters, however, if you add the dictionary entry "0=and", you lose 5 characters, so overall, your file is one character larger). Also make sure you properly handle the numbers that appear in the original text, so that decompression doesn't accidentally replace them with words (you can, for example, add an escape character before them, so you know that they aren't dictionary entries). The dictionary must be added to the compressed file. Also write a decompression algorithm that replaces the numbers with the corresponding dictionary entry and removes the dictionary from the file. The usage of the application should be: "./comdecom -c source.txt compressed_file.comp" and "./comdecom -d compressed_file.comp decompressed_file.txt". The flags "-c" and "-d" stand for "compress" and "decompress" and they are followed by file names.
 More particular requirements will be added soon.

@@ Linia 9: / Linia 9: @@
 #* a password should not contain the username;
 #* a password should not contain any three consecutive characters from the old password;
-# Write an application that parses a text file and creates a statistic with every word that appears in the text and the number of occurrences. Then write a basic compression algorithm for text files that works by replacing the most common words with a code that represents a dictionary entry. For example, you can encode "and" as 0 so you replace "and" everywhere in the text with 0. Don't replace a word unless the length of the code is less than the length of the word (so don't replace "and" with 1234) and the addition of the dictionary entry doesn't make the file larger. Also make sure you properly handle the numbers that appear in the original text, so that decompression doesn't accidentally replace them with words). The dictionary must be added to the compressed file. Also write a decompression algorithm that replaces the numbers with the corresponding dictionary entry and removes the dictionary from the file. The usage of the application should be: "./comdecom -c source.txt compressed_file.comp" and "./comdecom -d compressed_file.comp decompressed_file.txt". The flags "-c" and "-d" stand for "compress" and "decompress" and they are followed by file names.
+# Write an application that parses a text file and creates a statistic with every word that appears in the text and the number of occurrences. Then write a basic compression algorithm for text files that works by replacing the most common words with a code that represents a dictionary entry. For example, you can encode "and" as 0 so you replace "and" everywhere in the text with 0. Don't replace a word unless the length of the code is less than the length of the word (so don't replace "and" with 1234) and the addition of the dictionary entry doesn't make the file larger. Also make sure you properly handle the numbers that appear in the original text, so that decompression doesn't accidentally replace them with words (you can, for example, add an escape character before them, so you know that they aren't dictionary entries). The dictionary must be added to the compressed file. Also write a decompression algorithm that replaces the numbers with the corresponding dictionary entry and removes the dictionary from the file. The usage of the application should be: "./comdecom -c source.txt compressed_file.comp" and "./comdecom -d compressed_file.comp decompressed_file.txt". The flags "-c" and "-d" stand for "compress" and "decompress" and they are followed by file names.
 More particular requirements will be added soon.

@@ Linia 9: / Linia 9: @@
 #* a password should not contain the username;
 #* a password should not contain any three consecutive characters from the old password;
+# Write an application that parses a text file and creates a statistic with every word that appears in the text and the number of occurrences. Then write a basic compression algorithm for text files that works by replacing the most common words with a code that represents a dictionary entry. For example, you can encode "and" as 0 so you replace "and" everywhere in the text with 0. Don't replace a word unless the length of the code is less than the length of the word (so don't replace "and" with 1234) and the addition of the dictionary entry doesn't make the file larger. Also make sure you properly handle the numbers that appear in the original text, so that decompression doesn't accidentally replace them with words). The dictionary must be added to the compressed file. Also write a decompression algorithm that replaces the numbers with the corresponding dictionary entry and removes the dictionary from the file. The usage of the application should be: "./comdecom -c source.txt compressed_file.comp" and "./comdecom -d compressed_file.comp decompressed_file.txt". The flags "-c" and "-d" stand for "compress" and "decompress" and they are followed by file names.
 More particular requirements will be added soon.

@@ Linia 4: / Linia 4: @@
 # Learn a new programming language (Java, Python, C#, Scheme, ObjectiveC, etc.) and re-do the homework exercises in that language.
 # Join a software & programming summer school or internship.
 More particular requirements will be added soon.