This project is the first projects you will be working on this quarter. There ar
ID: 3790474 • Letter: T
Question
This project is the first projects you will be working on this quarter. There are a number of objectives to this assignment. First, to start gaining experience in developing programs in C++. Second, in case you haven’t already you are going to work in pairs to get the sense of collaborative development of software. Third, because you are allowed to use any references you find online, this assignment will help you get a sense for just how many sources for programming in C++ are available via the web. Project specification: In this project you are going to implement a word search engine using C++. The search engine would help users to count number of occurrence of a word among given set of text files. Input specification: The program takes as an input a set of files, containing of multiple words. Words can appear multiple times in a single file or in different files. The input files should be stored in a dedicated directory (e.g. /cs/class/cs24/project1/input) and loaded in memory upon program execution. Program functionality: Upon execution, the program should load all the words from the input files in the memory. The program should run until the user explicitly specifies “exit”. The following functionality should be supported: 1. Count how many times a user specified word appears in the files. 3. Display the name of input files and corresponding number of occurrences of the specified word. Upon execution of you program, you should specify as input parameter the path to a directory containing the input files. Below you can find the format specification: $./wordsearch Examples for execution format: $./wordsearch /cs/class/cs24/project1/input Enter word: cat If executed as specified above, the program should return the name of files that contain word “cat” and the number of occurrences of the word in each file Implementation requirements: First, you need to implement a class for an abstract data type, in which you are going to store files in memory. This step is very specific, depending on the functionality of the program you are developing. For the current implementation you are required to use linked lists. A basic layout of the data structure you would need to implement is illustrated on the figure below: You need to declare a class Word that would store a word and a pointer to the beginning of a linked list and another class File that would store a file-name and number of times that the word occurred in this file. The process of “loading files in the memory” consists of (i) creating an object of type Word for each new word that occurs in the set of input files, (ii) appending this object to a linked list (e.g. the green linked list from the picture), (iii) creating an object File for each occurrence of the word in a file and (iv) updating the corresponding (blue) linked list with the object File. Once you have the files loaded in such structure, the searching would be as easy as finding the queried word in the “green” linked list and tracing in which files does it occur by going over the corresponding “blue” linked list. To start gaining experience in how to structure your C++ projects, you are required to split the different aspects of this program and implement them in separate files. Then you will have to put them all back together to achieve the program functionality. By now, you should be familiar with the concept of .h and .cpp files (if not, it is a good moment to familiarize yourselves). You will need to create several .h and .cpp files for this project. We will help guiding you through this process. First you need to identify the important object-types and methods you will need for your implementation. In this project, your main object types are going to be class Word and class File. Go ahead and create a file called itemtype.h and declare class File in it. Then create another file called itemtype.cpp and define your class File in it. These two files are going to be related to objects from the “blue” lists on the picture. The next step is to implement the functionality for creating the “blue” lists. For this purpose, you need to create two more files – list.h and list.cpp. In list.h declare all the methods needed for building a “blue” list and in list.cpp define these methods. Next, you need to implement the functionality related to objects like these in the “green” list. Create two more files – word.h and word.cpp, declare class Word and all methods to this class in word.h and define them in word.cpp. Now what's left is to put it all together by writing a main function that utilizes both file and word. To do so, create wordsearch.h and wordsearch.cpp, declare your main function in wordsearch.h and define it in wordsearch.cpp. So all in all you will need eight files: wordsearch.h, wordsearch.cpp, itemtype.h, itemtype.cpp, list.h, list.cpp, word.h, word.cpp. Instructions for compilation: Your program should compile on a CSIL machine with the following command without any errors or warnings. $ g++ -o wordsearch wordsearch.cpp itemtype.cpp list.cpp word.cpp
Explanation / Answer
Given below are the files needed for the question. The images mentioned in the question are not uploaded. So based only on the description, the file structures have been come up. Please don't forget to rate the answer if it helped. Thank you.
list.h
#ifndef list_h
#define list_h
#include <iostream>
using namespace std;
template <typename T>
struct Node
{
T data;
struct Node<T>* next;
Node(const T &data, Node<T>* next = nullptr)
{
this->data = data;
this->next = next;
}
};
template <typename T>
class LinkedList
{
Node<T>* head;
Node<T>* tail;
int count;
public:
LinkedList();
void append(const T &data);
T& get(int i); //get item at index i
int size(); // number of items in list
void print() const;
~LinkedList();
};
#include "list.cpp"
#endif /* list_h */
list.cpp
#ifndef list_cpp
#define list_cpp
#include "list.h"
template <typename T>
LinkedList<T>::LinkedList()
{
head = tail = nullptr;
count = 0;
}
template <typename T>
void LinkedList<T>::append(const T &data)
{
Node<T>* n = new Node<T>(data, nullptr);
if(head == nullptr)
head = tail = n;
else
{
tail->next = n;
tail = n;
}
count++;
}
template <typename T>
int LinkedList<T>::size()
{
return count;
}
template <typename T>
T& LinkedList<T>::get(int index)
{
Node<T> *n = head;
for(int i = 0; n != nullptr && i < index; i++)
n = n->next;
return n->data;
}
template <typename T>
void LinkedList<T>::print() const
{
Node<T> *curr = head;
while(curr != nullptr)
{
cout << curr->data << endl;
curr = curr->next;
}
cout << endl;
}
template <typename T>
LinkedList<T>::~LinkedList()
{
Node<T> *curr = head;
Node<T> *next;
while(curr != nullptr)
{
next = curr->next;
delete curr;
curr = next;
}
}
#endif
itemtype.h
#ifndef itemtype_h
#define itemtype_h
#include <iostream>
using namespace std;
class File
{
string filepath;
int count;
public:
File(){}
File(string filepath);
void incrementCount();
int getCount();
string getFilepath();
friend ostream& operator << (ostream &out, const File &f);
};
#endif /* itemtype_h*/
itemtype.cpp
#include "itemtype.h"
File::File(string filepath)
{
this->filepath = filepath;
count = 1;
}
void File::incrementCount()
{
count++;
}
int File::getCount()
{
return count;
}
string File::getFilepath()
{
return filepath;
}
ostream& operator << (ostream &out, const File &f)
{
cout << f.filepath << " [" << f.count << "]";
return out;
}
word.h
#ifndef word_h
#define word_h
#include <iostream>
using namespace std;
#include "itemtype.h"
#include "list.h"
class Word
{
string word;
int find(string filepath);
public:
Word(){};
Word(string word);
LinkedList<File> files;
void addFile(string filepath);
string getWord();
friend ostream& operator << (ostream &out, const Word &w);
};
#endif /* word_h */
word.cpp
#include "word.h"
Word::Word(string word )
{
this->word = word;
}
void Word::addFile(string filepath)
{
int idx = find(filepath);
if(idx == -1)
files.append(File(filepath));
else
{
File & file = files.get(idx);
file.incrementCount();
}
}
int Word::find(string filepath)
{
int sz = files.size();
for(int i =0; i < sz; i ++)
{
if(files.get(i).getFilepath() == filepath)
return i;
}
return -1;
}
string Word::getWord()
{
return word;
}
ostream& operator << (ostream &out, const Word &w)
{
cout << "Word: " << w.word << endl;
w.files.print();
return out;
}
wordsearch.h
#ifndef wordsearch_h
#define wordsearch_h
#include "word.h"
class WordSearch
{
LinkedList<Word> words;
public:
WordSearch(){}
bool loadFiles(char* directory);
void parseFile(string filepath);
int findWord(string word);
void addWord(string word, string filepath);
void printWordStats(string word);
};
int main(int argc, char *argv[]);
#endif /* wordsearch_h */
wordsearch.cpp
#include "wordsearch.h"
#include <dirent.h>
#include <fstream>
using namespace std;
bool WordSearch::loadFiles(char* directory)
{
DIR *dir;
struct dirent *ent;
if ((dir = opendir(directory)) != NULL)
{
while ((ent = readdir (dir)) != NULL)
{
if(ent->d_type == DT_REG)
{
string fpath(directory);
fpath =fpath + "/" + ent->d_name;
parseFile(fpath);
}
}
closedir (dir);
return true;
}
else
{
cout << "Could not open directory: " << directory << endl;
return false;
}
}
void WordSearch::parseFile(string filepath)
{
ifstream infile(filepath.c_str());
string word;
if(!infile.is_open())
{
cout << "Error opening file: " << filepath << endl;
return;
}
int i = 0;
while(infile >> word)
{
addWord(word, filepath);
}
infile.close();
}
int WordSearch::findWord(string word)
{
int sz = words.size();
for(int i =0; i < sz; i ++)
{
if(words.get(i).getWord() == word)
return i;
}
return -1;
}
void WordSearch::addWord(string word, string filepath)
{
int idx = findWord(word);
if(idx == -1)
{
Word w(word);
words.append(w);
idx = findWord(word);
}
Word &w = words.get(idx);
w.addFile(filepath);
}
void WordSearch::printWordStats(string word)
{
int idx = findWord(word);
if(idx == -1)
cout << word << " not found!" << endl;
else
{
cout << words.get(idx) << endl;
}
}
int main(int argc, char *argv[])
{
WordSearch ws;
if(argc != 2)
{
cout << "Usage: " << argv[0] << " <directory_path>" << endl;
return 1;
}
if(ws.loadFiles(argv[1]))
{
string input = "";
while(true)
{
cout << "Enter a word ( type exit to quit): ";
cin >> input;
if(input == "exit")
break;
ws.printWordStats(input);
}
}
}
There are 2 files text1.txt and text2.txt in the specified directory of the program. The contents of the input files are as follows-
input file: text1.txt
This project is the first projects you will be working on this quarter.
There are a number of objectives to this assignment
First, to start gaining experience in developing programs in C++.
Second, in case you haven’t already you are going to work in pairs to get the sense of
collaborative development of software. Third, because you are allowed to use any references you find online
text2.txt
This assignment will help you get a sense for just how many sources for programming in C++ are available via the web.
Project specification: In this project you are going to implement a word search engine using C++.
The search engine would help users to count number of occurrence of a word among given set of text files.
Input specification: The program takes as an input a set of files, containing of multiple words.
Words can appear multiple times in a single file or in different files.
The input files should be stored in a dedicated directory (e.g. /cs/class/cs24/project1/input) and loaded in memory
upon program execution. Program functionality: Upon execution, the program should load all the words from the input
files in the memory. The program should run until the user explicitly specifies “exit”.
The following functionality should be supported: 1.
Count how many times a user specified word appears in the files. 3. Display the name of input files and
output
Word: will
/Users/raji/Documents/sample/text1.txt [1]
/Users/raji/Documents/sample/text2.txt [1]
Enter a word ( type exit to quit): the
Word: the
/Users/raji/Documents/sample/text1.txt [2]
/Users/raji/Documents/sample/text2.txt [8]
Enter a word ( type exit to quit): The
Word: The
/Users/raji/Documents/sample/text2.txt [5]
Enter a word ( type exit to quit): program
Word: program
/Users/raji/Documents/sample/text2.txt [4]
Enter a word ( type exit to quit): Count
Word: Count
/Users/raji/Documents/sample/text2.txt [1]
Enter a word ( type exit to quit): to
Word: to
/Users/raji/Documents/sample/text1.txt [5]
/Users/raji/Documents/sample/text2.txt [2]
Enter a word ( type exit to quit): exit
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.