Hey there! Sign in to join this conversationNew here? Join for free
    Offline

    4
    ReputationRep:
    (Original post by Dilzo999)
    I got 2.6989898 something not 2.01. THIS IS CONFUSING XD.
    No I mean in general , if you had 2.01 would you round to 3 or 2
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by otrivine)
    No I mean in general , if you had 2.01 would you round to 3 or 2
    It's always rounding up in D1
    Offline

    4
    ReputationRep:
    (Original post by Fortitude)
    It's always rounding up in D1
    thanks, so you round up in everything! right


    Define: Digraph

    then ask me
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by otrivine)
    thanks, so you round up in everything! right


    Define: Digraph

    then ask me
    Ok digraph = graph in which its edges have a direction associated with them (directed edges)

    For you, starting off nice ...Degree/Valency = ...
    Offline

    4
    ReputationRep:
    (Original post by Fortitude)
    Ok digraph = graph in which its edges have a direction associated with them (directed edges)

    For you, starting off nice ...Degree/Valency = ...


    yes exactly right


    degree/valency of a vertex is the number of arcs(edges)incident to it.
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by otrivine)
    yes exactly right


    degree/valency of a vertex is the number of arcs(edges)incident to it.
    That is correct
    Offline

    4
    ReputationRep:
    (Original post by Fortitude)
    That is correct



    Define:loop
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by otrivine)



    Define:loop
    We need to know that?! :confused:
    Offline

    4
    ReputationRep:
    (Original post by Fortitude)
    We need to know that?! :confused:

    Well I guess, cause it was in the definition?


    Loop is an edge where it starts and finishes at the same vertex/
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by otrivine)
    Well I guess, cause it was in the definition?


    Loop is an edge where it starts and finishes at the same vertex/
    So that was in the textbook? I just learnt the ones which were given in the spec
    Offline

    4
    ReputationRep:
    (Original post by Fortitude)
    So that was in the textbook? I just learnt the ones which were given in the spec
    OMG, you are right, I spent so much time as well learning these definitions not in our spec

    ok ill give you a different one.


    Define:tree
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by otrivine)
    OMG, you are right, I spent so much time as well learning these definitions not in our spec

    ok ill give you a different one.


    Define:tree
    Tree = connected graph with no cycles

    Define Matching
    Offline

    4
    ReputationRep:
    (Original post by Fortitude)
    Tree = connected graph with no cycles

    Define Matching
    Perfect!


    Matching is the 1-1 pairing of some or all of the vertices such that the elements of X joins to the elements of Y.
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by otrivine)
    Perfect!


    Matching is the 1-1 pairing of some or all of the vertices such that the elements of X joins to the elements of Y.
    Correct
    Offline

    4
    ReputationRep:
    (Original post by Fortitude)
    Correct
    Define:Minimum spanning tree


    Give 3 differences between Kruskals and prims alogrithm
    Offline

    14
    ReputationRep:
    (Original post by Fortitude)
    So that was in the textbook? I just learnt the ones which were given in the spec
    Your right ! What on earth am I doing
    Offline

    4
    ReputationRep:
    (Original post by posthumus)
    Your right ! What on earth am I doing
    Good Morning
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by otrivine)
    Define:Minimum spanning tree


    Give 3 differences between Kruskals and prims alogrithm
    MST = is a subgraph which includes all vertices & is also a tree in which the total length of all its edges is as small as possible.


    • Kruskal's starts from the smallest edge while in Prim's the starting vertex is given.
    • The spanning tree in Prim's 'grows' while in Kruskals it chaotic (there's probably a much better way of explaining this)
    • Can apply prim's from a matrix, you can't with kruskals


    And while we're on this topic, how do you answer questions which ask that: a route has to be included in the MST which algorithm would you use & how would you adapt it ??:confused:
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by posthumus)
    Your right ! What on earth am I doing
    I'm sure they will only ask the definitions that they've mentioned in the spec
    Offline

    4
    ReputationRep:
    (Original post by Fortitude)
    MST = is a subgraph which includes all vertices & is also a tree in which the total length of all its edges is as small as possible.


    • Kruskal's starts from the smallest edge while in Prim's the starting vertex is given.
    • The spanning tree in Prim's 'grows' while in Kruskals it chaotic (there's probably a much better way of explaining this)
    • Can apply prim's from a matrix, you can't with kruskals


    And while we're on this topic, how do you answer questions which ask that: a route has to be included in the MST which algorithm would you use & how would you adapt it ??:confused:

    all correct


    The answer is always Krusckals and you say you start with AB and DE (example). This is because with Krusckals alogrithm can be built with non connected sub trees while prims only the tree grows and has to be connected all the time
 
 
 
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • Poll
    Brussels sprouts
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

    Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

    Quick reply
    Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.