The moment you’ve all been waiting for people, we finish the course. But I can’t leave without giving you a little opinion by myself about this course.

#AbolishGrades – #FlippedLearning are two types of innovative education Ken is implementing in this new “TEC21” system, making you to learn by your own at anytime you want without having any type of due dates.

I fully recommend this course for new people who hasn’t see anything about programming, plus, if you get troubled, everyone can help you, so does Ken too.

Before I forget it, I’ve uploaded all my codes to GitHub, here.

See you next time people

Hey guys, this WSQ has to be done on SciLab, so I recommend you to start downloading it.

Tutorial

Examples

The purpouse of this WSQ focus on experimenting with SciLab, so, do whatever you want to do, and understand this program.

Enjoy people

Create a function called dot_product that receives two lists of numbers (say list1 and
list2). The function returns what is the dot product of the two lists.

Here it is:

You’re welcome.

Hey people, this team we are going to do the second partial exam, so there’s the link for you, so you be able to check out the problems.

Exam

#1

#2

#3

#4

Enjoy

Hey people, we are in the finish line, so, let’s make a little more effort to finish this curse.

So, heré’s what we need to do:

• Create a program that asks the user for a word which will be your search word and the name of a file to open and search for that word. Then create a function that will receive two parameters (both string) representing those two data points. This function returns the number of occurrences of that word in that file

Seems like a difficult one, but it isn’t, check this out:

If you have any question ask in the comments section below.

Let’s keep moving forward people

To do list:

1. Write a function to calculate the greatest common denominator of two positive integers using Euclid’s algorithm.

Let’s begin:

And that’s it.

Hey guys, I’m here with another quizz, let’s take a check to our to do list:

1. Create a function called is_palindrome which receives a string as a parameter and returns true if that string is a palindrome, false otherwise. Remember that a palindrome is a word that is the same forward or backward. For full points your function must ignore case and must work with any character (not just letters). So (“Dad$dad” is a palindrome even though the D is capital and d is lower case).
2. Create a function called find_threes that receives as a parameter a list (or Vector or array for C++ students) of numbers and returns the sum of all numbers in that list that are evenly divisible by 3. Note if using vectors, you will need an additional parameter to represent the number of numbers in the array. So if the list was [0,4,2,6,9,8,3,12], the function would return 30 (0+6+9+3+12).

Let’s do it:

First function:

Second function:

You’re welcome.

Click here to view the to do list.

Let’s do it:

And that’s it.

Hey people, quizz time:

Tasks: Click here.

Let’s do it:

This is the first program:

The second program:

There you are people, easy tasks.

To do list:

Your jobs is to create a program that asks the user for two pieces of data:

• The lower bound of the sequence
• The upper bound of the sequence