ĐĎॹá>ţ˙ lnţ˙˙˙k˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙ěĽÁ7 đżF2bjbjUU &h7|7|..˙˙˙˙˙˙lžžžžžžž˛†(†(†(8ž(Ň(´˛G2’)’)¨)¨)¨)ƒ*ƒ*ƒ*şFźFźFźFźFźFźFIH iJŽźFžƒ*ƒ*ƒ*ƒ*ƒ*źF—3žž¨)¨)ŰŃF—3—3—3ƒ*Šž¨)ž¨)şF—3ƒ*şF—3—38ŽŇChžžE¨)†)  2Őf7n²Ô%†( 2Š:DEŹçF0GJDÄ÷J—3÷JE—3˛˛žžžžŮ Points off 1 2 3 4 Admin Total off Net Score  CS 307 – Midterm 1 – Fall 2002 Your Name____________________________________ Last 4 digits of SSN / Student ID ______________ Section Leaders Name ___________________________ Instructions: There are 4 questions on this test. You will have 3 hours to complete the test. You may not use a calculator. When code is required, write Java code. Please make your answers legible. The style guide is not in effect, except as noted. Unless noted on the question, you may not use any of the classes or methods from the Java standard library. You may use native arrays 1. (2 points each, 30 points total) Java Mechanics. For all parts, what is the output of the code fragment? Write your answer on the line provided. Consider each piece of code in isolation. If the code would cause an error, answer "syntax error" or "runtime error" depending on what type of error it would be. A. int xa = 12; int ya = 5; double aa = xa / ya + 1.5; System.out.println( aa ); ____________________________________________ B. int xb = 37; int yb = 5; int zb = xb % yb + xb / yb; System.out.println( zb ); _________________________________________________ For parts C – J consider the following class: public class Ellipse { private int iMyX; private int iMyY; private int iMyXDistance; private int iMyYDistance; public Ellipse(int x, int y, int xDistance, int yDistance) { iMyX = x; iMyY = y; iMyXDistance = xDistance; iMyYDistance = yDistance; } public void setX(int x) { iMyX = x; } public void setY(int y) { iMyY = y; } public int getX() { return iMyX; } public int getY() { return iMyY; } public String toString() { return iMyX + " " + iMyY + " " + iMyXDistance + " " + iMyYDistance; } } C. public class EllipseUser { public void tree(Ellipse e1, Ellipse e2) { int tempX = e1.getX(); int tempY = e1.getY(); e1.setX( e2.getX() ); e1.setY( e2.getY() ); e2.setX( tempX ); e2.setY( tempY ); } public void cardinal() { Ellipse ep1 = new Ellipse(2, 4, 6, 8); Ellipse ep2 = new Ellipse(5, 10, 15, 20); ep1.setX(12); tree(ep1, ep2); System.out.println( ep1.toString() ); System.out.println( ep2.toString() ); } } What is the output when method cardinal in class EllipseUser is called? D. public class EllipseUser2 { public void wave(Ellipse e1) { e1.setY( 50 ); e1 = new Ellipse(100, 200, 250, 250); e1.setX( 12 ); } public void pack() { Ellipse ep1 = new Ellipse(10, 20, 30, 35); ep1.setY(40); System.out.println( ep1.toString() ); } } What is the output when method pack in class EllipseUser2 is called? ___________________________________________________________ E. public class EllipseUser3 { public void crimson( Ellipse e1 ) { e1.setX( e1.getY() ); e1.setY( e1.getX() ); } public void volunteers() { Ellipse ep1 = new Ellipse(3, 6, 9, 12); crimson( ep1 ); ep1.iMyXDistance = 50; System.out.println( ep1.toString() ); } } What is the output when method volunteers in class EllipseUser3 is called? F. public class EllipseUser4 { private Ellipse myEllipse; private static final int SCALE_FACTOR = 5; public EllipseUser4(int x, int y) { myEllipse = new Ellipse(x, y, y * 2, x * 2); } public void scale() { myEllipse.setX( myEllipse.getX() * SCALE_FACTOR ); myEllipse.setY( myEllipse.getY() * SCALE_FACTOR ); } public String toString() { return myEllipse.toString() + " Scale Factor" + SCALE_FACTOR; } } public class SuperUser { public void compute() { EllipseUser4 eu1 = new EllipseUser4(2, 3); eu1.scale(); eu1.scale(); System.out.println( eu1.toString() ); } } What is the output when method compute in class SuperUser is called? G. Ellipse e1 = new Ellipse(10, 10, 20, 30); Ellipse e2 = new Ellipse(5, 10, 20, 30); e2.setX(10); System.out.println( e1 == e2 ); What is the output of the above code? H. Ellipse e1 = new Ellipse(5, 20, 30, 50); Ellipse e2 = new Ellipse(12, 8, 30, 50); e1.setX( e2.getX() ); e2.setY(112); e1.setY(110); System.out.println( e1.getX() == e2.getX() ); What is the output of the above code? I. public class EllipseUser5 { public int bananaSlugs(int x, int y) { int temp = x; x = x * 2; y = temp + 2; return x + y; } public void bruins() { Ellipse ep1 = new Ellipse(1, 2, 3, 4); Ellipse ep2 = new Ellipse(2, 1, 5, 6); int result = bananaSlugs(ep1.getY(), ep2.getY()); System.out.println( ep1.getY() + " " + ep2.getY() + " " + " " + result); } } What is the output when method bruins in class EllipseUser5 is called? J. int x = 3; int y = x + 2; Ellipse[] eList = new Ellipse[y]; System.out.println( eList[3].getY() ); What is the output of the above code? K. int limit = 3 * 5; int[] intList = new int[limit]; for(int i = 0; i < limit; i++) intList[i] = i – 2; limit += 2; for(int i = 0; i < limit; i++) System.out.print( intList[i] + " " ); What is the output of the above code? L. int[] intList2 = new int[5]; for(int i = 1; i <= intList2.length; i++) intList2[ intList.length – i ] = i * i; for(int i = 0; i < intList2.length; i++) System.out.print( intList2[i] + " " ); What is the output of the above code? M. int size = 10; int[][] mat = new int[size][size / 2]; System.out.println( mat[7].length ); What is the output of the above code? N. // pre: list != null public void wolfpack(int[] list) { int times = 0; for(int i = 0; i < list.length; i++) for(int j = 0; j < list.length; j++) for(int k = 0; k < list.length; k++) times++; System.out.println( times ); } What is the output of the above code when method wolfpack is called, assuming the precondition is met? (formula required) O. public void yellowJackets(int x) { int temp; for(int i = 0; i < x; i++) temp += i + 2; System.out.println( temp ); } What is the output of the above code assuming method yellowJackets is called with an argument of 5? ( yellowJackets(5); ) 2. Arrays: (25 points) Compression of data is done to save space and minimize transmission time. One simple method of compression is know as run length encoding. In this form of compression, instead of representing every bit of data, the number of repeated bits of the current data are sent. In this example you will be encoding a black and white bitmap with 1 representing black and 0 representing white. Here is an example of raw data: 000000000011111000000000000100000000000000100000000000000100000000000000100000000000011111 Employing run length encoding would yield the following encoded data. The first num in the pair is the data and the second is the number of times this data occurs in this run. (0, 10), (1, 5), (0,12), (1,1), (0,14), (1,1), (0,14), (1,1), (0,14), (1,1), (0,12), (1,5) In this question you will write a method that accepts an array of booleans and produces a run length encoded version of the data. You may use the following class for this question: public class EncodeData { // value = true if this encodes a 1, // value = false if this encodes a 0 // num = number of 1s or 0s in this run public EncodeData(boolean value, byte num) } recall that the byte data type represents signed integer values between –128 and 127. When coding your solution only use the values between 1 and 127. If you get a run of greater than 127 trues or falses you will have to break them up into multiple EncodeData objects. Complete the following method on the next page. You may write your code assuming the precondition is met. /* pre: data != null, an element equal to true represents a 1 and an element equal to false represents a 0. post: return an array of EncodeData objects. There are to be no null objects in the array. It encodes the data using run length encoding as described above. */ public EncodeData[] compress(boolean[] data) /* pre: data != null, an element equal to true represents a 1 and an element equal to false represents a 0. post: return an array of EncodeData objects. There are to be no null objects in the array. It encodes the data using run length encoding as described above. */ public EncodeData[] compress(boolean[] data) { 3. 2D Arrays (25 points) This question also involves run length encoding. In this question you will take an array of EncodeData objects and create a 2D array representing the data. The size of the desired matrix will be specified and the encoded data will be converted to a matrix of type byte. There is no guarantee that the size of the matrix is equal to the amount of data encoded. There may be left over data or extra space in the resulting matrix. For example given an encoded set of data: (false, 6), (true, 1), (false, 1), (true,1), (false, 8), (true,1), (false,8), (true,3) and rows specified to equal 7 and columns specified to equal 5 the following is the result: 00000010100000000100000000111000000 Note, extra spaces are filled in with 0s., You will may use the following methods from the EncodeData class: public class EncodeData { // if encoded data is a 1, returns true // if encoded data is a 0, returns false public boolean getValue() // return number of 1s or 0s in this run public byte getNum() } Complete the following method: /* pre: code != null, numRows > 0, numCols > 0 post: return a 2D matrix of bytes with rows = numRows and numCols columns per row. Use the first numRows * numCols bits represented by code. All elements of result are 1 or 0. if numRows * numCols > the number of bits represented in code the extra spots in result = 0 */ public byte[][] decompress(EncodeData[] code, int numRows, int numCols) /* pre: code != null, numRows > 0, numCols > 0 post: return a 2D matrix of bytes with rows = numRows and numCols columns per row. Use the first numRows * numCols bits represented by code. All elements of result are 1 or 0. if numRows * numCols > (the number of bits represented in code) the extra spots in result = 0 */ public byte[][] decompress(EncodeData[] code, int numRows, int numCols) { 4. Classes and Objects(20 points) Write a class to represent a packet of information that is sent across networks. Packets have the following characteristics. (Simplified for this question.) The IP address of the sender the IP address of the destination. IP addresses are 12 digits numbers so use a long or String to represent them. A packet ID number from 0 to 2,000,000,000. And finally the data itself. This is an array of bytes and in this question every packet has a fixed length of 1000 bytes. If there is not enough data to fill the 1000 bytes then it is padded with a series of alternating bytes equal to –1 and 0. Write a class to represent a network packet. Each packet object should be able to store the data listed above. Provide the following functionality for your class. Create a constructor with parameters for the IP addresses of the sender and receiver, the packet ID, and an array of type byte. You choose the data types for the IP addresses and packet ID. The data will be in an array of bytes, byte[], whose length will be <= 1000. All elements of this array contain valid data. (No padding.) Write an accessor for the IPAddress of the receiver. Write an accessor that allows a class user to specify an element in the data array and returns that element. Override the equals method from the Object class. Two packets are equal if the IP addresses of the receiver and sender match and the packet IDs match. Have the class implement the Comparable interface and override the compareTo method. Packets are ordered based on their packet ID. You do not have to follow the naming conventions in the class coding standards, but other elements of style will be considered on this question. CS 307 – Midterm 1 – Fall 2002  PAGE 9 u|ósvĘűý, ; A é    % ; :Y]gtżĂÓňü#&gˆ™ŁŻłś8_dhBFI¸×Ýçô˙k“•™V~€…HprxŐý˙ď (lntî#0Tfloý(„5‘H   ýööööööööööööööööööööööööööööööööööööööööööňöööö6] OJQJ^JCJ `uvwxyz{|ý÷÷÷÷÷÷÷$If2E2ţţ|}ž1231///Ě$$IfT–lÖ֞”˙ôT´  tt````` `Ö0˙˙˙˙˙˙ö6Ö˙˙˙˙˙˙˙Ö˙˙˙˙˙˙˙Ö˙˙˙˙˙˙˙Ö˙˙˙˙˙˙˙4Ö laö2Af’ąÚý0śˇîďó  ()CDErswx…‘’Žýřřřřřřřýýýýňňňňňňňňňňňňňňňň ĆŕŔ! & FŽŻÉĘü+ , A U h i „ Ÿ   Ü é ő  - 0 1 J Y Z s ‚ ƒ – ¨ Š ůůůůůůůůůůůůůůůůůůůůůůůůůůůůů ĆŕŔ!Š ź Î Ď é # 5 8 : ; @ A … Ÿ ¸ Î ä ö  " K v … – ůůůůůůůůůůůůůůëëáá×××××××  ĆŕŔ!„Đ`„Đ  ĆŕŔ!„ ^„  ĆŕŔ!„Đ„Đ^„Đ`„Đ ĆŕŔ!– ˝ ä ć č é 1 2 3 4 5 6 7 ; t … Ź ź ž ż Ň ˙ 579:őőőďďďďďďŕďďďďőőőőőőőőőőďď ĆŕŔ!&d PĆ˙  ĆŕŔ!  ĆŕŔ!„Đ`„Đ:‚ž256{ŚÎŃÓ !"#]‰ŠŹÝŢůůůůůůůůůůůůůůůůůęęůůůŕŕŕŕ  ĆŕŔ!„Đ`„Đ ĆŕŔ!&d PĆ˙  ĆŕŔ!Ţň'Z]^xť˝żŔď,;cfiŽŻą˛śˇáőőçááááőááááááááááááŇááá ĆŕŔ!&d PĆ˙  ĆŕŔ! ĆŕŔ!„Đ„Đ^„Đ`„Đ  ĆŕŔ!„Đ`„Đá 78^_abcdgh‘şĐŢěABDEFGKLůůůůůůůęůůůůůůůůůůůůůůęůůůů ĆŕŔ!&d PĆ˙  ĆŕŔ!Lf¨śÄÇČ1eŸłś¸˙!CjkůëÝÝÝůůůůůůůůůůůÎůůůůůůů ĆŕŔ!&d PĆ˙  ĆŕŔ!„Đ„Đ^„Đ`„Đ ĆŕŔ!„Đ„0ý^„Đ`„0ý ĆŕŔ!k‘’“”•˜™ŹĚÍě.UV|}~€„…ůęęůůůůůůůůůůůůůůůůŰŰůůůů ĆŕŔ!&d PĆ˙  ĆŕŔ!&d PĆ˙  ĆŕŔ!…˘ĚőöGHnopqwx‡ŽŻÔŐűüýţ˙Lůůůůůůůůęęůůůůůůůůůęęůůůůůů ĆŕŔ!&d PĆ˙  ĆŕŔ!Lr™ÁÎěîďijklmnstĄ˝Îëíîhijklmůůůůůůůůůęęůůůůůůůůůůůęęęęů ĆŕŔ!&d PĆ˙  ĆŕŔ!m'(ƒ„45‘GH`ˆŽ×    !!!€!!Ç!ůůůůůůůůůůůůůůůůďůůůůůůůůů  ĆŕŔ!„Đ`„Đ ĆŕŔ! ! !!ý#ě%C&Ł&­&Ž&¸&š&Ă&Ä&Î&Ď&Ů&Ú&ä&ĺ&ď&a'/(N(g+ˆ+‰+Ś+Ź+ű.˙.f/l/8292?2@2A2B2F2ůůůůůůůůůůůůůőůůîëîăî0JmHnHu0J j0JU6] OJQJ^J'Ç!î!ď!Œ""ź"#*#+#Č#Ë#ř#ú#ű#ü#ě%í%E&F&˘&Ł&Ľ&§&Š&Ť&­&őőëĺĺĺőőëĺĺĺĺĺĺĺĺĺĺĺÚÚÚÚÚ  ĆŕŔ!$If ĆŕŔ!  ĆŕŔ!„ł^„ł  ĆŕŔ!„ł`„ł­&Ž&°&˛&´&ś&¸&š&ť&˝&[,PPPPP[,PP  ĆŕŔ!$If¤$$If–lÖÖr”˙ýfĎ8ĄÖ0˙˙˙˙˙˙ö6Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙4Ö laö ˝&ż&Á&Ă&Ä&Ć&Č&Ę&Ě&Î&ôôôP,ôôôôô¤$$If–lÖÖr”˙ýfĎ8ĄÖ0˙˙˙˙˙˙ö6Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙4Ö laö  ĆŕŔ!$If Î&Ď&Ń&Ó&Ő&×&Ů&Ú&Ü&Ţ&[,PPPPP[,PP  ĆŕŔ!$If¤$$If–lÖÖr”˙ýfĎ8ĄÖ0˙˙˙˙˙˙ö6Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙4Ö laö Ţ&ŕ&â&ä&ĺ&ç&é&ë&í&ď&ôôôP,ôôôôô¤$$If–lÖÖr”˙ýfĎ8ĄÖ0˙˙˙˙˙˙ö6Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙4Ö laö  ĆŕŔ!$If ď&đ&ń&''_'`'y'Ł'Í'[UUUUUUUU ĆŕŔ!¤$$If–lÖÖr”˙ýfĎ8ĄÖ0˙˙˙˙˙˙ö6Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙Ö˙˙˙˙˙4Ö laö Í'ç'č'(*(,(.(/(N(O(~(.)/)‹)Ž)Ę)×)Ř)*¸*š*++V+c+e+f+őďďďďďďďďďĺĺĺďďőőďĺĺĺďďőďď  ĆŕŔ!„ł^„ł ĆŕŔ!  ĆŕŔ!„Đ`„Đf+(,F,š,ć,Ü-Ý-€..É/ţ/k01…1†12C2D2E2F2ůďďďďůůůĺĺĺĺĺůůăááů  & F ĆŕŔ!  & F ĆŕŔ! ĆŕŔ!$1h°Đ/ °ŕ=!°đ"°đ#đ$%°° i8@ń˙8 NormalCJ_HaJmH sH tH <A@ň˙Ą< Default Paragraph Font,@ň, Header  ĆŕŔ!, @, Footer  ĆŕŔ!&)@˘& Page Number(>@"( Title$a$CJ$HC2H Body Text Indent „Đ^„Đ OJQJ^J"W@˘A" Strong5\,BR, Body Text5\.U@˘a. Hyperlink >*B*ph˙>V@˘q> FollowedHyperlink >*B* ph€€:b@˘: HTML CodeCJOJPJQJ^JaJF.h˙˙˙˙uvwxyz{|}ž12Af’ąÚý0śˇîďó  ()CDErswx…‘’ŽŻÉĘü+,AUhi„Ÿ Üéő-01JYZs‚ƒ–¨ŠźÎĎé#58:;@A…Ÿ¸Îäö  "Kv…–˝äćčé1 2 3 4 5 6 7 ; t … Ź ź ž ż Ň ˙  5 7 9 :   ‚ ž   2 5 6 {  Ś Î Ń Ó  ! " # ] ‰ Š Ź Ý Ţ ň ' Z ] ^ x ť ˝ ż Ŕ ď ,;cfiŽŻą˛śˇá 78^_abcdgh‘şĐŢěABDEFGKLf¨śÄÇČ1eŸłś¸˙!Cjk‘’“”•˜™ŹĚÍě.UV|}~€„…˘ĚőöGHnopqwx‡ŽŻÔŐűüýţ˙Lr™ÁÎěîďijklmnstĄ˝Îëíîhijklm'(ƒ„45‘GH`ˆŽ×€ÇîďŒź*+ČËřúűüě!í!E"F"˘"Ł"Ľ"§"Š"Ť"­"Ž"°"˛"´"ś"¸"š"ť"˝"ż"Á"Ă"Ä"Ć"Č"Ę"Ě"Î"Ď"Ń"Ó"Ő"×"Ů"Ú"Ü"Ţ"ŕ"â"ä"ĺ"ç"é"ë"í"ď"đ"ń"##_#`#y#Ł#Í#ç#č#$*$,$.$/$N$O$~$.%/%‹%Ž%Ę%×%Ř%&¸&š&''V'c'e'f'((F(š(ć(Ü)Ý)€**É+ţ+k,-…-†-.C.G.˜0€€Š0€€Š0€€Š0€€Š0€€Š0€€Š0€€Š0€€™0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜ 0€€˜ 0€€˜ 0€€˜ 0€€˜ 0€€˜ 0€€˜ 0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜0€€˜0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€Š0€€Š0€€Š0€€Š0€€Š0€€™0€€Š0€€Š0€€Š0€€Š0€€Š0€€™0€€Š0€€Š0€€Š0€€Š0€€Š0€€™0€€Š0€€Š0€€Š0€€Š0€€Š0€€™0€€Š0€€Š0€€Š0€€Š0€€Š0€€™0€€Š0€€Š0€€Š0€€Š0€€Š0€€™0€€Š0€€Š0€€Š0€€Š0€€Š0€€™0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜@0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜@0€€˜@0€€˜0€€˜@0€€˜@0€€˜0€€˜0€€˜0€€˜0€€˜ 0€€˜ 0€€˜ 0€€˜ 0€€˜0€€˜0€€˜0€€˜ 0€€˜ 0€€˜ 0€€˜ 0€€˜ 0€€˜0€€˜0€€š@0€€ 0---0 F2+|2ŽŠ – :ŢáLk…LmÇ!­&˝&Î&Ţ&ď&Í'f+F2 !"#$%&'()*,-./0123E2!(*0!T˙•€đ8đ@ń˙˙˙€€€÷đ’đđ0đ( đ đđB đS đżË˙ ?đœŸ÷ů );=?|~‰‹–˜› ˘Ľ§ŞŹŻÁĂĹOSbfv‚‘ÂËŃÚßăëď÷"+>BMQgkvz“ ¤ľšĆĘŢćó÷ &2NYŒ‘ĽŞíň˙—ŠžĐ %  ! ¨ ş R [ Ž ˇ ô    ' 5 7 E m u ‚ ” Í Ö =O™˘)ěţs~@Kgy+0CUW\`d˛šŐÖÜÝçčíôőöúű)*/?AHIJŞŤą˛ÇČ×ĺčéîďňóţ˙ 0;<ŻÁ&.UV\]`kmn|}ƒ„‡’”•¤ĽŤŹŻşź˝Ďá (€ŞŤą˛¸šÇČĎá#0TaU_ŢčĂČĚŇ – DNŇÜr | M#W#n#x#Ü#ä# $&$e$l$r$y$Ź$ł$¸$ż$ß$ć$é$đ$2%9%<%C%Š%ł%Ŕ%Ç%Î%Ő%ď%ö%ü%&6&=&B&I&i&p&s&z&ź&Ă&Ć&Í&5'?'L'S'Z'a'ă+ě+E-N-.D.G.žŁ˙šľ  y€^e  Í Î Ô Ő Ö × `dëíhięěhjźÄČ3]^•î˝÷Â!#/$N$O$O$ž%...-.6.8.B.G.˙˙ Mike Scott C:\307\Fall02\midterm1Fall02.doc Mike ScottRC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of midterm1Fall02.asd Mike Scott C:\307\Fall02\midterm1Fall02.doc Mike ScottRC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of midterm1Fall02.asd Mike Scott C:\307\Fall02\midterm1Fall02.doc Mike Scott C:\307\Fall02\midterm1Fall02.doc Mike ScottRC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of midterm1Fall02.asd Mike Scott C:\307\Fall02\midterm1Fall02.doc Mike ScottRC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of midterm1Fall02.asd Mike Scott C:\307\Fall02\midterm1Fall02.doc÷&zŠű˙˙˙˙˙˙˙˙˙đy˛[¤2fo˙˙˙˙˙˙˙˙˙0•g.gňŐ˙˙˙˙˙˙˙˙˙Ÿ(ŤwŢqšB˙˙˙˙˙˙˙˙˙~Öë|˙˙˙˙˙˙˙˙˙„Đ„˜ţĆĐ^„Đ`„˜ţCJOJQJo(ˇđ€„ „˜ţĆ ^„ `„˜ţCJOJQJo(o€„p„˜ţĆp^„p`„˜ţCJOJQJo(§đ€„@ „˜ţĆ@ ^„@ `„˜ţCJOJQJo(§đ€„„˜ţĆ^„`„˜ţCJOJQJo(§đ€„ŕ„˜ţĆŕ^„ŕ`„˜ţCJOJQJo(§đ€„°„˜ţĆ°^„°`„˜ţCJOJQJo(§đ€„€„˜ţĆ€^„€`„˜ţCJOJQJo(§đ€„P„˜ţĆP^„P`„˜ţCJOJQJo(§đh„Đ„˜ţĆĐ^„Đ`„˜ţ.h„ „˜ţĆ ^„ `„˜ţ.’h„p„L˙Ćp^„p`„L˙.h„@ „˜ţĆ@ ^„@ `„˜ţ.h„„˜ţĆ^„`„˜ţ.’h„ŕ„L˙Ćŕ^„ŕ`„L˙.h„°„˜ţĆ°^„°`„˜ţ.h„€„˜ţĆ€^„€`„˜ţ.’h„P„L˙ĆP^„P`„L˙.h„Đ„˜ţĆĐ^„Đ`„˜ţ.h„ „˜ţĆ ^„ `„˜ţ.’h„p„L˙Ćp^„p`„L˙.h„@ „˜ţĆ@ ^„@ `„˜ţ.h„„˜ţĆ^„`„˜ţ.’h„ŕ„L˙Ćŕ^„ŕ`„L˙.h„°„˜ţĆ°^„°`„˜ţ.h„€„˜ţĆ€^„€`„˜ţ.’h„P„L˙ĆP^„P`„L˙.h„Đ„˜ţĆĐ^„Đ`„˜ţ.h„ „˜ţĆ ^„ `„˜ţ.’h„p„L˙Ćp^„p`„L˙.h„@ „˜ţĆ@ ^„@ `„˜ţ.h„„˜ţĆ^„`„˜ţ.’h„ŕ„L˙Ćŕ^„ŕ`„L˙.h„°„˜ţĆ°^„°`„˜ţ.h„€„˜ţĆ€^„€`„˜ţ.’h„P„L˙ĆP^„P`„L˙.h„8„˜ţĆ8^„8`„˜ţ.h„„˜ţĆ^„`„˜ţ.’h„Ř „L˙ĆŘ ^„Ř `„L˙.h„¨ „˜ţƨ ^„¨ `„˜ţ.h„x„˜ţĆx^„x`„˜ţ.’h„H„L˙ĆH^„H`„L˙.h„„˜ţĆ^„`„˜ţ.h„č„˜ţĆč^„č`„˜ţ.’h„¸„L˙Ƹ^„¸`„L˙.~÷&đy˛[Ÿ(Ťw0•g˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˛¸XňŘtś+Îuž"–Ž¸Ý$â:ŻÜŚ°)&źѢšĆut'Žž                                    uvwxyz{|}Ł"Ľ"§"Š"Ť"­"Ž"°"˛"´"ś"¸"š"ť"˝"ż"Á"Ă"Ä"Ć"Č"Ę"Ě"Î"Ď"Ń"Ó"Ő"×"Ů"Ú"Ü"Ţ"ŕ"â"ä"ĺ"ç"é"ë"í"ď"đ"G.–žžžžžž–˙@F.P@˙˙Unknown˙˙˙˙˙˙˙˙˙˙˙˙G‡:˙Times New Roman5€Symbol3& ‡:˙Arial?5 ‡:˙Courier New;€Wingdings"qˆđĐähXói&š;j&…;j&%÷Ş&Q‘#đđ𴴁0dŤ. 2ƒQđ˙˙CS 307  Midterm 1  Fall 2001 Mike Scott Mike Scottţ˙ ŕ…ŸňůOhŤ‘+'łŮ0 ˜ ČÔčô (4 P \ h t€ˆ˜äCS 307 – Midterm 1 – Fall 2001iS 3 Mike Scottdikeike Normal.dotd Mike Scottd37eMicrosoft Word 9.0–@ŠŽDF@Öo4nÂ@`ދŽhÂ@” ^7nÂŞ&ţ˙ ŐÍ՜.“—+,ůŽ0  hp€ˆ˜  ¨°¸ Ŕ ëäU of T QŤ.  CS 307 – Midterm 1 – Fall 2001 Title  !"#$%&'()*+,-./01234ţ˙˙˙6789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZţ˙˙˙\]^_`abţ˙˙˙defghijţ˙˙˙ý˙˙˙mţ˙˙˙ţ˙˙˙ţ˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙Root Entry˙˙˙˙˙˙˙˙ ŔF€űĺf7nÂo€1Table˙˙˙˙˙˙˙˙˙˙˙˙5÷JWordDocument˙˙˙˙˙˙˙˙&hSummaryInformation(˙˙˙˙[DocumentSummaryInformation8˙˙˙˙˙˙˙˙˙˙˙˙cCompObj˙˙˙˙jObjectPool˙˙˙˙˙˙˙˙˙˙˙˙€űĺf7n€űĺf7nÂ˙˙˙˙˙˙˙˙˙˙˙˙ţ˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙ţ˙ ˙˙˙˙ ŔFMicrosoft Word Document MSWordDocWord.Document.8ô9˛q