Sponsored Content
Full Discussion: Fibonacci series
Top Forums Shell Programming and Scripting Fibonacci series Post 302069128 by RTM on Wednesday 22nd of March 2006 07:19:58 PM
Old 03-22-2006
Maybe just a rabbit breeder.
 

10 More Discussions You Might Find Interesting

1. Programming

C with MQ Series

Hi, Any one please let me know, how to write in to MQ Series through C. I tried, but it was vein, am expecting material(URL) or code. Thanks, Naga:cool: (5 Replies)
Discussion started by: Nagapandi
5 Replies

2. Shell Programming and Scripting

problem in fibonacci series

hi, I'm a beginner to UNIX and got some problem in this fibonacci.Please help me out.Here is the code: fibo() { if then fibo=` expr {fibo ($1 - 2)} + {fibo ($1 - 1)}` | bc echo $fibo fi } echo "enter a number:" read x #echo "The fibonnacci series for value $x is:" fibo $x ... (4 Replies)
Discussion started by: janani_kalyan
4 Replies

3. Shell Programming and Scripting

Shell script to generate Fibonacci series using recursion

I am facing problem with Shell script to generate Fibonacci series using recursion i.e. recursive function. Here is my script: #!/bin/sh fibo() { no=$1 if ; then return 0 elif ; then return 1 else a1=`expr $no - 1` fibo $a1 ... (10 Replies)
Discussion started by: Tapas Bose
10 Replies

4. Shell Programming and Scripting

Shell script to find the sum of first n Fibonacci numbers

pls give me the solution for this i need it for my exam pls pls pls Shell script to find the sum of first n Fibonacci numbers (1 Reply)
Discussion started by: Kshitija
1 Replies

5. Homework & Coursework Questions

Help with shell script to find sum of first n numbers of Fibonacci series

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: Shell script to find sum of first n numbers of Fibonacci series 2. Relevant commands, code, scripts,... (0 Replies)
Discussion started by: Kshitija
0 Replies

6. UNIX for Dummies Questions & Answers

Why does fibonacci sequence script stop making sense at 92nd iteration?

So, Just for practice, I wrote a simple fibonacci sequence script in bash. (03:08:02\$ cat fib #!/usr/bin/bash ret () { echo -ne "\n" sleep .5 } a=1 b=2 echo -n $a #1 A ret echo -n $b #2 B ret (8 Replies)
Discussion started by: DeCoTwc
8 Replies

7. Programming

Fibonacci (assembly)

When i run this with gcc filename.s -o filename. It is giving fatal error: Unknown opcode at define registers. Anyhelp will be appreciated .section ".data" prompt: .asciz "\nThis program prints the Fibonacci sequence" prompt2: .asciz "\nEnter a limit on the largest number to be displayed:"... (2 Replies)
Discussion started by: Learnerabc
2 Replies

8. Solaris

M Series

Hi All, Do anyone know if I upgrade cpu module and memory module for one of the domain inside Sun M5000. After the upgrade, will the hostid for the domain change or it will remain as long we don't change the system board? Currently will try to upgrade one of the Sun M5000 with 4 domains... (2 Replies)
Discussion started by: mailbox80
2 Replies

9. Homework & Coursework Questions

program to find and print a Fibonacci sequence of numbers. --Errors

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: I am trying to convert a C language program over to Sparc Assembley and I am getting Undefined first referenced... (4 Replies)
Discussion started by: kenjiro310
4 Replies

10. Shell Programming and Scripting

Fibonacci series -going into infinite loop

Hello, I am a beginner to shell programming. Coded the following for Fibonacci series. #!/bin/bash fib() { i=0 j=1 arr=0 arr=1 echo "enter the limit:" read n while do fo= expr $j - 1 f1=$j f2= expr $j + 1 arr= expr ${arr} + ${arr} echo ${arr} (3 Replies)
Discussion started by: Rookie222
3 Replies
INTERCAL::Charset::Hollerith(3pm)			User Contributed Perl Documentation			 INTERCAL::Charset::Hollerith(3pm)

NAME
Charset::Hollerith - allows to use Hollerith string constants in ASCII programs (and v.v.) SYNOPSIS
use Charset::Hollerith qw(hollerith2ascii); my $a = hollerith2ascii "(Hollerith text)"; DESCRIPTION
Charset::Hollerith defines functions to convert between a subset of ASCII and a subset of nonstandard Hollerith (since there isn't such a thing as a standard Hollerith we defined our own variant which is guaranteed to be incompatible with all versions of Hollerith used by IBM hardware - however, for each character code we have used the code used by some (but not all) IBM card reader, if the code exists in Hol- lerith at all, or we have made one up in some logical way (such as overpunching) if no IBM hardware had that particular character. The two functions hollerith2ascii and ascii2hollerith are exportable but not exported by default. They do the obvious thing to their argu- ment. HOLLERITH CHARACTER TABLE
A Hollerith string is a sequence of 12-bit characters; they are encoded as two ASCII characters, containing 6 bits each: the first charac- ter contains punches 12, 0, 2, 4, 6, 8 and the second character contains punches 11, 1, 3, 5, 7, 9; interleaving the two characters gives the original 12 bits. To make the characters printable on ASCII terminals, bit 7 is always set to 0, and bit 6 is set to the complement of bit 5. These two bits are ignored when reading Hollerith cards. Some Hollerith characters (produced by overpunching) can be converted to sequences of ASCII characters; ascii2hollerith will correctly recognise the sequences. The following punched cards document the encoding of characters (the last three symbols at the end nongraphic symbols in ASCII; the previ- ous two symbols correspond to multicharacter sequences): ' !"#$%&()*+,-./:;<=>?@[]^_`{|}~cY0123456789 12 * * * * * * * * * * 12 11 * * * * ** ** * * * 11 0 * * * * **** * * *** 0 1 * * * 1 2 * * * * * 2 3 ** * * * * 3 4 *** * * ** * * * * 4 5 * * * * * * 5 6 * * ** * * 6 7 * *** * * 7 8 * ******** * * ******* * * * * * 8 9 * * * 9 ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrs 12 ********* ********* 12 11 ********* ********* 11 0 ********* * * 0 1 * * ** ** * 1 2 * * * ** ** * 2 3 * * * ** ** 3 4 * * * ** ** 4 5 * * * ** ** 5 6 * * * ** ** 6 7 * * * ** ** 7 8 * * * ** ** 8 9 * * * * * 9 tuvwxyz [] ". NL CR HT 12 * * * 12 11 * 11 0 ******* * * 0 1 * * * 1 2 * * * * 2 3 ** * * * * 3 4 ** * * * * 4 5 ** * * * 5 6 ** * * * 6 7 ** * * * * * 7 8 ** * * * * 8 9 * * * * 9 PLEASE NOTE that versions of CLC-INTERCAL before 1.-94.-2 had a bug which caused a rabbit to be represented as 12-3-2-8 instead of 12-3-7-8. Cards punched with such older versions, and containing rabbits, will need to be copied with one of the rabbit holes moved from row 2 to row 7. COPYRIGHT
This module is part of CLC-INTERCAL. Copyright (C) 2000, 2002, 2006, 2007 Claudio Calvelli, all rights reserved See the files README and COPYING in the distribution for information. SEE ALSO
A qualified psychiatrist. perl v5.8.8 2008-03-29 INTERCAL::Charset::Hollerith(3pm)
All times are GMT -4. The time now is 12:15 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy