ASSIGNMENT 1

innoprograms/count char.java

@@ -0,0 +1,34 @@
+import java.util.*;
+public class Main
+{
+	public static void main(String[] args) {
+	    Scanner sc= new Scanner(System.in);
+	    System.out.println("enter your string");
+	    String s;
+	    String w="";
+	    int c=0;
+	    s=sc.nextLine();
+	    System.out.println("enter your character");
+	     char ch=sc.next().charAt(0);
+	    s=s+" ";
+	    for(int i=0;i<s.length();i++)
+	    {
+	        if(s.charAt(i)!=' ')
+	        {
+	            w=w+s.charAt(i);
+	        }
+	        else{
+	            for(int y=0;y<w.length();y++)
+	            {
+	                if(w.charAt(y)==ch)
+	                {
+	                    c++;
+	                }
+	            }
+	            w="";
+	        }
+	    }
+	    System.out.println(c);
+	}
+}
+

innoprograms/factorial (2).c

@@ -0,0 +1,23 @@
+
+
+#include <stdio.h>
+int fact(int n)
+{
+    if(n==0)
+    {
+        return 1;
+    }
+    else
+    {
+        return n*fact(n-1);
+    }
+}
+void main()
+{
+    int n,x;
+    printf("enter a number");
+    scanf("%d",&n);
+    x=fact(n);
+    printf("%d",x);
+
+}

innoprograms/fibonacci.c

@@ -0,0 +1,24 @@
+#include <stdio.h>
+int fibo(int n)
+{
+    if(n==1)
+    {
+        return 1;
+    }
+     else if(n==0)
+    {
+        return 0;
+    }
+   else return (fibo(n-1)+fibo(n-2));
+}
+void main()
+{
+    int num,i;
+    printf("enter the number of elements");
+    scanf("%d",&num);
+    printf("fibonacci series\n");
+    for(i=0;i<num;i++)
+    {
+        printf("%d",fibo(i));
+    }
+}

innoprograms/largesmall.java

@@ -0,0 +1,32 @@
+import java.util.*;
+public class Main
+{
+	public static void main(String[] args) {
+	    Scanner sc= new Scanner(System.in);
+	    System.out.println("enter length");
+	    int n=sc.nextInt();
+	    int l=0;
+	    int s;
+	    int a[]=new int[n];
+	    System.out.println("enter array");
+	    for(int i=0;i<n;i++)
+	    {
+	        a[i]=sc.nextInt();
+
+	    }
+	    s=a[0];
+	    for(int i=0;i<n;i++)
+	    {
+	        if(l<a[i])
+	        {
+	            l=a[i];
+	        }
+	        if(s>a[i])
+	        {
+	            s=a[i];
+	        }
+	    }
+	    System.out.println("largest"+l);
+	    System.out.println("smallest"+s);
+	}
+}

innoprograms/length.java

@@ -0,0 +1,9 @@
+import java.util.*;
+public class Main
+{
+	public static void main(String[] args) {
+	    Scanner sc= new Scanner(System.in);
+	    int a[]={1,2,3,4,5,6};
+	    System.out.println(a.length);
+	}
+}

innoprograms/prime.c

@@ -0,0 +1,18 @@
+void main()
+{
+    int n;
+    int c=0;
+    printf("enter");
+    scanf("%d",&n);
+    for(int i=1;i<=n;i++)
+    {
+        if(n%i==0)
+        {
+            c++;
+        }
+    }
+    if(c==2)
+    printf("prime");
+    else
+    printf("not prime");
+}

innoprograms/reverse.c

@@ -0,0 +1,14 @@
+void main()
+{
+    int n;
+    int r=0;
+    int d=0;
+    printf("enter n");
+    scanf("%d",&n);
+    for(int i=n;i>0;i=i/10)
+    {
+        d=i%10;
+        r=r*10+d;
+    }
+    printf("%d",r);
+}

innoprograms/squareroot.java

@@ -0,0 +1,12 @@
+import java.util.*;
+public class Main
+{
+	public static void main(String[] args) {
+	    Scanner sc=new Scanner(System.in);
+	    int n=sc.nextInt();
+	    double sq=0;
+	    sq=(double)Math.sqrt(n);
+	    System.out.println(sq);
+
+	}
+}

innoprograms/sum array.java

@@ -0,0 +1,22 @@
+import java.util.*;
+public class Main
+{
+	public static void main(String[] args) {
+	    Scanner sc= new Scanner(System.in);
+	    System.out.println("enter length of array");
+	    int n=sc.nextInt();
+	    int s=0;
+	    int a[]=new int[n];
+	    System.out.println("enter array");
+	    for(int i=0;i<n;i++)
+	    {
+	        a[i]=sc.nextInt();
+	    }
+	    for(int i=0;i<n;i++)
+	    {
+	        s=s+a[i];
+	    }
+	    System.out.println(s);
+	}
+}
+

innoprograms/swap.c

@@ -0,0 +1,16 @@
+void main()
+{
+    int a;
+    int b;
+    printf("enter");
+    scanf("%d%d",&a,&b);
+
+
+        a=a+b;
+        b=a-b;
+        a=a-b;
+
+
+    printf("%d",a);
+    printf("%d",b);
+}