PROGRAMMING

JAVA STRING .EQUALS   /* 4. WAP in Java to print the longest word in a sentence. If lengths are same then it will print the first word.*/ import java.util.*; class Test {     public static void main(String args[])     {         Scanner sc=new Scanner(System.in);         String name;         System.out.print("\nInput: ");         name=sc.nextLine();         //System.out.print("NAME: "+name);        String ns2=(name.charAt(0)+". ");                      String ls="";        int i=0;        int lp=0,pi=-1,max=0,ival=0;                  ...

 JAVA STRING ==   import java.util.*; class Test {     static String ss="";     static void fun(char ch)     {         ch=Character.toUpperCase(ch);         if ((ch=='A')||(ch=='U')||(ch=='O')||(ch=='I')||(ch=='E'))             return ;         else             ss=ss+Character.toString(ch);              }     public static void main(String args[])     {                  Scanner sc=new Scanner(System.in);         String name;         System.out.print("\nENTER ANY NAME: ");      ...

 JAVA STRING TOUPPERCASE TOSTRING CHARAT LENGTH import java.util.*; class Test {     public static void main(String args[])     {         Scanner sc=new Scanner(System.in);         String name;         System.out.print("\nENTER ANY NAME: ");         name=sc.nextLine();         int len=name.length();         int i=0;         String ns="";         while(i<len)         {                char s1=(name.charAt(i));             String s=Character.toString(s1);             if(i...

JAVA STRING CHARAT LENGTH TOSTRING SUBSTRING import java.util.*; class Test {     public static void main(String args[])     {         Scanner sc=new Scanner(System.in);         String name;         System.out.print("\nENTER ANY NAME: ");         name=sc.nextLine();         String ns2=(name.charAt(0)+". ");         String ns="";                int i=0;         int lp=0;               int len=name.length();         while(i<len)         {                char n=name....

 /* Tower of Hanoi Algorithm TowerOfHanoi(noofdisk, source, dest, aux) IF disk == 1, THEN     move disk from source to dest ELSE     TowerOfHanoi (no-of-disk- 1, source, aux, dest) // Step 1     move disk from source to dest // Step 2     TowerOfHanoi (no-of-disk- 1, aux, dest, source) // Step 3 */ #include<stdio.h> void ToH(int,char,char,char); void main() {     int n;     printf("How many plates?");     scanf("%d",&n);     ToH(n,'S','D','A'); /*...Function call...*/ } void ToH(int n,char x,char y,char z) {     if(n > 0)     {         ToH(n-1, x, z, y);         /*..... n -1 plates moved from source to auxiliary using destination tower.....*/         printf("\n%c -> %c",x,y);         /*.....last plate...

 # Formulate a program to create a binary tree of integers in python class Node:     def __init__(self, data):         self.left = None         self.right = None         self.data = data     def insert(self, data): # Compare the new value with the parent node         if self.data:             if data < self.data:                 if self.left is None:                     self.left = Node(data)                 else:                  ...

 # traverse inorder, preorder, postorder class Node(object):     def __init__(self,value):         self.value=value         self.left=None         self.right=None class BinaryTree(object):     def __init__(self,root):         self.root=Node(root)     def print_tree(self,traversal_type):         if traversal_type=="preorder":             return self.preorder_print(tree.root, "")             elif traversal_type=="inorder":             return self.inorder_print(tree.root, "")             if traversal_type=="postorder":             return self.postorder_print(tree.root, "")...