assignments are plagiarism-free. To do this, you decide to design a simple plagiarism checker. Your checker will take 2 strings as input. Then it will compare the 2 strings and check how many words they have in common. Then, print the percentage in common, by calculating: (No. of words in common / (No of words in string 1 + No of words in string 2)) * 100. If the calculated plagiarism is greater than or equal to 30%, print "Plagiarism detected." Otherwise, print "Good job!". Note: you need to compare "words" not individual characters. You can consider that all characters in both inputs will be in only lowercase or uppercase. ======== ======= Sample Input 1: my dog's name is bob bob is my dog's name Sample Output 1: Common percentage: 50% Plagiarism detected. Explanation 1: Length of string1= 5, Length of string2= 5, number of common words= 5. %3D Hence, common percentage= (5/(5+5))*100 = 50 %3D Sample Input 2: my dog's name is bob my dog is a canine Sample Output 2: Common percentage: 20% Good Job! Explanation 2: Length of string1= 5, Length of string2= 5, number of common %3D words= 2. Hence, common percentage= (2/(5+5))*100 = 20
assignments are plagiarism-free. To do this, you decide to design a simple plagiarism checker. Your checker will take 2 strings as input. Then it will compare the 2 strings and check how many words they have in common. Then, print the percentage in common, by calculating: (No. of words in common / (No of words in string 1 + No of words in string 2)) * 100. If the calculated plagiarism is greater than or equal to 30%, print "Plagiarism detected." Otherwise, print "Good job!". Note: you need to compare "words" not individual characters. You can consider that all characters in both inputs will be in only lowercase or uppercase. ======== ======= Sample Input 1: my dog's name is bob bob is my dog's name Sample Output 1: Common percentage: 50% Plagiarism detected. Explanation 1: Length of string1= 5, Length of string2= 5, number of common words= 5. %3D Hence, common percentage= (5/(5+5))*100 = 50 %3D Sample Input 2: my dog's name is bob my dog is a canine Sample Output 2: Common percentage: 20% Good Job! Explanation 2: Length of string1= 5, Length of string2= 5, number of common %3D words= 2. Hence, common percentage= (2/(5+5))*100 = 20
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question

Transcribed Image Text:Question 1:
As you are a student of university now, you need to ensure your
assignments
are plagiarism-free. To do this, you decide to design a simple
plagiarism
checker. Your checker will take 2 strings as input. Then it will
compare
the 2 strings and check how many words they have in common. Then,
print the
percentage in common, by calculating:
(No. of words in common / (No of words in string 1+ No of words in
string
2)) * 100.
If the calculated plagiarism is greater than or equal to 30%, print
"Plagiarism detected." Otherwise, print "Good job!".
Note: you need to compare "words" not individual characters. You
can
consider that all characters in both inputs will be in only lowercase or
uppercase.
=========
========
Sample Input 1:
my dog's name is bob
bob is my dog's name
Sample Output 1:
Common percentage: 50%
Plagiarism detected.
Explanation 1:
Length of string1= 5, Length of string2= 5, number of common
words= 5.
Hence, common percentage= (5/(5+5))*100 = 50
%3D
Sample Input 2:
my dog's name is bob
my dog is a canine
Sample Output 2:
Common percentage: 20%
Good Job!
Explanation 2:
Length of string1= 5, Length of string2= 5, number of common
words= 2.
Hence, common percentage= (2/(5+5))*100 = 20
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education

Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY