Scribd Logo
Hochladen

Willkommen bei Scribd!

  • 6.851 Advanced Data Structures (Spring'12) Prof. Erik Demaine Problem 9 Due: Thursday, Apr. 26

    Hochgeladen von

    djoseph_1
    9 Ansichten2 Seiten
    This document provides instructions for Problem 9 of the 6.851 Advanced Data Structures course at MIT for Spring 2012. Students are asked to develop an algorithm to count the number of substrings of length k or greater from string S1 that occur in string S2, and to analyze the runtime of the algorithm which should be O(|S1| + |S2| + sort(Σ)) time, where Σ is the alphabet. The instructions remind students to keep their solutions to one page and to read the assignment instructions on the class website.

    Originalbeschreibung:

    from MIT OCW

    Originaltitel

    MIT6_851S12_ps9

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Verfügbare Formate

    PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document provides instructions for Problem 9 of the 6.851 Advanced Data Structures course at MIT for Spring 2012. Students are asked to develop an algorithm to count the number of substrings of length k or greater from string S1 that occur in string S2, and to analyze the runtime of the algorithm which should be O(|S1| + |S2| + sort(Σ)) time, where Σ is the alphabet. The instructions remind students to keep their solutions to one page and to read the assignment instructions on the class website.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    9 Ansichten2 Seiten

    6.851 Advanced Data Structures (Spring'12) Prof. Erik Demaine Problem 9 Due: Thursday, Apr. 26

    Hochgeladen von

    djoseph_1
    This document provides instructions for Problem 9 of the 6.851 Advanced Data Structures course at MIT for Spring 2012. Students are asked to develop an algorithm to count the number of substrings of length k or greater from string S1 that occur in string S2, and to analyze the runtime of the algorithm which should be O(|S1| + |S2| + sort(Σ)) time, where Σ is the alphabet. The instructions remind students to keep their solutions to one page and to read the assignment instructions on the class website.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 2

    6.851 Advanced Data Structures (Spring12) Prof. Erik Demaine Problem 9 Due: Thursday, Apr.

    26

    Be sure to read the instructions on the assignments section of the class web page. Remember to keep your solutions to one page! Substring matching. Given two strings S1 and S2 , and a positive integer k , nd the number of substrings of S1 of length at least k that occur in S2 . Develop and analyze an algorithm to solve this problem in O(|S1 | + |S2 | + sort()) time.

    MIT OpenCourseWare http://ocw.mit.edu

    6.851 Advanced Data Structures


    Spring 2012

    For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

    Das könnte Ihnen auch gefallen