Search:

Type: Posts; User: iamnew

Page 1 of 3 1 2 3

Search: Search took 0.01 seconds.

  1. Replies
    8
    Views
    5,002

    i think the edges in the graph can change but the...

    i think the edges in the graph can change but the total edge cost cannot change. Any don't agree?
  2. Replies
    8
    Views
    5,002

    I don't get your point? I think it will not...

    I don't get your point?

    I think it will not give different MST's when the starting vertex is changed

    Please help.
  3. Replies
    8
    Views
    5,002

    can Prim’s yieeld different MST’s dependiing on...

    can Prim’s yieeld different MST’s dependiing on which verteex was set as the startting point?
  4. Replies
    2
    Views
    2,805

    Okay if all the edges are unique then will the...

    Okay if all the edges are unique then will the minimum spanning tree obtained be be the same as the shortest path tree?

    I think it's the same

    Am i correct?
  5. Replies
    2
    Views
    2,805

    Minimum Spanning Tree Shortest path

    Can someone please give me an example where the minimum spanning tree obtained is not the shortest path distance between two vertices.

    Please help.
  6. Replies
    8
    Views
    5,002

    are you sure that the algorithm runs for graph's...

    are you sure that the algorithm runs for graph's containing negative edge's?
  7. Replies
    8
    Views
    5,002

    Prim's Kruskal Algorithm

    What property of the graph will result in prim's and kruskal's algorithm giving different minimum spanning tree's?

    Please help.
  8. Thread: socket

    by iamnew
    Replies
    1
    Views
    1,092

    socket

    I have seen the server code bind to a socket. Why doesn't the client have to bind to a socket?
  9. Replies
    1
    Views
    1,001

    Minimum Spanning Tree

    Is the proof of runtime similar to Dijkstra's proof?

    Please help.
  10. Replies
    3
    Views
    2,367

    anyone else knows the answer? Please help. I am a...

    anyone else knows the answer? Please help. I am a noob in this field.
  11. Replies
    3
    Views
    2,367

    breath first search shortest path

    Why is the breath first search algorithm is considered to be the most efficient shortest path algorithm for unweighted graphs?

    Please help.
  12. Replies
    1
    Views
    1,945

    Prim's algorithm

    Prim(G, w, s)
    //Input: undirected connected weighted graph G = (V,E) in adj list representation,
    source vertex s in V
    //Output: p[1..|V|], representing the set of edges composing an MST of G
    01...
  13. Replies
    3
    Views
    1,656

    Minimum Spanning Tree

    Which algorithm is best suited to find the minimum spanning tree

    Kruskal algorithm or prim's algorithm?

    Which has the lowest time complexity?

    Please help.
  14. Thread: recursion tree

    by iamnew
    Replies
    0
    Views
    1,284

    recursion tree

    T(n) = T(n/4) + T(n/2) + n2

    The root of the tree that we get from the above recurrence relation is n2

    Why is that?

    Please help.
  15. Replies
    5
    Views
    1,523

    is there a good tutorial (Or a book that explains...

    is there a good tutorial (Or a book that explains all of the above ) that shows me what happens to the memory layout when you make a pipe between processes and when you redirect input using dup...
  16. Replies
    5
    Views
    1,523

    after the fork code if process B has code which...

    after the fork code if process B has code which is different from that of A

    then will process B have it's own code and data segment

    and files_struct for process B
  17. Replies
    5
    Views
    1,523

    memory layout problem

    now imagine i have a program running

    let the name of this process be process A

    the following will be found in this process memory region

    Process A's data and code

    files_struct for process...
  18. Thread: execve

    by iamnew
    Replies
    4
    Views
    1,013

    what's the use of passing an environment array?

    what's the use of passing an environment array?
  19. Thread: execve

    by iamnew
    Replies
    4
    Views
    1,013

    execve

    int execve(const char *pathname, char *const argv[], char *const envp []);

    i know what to pass for the first two parameters, but for envp i don't know what to pass.

    Please help me.
  20. Thread: Grammer rules

    by iamnew
    Replies
    8
    Views
    1,992

    say if you have a code like this int a=4;...

    say if you have a code like this



    int a=4;
    if(a){
    }
    else{
    }
  21. Thread: Grammer rules

    by iamnew
    Replies
    8
    Views
    1,992

    Can't you use a parse tree to validate syntax?

    Can't you use a parse tree to validate syntax?
  22. Thread: Grammer rules

    by iamnew
    Replies
    8
    Views
    1,992

    now the above rules can be defined using backus...

    now the above rules can be defined using backus naur form. So how do i store these rules in a program so that these rules can be used later to check for syntax validity?
  23. Thread: Parse Tree

    by iamnew
    Replies
    3
    Views
    5,193

    i cannot understand can someone please explain a...

    i cannot understand can someone please explain a bit more. How do you create parse tree's for while statements?
  24. Thread: Parse Tree

    by iamnew
    Replies
    3
    Views
    5,193

    Parse Tree

    int a=33;
    int b=111;
    double c=123.23;

    while(a>0){
    a--;
    }
  25. Thread: Grammer rules

    by iamnew
    Replies
    8
    Views
    1,992

    Grammer rules

    in a programing language how do you represent grammer rules?

    For example

    say we have a hypothetical programming language called ABED

    ABED can have only one type of loop. And it's a while...
Results 1 to 25 of 51
Page 1 of 3 1 2 3