diff --git a/group09/610673813/src/coding/week02/array/ArrayUtil.java b/group09/610673813/src/coding/week02/array/ArrayUtil.java
new file mode 100644
index 0000000000..ed443a2c22
--- /dev/null
+++ b/group09/610673813/src/coding/week02/array/ArrayUtil.java
@@ -0,0 +1,345 @@
+package coding.week02.array;
+
+public class ArrayUtil 
+{
+	
+	/**
+	 * 给定一个整形数组a , 对该数组的值进行置换
+		例如： a = [7, 9 , 30, 3]  ,   置换后为 [3, 30, 9,7]
+		如果     a = [7, 9, 30, 3, 4] , 置换后为 [4,3, 30 , 9,7]
+	 * @param origin
+	 * @return
+	 */
+	public void reverseArray(int[] origin)
+	{
+		 for(int i=0, j = origin.length-1; i<j; i++, j--)
+		 {
+			 int t = origin[i];
+			 origin[i] = origin[j];
+			 origin[j] = t;
+		 }
+	}
+	
+	/**
+	 * 现在有如下的一个数组：   int oldArr[]={1,3,4,5,0,0,6,6,0,5,4,7,6,7,0,5}   
+	 * 要求将以上数组中值为0的项去掉，将不为0的值存入一个新的数组，生成的新数组为：   
+	 * {1,3,4,5,6,6,5,4,7,6,7,5}  
+	 * @param oldArray
+	 * @return
+	 */
+	
+	public int[] removeZero(int[] oldArray)
+	{	//传进空数组是返回空数组
+		if(oldArray == null)
+			return null;
+		int count = 0; //统计非零元素个数
+		int b[] = new int[oldArray.length];
+		//先统计非零元素个数，并将非零元素存入一个和原数组同样大小的新数组
+		for(int i=0; i < oldArray.length; i++)
+		{
+			if(oldArray[i] != 0)
+			{
+				b[count++] = oldArray[i];
+			}	
+		}
+		//初始化一个元素个数为非零元素个数的新数组
+		int newArray[] = new int[count]; 
+		//将非零元素copy到新数组
+		System.arraycopy(b, 0, newArray, 0, count);
+		
+		/*
+		 * int k=0;
+		for(int i=0; i<oldArray.length; i++)
+		{
+			if(oldArray[i] != 0)
+			{
+				newArray[k++] = oldArray[i];   
+			}
+		}*/
+		
+		return newArray;
+	}
+	
+	/**
+	 * 给定两个已经排序好的整形数组， a1和a2 ,  创建一个新的数组a3, 使得a3 包含a1和a2 的所有元素， 并且仍然是有序的
+	 * 例如 a1 = [3, 5, 7,8]   a2 = [4, 5, 6,7]    则 a3 为[3,4,5,6,7,8]    , 注意： 已经消除了重复
+	 * @param array1
+	 * @param array2
+	 * @return
+	 */
+	
+	public int[] merge(int[] array1, int[] array2)
+	{   //当array1和array2都为空时，返回空
+		if(array1 == null && array2 == null)
+			return null;
+		int[] newArray = new int[array1.length + array2.length];
+		//应该让a1，a2两个数组先进行比较 比较后插入元素
+		int i = 0;  //array1下标
+		int j = 0;	//array2下标
+		int count = 0;	//array3下标
+		while(i < array1.length && j < array2.length)
+		{
+			if(array1[i] < array2[j])
+			{
+				newArray[count++] = array1[i++];
+			}
+			else if(array1[i] > array2[j])
+			{
+				newArray[count++] = array2[j++];
+			}
+			else if(array1[i] == array2[j])
+			{
+				newArray[count++] = array2[j++];
+				i++;
+			}
+		}
+		while(i==array1.length && j<array2.length)
+		{
+			newArray[count++] = array2[j++];
+		}
+		while(j==array2.length && i<array1.length)
+		{
+			newArray[count++] = array1[i++];
+		}
+	
+		int[] newArray1 = new int[count];
+		System.arraycopy(newArray, 0, newArray1, 0, count);
+		
+		return  newArray1;
+	}
+	/**
+	 * 把一个已经存满数据的数组 oldArray的容量进行扩展， 扩展后的新数据大小为oldArray.length + size
+	 * 注意，老数组的元素在新数组中需要保持
+	 * 例如 oldArray = [2,3,6] , size = 3,则返回的新数组为
+	 * [2,3,6,0,0,0]
+	 * @param oldArray
+	 * @param size
+	 * @return
+	 * @throws Exception 
+	 */
+	public int[] grow(int [] oldArray,  int size)
+	{
+		if(oldArray == null)
+			return null;
+		if(size < 0)
+			throw new IndexOutOfBoundsException("size小于0");
+		int[] newArray = new int[oldArray.length + size];
+		System.arraycopy(oldArray, 0, newArray, 0, oldArray.length);
+		return newArray;
+	}
+	
+	/**
+	 * 斐波那契数列为：1，1，2，3，5，8，13，21......  ，给定一个最大值， 返回小于该值的数列
+	 * 例如， max = 15 , 则返回的数组应该为 [1，1，2，3，5，8，13]
+	 * max = 1, 则返回空数组 []
+	 * @param max
+	 * @return
+	 */
+	public int[] fibonacci(int max)
+	{	
+		if(max == 1)
+			return new int[0];
+		//先将max设置为数组长度,但会浪费空间
+		int[] a = new int[max];
+		a[0] = 1;
+		a[1] = 1;
+		for(int i=2; i<max; i++)
+			a[i] = a[i-1] + a[i-2];
+		//再将max与数组中元素进行比较，获得元素节点位置
+		int j = 0;
+		for(j = 0; j<a.length; j++)
+		{
+			if(max < a[j])
+				break;
+		}
+		int[] newArray = new int[j];
+		System.arraycopy(a, 0, newArray, 0, j);
+			
+		return newArray;
+	}
+	
+	/**
+	 * 返回小于给定最大值max的所有素数数组
+	 * 例如max = 23, 返回的数组为[2,3,5,7,11,13,17,19]
+	 * @param max
+	 * @return
+	 */
+	public int[] getPrimes(int max)
+	{
+		/*
+		 * 思路：先生成素数数组，数组的最大值小于max  
+		 */
+		//max小于3时，返回空数组
+		if(max < 3)
+			return new int[0];
+		int[] Array = new int[max];
+		int count = 0;  //
+		int n = 0;
+		//判断小于max的数有哪些是素数
+		for(n = 2; n < max; n++)
+		{
+			if( count < max)
+		    {	
+				//判断当前n是不是素数
+				int i = 2;
+				while(i < n)  
+				{
+					if(n % i == 0)
+						break;
+					if(n % i != 0)
+						i++;
+				}
+				if(i == n)
+				{	//将素数统计出来
+					Array[count++] = n;
+				}
+			}
+		}
+		int[] newArray = new int[count];
+		System.arraycopy(Array, 0, newArray, 0, count);
+		return newArray;
+	}
+	
+	/**
+	 * 所谓“完数”， 是指这个数恰好等于它的因子之和，例如6=1+2+3
+	 * 给定一个最大值max， 返回一个数组， 数组中是小于max 的所有完数
+	 * @param max
+	 * @return
+	 */
+	public int[] getPerfectNumbers(int max)
+	{
+		int[] Array = new int[max];
+		
+		int n = 0;
+		int count = 0;
+		int i = 0;
+		for(n = 2; n < max; n++)
+		{
+			int sum = 0;
+			for(i=1; i<n; i++)
+			{
+				if(n%i == 0)
+					sum += i;
+			}
+			if(sum == n)
+				Array[count++] = n;
+		}
+		
+		int[] newArray = new int[count];
+		System.arraycopy(Array, 0, newArray, 0, count);
+		return newArray;
+	}
+	
+	/**
+	 * 用seperator 把数组 array给连接起来
+	 * 例如array= [3,8,9], seperator = "-"
+	 * 则返回值为"3-8-9"
+	 * @param array
+	 * @param s
+	 * @return
+	 */
+	public String join(int[] array, String seperator)
+	{
+		String s = null;
+		if(array.length == 0)
+			return "";
+		s = Integer.toString(array[0]);
+		if(array.length > 1)
+		{
+			s = s + seperator;
+			for(int i=1; i<array.length-1; i++)
+				s = s + array[i] + seperator;
+			s = s + array[array.length -1];
+		}	
+		return s;
+	}
+	
+ 
+	public static void main(String[] args)
+	{
+		/*  reverseArray()
+		 * 
+		 *
+		int[] a = {1, 2,1, 3, 5, 6};
+		reverseArray(a);
+		for(int i=0; i<a.length; i++)
+		{
+			System.out.print(a[i] + " ");
+		}
+		*/
+		
+		
+		/* removeZero()
+		 * 
+		 * 
+		int oldArr[]={1,3,4,5,0,0,6,6,0,5,4,7,6,7,0,5, 7, 8}; 
+		int[] a = removeZero(oldArr);
+		for(int i=0; i<a.length; i++)
+		{
+			System.out.print(a[i] + " ");
+		}
+		*/
+		
+		
+		/* merge()
+		 * 
+		 * 
+		 int[] a1 = {3, 5, 7, 8, 9};
+		 int[] a2 = {1, 2, 3, 4, 5, 6, 7};
+		 int[] a3 = merge(a1, a2);
+		 for(int i=0; i<a3.length; i++)
+		 {
+			 System.out.print(a3[i] + " ");
+		 }
+		 */
+		
+		/* grow()
+		 * 
+		 *
+		int[] a = new int[0];//{3, 5, 7, 8, 9};
+		int[] newArray = grow(a, -3);
+		for(int i=0; i<newArray.length; i++)
+		{
+			System.out.print(newArray[i] + " ");
+		}
+		*/
+		
+		/* fibonacci()
+		 *
+		int[] array =  fibonacci(35);
+		for(int i=0; i<array.length; i++)
+		{
+			System.out.print(array[i] + " ");
+		}
+		*/
+		
+		/* getPrimes()
+		 *
+		int[] array =  getPrimes(2);
+		for(int i=0; i<array.length; i++)
+		{
+			System.out.print(array[i] + " ");
+		}
+		*/
+		
+		/*  getPerfectNumbers()
+		 *
+		int[] array =  getPerfectNumbers(10000);
+		for(int i=0; i<array.length; i++)
+		{
+			System.out.print(array[i] + " ");
+		}
+		*/
+		
+		/*  join()
+		 *
+		int[] Array = {3, 5, 7, 8, 9};
+		int[] array = {};
+		String s = join(array, "-");
+		System.out.println(s);
+		*/
+		 
+	}
+
+
+}
diff --git a/group09/610673813/src/coding/week02/array/ArrayUtilTest.java b/group09/610673813/src/coding/week02/array/ArrayUtilTest.java
new file mode 100644
index 0000000000..0401894189
--- /dev/null
+++ b/group09/610673813/src/coding/week02/array/ArrayUtilTest.java
@@ -0,0 +1,151 @@
+package coding.week02.array;
+
+import static org.junit.Assert.*;
+
+import org.junit.Before;
+import org.junit.Rule;
+import org.junit.Test;
+import org.junit.rules.ExpectedException;
+
+public class ArrayUtilTest
+{
+	private ArrayUtil myArray;
+	
+	@Before
+	public void setUp() throws Exception
+	{
+		myArray = new ArrayUtil();
+	}
+
+	@Test
+	public void testReverseArray()
+	{
+		int[] a = {1, 2, 1, 3, 5, 6};
+		int[] b = {6, 5, 3, 1, 2, 1};
+				
+		myArray.reverseArray(a);
+		assertArrayEquals(a, b);
+		
+		int[] c = new int[0];
+		myArray.reverseArray(c);
+		assertArrayEquals(c, new int[0]);
+
+	}
+
+	@Test
+	public void testRemoveZero()
+	{
+		int[] oldArr= {1, 3, 4, 5, 0, 0, 6, 6, 0, 5, 4, 7, 6, 7, 1, 2, 0, 5};
+		int b[] = {1, 3, 4, 5, 6, 6, 5, 4, 7, 6, 7, 1, 2, 5};  
+		int[] c = myArray.removeZero(oldArr);
+		assertArrayEquals(b, c);
+		
+		int[] d = null;
+		int[] e = myArray.removeZero(d);
+		assertNull(e);
+		
+	}
+
+	@Test
+	public void testMerge()
+	{
+		int a1[] = {1, 2, 3, 4, 5};
+		int b1[] = {3, 4, 5, 6, 7, 8};
+		int c1[] = {1, 2, 3, 4, 5, 6, 7, 8};
+		int[] newArray1 = myArray.merge(a1, b1);
+		assertArrayEquals(c1, newArray1);
+		
+		int a2[] = new int[0];
+		int b2[] = {0, 2, 3, 6, 7, 8};
+		int c2[] = {0, 2, 3, 6, 7, 8};
+		int[] newArray2 = myArray.merge(a2, b2);
+		assertArrayEquals(c2, newArray2);
+		
+		int a3[] = {0, 2, 3, 6, 7, 8};
+		int b3[] = new int[0];
+		int c3[] = {0, 2, 3, 6, 7, 8};
+		int[] newArray3 = myArray.merge(a3, b3);
+		assertArrayEquals(c3, newArray3);
+		
+		int[] a4 = null;
+		int[] b4 = null;
+		int[] newArray4 = myArray.merge(a4, b4);
+		assertNull(newArray4);
+	}
+
+	@Rule  
+	public ExpectedException expectedEx = ExpectedException.none(); 
+	
+	@Test
+	public void testGrow()
+	{
+		int[] a = {3, 5, 7, 8, 9};
+		int[] b = {3, 5, 7, 8, 9, 0, 0, 0};
+		int[] newArray = myArray.grow(a, 3);
+		assertArrayEquals(b, newArray);
+		
+		int[] c = null;
+		int[] newArray1 = myArray.grow(c, 3);
+		assertNull(newArray1);
+		
+		// size < 0 抛出异常
+		expectedEx.expect(Exception.class);
+		myArray.grow(a, -3);
+	}
+	
+	@Test
+	public void testFibonacci()
+	{
+		//max == 1时返回空数组
+		int[] array1 =  myArray.fibonacci(1);
+		int[] b = new int[0];
+		assertArrayEquals(array1, b);
+		
+		
+		int[] array2=  myArray.fibonacci(35);
+		int[] c = {1, 1, 2, 3, 5, 8, 13, 21, 34 };
+		assertArrayEquals(c, array2);
+	}
+
+	@Test
+	public void testGetPrimes()
+	{
+		int[] a = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
+		int[] array1 =  myArray.getPrimes(35);
+		assertArrayEquals(a, array1);
+		
+		//max <= 2的时候没有素数，数组为空数组
+		int[] array2 = myArray.getPrimes(1); 
+		int[] b = new int[0];
+		assertArrayEquals(array2, b);
+	}
+
+	@Test
+	public void testGetPerfectNumbers()
+	{
+		int[] array =  myArray.getPerfectNumbers(10000);
+		int[] a = {6, 28, 496, 8128 };
+		assertArrayEquals(a, array);
+	}
+
+	@Test
+	public void testJoin()
+	{
+		int[] Array0 = {3, 5, 7, 8, 9};
+		String s0 = myArray.join(Array0, "-");
+		String s1 = "3-5-7-8-9";
+		assertEquals(s1, s0);
+		
+		int[] Array1 = {3};
+		String s2 = myArray.join(Array1, "-");
+		String s3 = "3";
+		assertEquals(s2, s3);
+		
+		//传递空数组时，返回空字符串
+		int[] Array2 = new int[0];
+		String s4 = myArray.join(Array2, "-");
+		String s5 = "";
+		assertEquals(s4, s5);
+	}
+
+}
diff --git a/group09/610673813/src/coding/week03/DownloadThread.java b/group09/610673813/src/coding/week03/DownloadThread.java
new file mode 100644
index 0000000000..b125afb43e
--- /dev/null
+++ b/group09/610673813/src/coding/week03/DownloadThread.java
@@ -0,0 +1,39 @@
+package coding.week03;
+
+import java.io.IOException;
+import java.io.RandomAccessFile;
+import java.util.concurrent.CountDownLatch;
+
+import coding.week03.download.api.Connection;
+
+
+public class DownloadThread extends Thread {
+
+	private Connection conn;
+	private int startPos;
+	private int endPos;
+	private RandomAccessFile file;
+	private CountDownLatch threadsSignal;
+	
+	public DownloadThread(CountDownLatch threadsSignal,Connection conn, int startPos, int endPos, RandomAccessFile file) {
+		this.conn = conn;
+		this.startPos = startPos;
+		this.endPos = endPos;
+		this.file = file;
+		this.threadsSignal=threadsSignal;
+	}
+
+	public void run() {
+		try {
+			byte[] buffer = conn.read(startPos, endPos);
+			file.seek(startPos);
+			file.write(buffer, 0, buffer.length);
+		} catch (IOException e) {
+			// TODO Auto-generated catch block
+			e.printStackTrace();
+		} finally {
+			threadsSignal.countDown();
+			System.out.println("当前线程："+Thread.currentThread().getName()+";剩余线程数："+threadsSignal.getCount());
+		}
+	}
+}
diff --git a/group09/610673813/src/coding/week03/FileDownloader.java b/group09/610673813/src/coding/week03/FileDownloader.java
new file mode 100644
index 0000000000..bb07582170
--- /dev/null
+++ b/group09/610673813/src/coding/week03/FileDownloader.java
@@ -0,0 +1,91 @@
+package coding.week03;
+
+import java.io.FileNotFoundException;
+import java.io.IOException;
+import java.io.RandomAccessFile;
+import java.util.concurrent.CountDownLatch;
+
+import coding.week03.download.api.Connection;
+import coding.week03.download.api.ConnectionException;
+import coding.week03.download.api.ConnectionManager;
+import coding.week03.download.api.DownloadListener;
+
+public class FileDownloader {
+	private int threadNumber = 3;
+	String url;
+	DownloadListener listener;
+	boolean finish = false;
+	ConnectionManager cm;
+
+	public FileDownloader(String _url) {
+		this.url = _url;
+	}
+
+	public void execute() {
+		// 在这里实现你的代码， 注意： 需要用多线程实现下载
+		// 这个类依赖于其他几个接口, 你需要写这几个接口的实现代码
+		// (1) ConnectionManager , 可以打开一个连接，通过Connection可以读取其中的一段（用startPos,
+		// endPos来指定）
+		// (2) DownloadListener, 由于是多线程下载， 调用这个类的客户端不知道什么时候结束，所以你需要实现当所有
+		// 线程都执行完以后， 调用listener的notifiedFinished方法， 这样客户端就能收到通知。
+		// 具体的实现思路：
+		// 1. 需要调用ConnectionManager的open方法打开连接，
+		// 然后通过Connection.getContentLength方法获得文件的长度
+		// 2. 至少启动3个线程下载， 注意每个线程需要先调用ConnectionManager的open方法
+		// 然后调用read方法， read方法中有读取文件的开始位置和结束位置的参数， 返回值是byte[]数组
+		// 3. 把byte数组写入到文件中
+		// 4. 所有的线程都下载完成以后， 需要调用listener的notifiedFinished方法
+
+		// 下面的代码是示例代码， 也就是说只有一个线程， 你需要改造成多线程的。
+		CountDownLatch threadSignal = new CountDownLatch(threadNumber);
+		Connection conn = null;
+		try {
+			conn = cm.open(this.url);
+
+			int length = conn.getContentLength();
+			RandomAccessFile file = new RandomAccessFile("test", "rw");
+			file.setLength(length);
+			int clength = length / threadNumber;
+			int off = 0;
+			for (int i = 0; i < threadNumber; i++) {
+				if (i != threadNumber - 1) {
+					new DownloadThread(threadSignal,cm.open(url), off, off + clength, file).start();
+				} else {
+					new DownloadThread(threadSignal,cm.open(url), off, length - 1, file).start();
+				}
+				off = off + clength + 1;
+			}
+			threadSignal.await();
+			Thread.sleep(5000);
+		} catch (ConnectionException e) {
+			e.printStackTrace();
+		} catch (FileNotFoundException e) {
+			// TODO Auto-generated catch block
+			e.printStackTrace();
+		} catch (IOException e) {
+			// TODO Auto-generated catch block
+			e.printStackTrace();
+		} catch (InterruptedException e) {
+			// TODO Auto-generated catch block
+			e.printStackTrace();
+		} finally {
+			if (conn != null) {
+				conn.close();
+			}
+		}
+
+	}
+
+	public void setListener(DownloadListener listener) {
+		this.listener = listener;
+	}
+
+	public void setConnectionManager(ConnectionManager ucm) {
+		this.cm = ucm;
+	}
+
+	public DownloadListener getListener() {
+		return this.listener;
+	}
+
+}
diff --git a/group09/610673813/src/coding/week03/download/api/Connection.java b/group09/610673813/src/coding/week03/download/api/Connection.java
new file mode 100644
index 0000000000..fdcc615e63
--- /dev/null
+++ b/group09/610673813/src/coding/week03/download/api/Connection.java
@@ -0,0 +1,28 @@
+package coding.week03.download.api;
+
+import java.io.IOException;
+
+public interface Connection {
+	/**
+	 * 给定开始和结束位置， 读取数据， 返回值是字节数组
+	 * 
+	 * @param startPos
+	 *            开始位置， 从0开始
+	 * @param endPos
+	 *            结束位置
+	 * @return
+	 */
+	public byte[] read(int startPos, int endPos) throws IOException;
+
+	/**
+	 * 得到数据内容的长度
+	 * 
+	 * @return
+	 */
+	public int getContentLength();
+
+	/**
+	 * 关闭连接
+	 */
+	public void close();
+}
diff --git a/group09/610673813/src/coding/week03/download/api/ConnectionException.java b/group09/610673813/src/coding/week03/download/api/ConnectionException.java
new file mode 100644
index 0000000000..64bc95fabb
--- /dev/null
+++ b/group09/610673813/src/coding/week03/download/api/ConnectionException.java
@@ -0,0 +1,5 @@
+package coding.week03.download.api;
+
+public class ConnectionException extends Exception {
+
+}
diff --git a/group09/610673813/src/coding/week03/download/api/ConnectionManager.java b/group09/610673813/src/coding/week03/download/api/ConnectionManager.java
new file mode 100644
index 0000000000..f49c5641f0
--- /dev/null
+++ b/group09/610673813/src/coding/week03/download/api/ConnectionManager.java
@@ -0,0 +1,10 @@
+package coding.week03.download.api;
+
+public interface ConnectionManager {
+	/**
+	 * 给定一个url , 打开一个连接
+	 * @param url
+	 * @return
+	 */
+	public Connection open(String url) throws ConnectionException;	
+}
diff --git a/group09/610673813/src/coding/week03/download/api/DownloadListener.java b/group09/610673813/src/coding/week03/download/api/DownloadListener.java
new file mode 100644
index 0000000000..585e5239c0
--- /dev/null
+++ b/group09/610673813/src/coding/week03/download/api/DownloadListener.java
@@ -0,0 +1,5 @@
+package coding.week03.download.api;
+
+public interface DownloadListener {
+	public void notifyFinished();
+}
diff --git a/group09/610673813/src/coding/week03/download/impl/ConnectionImpl.java b/group09/610673813/src/coding/week03/download/impl/ConnectionImpl.java
new file mode 100644
index 0000000000..5dd0808b49
--- /dev/null
+++ b/group09/610673813/src/coding/week03/download/impl/ConnectionImpl.java
@@ -0,0 +1,49 @@
+package coding.week03.download.impl;
+
+import java.io.ByteArrayOutputStream;
+import java.io.IOException;
+import java.io.InputStream;
+import java.net.HttpURLConnection;
+
+import coding.week03.download.api.Connection;
+
+
+public class ConnectionImpl implements Connection {
+	private static final int BUFFER_SIZE = 1024;
+	private HttpURLConnection connection;
+	private ByteArrayOutputStream outputStream;
+	private InputStream inputstream;
+
+	public ConnectionImpl(HttpURLConnection connection) {
+		this.connection=connection;
+	}
+
+	@Override
+	public byte[] read(int startPos, int endPos) throws IOException {
+		connection.setRequestProperty("Range", "bytes=" + startPos + "-" + endPos);
+		inputstream = connection.getInputStream();
+		outputStream = new ByteArrayOutputStream();
+		byte[] buffer = new byte[BUFFER_SIZE];
+		int length = 0;
+		while (inputstream.read(buffer) != -1) {
+			outputStream.write(buffer, 0, length);
+		}
+		return outputStream.toByteArray();
+	}
+
+	@Override
+	public int getContentLength() {
+		return connection.getContentLength();
+	}
+
+	@Override
+	public void close() {
+		try {
+			inputstream.close();
+		} catch (IOException e) {
+			// TODO Auto-generated catch block
+			e.printStackTrace();
+		}
+	}
+
+}
diff --git a/group09/610673813/src/coding/week03/download/impl/ConnectionManagerImpl.java b/group09/610673813/src/coding/week03/download/impl/ConnectionManagerImpl.java
new file mode 100644
index 0000000000..2effb422c4
--- /dev/null
+++ b/group09/610673813/src/coding/week03/download/impl/ConnectionManagerImpl.java
@@ -0,0 +1,31 @@
+package coding.week03.download.impl;
+
+import java.io.IOException;
+import java.net.HttpURLConnection;
+import java.net.MalformedURLException;
+import java.net.URL;
+
+import coding.week03.download.api.Connection;
+import coding.week03.download.api.ConnectionException;
+import coding.week03.download.api.ConnectionManager;
+
+
+public class ConnectionManagerImpl implements ConnectionManager {
+	Connection conn;
+
+	@Override
+	public Connection open(String url) throws ConnectionException {
+		try {
+			URL urlObj = new URL(url);
+			HttpURLConnection httpURLConnection = (HttpURLConnection) urlObj.openConnection();
+			conn = new ConnectionImpl(httpURLConnection);
+		} catch (MalformedURLException e) {
+			// TODO Auto-generated catch block
+			e.printStackTrace();
+		} catch (IOException e) {
+			// TODO Auto-generated catch block
+			e.printStackTrace();
+		}
+		return conn;
+	}
+}