Hope is not too late

Here is my code:

https://github.com/fernandazm/WSQS/blob/master/Quiz%2011

https://github.com/marinaruelas/WSQ/blob/master/Quiz%2011.2

Question 1

Question 2

GIANT BANANA!!!

via: komonews.com

Here’s my code:

https://github.com/cesarau04/WSQ/blob/master/Quiz%2311-problem1.py

https://github.com/cesarau04/WSQ/blob/master/Quiz%2311-problem2.py

//Quiz Euler
#include <iostream>
using namespace std;

float fact (float e) {
int q,w;
q = 0;
w = 1;
while (q<e) {
w = w*(q+1);
q = q+1;}
return w;}

// x=número de factorial al que llegará el denominador
int main(){
cout<<“¿Hasta qué factorial quieres llegar en el denominador?”<<endl;
int x;
cin>>x;
int i;
float s=1;
for(i=1;i<=x;i++){
s=s+1/fact(i);
}
cout<<“elnúmero de Euler llegando hasta tener el factorial de “<<x<<” en el denominador es “<<s<<endl;
return 0;}

Question 2

//Quiz Banana
#include <iostream>
#include <fstream>
#include <string>
using namespace std;

int main(){
ifstream archivo(“archivo.txt”);
string renglon;
int c=0;//contador

while (1){
getline(archivo,renglon);//se hace un string
int x;//Para el for
for(x=0;x<renglon.length();x++){
if(renglon[x]==’b’or renglon[x]==’B’){
if(renglon[x+1]==’a’or renglon[x+1]==’A’){
if(renglon[x+2]==’n’or renglon[x+2]==’N’){
if(renglon[x+3]==’a’or renglon[x+3]==’A’){
if(renglon[x+4]==’n’or renglon[x+4]==’N’){
if(renglon[x+5]==’a’or renglon[x+5]==’A’){
c=c+1;
}
}
}
}
}
}
else{
continue;}
}
if (archivo.eof()) break;//el while se detiene cuando termina el archivo
}
cout<<“La palabra banana se encuentra “<<c<<” veces en el archivo.”<<endl;
return 0;}

Photo credit: https://flic.kr/p/A9poRo

The quiz was so difficult but I see tutorials and blogs of my classmates.

Here are my codes:

Question 1:

https://github.com/BrayanGc/Codigos/blob/master/Quiz11_1.cpp

Question 2:

https://github.com/BrayanGc/Codigos/blob/master/Quiz11_2.cpp

I tried Quiz 11 before doing WSQ14 and I had no idea what to do. After kinda completing WSQ14, the first part of the quiz was easy (assuming what I did on WSQ14 was correct.)

For the second part of the quiz, I did some research and found this webpage, this one, and this other one that had useful information.

Here are my programs: Euler’s Number, Banana.

I struggled with the file question since i dont know how to use properly the .split() very well but still i did my best effort.

Here is my code of the first question: https://github.com/sabaldaba/TC101/blob/master/Question1-quiz

And the second one: https://github.com/sabaldaba/TC101/blob/master/question2-quiz11

GitHub code: https://github.com/luisduartepalacios/Quiz11

Anyways, here’s the github link to my codes:

https://github.com/Dragv/Quiz11/tree/master