diff --git a/Semester 2 (DSA)/assignment 2/demo.java b/Semester 2 (DSA)/assignment 2/demo.java
index 47a9c2a..4795eba 100644
--- a/Semester 2 (DSA)/assignment 2/demo.java	
+++ b/Semester 2 (DSA)/assignment 2/demo.java	
@@ -1,6 +1,6 @@
 //a2q1.java
 import java.util.*;
-public class demo
+public class Demo
 {
     public static void main(String args[])
     {
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q1.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q1.java
new file mode 100644
index 0000000..8a8c140
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q1.java	
@@ -0,0 +1,51 @@
+//A Simple Text Formatter as in text book.
+import java.io.*;
+import java.util.*;
+
+public class a3q1
+{
+	public static void main(String args[])throws IOException
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.println("Enter The File Path : ");
+		String path=in.nextLine();
+		in.close();
+		
+		FileReader fr = new FileReader(path);
+		BufferedReader br = new BufferedReader(fr);
+		String s="";
+		StringBuffer sb1 = new StringBuffer();
+		int len=0;
+		
+		while((s=br.readLine())!=null)
+		{
+			len=len<s.length()?s.length():len;
+			sb1.append(s);
+			sb1.append((char)0);
+		}
+		
+		String delim=""+(char)0;
+		s=sb1.toString();
+		StringTokenizer st = new StringTokenizer(s,delim);
+		StringBuffer sb2 = new StringBuffer();
+		
+		while(st.hasMoreElements())
+		{
+			StringBuffer tmp = new StringBuffer(st.nextElement().toString());
+			int tmplen=tmp.length();
+			for(int i=tmplen; i<len; i++)
+			{
+				tmp.insert(0, " ");
+			}
+			sb2.append(tmp);
+			sb2.append("\n");
+		}
+		
+		fr.close();
+		br.close();
+		
+		FileWriter fw = new FileWriter(path);
+		fw.write(sb2.toString());
+		fw.close();
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q10.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q10.java
new file mode 100644
index 0000000..406c6f2
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q10.java	
@@ -0,0 +1,41 @@
+/*The global replace function is a string-processing algorithm found in every word 
+processor. Write a method that takes three String arguments: a document,
+a target string, and a replacement string. The method should replace every
+occurrence of the target string in the document with the re- placement string.
+For example, if the document is “ To be or not to be, that is the question,” and
+the target string is “be”, and the replacement string is “see,” the result should be,
+“To see or not to see, that is the question."*/
+
+import java.util.*;
+
+public class a3q10
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String str=in.nextLine();
+		System.out.print("Enter the targetted word : ");
+		String tar=in.nextLine();
+		System.out.print("Enter the replacement word : ");
+		String rep=in.nextLine();
+		in.close();
+		replace(str, tar,rep);
+	}
+	public static void replace(String str, String tar, String rep)
+	{
+		StringTokenizer st = new StringTokenizer(str," ");
+		while(st.hasMoreElements())
+		{
+			String tmp=(String) st.nextElement();
+			if(tmp.equalsIgnoreCase(tar))
+			{
+				System.out.print(rep+" ");
+			}
+			else
+			{
+				System.out.print(tmp+" ");
+			}
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q11.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q11.java
new file mode 100644
index 0000000..ba390dd
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q11.java	
@@ -0,0 +1,40 @@
+/*Design and write a Java program that searches for single- digit numbers in a text 
+and changes them to their corresponding words. For ex- ample, the string 
+“4 score and 7 years ago” would be converted into "four score and seven years ago”.*/
+
+import java.util.*;
+
+public class a3q11
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a Stirng : ");
+		String inp=in.nextLine();
+		in.close();
+		String numbers[]= {"zero", 
+							"one",
+							"two",
+							"three",
+							"four",
+							"five",
+							"six",
+							"seven",
+							"eight",
+							"nine",};
+		StringTokenizer st = new StringTokenizer(inp," ");
+		while(st.hasMoreElements())
+		{
+			String tmp=st.nextToken();
+			try
+			{
+				int i=Integer.parseInt(tmp);
+				System.out.print(numbers[i]+" ");
+			}
+			catch(NumberFormatException e)
+			{
+				System.out.print(tmp+" ");
+			}
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q12.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q12.java
new file mode 100644
index 0000000..137864b
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q12.java	
@@ -0,0 +1,31 @@
+/*Write a method that converts its String parameter so that letters are written in 
+blocks five characters long. For example, consider the following two versions of 
+the same sentence: Plain : This i s how we would o r d in a rily write a sentence.
+Blocked : This i showw ewoul dordi n a r il ywrit easen tence.*/
+
+import java.util.*;
+
+public class a3q12
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String inp=in.nextLine();
+		in.close();
+		a3q12 ob = new a3q12();
+		ob.block(inp);
+	}
+	private void block(String inp)
+	{
+		inp=inp.replaceAll(" ", "");
+		for(int i=0; i<inp.length(); i++)
+		{
+			if(i%5==0 && i!=0)
+			{
+				System.out.print(" ");
+			}
+			System.out.print(inp.charAt(i));
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q13.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q13.java
new file mode 100644
index 0000000..c19e3f5
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q13.java	
@@ -0,0 +1,42 @@
+/*Write a Java program to find longest Palindromic Substring within a string 
+Example: The given string is: thequickbrownfoxxofnworbquickthe 
+The longest palindrome substring in the given string is; 
+brownfoxxofnworb The length of the palindromic substring is: 16*/
+
+import java.util.*;
+
+public class a3q13
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String s=in.nextLine();
+		String pal="";
+		in.close();
+		
+		for(int i=0; i<s.length(); i++)
+		{
+			for(int j=i+2; j<s.length(); j++)
+			{
+				String tmp=s.substring(i,j);
+				a3q13 ob = new a3q13();
+				if(ob.checkPalindrome(tmp))
+					pal=tmp.length()>pal.length()?tmp:pal;
+			}
+		}
+		
+		System.out.println("Largest Palidromic String is : "+pal);
+	}
+	boolean checkPalindrome(String s)
+	{
+		for(int i=0; i<s.length()/2; i++)
+		{
+			if(s.charAt(i)!=s.charAt((s.length()-1)-i))
+			{
+				return false;
+			}
+		}
+		return true;
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q14.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q14.java
new file mode 100644
index 0000000..5f5e4df
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q14.java	
@@ -0,0 +1,28 @@
+/*Write a Java program to find first non repeating character in a string . 
+Example: The given string is: gibblegabbler 
+The first non repeated character in String is: i*/
+
+import java.util.*;
+
+public class a3q14
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String inp=in.nextLine();
+		inp+=" ";
+		in.close();
+		
+		for(int i=0; i<inp.length(); i++)
+		{
+			char ch=inp.charAt(i);
+			if(inp.split(ch+"").length==2)
+			{
+				System.out.println(ch+" is First Non repeated Character in the string");
+				System.exit(0);
+			}
+		}
+		System.err.println("There doesn't Exist any character that is not repeated in the string");
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q15.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q15.java
new file mode 100644
index 0000000..89b6dc0
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q15.java	
@@ -0,0 +1,26 @@
+/*Write a java program to remove the title from a name. 
+Ex. Input: Mr. Sachin Tendulkar Ms. Saina Nehwal Output: Sachin Tendulkar Saina Nehwal 
+*/
+
+import java.util.*;
+
+public class a3q15
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String s=in.nextLine();
+		in.close();
+		StringTokenizer st = new StringTokenizer(s," ");
+		while(st.hasMoreElements())
+		{
+			String tmp=st.nextToken();
+			if(tmp.equalsIgnoreCase("Mr."))
+			{
+				continue;
+			}
+			System.out.print(tmp+" ");
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q16.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q16.java
new file mode 100644
index 0000000..ef0976d
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q16.java	
@@ -0,0 +1,25 @@
+//Write a java program to read two string as user input and check if first contains second?
+
+import java.util.*;
+
+public class a3q16
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter the First String : ");
+		String s1=in.nextLine();
+		System.out.print("Enter the String String : ");
+		String s2=in.nextLine();
+		in.close();
+		
+		if(s1.contains(s2))
+		{
+			System.out.println("Yes, 1st string contains the second");
+		}
+		else
+		{
+			System.out.println("No, 1st string doesn't contains the second");
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q17.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q17.java
new file mode 100644
index 0000000..0ea6e3e
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q17.java	
@@ -0,0 +1,20 @@
+//Write a java code to remove all occurrences of a given character from an input String
+
+import java.util.*;
+
+public class a3q17
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String inp=in.nextLine();
+		System.out.print("Enter a character to be removed : ");
+		char ch=in.nextLine().charAt(0);
+		in.close();
+		
+		String out=inp.replaceAll(ch+"", "");
+		
+		System.out.println("Output : "+out);
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q18.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q18.java
new file mode 100644
index 0000000..b3d7599
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q18.java	
@@ -0,0 +1,36 @@
+//Write a java code to find the longest substring without repeating characters in the given string.
+
+import java.util.*;
+
+public class a3q18
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String inp=in.nextLine();
+		in.close();
+		String biggest="";
+		
+		for(int i=0; i<inp.length(); i++)
+		{
+			for(int j=i+1; j<=inp.length(); j++)
+			{
+				biggest=repeat(inp.substring(i,j))?inp.substring(i,j).length()>biggest.length()?inp.substring(i,j):biggest:biggest;
+			}
+		}
+		System.out.println("Output : "+biggest);
+	}
+	private static boolean repeat(String inp)
+	{
+		inp+=" ";
+		for(int i=0; i<inp.length(); i++)
+		{
+			if(inp.split(inp.charAt(i)+"").length>2)
+			{
+				return false;
+			}
+		}
+		return true;
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q19.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q19.java
new file mode 100644
index 0000000..035121d
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q19.java	
@@ -0,0 +1,24 @@
+//Write a java program to check if a String contains only digits.
+
+import java.util.*;
+
+public class a3q19
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String inp=in.nextLine();
+		in.close();
+		
+		for(int i=0; i<inp.length(); i++)
+		{
+			if(Character.isDigit(inp.charAt(i)))
+			{
+				System.out.println("The Given String Contains a Number");
+				System.exit(0);
+			}
+		}
+		System.out.println("The Given String doesn't contain any number");
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q20.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q20.java
new file mode 100644
index 0000000..4062554
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q20.java	
@@ -0,0 +1,29 @@
+//Write a java program to input a string from user and reverse each word of the string.
+
+import java.util.*;
+
+public class a3q20
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String inp=in.nextLine();
+		in.close();
+		
+		StringTokenizer st = new StringTokenizer(inp);
+		while(st.hasMoreElements())
+		{
+			System.out.print(rev(st.nextToken())+" ");
+		}
+	}
+	private static String rev(String s)
+	{
+		String rt="";
+		for(int i=s.length()-1; i>-1; i--)
+		{
+			rt+=s.charAt(i);
+		}
+		return rt;
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q21.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q21.java
new file mode 100644
index 0000000..e7f52c2
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q21.java	
@@ -0,0 +1,22 @@
+//Write a java code to capitalize first alphabet of each word in a string
+
+import java.util.Scanner;
+import java.util.StringTokenizer;
+
+public class a3q21
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String inp=in.nextLine();
+		in.close();
+		
+		StringTokenizer st = new StringTokenizer(inp);
+		while(st.hasMoreElements())
+		{
+			String t=st.nextToken();
+			System.out.print(t.toUpperCase().charAt(0)+t.toLowerCase().substring(1)+" ");
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q22.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q22.java
new file mode 100644
index 0000000..e634469
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q22.java	
@@ -0,0 +1,56 @@
+//Write a java code to swap two string variables without using third or temp variable.
+
+import java.util.*;
+
+public class a3q22
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String s1=in.nextLine();
+		System.out.print("Enter a String : ");
+		String s2=in.nextLine();
+		in.close();
+		if(s1.length()>s2.length())
+		{
+			for(int i=s2.length(); i<s1.length(); i++)
+			{
+				s1+=" ";
+			}
+		}
+		else
+		{
+			for(int i=s1.length(); i<s2.length(); i++)
+			{
+				s2+=" ";
+			}
+		}
+		
+		s1=add(s1,s2);
+		s2=subt(s1,s2);
+		s1=subt(s1,s2);
+
+		System.out.println("After Swapping");
+		System.out.println("s1 : "+s1);
+		System.out.println("s2 : "+s2);
+	}
+	private static String add(String s1, String s2)
+	{
+		String outp="";
+		for(int i=0; i<s2.length(); i++)
+		{
+			outp+=(char)((int)s1.charAt(i)+(int)s2.charAt(i));
+		}
+		return outp;
+	}
+	private static String subt(String s1, String s2)
+	{
+		String outp="";
+		for(int i=0; i<s2.length(); i++)
+		{
+			outp+=(char)((int)s1.charAt(i)-(int)s2.charAt(i));
+		}
+		return outp;
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q23.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q23.java
new file mode 100644
index 0000000..b90f7a3
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q23.java	
@@ -0,0 +1,28 @@
+//Write a java code to move all uppercase characters to the end of string.
+
+import java.util.*;
+
+public class a3q23
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String inp=in.nextLine();
+		in.close();
+		StringBuffer sb = new StringBuffer(inp);
+		int len=inp.length();
+		for(int i=0; i<len; i++)
+		{
+			char ch=sb.charAt(i);
+			if(Character.isUpperCase(ch))
+			{
+				sb.deleteCharAt(i);
+				sb.append(ch);
+				i--;
+				len--;
+			}
+		}
+		System.out.println("Output : "+sb);
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q24.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q24.java
new file mode 100644
index 0000000..2cc61d0
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q24.java	
@@ -0,0 +1,28 @@
+//Write a java code to generate random string of a given size.
+
+import java.util.*;
+
+public class a3q24
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter String Length to Generate : ");
+		int n=in.nextInt();
+		in.close();
+		String out="";
+		for(int i=0; i<n; i++)
+		{
+			switch((int)(Math.random()*2))
+			{
+			case 0:
+				out+=(char)((int)(Math.random()*26+65));
+				break;
+			case 1:
+				out+=(char)((int)(Math.random()*26+97));
+				break;
+			}
+		}
+		System.out.println(out);
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q25.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q25.java
new file mode 100644
index 0000000..c1dff22
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q25.java	
@@ -0,0 +1,40 @@
+/*Write an program to print all permutations of a given String in Java. For example,
+ * if given input is "123" then your program should print all 6 permutations 
+e.g. "123”, “132", "213”, “231", "312” and “321”.*/
+
+import java.util.*;
+
+public class a3q25
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String s=in.nextLine();
+		in.close();
+		a3q25 ob = new a3q25();
+		Vector<Character> charr=new Vector<Character>();
+		for(char ch:s.toCharArray())
+		{
+			charr.add(ch);
+		}
+		ob.rec("", charr);
+	}
+	private void rec(String s, Vector<Character> arr)
+	{
+		if(arr.size()==1)
+		{
+			System.out.println(s+arr.get(0));
+			return;
+		}
+		else
+		{
+			for(int i=0; i<arr.size(); i++)
+			{
+				Vector<Character> arrn = new Vector<Character>(arr);
+				arrn.remove(i);
+				rec(s+arr.get(i),arrn);
+			}
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q26.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q26.java
new file mode 100644
index 0000000..6b0b50d
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q26.java	
@@ -0,0 +1,37 @@
+/*Write a Java program which will take a String input and print out a number of 
+vowels and consonants on that String. For example, if the input is “Java” then 
+your program should print "2 vowels and 2 consonants”.*/
+
+import java.util.*;
+
+public class a3q26
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String s=in.nextLine();
+		in.close();
+		int cons=0, vowel=0;
+		for(char ch:s.toLowerCase().toCharArray())
+		{
+			if(Character.isLetter(ch))
+			{
+				switch(ch)
+				{
+				case 'a':
+				case 'e':
+				case 'i':
+				case 'o':
+				case 'u':
+					vowel++;
+					break;
+				default:
+					cons++;
+				}
+			}
+		}
+		System.out.println("Number of Vowels : "+vowel);
+		System.out.println("Number of Consonants : "+cons);
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q27.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q27.java
new file mode 100644
index 0000000..8e0076b
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q27.java	
@@ -0,0 +1,59 @@
+/*
+ * You are given 3 strings:first, second, and third. Third String is said to be a shuffle 
+ * of first and second if it can be formed by interleaving the characters of first and second 
+ * String in a way that maintains the left to right ordering of the characters from each string. 
+ * For example, given first ="abc"and second ="def”, third ="dabecf” is a valid shuffle since it 
+ * preserves the character ordering of the two strings. So, given these 3 strings write a 
+ * function that detects whether the third String is a valid shuffle of first and second String.
+ */
+
+import java.util.*;
+
+public class a3q27
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter the First String : ");
+		String s1=in.nextLine();
+		System.out.print("Enter the Second String : ");
+		String s2=in.nextLine();
+		System.out.print("Enter the Shuffled String : ");
+		String s3=in.nextLine();
+		in.close();
+		a3q27 ob = new a3q27();
+		if(ob.checkShuffle(s1,s2,s3))
+		{
+			System.out.println("The Shuffling is Correct");
+		}
+		else
+		{
+			System.out.println("The Shuffling is Wrong");
+		}
+	}
+	private boolean checkShuffle(String s1, String s2, String s3)
+	{
+		StringBuffer sb1 = new StringBuffer(s1);
+		StringBuffer sb2 = new StringBuffer(s2);
+		if(s1.length()+s2.length()!=s3.length())
+		{
+			return false;
+		}
+		for(char ch:s3.toCharArray())
+		{
+			if(sb1.length()!=0 && ch==sb1.charAt(0))
+			{
+				sb1.deleteCharAt(0);
+			}
+			else if(sb2.length()!=0 && ch==sb2.charAt(0))
+			{
+				sb2.deleteCharAt(0);
+			}
+			else
+			{
+				return false;
+			}			
+		}
+		return true;
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q28.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q28.java
new file mode 100644
index 0000000..cf3f8fd
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q28.java	
@@ -0,0 +1,43 @@
+/*Write a function to search for the existence of a string (target) in another string 
+(source). The function takes two strings as the input and returns the index where the
+second string is found. If the target string cannot be found, then return -1. 
+If you are a Java developer, then you can relate its behavior to indexOf() method from 
+java.lang.String class. This question is also asked as Code and algorithm to check if a 
+given short string is a substring of the main string. Can you get a linear solution (O(n)) if possible? */
+
+import java.util.*;
+
+public class a3q28
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String str=in.nextLine();
+		System.out.print("Enter the String to be Searched : ");
+		String s=in.nextLine();
+		in.close();
+		a3q28 ob = new a3q28();
+		int outp=0;
+		if((outp=ob.searchString(str,s))==-1)
+		{
+			System.out.println("Substring not found in the main String");
+		}
+		else
+		{
+			System.out.println("Substring found at Postion number "+outp);
+		}
+	}
+	private int searchString(String str, String s)
+	{
+		for(int i=0; i<=str.length()-s.length(); i++)
+		{
+			String tmp=str.substring(i,i+s.length());
+			if(s.equals(tmp))
+			{
+				return i;
+			}
+		}
+		return -1;
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q29.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q29.java
new file mode 100644
index 0000000..cca39c1
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q29.java	
@@ -0,0 +1,42 @@
+/*Write a function to implement an algorithm which will accept a string of characters 
+ * and should find the highest occurrence of the character and display it.
+ * For example if input is “aaaaaaaaaaaaaaaaabbbbcddddeeeeee” it should return “a”.*/
+
+import java.util.*;
+
+public class a3q29
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String inp=in.nextLine();
+		in.close();
+		
+		int count=0;
+		char character=' ';
+		for(int i=0; i<inp.length(); i++)
+		{
+			char ch=inp.charAt(i);
+			int t=0;
+			for(;i<inp.length(); i++)
+			{
+				if(ch==inp.charAt(i))
+				{
+					t++;
+				}
+				else
+				{
+					i--;
+					break;
+				}
+			}
+			if(t>count)
+			{
+				count=Math.max(count, t);
+				character=ch;
+			}
+		}
+		System.out.print("\'"+character+"\' Was repeated the most");
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q3.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q3.java
new file mode 100644
index 0000000..d9ad6a0
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q3.java	
@@ -0,0 +1,17 @@
+//Write a program to enter a string and count how many vowels present in it.
+
+import java.util.*;
+
+public class a3q3
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String str=in.nextLine();
+		in.close();
+		str=" "+str.toLowerCase()+" ";
+		StringTokenizer st = new StringTokenizer(str,"aeiou");
+		System.out.println("Number of Vowels : "+(st.countTokens()-1));
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q30.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q30.java
new file mode 100644
index 0000000..c961a05
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q30.java	
@@ -0,0 +1,49 @@
+/*Write a Program to sort String on their length in Java? Your method should accept
+ * an array of String and return a sorted array based upon the length of String.
+*/
+
+import java.util.*;
+
+public class a3q30
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter the Number of Strings to be Entered : ");
+		int n=in.nextInt();
+		//clears buffer
+		in.nextLine();
+		
+		String arr[] = new String[n];
+		for(int i=0; i<n; i++)
+		{
+			System.out.print("arr["+i+"]=");
+			arr[i]=in.nextLine();
+		}
+		in.close();
+		a3q30 ob = new a3q30();
+		arr=ob.sort(arr);
+		System.out.println("After Sorting");
+		for(String s:arr)
+		{
+			System.out.println(s);
+		}
+	}
+	private String[] sort(String arr[])
+	{
+		int n = arr.length; 
+        for(int i=0; i<n-1; i++)
+        {
+            for(int j=0; j<n-i-1; j++)
+            {
+                if(arr[j].length()>arr[j+1].length()) 
+                { 
+                    String temp=arr[j]; 
+                    arr[j]=arr[j+1]; 
+                    arr[j+1]=temp; 
+                }
+            }
+        }
+        return arr;
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q4.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q4.java
new file mode 100644
index 0000000..621523d
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q4.java	
@@ -0,0 +1,25 @@
+//Write a program to enter a string and count the frequency each character present in it.
+
+import java.util.*;
+
+public class a3q4
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String s=in.nextLine();
+		in.close();
+		int arr[] = new int[256];
+		s.toUpperCase();
+		for(char ch:s.toCharArray())
+		{
+			arr[ch]++;
+		}
+		for(int i=0; i<256; i++)
+		{
+			if(arr[i]!=0)
+			System.out.println("\'"+((char)i)+"\' occured "+arr[i]+" times");
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q5.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q5.java
new file mode 100644
index 0000000..30a5c99
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q5.java	
@@ -0,0 +1,21 @@
+/*Write a program to enter a string and print the string in a format which says 
+that 1st letter of each word present in the string must be printed in capital letters.*/
+
+import java.util.*;
+
+public class a3q5
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String s=in.nextLine();
+		in.close();
+		StringTokenizer st = new StringTokenizer(s," ");
+		while(st.hasMoreElements())
+		{
+			String tmp=(String) st.nextElement();
+			System.out.print(tmp.toString().toUpperCase().charAt(0)+tmp.substring(1)+" ");
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q6.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q6.java
new file mode 100644
index 0000000..69a94e0
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q6.java	
@@ -0,0 +1,49 @@
+/*Write a program to enter N number of strings , arrange them in ascending order.*/
+
+import java.util.*;
+
+public class a3q6
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		
+		System.out.print("Enter the Value of n : ");
+		int n=in.nextInt();
+		in.nextLine();
+		
+		String arr[]=new String[n];
+		for(int i=0; i<n; i++)
+		{
+			System.out.print((i+1)+" : ");
+			arr[i]=in.nextLine();
+		}
+		in.close();
+		
+		a3q6 ob = new a3q6();
+		arr=ob.sort(arr);
+		
+		System.out.println("Strings After Sorting : ");
+		for(String s:arr)
+		{
+			System.out.println(s);
+		}
+	}
+	String[] sort(String arr[])
+	{
+		int n = arr.length; 
+        for (int i = 0; i < n-1; i++)
+        {
+            for (int j = 0; j < n-i-1; j++)
+            {
+                if (arr[j].compareTo(arr[j+1])>0) 
+                {  
+                    String temp = arr[j]; 
+                    arr[j] = arr[j+1]; 
+                    arr[j+1] = temp; 
+                }
+            }
+        }
+        return arr;
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q7.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q7.java
new file mode 100644
index 0000000..e7e5eec
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q7.java	
@@ -0,0 +1,31 @@
+/*Write a program to enter a name as string and print the name in shorter manner. 
+Ex: Ram Chandra Dash will become R.C.Dash 
+*/
+
+import java.util.*;
+
+public class a3q7
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String : ");
+		String s=in.nextLine();
+		in.close();
+		StringTokenizer st = new StringTokenizer(s," ");
+		int cnt=st.countTokens();
+		while(st.hasMoreElements())
+		{
+			String tmp=(String) st.nextElement();
+			System.out.print(tmp.toString().toUpperCase().charAt(0)+".");
+			cnt--;
+			if(cnt==1)
+				break;
+		}
+		if(st.hasMoreElements())
+		{
+			String tmp=st.nextToken();
+			System.out.print(tmp.toString().toUpperCase().charAt(0)+tmp.substring(1));
+		}
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q8.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q8.java
new file mode 100644
index 0000000..2655ec8
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q8.java	
@@ -0,0 +1,40 @@
+//Write a program to check whether the entered string is palindrome or not
+
+import java.util.*;
+
+public class a3q8
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter a String: ");
+		String s=in.nextLine();
+		in.close();
+		
+		a3q8 ob = new a3q8();
+		if(ob.checkPalindrome(s))
+		{
+			System.out.println(s+" is palindrome");
+		}
+		else
+		{
+			System.out.println(s+" is not palindrome string");
+		}
+	}
+	boolean checkPalindrome(String s)
+	{
+		if(s.length()<2)
+			return true;
+		else
+		{
+			char ch1=s.charAt(0);
+			char ch2=s.charAt(s.length()-1);
+			if(ch1!=ch2)
+				return false;
+			s=s.substring(0,1);
+			s=s.substring(s.length()-1, s.length());
+			checkPalindrome(s);
+		}
+		return true;
+	}
+}
diff --git a/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q9.java b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q9.java
new file mode 100644
index 0000000..7dbae9a
--- /dev/null
+++ b/Semester 3 (CWS-1)/Assignments/Assignment 3/a3q9.java	
@@ -0,0 +1,21 @@
+/*Write a method that takes a delimited string to store a name and address, from 
+which you can print a mailing label. For example, if the string contains “Sam Penn:14 Bridge St.:Hoboken, NJ 01881,”
+the method should print the label shown in the below: Sam Penn 14 Bridge St. Hoboken, NJ 01881*/
+
+import java.util.*;
+
+public class a3q9
+{
+	public static void main(String args[])
+	{
+		Scanner in = new Scanner(System.in);
+		System.out.print("Enter mail label : ");
+		String s=in.nextLine();
+		in.close();
+		StringTokenizer st = new StringTokenizer(s,":,");
+		while(st.hasMoreElements())
+		{
+			System.out.println(st.nextElement().toString().trim());
+		}
+	}
+}