https://rohan-mantena.github.io/notes/docs/cs61b/Recent content in CS 61B on berkeley.notesHugo -- gohugo.ioen-ushttps://rohan-mantena.github.io/notes/cs61b/complexity/Mon, 01 Jan 0001 00:00:00 +0000https://rohan-mantena.github.io/notes/cs61b/complexity/https://joshhug.gitbooks.io/hug61b/content/chap8/chap82.html Considerations # in regards to an engineer, there are some crucial things to consider -> operational cost, the development costs, the maintenacne costs, and costs of failure is the program fast enough (purpose + input data factor in) the space - memory, disk space - dephends on input data as well and, scale (as input gets big) execution cost, that is, the cost of execution in terms of time and space/memory, is referred to as time complexity and space complexityhttps://rohan-mantena.github.io/notes/cs61b/packages/Mon, 01 Jan 0001 00:00:00 +0000https://rohan-mantena.github.io/notes/cs61b/packages/Non netsted classes or interfacnes may be public or package private Classes without a modifier are package private (only accesible within the same package) Members of a class (attriubes/fields/instance variables, methods, constructors, nested types) can be any of the four access levels Access is based on static not dynamic types -> class not object Only override a method with one that is at least as permissivehttps://rohan-mantena.github.io/notes/cs61b/collections/Mon, 01 Jan 0001 00:00:00 +0000https://rohan-mantena.github.io/notes/cs61b/collections/not needed?https://rohan-mantena.github.io/notes/cs61b/integer/Mon, 01 Jan 0001 00:00:00 +0000https://rohan-mantena.github.io/notes/cs61b/integer/Integers Types and Literals # the range of values for signed types -2^N .. 2^N - 1 (there is 1 less value for posivite values to account for 0) the range of values for unsigned types 0 .. 2^N - 1 (N is the number of bits) how do we handle ‘overflow’, numbers that are so large they are outside the range, java employs modular arithmetic (‘wrapping around’)https://rohan-mantena.github.io/notes/cs61b/project2/Mon, 01 Jan 0001 00:00:00 +0000https://rohan-mantena.github.io/notes/cs61b/project2/Ataax is a 2 person game with red and blue pieces played on a 7x7 board How the Game is Played # Intially, there are pieces in all four corners and the red player goes first red in top left / bottom right (a7/g1) blue in top right / bottom left (a1/g7) Play continues until there are no moves left or there has been 25 consecutive jumps between both players winner is player with the most pieces at the end of the game if you have no pieces, you lose to tie; players must have same # of pieces neither player can make a move OR the max number of jumps (25 consecutive between players) has been reached two kinds of moves Extending: place a new piece of your color next to an existing piece (horizontally, vertically, diagonally adjacent) Jumping: move a piece of your color to a square that is no more than 2 rows and 2 columns away all opposing pieces that are touching (previously empty) square are replaced by your color a player can only pass if you cannot move at the beginning of the game, you can set blocks, pre-filled squares that may never be moved or or moved to they are symmetrical about the center reflected along x and y axis config ‘file’ may list a square on the right side of the board but another block must be placed symmetrically on the left side as well Commands # there are commands that player inputs into the textual interface (GUI for EC) do EC Starting and Ending Games # new : Abandons the current game (if one is in progress), clears the board to its initial configuration, and starts a new game.https://rohan-mantena.github.io/notes/cs61b/sequences/Mon, 01 Jan 0001 00:00:00 +0000https://rohan-mantena.github.io/notes/cs61b/sequences/Topics include; views, maps, sentienls, stacks, adapters, and more. Views # views (concept) are an alternative presentation of (interface to) an existing object : view implements inteface of object a not concrete analogy for a view is a pointer into object Map Views? # Partial Implementations # the idea of taking advantage of the fact that operations are releated for designers, this can be used by implementing existing concrete types or interfaces.https://rohan-mantena.github.io/notes/cs61b/sorting/Mon, 01 Jan 0001 00:00:00 +0000https://rohan-mantena.github.io/notes/cs61b/sorting/why sorting? supports searching (binary, equal items, same val for property, what are my nearest neighbor, etc) – see convex hull (cs 170) formal definition: a soring algorithm (or sort) permutes (re-arranges) a sequece of elements to bring them into order, according to some total order. - a total order is : Total: All items can be compared with one another Reflexive: An item can be compared to itself Antisymmetric: x <= y AND y <= x IFF y == x Transitive: If x <= y and y <= z, then x must be <= z - a sort that does not change the relative order of equivalent entries (compared to input) is called stable (consider sorting dictionary defs for same word, ignoring defition - unstable)