c
Спасибо
Size: a a a
2020 May 29
2020 May 30
VE
Кто может подсказать, где можно попрактиковаться в многопоточности?
Task:
Design and implement a simple Java program to find specific strings in a large text. The program should be composed of the following modules: 1. The main module - reads a large text file in parts (e.g. 1000 lines in each part) and sends each part (as string) to a matcher . After all matchers completed, it calls the aggregator to combine and print the results 2. The matcher - gets a text string as input and searches for matches of a given set of strings. The result is a map from a word to its location(s) in the text 3. The aggregator - aggregates the results from all the matchers and prints the results.
For this task, please use the text at http://norvig.com/big.txt (download it and use local version), and the strings to find should be the 50 most common English first names: James, John, Robert, Michael, William, David, Richard, Charles, Joseph, Thomas, Christopher, Daniel, Paul, Mark, Donald, George, Kenneth, Steven, Edward, Brian, Ronald, Anthony, Kevin, Jason, Matthew, Gary, Timothy, Jose, Larry, Jeffrey, Frank, Scott, Eric, Stephen, Andrew, Raymond, Gregory, Joshua, Jerry, Dennis, Walter, Patrick, Peter, Harold, Douglas, Henry, Carl, Arthur, Ryan, Roger.
Example of one line from the program output based on the input above: Timothy --> [[lineOffset=13000, charOffset=19775], [lineOffset=13000, charOffset=42023]]
There should be several concurrent matchers (i.e each matcher should run in a separate thread). The results should be printed (in no particular order) after all text pieces have been processed. Please provide a main method that executes a sample run.
This task should be done alone. You can make use of any written or web resource you find, incl. 3rd party libraries).
The code should work, and be as clean and efficient as you think necessary.
Design and implement a simple Java program to find specific strings in a large text. The program should be composed of the following modules: 1. The main module - reads a large text file in parts (e.g. 1000 lines in each part) and sends each part (as string) to a matcher . After all matchers completed, it calls the aggregator to combine and print the results 2. The matcher - gets a text string as input and searches for matches of a given set of strings. The result is a map from a word to its location(s) in the text 3. The aggregator - aggregates the results from all the matchers and prints the results.
For this task, please use the text at http://norvig.com/big.txt (download it and use local version), and the strings to find should be the 50 most common English first names: James, John, Robert, Michael, William, David, Richard, Charles, Joseph, Thomas, Christopher, Daniel, Paul, Mark, Donald, George, Kenneth, Steven, Edward, Brian, Ronald, Anthony, Kevin, Jason, Matthew, Gary, Timothy, Jose, Larry, Jeffrey, Frank, Scott, Eric, Stephen, Andrew, Raymond, Gregory, Joshua, Jerry, Dennis, Walter, Patrick, Peter, Harold, Douglas, Henry, Carl, Arthur, Ryan, Roger.
Example of one line from the program output based on the input above: Timothy --> [[lineOffset=13000, charOffset=19775], [lineOffset=13000, charOffset=42023]]
There should be several concurrent matchers (i.e each matcher should run in a separate thread). The results should be printed (in no particular order) after all text pieces have been processed. Please provide a main method that executes a sample run.
This task should be done alone. You can make use of any written or web resource you find, incl. 3rd party libraries).
The code should work, and be as clean and efficient as you think necessary.
VE
Реальная задача с собеседования на проект
c
О, круто
VE
Мне, в свое время, показалась очень интересной
NS
tak a posiciya kakaya?
VE
Конкретно это не оговаривалось, так что трудно сказать точно
.
Junior скорее всего
.
задание не сильно хардово
h
Интересно - тут больше suffix tree подойдет?
UDP: хотя нет, все же хеш таблицу
UDP: хотя нет, все же хеш таблицу
Э
Task:
Design and implement a simple Java program to find specific strings in a large text. The program should be composed of the following modules: 1. The main module - reads a large text file in parts (e.g. 1000 lines in each part) and sends each part (as string) to a matcher . After all matchers completed, it calls the aggregator to combine and print the results 2. The matcher - gets a text string as input and searches for matches of a given set of strings. The result is a map from a word to its location(s) in the text 3. The aggregator - aggregates the results from all the matchers and prints the results.
For this task, please use the text at http://norvig.com/big.txt (download it and use local version), and the strings to find should be the 50 most common English first names: James, John, Robert, Michael, William, David, Richard, Charles, Joseph, Thomas, Christopher, Daniel, Paul, Mark, Donald, George, Kenneth, Steven, Edward, Brian, Ronald, Anthony, Kevin, Jason, Matthew, Gary, Timothy, Jose, Larry, Jeffrey, Frank, Scott, Eric, Stephen, Andrew, Raymond, Gregory, Joshua, Jerry, Dennis, Walter, Patrick, Peter, Harold, Douglas, Henry, Carl, Arthur, Ryan, Roger.
Example of one line from the program output based on the input above: Timothy --> [[lineOffset=13000, charOffset=19775], [lineOffset=13000, charOffset=42023]]
There should be several concurrent matchers (i.e each matcher should run in a separate thread). The results should be printed (in no particular order) after all text pieces have been processed. Please provide a main method that executes a sample run.
This task should be done alone. You can make use of any written or web resource you find, incl. 3rd party libraries).
The code should work, and be as clean and efficient as you think necessary.
Design and implement a simple Java program to find specific strings in a large text. The program should be composed of the following modules: 1. The main module - reads a large text file in parts (e.g. 1000 lines in each part) and sends each part (as string) to a matcher . After all matchers completed, it calls the aggregator to combine and print the results 2. The matcher - gets a text string as input and searches for matches of a given set of strings. The result is a map from a word to its location(s) in the text 3. The aggregator - aggregates the results from all the matchers and prints the results.
For this task, please use the text at http://norvig.com/big.txt (download it and use local version), and the strings to find should be the 50 most common English first names: James, John, Robert, Michael, William, David, Richard, Charles, Joseph, Thomas, Christopher, Daniel, Paul, Mark, Donald, George, Kenneth, Steven, Edward, Brian, Ronald, Anthony, Kevin, Jason, Matthew, Gary, Timothy, Jose, Larry, Jeffrey, Frank, Scott, Eric, Stephen, Andrew, Raymond, Gregory, Joshua, Jerry, Dennis, Walter, Patrick, Peter, Harold, Douglas, Henry, Carl, Arthur, Ryan, Roger.
Example of one line from the program output based on the input above: Timothy --> [[lineOffset=13000, charOffset=19775], [lineOffset=13000, charOffset=42023]]
There should be several concurrent matchers (i.e each matcher should run in a separate thread). The results should be printed (in no particular order) after all text pieces have been processed. Please provide a main method that executes a sample run.
This task should be done alone. You can make use of any written or web resource you find, incl. 3rd party libraries).
The code should work, and be as clean and efficient as you think necessary.
Это, скорей, задача для начинающего
Э
Мы такие в универе на лабах решали
БТ
С многопоточностью?
Э
Один хер
БТ
Не один
.
может кто подсказать где можно лучше узнать хороший ресурс по рефлексии , в целом не шарю за нее совсем
S
может кто подсказать где можно лучше узнать хороший ресурс по рефлексии , в целом не шарю за нее совсем
А вот даже у Оракла вполне пристойное руководство (английски) https://www.oracle.com/technical-resources/articles/java/javareflection.html
.
А вот даже у Оракла вполне пристойное руководство (английски) https://www.oracle.com/technical-resources/articles/java/javareflection.html
Благодарю
Е
Task:
Design and implement a simple Java program to find specific strings in a large text. The program should be composed of the following modules: 1. The main module - reads a large text file in parts (e.g. 1000 lines in each part) and sends each part (as string) to a matcher . After all matchers completed, it calls the aggregator to combine and print the results 2. The matcher - gets a text string as input and searches for matches of a given set of strings. The result is a map from a word to its location(s) in the text 3. The aggregator - aggregates the results from all the matchers and prints the results.
For this task, please use the text at http://norvig.com/big.txt (download it and use local version), and the strings to find should be the 50 most common English first names: James, John, Robert, Michael, William, David, Richard, Charles, Joseph, Thomas, Christopher, Daniel, Paul, Mark, Donald, George, Kenneth, Steven, Edward, Brian, Ronald, Anthony, Kevin, Jason, Matthew, Gary, Timothy, Jose, Larry, Jeffrey, Frank, Scott, Eric, Stephen, Andrew, Raymond, Gregory, Joshua, Jerry, Dennis, Walter, Patrick, Peter, Harold, Douglas, Henry, Carl, Arthur, Ryan, Roger.
Example of one line from the program output based on the input above: Timothy --> [[lineOffset=13000, charOffset=19775], [lineOffset=13000, charOffset=42023]]
There should be several concurrent matchers (i.e each matcher should run in a separate thread). The results should be printed (in no particular order) after all text pieces have been processed. Please provide a main method that executes a sample run.
This task should be done alone. You can make use of any written or web resource you find, incl. 3rd party libraries).
The code should work, and be as clean and efficient as you think necessary.
Design and implement a simple Java program to find specific strings in a large text. The program should be composed of the following modules: 1. The main module - reads a large text file in parts (e.g. 1000 lines in each part) and sends each part (as string) to a matcher . After all matchers completed, it calls the aggregator to combine and print the results 2. The matcher - gets a text string as input and searches for matches of a given set of strings. The result is a map from a word to its location(s) in the text 3. The aggregator - aggregates the results from all the matchers and prints the results.
For this task, please use the text at http://norvig.com/big.txt (download it and use local version), and the strings to find should be the 50 most common English first names: James, John, Robert, Michael, William, David, Richard, Charles, Joseph, Thomas, Christopher, Daniel, Paul, Mark, Donald, George, Kenneth, Steven, Edward, Brian, Ronald, Anthony, Kevin, Jason, Matthew, Gary, Timothy, Jose, Larry, Jeffrey, Frank, Scott, Eric, Stephen, Andrew, Raymond, Gregory, Joshua, Jerry, Dennis, Walter, Patrick, Peter, Harold, Douglas, Henry, Carl, Arthur, Ryan, Roger.
Example of one line from the program output based on the input above: Timothy --> [[lineOffset=13000, charOffset=19775], [lineOffset=13000, charOffset=42023]]
There should be several concurrent matchers (i.e each matcher should run in a separate thread). The results should be printed (in no particular order) after all text pieces have been processed. Please provide a main method that executes a sample run.
This task should be done alone. You can make use of any written or web resource you find, incl. 3rd party libraries).
The code should work, and be as clean and efficient as you think necessary.
а задачку надо было решить прям у них в офисе или домой дают? И сколько времени дают на решение?
VE
Евгений
а задачку надо было решить прям у них в офисе или домой дают? И сколько времени дают на решение?
3ч