Description A local company is seeking for help on their search service. They want to implement a search engine and provide functionality to show related words stored in their database. The search engine should support following command: • Add . The command will add the keyword into the search engine for search in the future. • Delete . The command will remove the keyword from the search engine, so that users will not get result when searching exact . If the word doesn't exist, the command should not affect any other word in the search engine. • Find . Return the word if a word in the search engine is found and exactly matches with , otherwise return an empty string "". • Search . Return the first word with prefix matches , if there are multiple matches, just return the first word matches alphabetically. For example, suppose that we have applejack and application in the search engine. If we run command Search app, the search engine returns applejack since applejack is alphabetically smaller than application. To simplify the implementation, s are strings that only contains lowercase letters, and s are strings that contains lowercase letters and wildcard symbol *, which represent any letter in lowercase.
Description A local company is seeking for help on their search service. They want to implement a search engine and provide functionality to show related words stored in their database. The search engine should support following command: • Add . The command will add the keyword into the search engine for search in the future. • Delete . The command will remove the keyword from the search engine, so that users will not get result when searching exact . If the word doesn't exist, the command should not affect any other word in the search engine. • Find . Return the word if a word in the search engine is found and exactly matches with , otherwise return an empty string "". • Search . Return the first word with prefix matches , if there are multiple matches, just return the first word matches alphabetically. For example, suppose that we have applejack and application in the search engine. If we run command Search app, the search engine returns applejack since applejack is alphabetically smaller than application. To simplify the implementation, s are strings that only contains lowercase letters, and s are strings that contains lowercase letters and wildcard symbol *, which represent any letter in lowercase.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Please answer in c++
Transcribed Image Text:Description
A local company is seeking for help on their search service. They want to implement a search
engine and provide functionality to show related words stored in their database. The search engine
should support following command:
Add <word>. The command will add the keyword <word> into the search engine for search in
the future.
• Delete <word>. The command will remove the keyword <word> from the search engine, so
that users will not get result when searching exact <word>. If the word doesn't exist, the
command should not affect any other word
the search engine.
• Find <str>. Return the word if a word in the search engine is found and exactly matches
with <str>, otherwise return an empty string "".
• Search <str>. Return the first word with prefix matches <str>, if there are multiple matches,
just return the first word matches alphabetically. For example, suppose that we have applejack
and application in the search engine. If we run command Search app, the search engine
returns applejack since applejack is alphabetically smaller than application.
To simplify the implementation, <word>s are strings that only contains lowercase letters, and <str>s
are strings that contains lowercase letters and wildcard symbol *, which represent any letter in
lowercase.
![Constraints
Input number n, w, q have constraints as following:
1 <= n <= 100,
1 <= w <= 500,
1 <= q <= 1000
Command related constraints: <command> is from list of [Add, Delete, Find, Search|
Constrains for <word> and <str> are expressed using regex as following:
( [a-z]+)
( [a-z\*]+)
<word> =
<str> =
In addition to the constraints on input, there's another constraint that your program should
work with the following lab3.cpp:
#include "SearchEngine.h"
#include <iostream>
using namespace std;
int main(){
int n, w, q;
cin>>n;
while (n-- > 0){
cin >> w >> q;
string word, cmd, arg;
SearchEngine engine;
while (w-- > 0){
cin >> word;
engine.addWord(word);
}
while (q-- > 0){
cin >> cmd >> arg;
engine.executeCommand (cmd, arg);
}
}
return 0;
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F70fa61f7-3b3e-4865-bf4f-7b515c444a78%2F2d1f80c4-40b3-4700-891d-be2bc5fe0a58%2Fx5ba8yh_processed.png&w=3840&q=75)
Transcribed Image Text:Constraints
Input number n, w, q have constraints as following:
1 <= n <= 100,
1 <= w <= 500,
1 <= q <= 1000
Command related constraints: <command> is from list of [Add, Delete, Find, Search|
Constrains for <word> and <str> are expressed using regex as following:
( [a-z]+)
( [a-z\*]+)
<word> =
<str> =
In addition to the constraints on input, there's another constraint that your program should
work with the following lab3.cpp:
#include "SearchEngine.h"
#include <iostream>
using namespace std;
int main(){
int n, w, q;
cin>>n;
while (n-- > 0){
cin >> w >> q;
string word, cmd, arg;
SearchEngine engine;
while (w-- > 0){
cin >> word;
engine.addWord(word);
}
while (q-- > 0){
cin >> cmd >> arg;
engine.executeCommand (cmd, arg);
}
}
return 0;
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 5 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education