Recent Changes

Wednesday, November 4

Tuesday, June 2

  1. page 4.3.13 Algorithms using predefined sub-programmes, 1D arrays and collections edited Title Headline 1 bullet 1 Headline 2 bullet 2 PHP Examples: 1) Sub-programmes à Checking w…

    Title
    Headline 1
    bullet 1
    Headline 2
    bullet 2
    PHP Examples:
    1) Sub-programmes à Checking what food you have left
    2) 1D Array àChecking what food you have left
    $stock = array (“Pringles”, “Schokobons”, “Pizza”); //array containing food left
    echo $stock[]
    unset($stock[1]);
    3) Collections à

    Created By: Lucie Magister
    Last update: 02/06/2015
    Sources:
    (view changes)
    5:10 am
  2. page 4.3.12 Need for sub-programmes and collections edited Title Headline 1 bullet 1 Headline 2 bullet 2 Sub-programmes: “self-made” reuse of code =…

    Title
    Headline 1
    bullet 1
    Headline 2
    bullet 2
    Sub-programmes:
    “self-made”
    reuse of code = reduction
    sub-program once refined does not have bugs, thus reusing it is safe
    code easier to read/understand
    decreased length
    Collections
    reusable
    provided by third party
    quicker programming, as less code needs to be written
    Why needed?
    reduces length of program
    easier to read/understand as shorter
    more organized
    if a team, people can work on sub-program, while other work on main program
    easier to debug if divided into parts
    Link:
    Show an understanding of the usefulness of reusable code and program organisation for the individual programmer, team members and future maintenance.
    General principles of computational thinking, connecting computational thinking and program design.
    Technology: use of software such as Alice.

    Created By: Lucie Magister
    Last update: 02/06/2015
    Sources:
    "Collections (C# and Visual Basic)." Collections (C# and Visual Basic). N.p., n.d. Web. 02 June 2015. <https://msdn.microsoft.com/en-us/library/ybcx56wz.aspx#BKMK_SimpleCollection>.
    "4.3 Stacks and Queues." Princeton University. N.p., n.d. Web. 02 June 2015. <http://introcs.cs.princeton.edu/java/43stack/>.

    (view changes)
    5:06 am
  3. page 4.3.11 Algorithms using acces methods of a collection edited ... pop(); removes T4 peek() outputs item at top (T3) without removing {Screen Shot 2015-06-02 …
    ...
    pop(); removes T4
    peek() outputs item at top (T3) without removing
    {Screen Shot 2015-06-02 at 12.04.10.png}
    Screenshot from: https://msdn.microsoft.com/en-us/library/ybcx56wz.aspx#BKMK_SimpleCollection
    {Screen Shot 2015-06-02 at 12.04.00.png}
    Screenshot from: https://msdn.microsoft.com/en-us/library/ybcx56wz.aspx#BKMK_SimpleCollection

    Created By: Lucie Magister
    Last update: 02/06/2015
    (view changes)
    5:02 am
  4. page 4.3.11 Algorithms using acces methods of a collection edited Title Headline 1 bullet 1 Headline 2 bullet 2 Access methods of a collection assign key to…

    Title
    Headline 1
    bullet 1
    Headline 2
    bullet 2
    Access methods of a collection
    assign key to object, by which the object can be retrieved from collection when needed
    collection is a class à declare new collection first
    push
    pull
    for each iteration
    must important significant library
    Example: Stack
    Algorithm for machine handing out plates in the cafeteria.
    class Stack();
    push(T1);
    push(T2);
    push(T3);
    push(T4);
    pop(); removes T4
    peek() outputs item at top (T3) without removing

    Created By: Lucie Magister
    Last update: 02/06/2015
    Sources:
    "Topic 4." IB Computer Science Revision Notes. N.p., n.d. Web. 02 June 2015. <http://www.dokuwiki.matyas.bplaced.net/doku.php?id=topicfour>.
    Worth, John Ray. "4.3.12." John Ray Worth. N.p., n.d. Web. 2 June 2015. <http://johnrayworth.info/jsr/_IB_Common/_topic4AssessmentStatements/4.3.12.php>.
    "Collections (C# and Visual Basic)." Collections (C# and Visual Basic). N.p., n.d. Web. 02 June 2015. <https://msdn.microsoft.com/en-us/library/ybcx56wz.aspx#BKMK_SimpleCollection>.
    "4.3 Stacks and Queues." Princeton University. N.p., n.d. Web. 02 June 2015. <http://introcs.cs.princeton.edu/java/43stack/>.

    (view changes)
    4:59 am
  5. page 4.3.10 Characteristics and apllications of a collection edited Title Headline 1 bullet 1 Headline 2 bullet 2 Definition: Aka container Abstract data typ…

    Title
    Headline 1
    bullet 1
    Headline 2
    bullet 2
    Definition:
    Aka container
    Abstract data type
    Object grouping elements à unifies
    Logical manner
    Elements have similar purpose
    Elements have common significant for solving purpose
    Group size varies with run time
    Access to individual elements through search function
    Characteristics:
    Dynamic size
    Similar elements contained
    share purpose
    (Similar to arrays)
    Application:
    Store
    Retrieve
    Manipulate
    Examples:
    Folders à email, desktop folder, phonebook
    Library à books, DVDs à tracking objects

    Created By: Lucie Magister
    Last update: 02/06/2014
    Sources:
    "Topic 4." IB Computer Science Revision Notes. N.p., n.d. Web. 02 June 2015. <http://www.dokuwiki.matyas.bplaced.net/doku.php?id=topicfour>.
    Worth, John Ray. "4.3.12." John Ray Worth. N.p., n.d. Web. 2 June 2015. <http://johnrayworth.info/jsr/_IB_Common/_topic4AssessmentStatements/4.3.12.php>.

    (view changes)
    4:56 am

Tuesday, May 19

  1. page 4.3.2 Fundamental and compund operations of a computer edited ... Sources: "Topic 4." IB Computer Science Revision Notes. N.p., n.d. Web. 19 May 2015…
    ...
    Sources:
    "Topic 4." IB Computer Science Revision Notes. N.p., n.d. Web. 19 May 2015. <http://www.dokuwiki.matyas.bplaced.net/doku.php?id=topicfour>.
    Notes from class.
    (view changes)
    1:19 am
  2. page 4.3.2 Fundamental and compund operations of a computer edited Title Headline 1 bullet 1 Headline 2 bullet 2 Fundamental Operations Compound Operations …

    Title
    Headline 1
    bullet 1
    Headline 2
    bullet 2
    Fundamental Operations
    Compound Operations
    Definition:
    Basic operations to manipulate sets of values
    Definition:
    Combination of basic operations to manipulate sets of numbers
    A process must be undertaken to obtain a solution
    Examples:
    Addition
    Subtraction
    Multiplication
    Division
    Store a number in memory
    Compare two numbers
    Examples:
    Find modulus of an expression
    Compare several numbers

    Created By: Lucie Magister
    Last update: 19/05/2015
    Sources:
    "Topic 4." IB Computer Science Revision Notes. N.p., n.d. Web. 19 May 2015. <http://www.dokuwiki.matyas.bplaced.net/doku.php?id=topicfour>.
    (view changes)
    1:19 am

More