Its our third session in Mobile Robotics Workshop. Five problems were given to be programmed in C. Although I prefer GCC (Gnu compiler collection) than Turbo C, I dont have a choice. Its not my pc. Its Windows XP. Not Linux!!! Not GNU!!!
 
Here are the problems:

Below is a C program that will reverse (input) text.

The factorial of a positive integer n, denoted by n!, is the product of all positive integers less than or equal to n. For example, 6! = 1 x 2 x 3 x 4 x 5 x 6 = 720. Below is a python program to identify this number.

A recursive function is a function that calls itself during its execution.

The factorial of a positive integer n, denoted by n!, is the product of all positive integers less than or equal to n. For example, 6! = 1 x 2 x 3 x 4 x 5 x 6 = 720.
 

I edit my previous post in fibonacci number to display the sequence up to nth number. I still used array to implement this problem. Future post will be fibonacci sequence using recursive function.

Fibonacci sequence/series is a sequence of numbers in which each successive number is equal to the sum of the preceding numbers.

The nth fibonacci number is:
fib(n) = fib(n-1) + fib(n-2); where fib(1) = 1 and F(2) = 1,

The first five numbers are 1, 1, 2, 3, 5

Below is a c program that will return the nth fibonacci number.

Round-robin is a scheduling algorithm that assigns time slots(slices) to each process in equal portions and in circular order, handling all processes without priority. Below is my implementation in C++ language.

The GNU Compiler Collection (GCC) is a compiler system produced by the GNU Project supporting various programming languages.
Below are the steps to compile C++ program using GCC:
    e.g. Your c++ source file is in Desktop named hello.cpp


1. Open up terminal
        (applications >>> accessories >>> terminal)
2. Go to path where your source file can be found
        cd Desktop
3. Compile

  1 #include<iostream>
  2 #include<stdlib.h>
  3 
  4 using namespace std;
  5 struct node{