A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

rvc

  • one year ago

Please help in need :') C program A king sends out two scrolls to the common public with the encryted message in it. the hidden message is the no of days the king is going to declare a war in. u have to interpret the encryption technique from the example4s given below and find the no of days. write a program which inputs the two messages and gives the no of days as output. For example. Scroll 1 : AMAZAPPLE Scroll 2 : APPLIECATION Hidden message : 5 Scroll 1 : APPLEPIE Scroll 2 :LEPIECT Hidden message : 5 It is the no of words common in a stretch

  • This Question is Closed
  1. rvc
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    @wio please help pleaseeeeeeeeeeeeeeeeeeeeeeeeeeeeeee

  2. ChantySquirrel1129**
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ..............yeah I'm retard...I can't help ya here :/ Sorry

  3. mathmate
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Is "APPLIECATION" meant to be APPLEICATION

  4. mathmate
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    No. of words common in a stretch means the longest common string. For example, "EXAMple" and " EXAMination" has a common string of length four. They don't have to start at the beginning. Or, "reSTRIct" and "STRIke" have again a common string of length four. These are easier to look for by inspection because of the short length. You need an algorithm to look for common strings of lengths in the hundreds, for example binary strings. @rvc Does that answer the question?

  5. rvc
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    No please help me with program

  6. mathmate
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Do you have an algorithm? If you have, please post the algorithm before working on the program.

  7. rvc
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    no

  8. mathmate
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Have you done trees?... and dynamic programming?

  9. rvc
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    yes please tell me the logic to compare the strings

  10. mathmate
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    First thing first, do you understand the problem?

  11. rvc
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    yes

  12. mathmate
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Good, if you have done trees and dynamic programming, you can start by taking a look at the algorithm suggest in the following link: https://en.wikipedia.org/wiki/Longest_common_substring_problem

  13. rvc
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    okay thank you so much

  14. mathmate
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    You're welcome! :)

  15. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.