# SEE, Programming Abstractions, Assignment 1

### Andrew Bolster

Researcher at the University of Liverpool, Founder/Director at Farset Labs

SEE, or, Stanford Engineering Everywhere, has turned out to be my favourite E-learning resource; I’ve dipped into it a few times over the past few years but in light of my recent investment into a CUDA enabled Graphics Card, I thought that it was coming high time to brush up on my C++ programming, which I’ve basically left stagnant for two years after advancing no further than function pointers, structures, and templates.

So, in the spirit of openness that SEE tries to foster, I’ll be blogging my work through their CS106B course, Programming Abstractions, the second of three programming courses. (I passed on CS106A, Programming Methodology, since I’ve had enough Java shoved down my throat to last a lifetime…).

Now, I’ll try not to repeat the lectures, and will focus mostly on the Assignments.

Straight into it, Assignment 1 is split into several Problems, introducing String manipulation, Pointer manipulation, File access, Struct use, Vector templates, and Memory Diagramming.

### Problem 1:Pointers

Build two different functions to remove substrings from strings, one that returns a fresh ‘new’ string, and another that operates directly on an existing string in memory. Simple Enough (Well, there was one Gotcha! that I fell hook line and sinker for)

string CensorString1(string text, string remove){
string returned;
size_t found=0, lastfound=0;
found = text.find(remove);
while (string::npos != found ){
returned += text.substr(lastfound,found-lastfound);
lastfound = found + remove.length();
found = text.find(remove,lastfound);
}
returned += text.substr(lastfound);
return returned;
}

void CensorString2(string& text, string remove){
size_t found = text.find(remove);
while ( string::npos != found){
text.erase(found, remove.length());
found = text.find(remove);
}

}


### Problem 2: Struct

Build a structure definition to store statistical information about class grades read from a file, where each line is a mark between 0 and 100. Write a function to generate this structure with max/min/average, and return the structure. (I left some extra vestigial information in the structure such as the number of entries and the total total of marks for averaging purposes.

 struct gradestats {
min=numeric_limits::max();
max=numeric_limits::min();
count=0;
total=0;
average=0;
}
int min,max,count,total;
double average;
};

int tempI;
ifstream instream(filename.c_str());
if(!instream.fail()){
while(instream >> tempI){
if(instream.fail || tempI < 0 || tempI > 100) continue;
if(stats.min > tempI) stats.min = tempI;
if(stats.max < tempI) stats.max = tempI;
stats.total += tempI;
stats.count++;
stats.average = stats.total/stats.count;
}
} else {
instream.clear();
cout << "Something wicked this way comes!" << endl;
}
instream.close();
return stats;
}


### Problem 3: Vectors

Write a function that takes a filename and prints out a letter frequency table. (dont forget to include fstream)

void CountLetters(string filename){
int tempI;
vector  counts(26,0);
char tempC;
ifstream instream(filename.c_str());

if (!instream.fail()){
do{
tempC = std::tolower(tempC);
if (!(tempC < 97 || tempC > 122)){
cout.put(tempC);
counts.at(tempC-97)++;
}
tempC = instream.get();
}while ( tempC != EOF );

cout < < endl;

for (tempI=0;tempI < counts.size(); tempI++)
cout << (char)(tempI + 97) << ":" << counts[tempI] << endl;
} else {
instream.clear();
cout << "Something wicked this way comes!" << endl;
}
}


### Problem 4: Memory

I hate drawing diagrams, so I’ll just hint; two structs ‘exist’ in the ‘main’ method stack, julie & tom. There’s nothing in the heap, and the ‘battle’ method stack has one structure and one reference to a structure, and has a few internal variables (pos, level, name). The internal structure variables can be worked out easily enough (look out for the nasty character/integer modifications in the names).

### Conclusion

I could make a habit out of this! Interesting and useful challenges from a world class CS department , all for free and accessible whenever you want / can.

Published: April 28 2010