Fibonacci Sequence Using Recursion Java

Fibonacci Sequence:
                                     Basic rule:: next term = Sum of previous two terms

Code::

import java .util.*;
public class Fibonacci 
{    
    public static void main(String[] nt) 
    {
      Scanner in=new Scanner(System.in);
      System.out.print("Enter Number of Terms:");
      int a=in.nextInt();
      for(int i=0;i<a;i++)
      {
          System.out.print(fibonacci(i)+" ");
      }
    }
    public static int fibonacci(int n)
    {  
        if(n<2)
        {
            return n;
        }
        else
        {
            return (fibonacci(n-2)+fibonacci(n-1));
        }
    }
}

Output::

                          

Character Frequency In a String Python

Question::

Write a function char_freq() that takes a string and builds a frequency listing of the characters contained in it. Represent the frequency listing as a Python dictionary. Try it with something like char_freq("abbabcbdbabdbdbabababcbcbab").

Code::

def char_freq(l):
    d={}
    for i in (range(len(l))):
        if (l[i] in d):
            d[l[i]]=int(d.get(l[i]))+1
        else:
            d[l[i]]=1     
    return d
nt=input("Enter any String:")
n=char_freq(nt)

print(n)

Output::

Call By Value V/S Call By Reference Java

Call by value: In this approach copy of the current variables are passed to called function.
i.e any change in called function on values is not reflected in main program...

Following code will illustrate this:

Code:
import java.util.*;
public class Value 
{

    public static void main(String[] nt) 
    {
       Scanner in=new Scanner(System.in);
       System.out.print("Enter A:");
       int a=in.nextInt();
       System.out.print("Enter B:");
       int b=in.nextInt();
       swap(a,b);
       System.out.println("After Swapping Outside Swap Function :");
       System.out.println("A:"+a);
       System.out.println("B:"+b);
    }
    public static void swap(int c,int d)
    {
        int temp=d;
        d=c;
        c=temp;
       System.out.println("After Swapping Inside Swap Function :"); 
        System.out.println("A:"+c);
        System.out.println("B:"+d);
    }
}

Output:

Call By Reference: As there are no pointers in java so we can not use & to refer to the variables

Following Code Will Illustrate this:

Code::

import java.util.*;
class Swap
{
    int a,b;
    public void swap(Swap s)
    {
        int temp=s.a;
        s.a=s.b;
        s.b=temp;
    }
}
public class Reference 
{

    public static void main(String[] nt) 
    {   Swap ob=new Swap();
        Scanner in=new Scanner(System.in);
       
        System.out.print("Enter A: ");
       ob.a=in.nextInt();
       System.out.print("Enter B: ");
       ob.b=in.nextInt();
       
       System.out.println("Before Swapping :");
       System.out.println("A:"+ob.a);
       System.out.println("B:"+ob.b);
       
       ob.swap(ob);
       
       System.out.println("After Swapping :");
       System.out.println("A:"+ob.a);
       System.out.println("B:"+ob.b);
        
    }   
}

Output::

Recursion Program Java

Tower of Hanoi: Puzzle in which there are three towers say A,B,C. and some finite number of disks in increasing order of size downwards.

Objective : Move disks from A to C by following below rules:

   1. Only one disk can be moved at a time,and only the top disk.

   2. At no time it is allowed to place a larger disk on small disk.

Following Code Uses Recursion(Function Calling Itself): 

Code::

import java.util.*;

public class Tower 

{  static int c=0;

    public static void main(String[] nt) 

    {

        Scanner in=new Scanner(System.in);

        System.out.print("Enter Number of Disks: ");

        int n=in.nextInt();

        System.out.println("Moves:");

        hanoi(n,'A','B','C');

        System.out.println("Total Moves: "+c);

    }

    

    public static void hanoi(int n,char A,char B,char C)

    {   if(n<1)

       {

        System.out.println("Please Enter Finite Number of Disks");

        return;

       }

        

        if(n==1)

        {

            System.out.println("From Tower "+A+" to Tower "+C);

            c++;

            return;

        }

        hanoi(n-1,A,C,B);

        System.out.println("From Tower "+A+" to Tower "+C);

        c++;

        hanoi(n-1,B,A,C);   

    }

}

Output::

PygLatin Python :)

Pig Latin is a language game, where you move the first letter of the word to the end and add "ay." So "Computer" becomes "omputercay." 

Following are the Steps involved:
1.Input the word
2. Converting the String to Lowercase
3. Assign first letter of the word to another variable
4. Removing first letter from the word
5. Concatenating the Strings for Output
Following Program Illustrates it:

word=input("Enter the Word: ")   #input word
temp=word.lower()   #lowercase conversion
first=temp[0]       #first letter
temp=temp[1:]
suffix='ay'
if(len(word)==0):
    print("String is Empty!!")
elif word.isalpha()==False:  #else if statement
    print("Enter only Alphabets!")
else:
    print("Pig Latin translation of "+word+" is ")
    print(temp+first+suffix)

Note: isalpha() function is used to check whether String contains alphabets or not. It gives True when all letters in String are alphabets.

"99 Bottles of Beer"

Question::

"99 Bottles of Beer" is a traditional song in the United States and Canada. It is popular to sing on long trips, as it has a very repetitive format which is easy to memorize, and can take a long time to sing. The song's simple lyrics are as follows:

99 bottles of beer on the wall, 99 bottles of beer.
Take one down, pass it around, 98 bottles of beer on the wall.

The same verse is repeated, each time with one fewer bottle. The song is completed when the singer or singers reach zero.

Your task here is write a Python program capable of generating all the verses of the song.

Code::
l=99
for l in (range(99,1,-1)):

    print(l ,"bottles of beer on the wall," ,l," bottles of beer.\nTake one down, pass it around,",l-1 ,"bottles of beer on the wall.\n")


Output::

Pangram Python

Question::
A pangram is a sentence that contains all the letters of the English alphabet at least once, for example: The quick brown fox jumps over the lazy dog. Your task here is to write a function to check a sentence to see if it is a pangram or not.

Code::

def panagram(nt):
    check="abcdefghijklmnopqrstuvwxyz"
    for l in check:
        if(l in nt):
            continue
        else:
            return False
    return True           
n=input("Enter Any Text:")
if(panagram(n.lower())):
    print("Yes It is a Pangram")
else:

    print("No It is not a Pangram")

Output::