Probrem 1
Remember a factorial problem in the previous homework? Make a function named factorial(n) and try calling it from main function.
> Save to L03_ex_01.c

---

Probrem 2
Make a recursive function to print n^th Fibonacci series, fibonacci(n). Try using this function to print the first ten terms of the series.
> Save to L03_ex_02.c

---

Probrem 3
Create the grading system for a school teacher.
- Teacher will input each student' score from keyboard. (So, you need to store scores in an array.)
- The grading criteria is simple:
    >=80 gets A, >= 70 gets B, >= 60 gets C, >= 50 gets D, else F.
- The result would be printed as:
    Student 1: score = 85.5, gets A
    Student 2: score = 63.5, gets C
> Save to L03_ex_03.c

---

Probrem 4 (optional)
Solve Ax=b using Gaaussian elimination. A test on 3 x 3 system would be enough.
You would find out more on the algorithm from [Wolfram] or [Wikipedia].
> Save to L03_ex_04.c

Probrem 1
Write a C program to find factors of any integer.
> Save to hw03_ex_01.c

---

Probrem 2
Write a C program to calculate vector product. [You can assign vector's elements within the code.]
> Save to hw03_ex_02.c

---

Probrem 3
Write a C program to perform matrices multiplication. [You can assign matrices' elements within the code.]
> Save to hw03_ex_03.c

---

Probrem 4 (optional)
Write a C program to perform (simple) Gaussian elimination. [You can assign matrices' elements within the code.]
> Save to hw03_ex_04.c

There will be a quiz, Quiz 02. But do not worry, just a few simple questions.

May be a short (10 questions) TOEIC test. Just for fun!

Use Octave to plot (scatter or scatter3) earthquakes under any subduction zones. Use the earthquake catalog from USGS website. (see the detail in the lecture)

Probrem 1
Write a Python program using the recursive funtion to produce Fibonacci series. You may print the first 20 terms of the series.
[Save to hw04_ex_1.py]

Probrem 2
There are 15 student attending a computer class at a famous University in Bangkok.
Here are their scores for the past midterm examination:
  score = [77, 68, 86, 73, 65, 96, 87, 89, 81, 66, 70, 90, 86, 81, 59]
Here are what the lecturer need to know. Write a python program to help him.
  1) Max and min of this score set. (You may create your own function call find_min and find_max)
  2) Average score of the class and its standard deviation.
  3) Grade these students using the same criteria in homework 02.
[Save to hw04_ex_2.py]

Probrem 1
Write a program (can be Python, C or Octave) to find the second largest and the second smallest number from any given list.
For example, unsorted_a = [3,4,1,6,8,5,2,1,10,11,-1].
Also try with another list, for example, unsorted_b = [3,4,10,6,8,5,2,-1,10,11,-1].
Does your program (algorithm) work for both lists?
[Save to hw05_ex_1.py or .c]

Probrem 1: Insertion Sort (Due: 20 April 2017)
a) Write a program to do the insertion sort (explained in the lecture note).
[Save to hw06_ex_1.py or .c or .m]

b) Analyze the algorithm and compare with our previous bubble sort. [Hint: Use Big Oh to describe these algorithms]
[Explain in your email or attach it as a txt or a pdf file]

c) [optional] You may plot the graph between input number n and the total operations done by the program.
[Save to hw06_ex_3.py or .c or .m]

d) [optional] Can you modify your previous bubble sort program to be more efficient?
[Save to hw06_ex_4.py or .c or .m]

Instruction Make a (good and informative) personal website.

Use these tutorials to accomplish this project:
> How to 1): HTML (and PHP if you'd like to try) [w3school tutorial]
> How to 2): Upload or edit your website on GPH server [upload manual]

Criteria for grading
1. Your website can be about introducing yourself, your favorite things, sports, interesting topics or any useful stuffs.
2. Unappropriate (you know that) contents are not allowed.
3. Your website should contain 2 - 5 pages (html files).
4. Include basic html features, i.e. inserting picture, links between pages and tables.
5. [Optional] If you want to make a more good-looking pages, include bootstrap or foundation package.

Instruction Make a (good) 10 - 15 min presentation on these interesting sorting and searching algorithms. [this how to would help you make a good presentation]

Topics:
1. Shell sorting
2. Radix sorting
3. Heap sorting
4. Merge sorting
5. Quick sorting
6. Binary searching

Your group presentation shoud include:
1. A PowerPoint (or any slide presentation program) consisting of
- Introduction to the given algorithms.
- Explanation of how the algorithm works.
- Analysis on the given algorithms (n and Big Oh)
2. A code. Your will have to write the example code to show to the class. Use comment to explain each part of the code.

Exam type includes both paper-based and computer-based problems.
What you should know (prepare):
1. Read/Write simple-format data file
2. Sorting/Searching
3. Making plots with Python/Octave/Matlab/GNUPlot or others
4. Basic idea of "Graph Theory"
5. Uploading file to your space on GPH server
* Most problems are taken from the class assignments.