Erinevus lehekülje "ITI0011-2015:harjutus 05" redaktsioonide vahel

Allikas: Kursused
Mine navigeerimisribale Mine otsikasti
3. rida: 3. rida:
 
Üldine informatsioon harjutuste kohta: [[ITI0011:harjutused]].
 
Üldine informatsioon harjutuste kohta: [[ITI0011:harjutused]].
  
Näidissisend: [[Meedia:Garbage_Collector_Article.txt]] (kood peab töötama suvalise etteantud sõnega).
+
Näidissisend: [[Meedia:Garbage_Collector_Article.txt|Garbage_Collector_Article.txt]] (kood peab töötama suvalise etteantud sõnega).
  
 
== Lähtekood ==
 
== Lähtekood ==

Redaktsioon: 26. veebruar 2015, kell 13:19

Harjutuse tähtaeg on 9. praktikum (3. märts).

Üldine informatsioon harjutuste kohta: ITI0011:harjutused.

Näidissisend: Garbage_Collector_Article.txt (kood peab töötama suvalise etteantud sõnega).

Lähtekood

<source lang="java"> import java.util.ArrayList; import java.util.HashMap; import java.util.HashSet;

public class CollectionTask {

/** * The function should read the contents of the file * designated by the filename and return its contents * as a string. * @param filename - A file name to read. * @return null if file is inaccessible (cannot be read or does not exist), * a string containing file contents otherwise. */ public static String readFile(String filename) { String text = "";

return text; }

/** * The function returns a list containing * all the words from the input string. * @param text - an input string. * @return null, if the string is not supplied, * an empty list, if the string contains no words, * a list of words otherwise. */ public static ArrayList<String> getWords(String text) {

// TODO Enter your code here

return null; }

/** * The function returns the set containing only * unique words from the input string. * @param text - an input string * @return null, if the string is not supplied, * an empty set, if the string contains no words, * a set of unique words otherwise. */ public static HashSet<String> getUniqueWords(String text) {

// TODO Enter your code here

return null; }


/** * The function counts how many times each word * can be found in the text and saves this * information in the Map object, where the key is * the word, and the value is the amount of times * the considered word can be found in the text. * @param text - an input string * @return null, if the string is not supplied, * an empty set, if the string contains no words, * a map of words otherwise. */ public static HashMap<String, Integer> getWordCount(String text) {

// TODO Enter your code here

return null; }

/** * The main function should print out * the result of the getWordCount() method. * @param args - input parameters. */ public static void main(String[] args) { // TODO Enter your code here }

} </source>