Description: Part1
The Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13, 21, …. begins with the terms 0 and 1 and has the
property that each succeeding term is the sum of the two preceding terms. Write a non-recursive
function Fibonacci (n) to display first n Fibonacci numbers. Watch the stop sign on the sample
output after the last displayed number (it is not comma). Write a short UNIX shell script to run
your Fibonacci program.
Part2
Write a C program that uses UNIX process management utility. You will use the fork( ) function
to spawn 3 child processes. Each child process will use the execlp( ) function to run an
application or UNIX command, and each process will be generated in sequential order.
To Search:
File list (Check if you may need any files):
assign4\Assignment04_Description.pdf
.......\ClassInfo.txt
.......\fibonacci.sh
.......\fibonacci.sh.bak
.......\README.txt
.......\Sample output.pdf
.......\UpdatedClassInfo.txt
.......\xyi5_a3_p2.c
.......\xyi5_a3_p2.c.bak
.......\xyi5_a4_p1.c
.......\xyi5_a4_p1.c.bak
.......\xyi5_a4_p1.exe
.......\xyi5_a4_p2.c
.......\xyi5_a4_p2.c.bak
.......\xyi5_a4_p2a.c
.......\xyi5_a4_p2a.c.bak
assign4
Download