Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
On
by
Prof.G.I.Rathod
Dr.J.J.Magdum Trust’s,
Dr. J. J. Magdum College of Engineering, Jaysingpur
Department of Computer Science & Engineering
Certificate
This is to certify that the project work entitled
Prof.G.I.Rathod
Project Guide H.O.D. CSE Dept.
Acknowledgement
Our sincere thank to Prof. Ms. D.A. Nikam, H.O.D. Computer Science &
Engineeringfor her permission to work on this project and valuable guidance and
timely advices in the competition of this mini project.
We would like to express our sincere and heartful thanks to all the
facultymembers of the department for their continuous cooperation, which has
given us cogency to build-up adamant aspiration over the completion of our mini
project.
Finally, we thank one and all who directly and indirectly helped us to
complete this project successfully.
Declaration
We, the undersigned hereby declare that the mini project entitled “Secret
Chamber at Mount Rushmore” submitted by us to Department of Computer Science
& Engineering, Dr.J.J.Magdum College of Engineering, Jaysingpur, for the term work
submission of semester-II of Second Year in Computer Science and Engineering,
under the guidance of Prof.G.I.Rathod is our original work.
Date : /03/2018
Index
Sr.No. Name of Chapter Page No
1. Introduction 1
1.1 Problem statement
1.2 Problem Description
1.3 Requirement Specification
2. Design 7
2.1Data Flow Diagram (Level 0, level 1)
2.2Flowchart
2.3Activity Diagram
2.4Sequence Diagram
3. Technical Details 10
3.1 Hardware Requirements details
3.2 Software Requirements details
4. Implementation 11
4.1.1 Algorithms
4.1.2 Functions used & Header files included
5. Testing 14
5.1 Test Cases
6. Results 16
6.1 Input
6.2 Output
6.3 Snapshots
7. Conclusion 19
References 20
1. Introduction
Given the secret writing of documents, we need to decipher code to get the original
information contained in the Historical US Document found in Secret Chamber of Mount
Rushmore.
By now you have probably heard that there is a spectacular stone sculpture featuring
four famous U.S. presidents at Mount Rushmore. However, very few people know that
this monument contains a secret chamber. This sounds like something out of a plot of a
Hollywood movie, but the chamber really exists. It can be found behind the head of
Abraham Lincoln and was designed to serve as a Hall of Records to store important
historical U.S. documents and artefacts. Historians claim that the construction of the
hall was halted in 1939 and the uncompleted chamber was left untouched until the late
1990s, but this is not the whole truth. In 1982, the famous archaeologist S. Dakota Jones
secretly visited the monument and found that the chamber actually was completed, but
it was kept confidential. This seemed suspicious and after some poking around, she
found a hidden vault and some documents inside. Unfortunately, these documents did
not make any sense and were all gibberish. She suspected that they had been written in
a code, but she could not decipher them despite all her efforts. Earlier this week when
she was in the area to follow the ACM-ICPC World Finals, Dr. Jones finally discovered the
key to deciphering the documents, in Connolly Hall of SDSM&T. She found a document
that contains a list of translations of letters. Some letters may have more than one
translation, and others may have no translation. By repeatedly applying some of these
translations to individual letters in the gibberish documents, she might be able to
decipher them to yield historical U.S. documents such as the Declaration of
Independence and the Constitution. She needs your help. You are given the possible
translations of letters and a list of pairs of original and deciphered words. Your task is to
verify whether the words in each pair match. Two words match if they have the same
length and if each letter of the first word can be turned into the corresponding letter of
the second word by using the available translations zero or more times.
1.3Requirement Specification
1.3.1 Abstract
This system developed for decoding the information contained in the US document. This
document follows the IEEE standard for a requirement specification document, with some
variations.
1.3.2 Introduction
1.3.2.1 Purpose
The purpose of this document is to describe the external requirements to decrypt the
Information contained in documents found in Secret chamber of mount Rushmore. It also
describes the interface for the system
1.3.2.2 Scope
This document is the only one that describes the requirements of the system. It is meant
for use by the developers and will be the basis for validating the final delivered system. Any
changes made to the requirements in the future will have to go through a formal changes
approval process. The developer is responsible for asking for clarifications where necessary, and
will not make any alteration without the permission of the client.
The developer is responsibilities for (a) developing the system, (b) installing the software on the
client’s hardware.
In this software we are going to use three functions as 1) Find 2) can_map 3) Main
1. Find-To find out the shortest path in the Transitive closure to get the possible
translations of letter to letter.
2. Can_map-Function used to check the translation and return Boolean i.e.True or False.
3. Main-Taking the Sample Inputs from user and Display output functions
If the string length do not match or The translation from letter to letter is not possible for all
letters in the string, then we display “NO”
All the inputs given to the system are only characters and all lower cases
The input sample consists of two integers first which define the m & n which are no. of
translations and no of string word inputs respectively.
95
ct
i r
k p
o c
r o
t e
t f
u h
w p
Input 3- Pair of words, defining first string as original from document while later to be the
possible translated word.
we we
can the
Work people
it of
out the
Output 1:
For each pair of words, display yes if the two words match, and no otherwise
Find-This function finds the shortest path between two letters in Transitive
closure and finds if the end letter is reachable and hence checks the condition if
the translation is possible. While inputing the following condition should be
satisfied-
a) The possible translation of pair of letters should be given only once i.e
no duplicates
Can_map-This function only says if the translation is possible and should the
iterator be continued.
Main-Inputs and calls the functions accordingly and outputs as well.
User interface: only one user command is required. The system should prompt for the input file
names.
Software constraints
Hardware Constraints
Acceptance Criteria
The developer will have to show test cases that all conditions satisfied.
Design
2.2Flow chartFF
3. Technical Details
Processor-1GHz
Ram-512MB
Disk space-40GB
4. Implementation
4.1 Algorithm:
1. Take Inputs of integer as no. of Translations-‘m’ and No of string pair to check ‘n’.
2. Pass The Possible translations to create a Transitive Closure
3. Check If the End Node is Reachable from the start node.
4. If Its Reachable , Find The Shortest path of transition and return the value
5. Check the string Length of two input string of words
6. If the string length match Continue else go to Step 9
7. Perform Each corresponding letter to letter check in the string
8. If the corresponding match is not found go to step 9
9. Display ‘false’ as the Translation is not possible, if not then continue
10. If all Translation are done Display ‘True’
Table no. 1
5.Testing
Results
6.1. Input:
The first line of input contains two integers m (1 ≤ m ≤ 500) and n (1 ≤ n ≤ 50), where m is the
number of translations of letters and n is the number of word pairs. Each of the next m lines
contains two distinct space-separated letters a and b, indicating that the letter a can be
translated to the letter b. Each ordered pair of letters (a, b) appears at most once. Following
this are n lines, each containing a word pair to check. Translations and words use only
lowercase letters ‘a’–‘z’, and each word contains at least 1 and at most 50 letters.
6.2. Output:
For each pair of words, display yes if the two words match, and no otherwise
Input Output
9 5
c t
i r
k p
o c
r o
t e
t f
u h
w p
we we yes
can the no
Work people no
it of yes
3 3
a c
b b
a b
abc aaa No
6.3. Snapshots-
Fig 6.3.1
7. Conclusion
Our problem was to find out if the decryption is possible if the pair of words are given.
In order to find the solution we made use of header files like Unordered_set and
Unordered_map from STL (Standard template Libraries) which is Core to C++.By implementing
the code we got to know how can exploit the utilities of the predefined structures from various
libraries and make the work easier.
References
Books-
Websites/Web Links:
acm-icpc
https://icpc.baylor.edu/worldfinals/problems/icpc2016.pdf
www.geeksforgeeks.com
www.programiz.com
www.turorialspoint.com