--Originally published at Ariatne's Blog
Reading and writing of text files
Matrices and Vectors
WSQ 11 – Go Bananas
Tag: #WSQ11
Calculating E
--Originally published at My TC1017 programming class
So, this is a program that calculates the value of e (Euler’s number) with the precision the user wants. As well, I added so that the user can also tell the program how many decimals he wants to be shown on the answer.
As usual, I will leave the link to the cpp file on Google Drive. This time, I didn’t use external sources besided Mr. Ken’s help and the web page giving the formula on how to calculate it. The link to the formula is included on the file.
Go Bananas – WSQ11
--Originally published at Programming in C++
For this program we were supose tu search for the word “banana” in a file, even if the word is written in upper or lower cases.
This was a very similar to the WSQ10. First we need to make a file, in this case, and for obviusly reasosn, I call it “banana.txt”. We have to open the file, then, to ingonre when the word is written u¡in upper or lower, we can change the hole file to lower cases.
Go Bananas
--Originally published at Blog de Aitor
This WSQ wasn’t very difficult I saw this video https://www.youtube.com/watch?v=Z1khk1tEm8Q from Fabrizzio that was very helpful and made this assignment easier
Bananas!
--Originally published at Future Queen of C++
I created my first code on GitHub in the final week of the semester! But I did it, it wasn’t hard, it was just laziness. And the thing that made me upload this into the web was that I needed to take more than one photo because of the size of the program, really.
But here it is
https://github.com/kfdzc/WSQ12/blob/master/Banana.cpp
I used some lines of WSQ09, I think, that’s the correct number I don’t recae really well.
And here is a pie of how it works and what the file was.
Hearted Bananas <3
--Originally published at Regular Blog
El propósito de este programa es contar el número de veces que se repite la palabra “banana” en un archivo de texto, de cualquier forma que esté escrita (alternando mayúsculas y minúsculas), como “BanAna” o “BAnanA” o “banANa”…
Para esto tuvimos que invocar un archivo de texto, como en el #WSQ09, pero además de eso, fue necesario abrir una nueva biblioteca: . Como se ve en el código…
https://github.com/LourdesMnz99/TC1017/blob/master/Bananas!!!
Go Bananas – (WSQ11)
--Originally published at TC1017 (Python3) – Titel der Website
What was to do in this WSQ:
Write a function called find_bananas which receives a single parameter called filename (a string) and returns a positive integer which is the number of times the word (string) “banana” (or “BANANA” ) is found in the file. The banana can be any case (‘BaNana’ or ‘BANANA’ or ‘banana’, etc) and they can be “stuck together” like “banAnaBANANA” (that counts as two). Create your own test file (plain text) to check your work.
My Banana File:
My Sourcecode:
The result:
Homework 11
--Originally published at Blog de Esteban
Este programa fue el segundo más difícil del curso porque no sabia muy bien como hacerlo, mi problema era encontrar las palabras en el texto.
Solucioné este problema leyendo el blog de otros alumnos que ya lo habían hecho y comprendí bien como funcionaba yendo a la oficina de ken.
Mi problema era el siguiente, no sabia que valor arrojaba este código:
int findbanana = str.find(“banana”);
Ya después comprendí que lo que hace “find” es buscar en el string la palabra que ponemos y te devuelve el numero de carácter donde se encuentra.
aquí una foto de mi código:
Hice mucha investigación para este programa y lo que más me sirvió fue el manual del curso que lo dejo a continuación, igualmente te dejo un video que puede servir.
http://www.greenteapress.com/thinkcpp/thinkCScpp.pdf
También te dejo el link de descarga de mi programa en github!, es la primera vez que subo algo a esta plataforma: https://github.com/estebanpm99/WSQ11/blob/master/Tarea11.cpp
y por ultimo un video que te puede servir para este WSQ:
Go Bananas
--Originally published at My TC1017 programming class
This is a program that takes a file that has the word ‘Banana’ written on it in several styles (Upper case mixed with lower case, everything in upper case, etc.)
Most of the informatin on the tools used is in the file, because I lost the links to the information. Sorry 
As always, I will leave the link to the Google Drive File.
Go Bananas
--Originally published at Valeria CT
For this assignment I created the function find_banana(), which received a string, like Ken asked. In the main I opened the .txt file, converted everything to lower case and then called find_banana(). I used nested conditionals and nested loops. Here’s my code with everything explained, feel free to ask me if you have questions!
https://github.com/valeriact/tc1017/blob/master/wsq11.cpp
Resources:
- https://stackoverflow.com/questions/3867890/count-character-occurrences-in-a-string
- How To Think Like a Computer Scientist
-Valeria
