CSC263H1 Lecture Notes - Lecture 13: Linked List, Upper And Lower Bounds

41 views1 pages

maroonhyena426

27 Oct 2015

School

Department

Course

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

De ne worst-case sequence complexity of sequence of m operations as the maximum runtime over all sequences of m operations. Wcsc m worst-case time of 1 operation. Worst case for one operation is (k) where k is the size of the list. Also max size after k ops k. worst-case runtime of op i c(i 1). m(cid:88) c(i 1) = o (cid:18) c(m)(m 1) (cid:19) . , ins(m) m(cid:88) i=1 d(i 1) = d(m 1)m. 0. 1 aggregate approach k bits in counter, increment. 2 ith every time every other time every other2 time every otheri time (cid:98)m/2i(cid:99) Total bits ipped k 1(cid:88) m (cid:98)m/2(cid:99) (cid:98)m/4(cid:99) Ammortized sc = 2m/m = 2. i=0 (cid:106) m. 2i (cid:107) (cid:98)log2 m(cid:99)(cid:88) i=0 (cid:106) m.

Related Questions

X. Write a da Subway system in which you define a new type Subway System A Subway Systemen of a private ArrayList lines. No methasoher than the constructed the addline method should modify this array list. Your class should have the following co-static methods (25 points) • Write a c tor Subway system that takes thing asing and initializes the private property lines to be an empty mysl • Write a method adine which takes as input a MetroLine newline and acknowline to the array lest lines. The mathed should retun void • Write a method got Distance Travelled which takes as in ArrayList path and returns a double representing the tual distance travelled or a paththalpos from the first Metrostation in the anaylist, to the Metrostation to the third til the cod of the array listHe cach Metrostation along the joy the calculate the distance between the Metrostation and the prices. If the ArrayList Metrostation path is less than 2 vales, y mesh shox return On You may the wale path issul For m e, if the ArrayList Metrostation path five Metrostation you code calculate the sum of the distance between the fin d ing the second third the third and fourth, and lastly the fourth and final stations. Hint: To calculate the distance between two points, you can use a method defined in the appendix in the Maputilities class . Write a method findNearest Station which takes as input a double x and a double y ad the Metrostation which is nearest to the x and y. To do this, it should leather all the Metrostations of all the Metrotines inside of this lines and find the Metro Station that is the smallest distance away. You can use the same appendix method as in the precis i on You may assume that there is a leadine MetroLine defined in the property lines. You may also assume that every MetroLine in lines has at least one Metrostation in Hint There is no method such as getAll Station defined a Metrotine ohjeet. This is since providing this method would rewal a lot about the implementation of the Metrolines and would differ depending on the kind of collectice you are using to store it. However, you can simulate this art of method by using the get PirstStop () and get Next Stop () methods to access every entry of the AmyList. Remember the condition that will cause getNext Stop (to be null • A method qet Neighboringstations which takes input a Metrostation station and re- turns an ArrayList The Arrayut Metrostation whild consist of all nephring stations to station possibly many if the station in ce may lines). P erample, if statice is the 3rd stop on the blue line, the 6th stop on the red line, and the stop on the green line, then the mothed should return an ArrayList

9. Write a method with the following header public static void replace (String oldFile, string newfile, char oldChar, char newChar) throws IOException This method opens the file whose name is given by the String parameter oldFile (the input file) for reading, and opens the file whose name is given by the string parameter newlile (the output file) for writing. It then reads every lime in the input file. For each line, it creates a new line identical to the original line, creept for the fact that all occurrences of char oldchar in the original String have been replaced by occurrences of char newchar in the new line. When the new line has been properly created, it write it to the output file. Once all the lines in the input file have been read and a corresponding line has been written to the output file, the method clases both files. Additional notes: • You MAY assume that none of the parameters this method accepts are null; in other words, your method does not have to handle the case where one or more of the parameters are null. You MAY assume that all the 10-related classes have already heen imported properly . Finally, because the replace() method is specified to throw an exception object of type TORxception, you MAY assume that I/O related problems will occur while reading from the input file or writing to the output file. In other words, your method DOES NOT have to check that no such problems occur, and DOES NOT have to manage Texceptions using try-catch blocks. WRITE YOUR replace() METHOD IN THE SPACE BELOW: YOUR replace() METHOD CONTINUED: USE THIS PAGE IF YOU NEED ADDITIONAL SPACE. CLEARLY INDICATE WHICH QUESTION(S) YOU ARE ANSWERING HERE. USE THIS PAGE IF YOU NEED MORE ADDITIONAL SPACE. CLEARLY INDICATE WHICH QUES- TION(S) YOU ARE ANSWERING HERE. • String (package java.lang) Methods: - public String chal wale Al t ri g od med in the chance au - public int length(): R e ach of the string - public char chattin R echar w heefd index public chart to Chachay: Consthis String to a new c r y - public boolean equals Object anbject): Ce this string to and yect - public boolean equalsigmoce Case String anotherstring]: Cam p ing sider this String to anotherString - public int compareToString anotherString: Compare this String to anotherstring graphically returns a negative ef this string before anotherstring, apithe value of this Stringatering distries publie iw paneelgoro (String another Camp i ng Garden ces, string to anoth i ng li hically returns te value of this thing care anotherstring, apie as if this string e r anotherstring, Strings - public int indexin ch Rather within this string of the och ch-lil does not - public int index fint.ch, int from index): Returns the index within this string of the first Roe of character ch, starting the search at position from Index retums - 1 il ch does not in this String - public int indexor (String ste): Returns the index within this string of the first currence of ringt-d eur - public int indexOf(stringate, int from index): Resures the index within the string of the fare currence of shariaparting police froiden liste des not count i ng - public String subat ring it begintndax) Rema new string which is a webstring of this string compend of the chesting at position begintndex (inclusive) - puble string subat ring intaginindex intendindex: Returns a new sering that waring of this string, composed of the characters starting at position beginIndex (inclusive, and ending at - public String replace(char oldChar, char newchar): Returns a new string resulting from replacing a Tences of olchar in this string with new Char. puble string tolon Case(): Returns a new string consisting of all the characters in this sting - publle ting toppe : Roum ingiting of all the c on in this thing uverted to perce - publie ting tet): Returns a copy of this line with leading and wailing whitespace • Scanner (package java.util) Methods: - publie danner File source) thrown jatorio Foundation sa Scanner the fun the specified file - public scanner InputStream source): Cits Scanner that process and from the input stream - puble Scannerstag source): Corsa ww Scanner that produces wales w ed from the specified String -puble vold close(): Cwes this Scanner -puble boolean asext(): Return this can het in its input puble boolean asext.Double(): Return to the taken in this season al ante pasadala w ith Doble() ed publie boolean hat Into: Reutte le inse gule ed wat w eet Int() had - public boolean hati : Return true if this w ee - puble boolean has longt) Return true if the r in this cannerm ane das along the next long) with puble ting at the t e rm from the canner puble double Smerthea ter puble intention there the l ot. puble w ith the need them - puble Intolog m u long • Printstream ( kape Java.io) Methods: a - Pri le rlle) throw alo.Pilo t Pelat ihan the p rile - Printing the throw r alo. Pet Stichw e d the wind - le void lose them - le void phone boolean ve - void prichar public void print chart 6): the way of char public void print double d o uble bed, public void print (int ) Fins int value - public void printet a n net public void printing : Strings - public void printin (1 Tm the line by writing the line para ring - public void printinhoolna ) Prints hoolean when thinorminates the public void printin (cthar c h ar wheelthening the line public void print in char i ta way of cars and then the line public void print in double d in double valued and the terminates the line public void printin(int 1) Pints int value and then into the line public void printin ( jat ova t terminates the line pulle void print intring): Tits Strings then to the line Note that the printwriter class defines the same methods and constructors (except for the fact that the structors are called Print.writer instead of PrintStream) • Math (package java.lang) Methods: - please le podle double bear the value of a t the of - puble balle blanche a Returns they u se of dele with pe r than realto - pietate double random Ruma doble 0.0 wi th .. puble stat la doble sin double a: Rethe puble statie doble con double a Return ther l e, where a ininin we angle, wherea in in e -puble statie doble tan double a) R he i ngold , whereas o m public statie double toeges double agrad): C a ngrad v ideo puble salle de anable and we a r e - - estatie delle au t olewa idle de ahholooble • Character (packape java.lang) Methods: - public static boolean ibigit charch: D i chtechisadil public static int digit(charch, int radix: Return the meal of cho ch in the di radix-lich des representa digit - public statie char forbigit chat digit, ut radix) Rems the character of digit in the disa - public statie boolean isletter charch): Demines if character chalet publle statie boolean islowerCase(char ch): Determines if character ch is a character - public static boolean ipparate(char eh): Determines ir ductes chinuppercase cura nd - publicatie boliwhip (arch Termine if character his white a intola - public static char tolowrane(char chevert hech to low - public static char tolpperCase(char ch): Covers Chococh topp • Array list (package java.util) Methods: - public ArrayList(): Create a new em ArrayList which contains clements of type - public int (1 : R m the number of clans in this list - public boolean isimpty(): Rens true if this in contains no elements - public boolean contains (object o): Return true if this lintutins el compr a re performed using the equals() method on - public int IndexOf(obj ): Returns the index of the first currence of elemento in this list, or lir this listes contain this element companies are performed wing the equals() method - publiek galimt in ): Returns the elementat position index in this list - publieket fint inde element): Replace the element at the position index in this list with the - puble honlanad a ): Appends the specifiedalent to the end of this list. - public void (int in aw e t the specified element the price index in this - publiek veint index): Remove the de s ition index in the list - publie hoolean remove(object a s the fir e of the president of this if it is p r epared wing the equals() methodno - public void clear(): Remes all of the elements from this • Vile (package java.io) Methods: - puble File(String pathname: Creates a File representing the file at the given pathane

CSC263H1 Lecture Notes - Lecture 13: Linked List, Upper And Lower Bounds

Document Summary

Get access

Related Documents

CSC263H1 Lecture 8: Lecture 8 - Hash Tables.docx

CSC263H1 Lecture Notes - Lecture 5: Universal Hashing, Linked List, Linear Probing

CSC263H1 Lecture 5: CSC263H1 LECTURE 5

Related Questions