Scribd Logo
Upload

Welcome to Scribd!

  • Distributed and Parallel Algorithms (CS-18301) Assignment 1

    Uploaded by

    Geeta Meena
    10 views1 page
    This document contains two questions for an assignment on distributed and parallel algorithms. The first question asks to prove that in a hypercube, there are i! different paths of length i from node u to node v. The second question asks to design a parallel algorithm to find all possible ways to fill in a crossword puzzle using words from a dictionary for every horizontal and vertical space.

    Original Description:

    Original Title

    Untitled

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains two questions for an assignment on distributed and parallel algorithms. The first question asks to prove that in a hypercube, there are i! different paths of length i from node u to node v. The second question asks to design a parallel algorithm to find all possible ways to fill in a crossword puzzle using words from a dictionary for every horizontal and vertical space.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views1 page

    Distributed and Parallel Algorithms (CS-18301) Assignment 1

    Uploaded by

    Geeta Meena
    This document contains two questions for an assignment on distributed and parallel algorithms. The first question asks to prove that in a hypercube, there are i! different paths of length i from node u to node v. The second question asks to design a parallel algorithm to find all possible ways to fill in a crossword puzzle using words from a dictionary for every horizontal and vertical space.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Distributed and Parallel Algorithms (CS-18301)

    Assignment 1

    Q.1. Prove that if node u is distance i from node v in a hypercube, then there are
    i! different paths of length i from u to v (though some hypercube edges may
    appear in more than one path).

    Q2. Given a crossword puzzle and a dictionary, design a parallel algorithm to


    find all possible ways to fill in the crossword puzzle so that every horizontal and
    vertical word space contains a word from the dictionary.

    You might also like