Question

Assignment 1

In this assignment you will be writing a tool to help you play the word puzzle game AlphaBear. In the game, certain letters must be used at each round or else they will turn into rocks! Therefore, we want to create a tool that you can provide with a list of letters you MUST use and a list of available letters and the program returns a list of all the words that contain required letters and only contain available letters.

Starter Code:

• main.cpp - main function to run your program.
• BearHelper.h - Header file with function prototypes.
• BearHelper.cpp - Your code goes in this file. must write the code as instructed to practice disk access and properly allocating C strings. The next assignment will look at ways we can improve the efficiency,

The Program:

The program (main) reads in a dictionary file, uses a list of required letters and a list of available letters. Then it goes through the dictionary and removes all words that do not contain required letters and all words that contain unavailable letters. Finally, the program prints the words that were not deleted

Structs and Functions to Implement:

The following functions should be implemented by the student.

• int GetNumEntriesInFile(const char* f);
• char** ReadWords(const char* f, int count);
• bool AllLettersInSet(const char* letters, const char* group);

Header File

#ifndef __FunctionTemplates__bearHelper__

#define __FunctionTemplates__bearHelper__

#include <stdio.h>

int GetNumEntriesInFile(const char *f);

char **ReadWords(const char *f, int count);

bool AllLettersInSet(const char *letters, const char *set);

#endif /* defined(__FunctionTemplates__bearHelper__) */

#include <string>

#include <iostream>

#include <stdio.h>

#include <vector>

#include <stdlib.h>

#include <unordered_map>

#include <fstream>

#include "bearHelper.h"

/*

* Counts the number of words in a file named f

* parameter: file name

* return: number of words in file

*/

int GetNumEntriesInFile(const char *f)

{

//1. Open the file for reading

//2. Count the number of words in file. Hint: You can count the number of '\n' characters in file. Use fgetc to read one character at a time.

  

//3. close file

  

//4.return count

  

}

/*

* Creates an array of strings of size count and populates it with words in file named f

* parameter: f - file name, cout - number of words in file

* return: An array of c-strings

*/

char **ReadWords(const char *f, int count)

{

  

//1. Open file for reading

//2. Allocate the array of c-strings

//3. For each word in the file

//3.a Determine the length of word

// (hint: use ftell to determine the location of the pointer in file before you start counting the letters, use fgetc to read a single character, then fseek to the location of the start of the word and read it).

//3.b Allocate a string long enough to store word

//3.c store word in array of words

//4. close file

//5. return array of words

  

}

/*

* Returns true if all letters in "letters" are in group of letters "group" (duplicates should be accounted for)

* therefore the letters: "ee" are in group "tree" but not in group "tea"

*

* parameter: letters - list of letters, group - a collection of letter

* return: true of all letters are in set

*/

bool AllLettersInSet(const char *letters, const char *group)

{

  

}

Answer 1

Below are the required code segments which have been requested.

you may add the following functions to your required files. You may test the functions directly by running this program's main

remove the cout from ReadWords, if it is not required

The explanations are in the comments.

//------------------------------------------------------------------------------------------------------------------

#include<iostream>
//defines file pointer
#include <stdlib.h>
#include<stdio.h>

using namespace std;
int GetNumEntriesInFile(const char *f)
{
int word_counter=0;
FILE *fp=fopen(f,"r");
if (fp == NULL)
{
cout<<"Cannot open file ";
exit(0);
}
char ch = fgetc(fp);
while (ch != EOF)
{
if(ch==' ')
word_counter++;
ch = fgetc(fp);
}
fclose(fp);
return word_counter;
}

/*
* Creates an array of strings of size count and populates it with words in file named f
* parameter: f - file name, cout - number of words in file
* return: An array of c-strings
*/
char **ReadWords(const char *f, int cnt)
{
//1. Open file for reading
FILE *fp=fopen(f,"r");
if (fp == NULL)
{
cout<<"Cannot open file ";
exit(0);
}
//2. Allocate the array of c-strings
int word_length=1;
char **array_of_words=(char **)malloc(cnt*sizeof(char*));
//for(int m=0;m<cnt;m++)
// array_of_words[m]=(char*)malloc(max_word_length*sizeof(char));
int i=0,j=0;
char ch;
long start=ftell(fp),ending=0;
while((ch=fgetc(fp))!=EOF)
   {
   //3. For each word in the file
   //NOTE: It is assumed that every word has ended with a newline character in the
   //dictionary file
       if(ch==' ')//ending of current string
       {
//calculating current position of file ptr
ending=ftell(fp);
//3.a Determine the length of word
word_length=ending-start;
//we deduct 1 from the diffenece since we dont want to include newline character
//3.b Allocate a string long enough to store word
           array_of_words[i]=(char*)malloc((word_length-1)*sizeof(char));
           //move the fp to starting of string
           fseek(fp,-word_length,SEEK_CUR);
           j=0;
           while(ftell(fp)<ending-1){
char v=fgetc(fp);
if(v!=' '){//skipping newline characters
//3.c store word in array of words
array_of_words[i][j]=v;
j++;
}
           }
           array_of_words[i][j]='';
           //remove the cout, if you dont want to print the stored words
           cout<<array_of_words[i]<<endl;
           //sets flag for next string
           start=ftell(fp);
           i++;
       }
   }
   //4. close file
   fclose(fp);
//5. return array of words
return array_of_words;
}
/*
* Returns true if all letters in "letters" are in group of letters "group" (duplicates should be accounted for)
* therefore the letters: "ee" are in group "tree" but not in group "tea"
* parameter: letters - list of letters, group - a collection of letter
* return: true of all letters are in set
*/
bool AllLettersInSet(const char *letters, const char *group)
{
int freq[26];
int freq_group[26];
int i=0,j=0;
//initializes the fequency array to 0
for(i=0;i<26;i++){
freq[i]=0;
freq_group[i]=0;
}
//traversing array of letters and storing frequencies of the crrent characters
while(letters[j]!='')
{
int ascii_converted_index=(int)(letters[j]-'a');
freq[ascii_converted_index]++;
j++;
}
j=0;
//frequencies of characters in groups of characters
while(group[j]!='')
{
int ascii_converted_index=(int)(group[j]-'a');
freq_group[ascii_converted_index]++;
j++;
}
for(i=0;i<26;i++){
//checks if frequency of reqd characters are at least upto the requirements
if(freq_group[i]<freq[i])
return false;
}
return true;
}

//NOTE: THIS MAIN IS JUST TO TEST THE FUNCTIONS AND NOT A PART OF YOUR REQUIRED CODE
int main()
{
char *filename="dictionary.txt";
int n=GetNumEntriesInFile(filename);
ReadWords(filename,n);
cout<<n<<" words in file"<<endl;
if(AllLettersInSet("ee", "tea"))
cout<<"yes";
else
cout<<"no";
return 0;
}

//---------------------------TESTING-------------------------------------------------------------------

dictionary.txt

//------------------------------------------------------------------------------------------------------------

privacy
tea
items
company
HomeworkLib
read
group
elephant
need
many

//------------------------------------------------------------------------------------------------------------------------------