EBK DATA STRUCTURES AND ALGORITHMS IN C
4th Edition
ISBN: 9781285415017
Author: DROZDEK
Publisher: YUZU
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
C programming
Implement an encoder. When completed, your program should be able to accept a short sentence from the user and display an encrypted version of it. For simplicity, let us assume one case of letters throughout, say CAPITALS. We can use a substitution method to scramble a sentence and then use the reverse of this process to recover it. If we take two rows of the alphabet and shift the bottom row along a specified amount (our key), we can then read the letters in our sentence from the top row and use the substituted letter from the bottom row to form the encrypted sentence.
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
X Y Z A B C D E F G H I J K L M N O P Q R S T U V W
In the example above, the key is 3, hence the second row is shifted by three characters along. Take, for instance, the sentence “HELLO”. Each letter of your message should be replaced by the letter in the alphabet that comes three letters before. For “HELLO” that would be: EBIIL
Your program is required…
Implement the first round of AES ( Advanced Encryption Standard ) in python.
Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.
Implement a SMS spam detection program in python using the Naive Baiyes algorithm. The program should be coded completely from scratch that is without the help of any libraries or imported libraries or packages. Note that you should use a dataset in this task and we shall be able to test it by entering a message too.
Chapter 11 Solutions
EBK DATA STRUCTURES AND ALGORITHMS IN C
Knowledge Booster
Similar questions
- Substitution ciphers are encryption/decryption algorithms that replace one letter or number with another. The first attested use of a substitution cipher in military affairs was by Julius Caesar, described by him in Gallic Wars (cf. Kahn pp83-84). In caesar cipher , you replace each letter by 3rd letter on. If it is out of bound (later than Z), then round to the head (letter A) and continue the shift. For example:meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB Please write a program in Java to implement the Caesar Cipher: a. Implement the encryption algorithm. Ask the user to input one all lower case normal sentence (called plaintext) using the nextLine method, and then output the encrypted text (called ciphertext). b. Implement the decryption algorithm. Ask the user to input one encrypted sentence (i.e. ciphertext) using the nextLine method, and then output the decrypted text (i.e. plaintext).arrow_forwardvvvHarry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according to different angle x. You can assume that coordinates of the centre of the clock are (0, 0) and the length of the minute hand is l. One endpoint of the minute hand is always located at the clock centre; the other endpoint is initially located at the point (0, l). One second later, Harry observes that this endpoint is at distance d above the x-axis, i.e., the y-coordinate of this endpoint is equal to d. Harry is curious about where the minute hand will be (specifically, its y-coordinate) after t seconds. Because t can be very large, Harry can't wait for that moment. Please help him to write a python code that prints a single line containing the output.Input: 4 2 2Output4Harry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according…arrow_forwardThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process is repeated. This is continued as long as necessary to obtain a single digit. For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process must be repeated. Adding the 1 and the 2 yields 3, a single digit and also the digital root of 39. Input File: The input file will contain a list of positive integers, one per line. The end of the input will be indicated by an integer value of zero. Output File: For each integer in the input, output its digital root on a separate line of the output. Example Input: 24 39…arrow_forward
- A random walk is a random path most often represented as a random number that changes over time. In particular, one common random walk is that in which the starting state is 0 and in each iteration we either add 1 or subtract 1 from the current value with equal probability. That is, in the first step, the next value would be 1 with probability 0.5 and -1 with probability 0.5. Use R to generate a random walk with 100 values starting at value 0 and store the values in a vector called random_walk. This vector should have length 100.arrow_forwardYou are given the task of analyzing how joyful a person is. If you are given a list of numbers that represent the emotional value of an individual on each day, design a divide and conquer algorithm to find the most joyous interval of the person. The measure of joy is given as sum of the values in interval multiplied by the smallest integer in the interval.arrow_forwardExample 2 Enter message to be encrypted: Dèyè mòn, gen mòn. Enter step size: -1 ORIGINAL MESSAGE Dèyè mòn, gen mòn. ENCRYPTED MESSAGE Cçxç lim, fdm lim. Enter message to be encrypted: Dèyè mòn, gen mòn. Enter step size: 0 ORIGINAL MESSAGE Dèyè mòn, gen mòn. ENCRYPTED MESSAGE Dèyè mòn, gen mòn. Enter message to be encrypted: QUIT Example 3 Enter message to be encrypted: Perfer et obdura, dolor hic tib: proderit olim. Enter step size: 8 ORIGINAL MESSAGE Perfer et obdura, dolor hic tibi proderit olim. ENCRYPTED MESSAGE Xmznmz m| wjl)zi, lwtwz pąk |qją xzwlmzą| wtqu. Enter message to be encrypted: QUITarrow_forward
- What is Benford’s Law? Benford’s Law involves looking at the first digit of a series of numbers. For example, suppose that you were to use a random number generator to generate integers in the range of 100 to 999 and you looked at how often the number begins with 1, how often it begins with 2, and so on. Any decent random number generator would spread the answers out evenly among the 9 regions, so we’d expect to see each digit about one-ninth of the time (11.1%). But with a lot of real-world data, we see a very different distribution. The expected distribution under Benford’s Law is shown below:1: 30.1%, 2: 17.6%, 3: 12.5%, 4: 9.7%, 5: 7.9%, 6: 6.7%, 7: 5.8%, 8: 5.1%, 9: 4.6% You should use this distribution in your program. You are being provided with a text file giving population data for 247 countries and territories. Your program should read in the data in this file and extract the information needed to keep count of how often each first digit is found. It may be useful to know…arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Computer science. You need to change this grouping so all components in it are equivalent (I. e. it contains a few events of a similar component). To accomplish this, you pick some integer x that happens to some extent once in a, and afterward play out the accompanying activity quite a few times (perhaps zero): pick some portion [l,r] of the arrangement and eliminate it. Yet, there is one special case: you are not permitted to pick a fragment that contains x. All the more officially, you pick some adjoining aftereffect [al,al+1,… ,ar] to such an extent that ai≠x if l≤i≤r, and eliminate it. After expulsion, the numbering of components to one side of the eliminated portion changes: the component that was the (r+1)- th is presently l-th, the component that was (r+2)- th is currently (l+1)- th, etc (I. e. the leftover arrangement simply falls). Note that you can not change x after you picked it. For instance, assume n=6,…arrow_forwardConsider a base 26 number system wherein the letters of the alphabet are the digits. That is, A=0, B=1, C=2, … Z=25 in base 10. Use the MAL as a number in the base 26 system, and KHA as another number in the base 26 system.Add these numbers together to obtain the sum in based 26. Example 1 — if your first name is “Peter” and your surname is “Pan”, then add up PET26 and PAN26, and show the sum in base 26.Example 2 — if your first name is “Peter” and your surname is “Pa”, then add up PET26 and PAA26, and show the sum in base 26.arrow_forward
- 3. Write a program that calculates the position, adds a noise, and estimates the speed using the Kalman algorithm. Test the algorithm on the follow- ing equation: S x₁(n) = n² x₂ (n) = sin(27 fon) with fo = 0.005. The observation noise is such that o² = 0.5. Try different values of the modeling noise's variance of. Compare the result with the theoretical speed given by: { v₁ (n) = 2n v2 (n) = 2π fo cos(2π fon)arrow_forwardHi! This is not a graded question I just need it for my reviewer. Thanks! 2.Recall that a public-key cryptosystem consists of three functions: A key generator G, an encryption function E, and a decryption function D. Any user, say Alice (A), can use the key generator to generate a key pair (PKA, SKA), in which PKA is Alice’s public key, and SKA is her secret key; she can then publish her name and public key in a directory. Subsequently, anyone who wants to send a private message x to Alice can look up PKA in the directory, compute a ciphertext y ←− E(x, PKA), and send y to Alice over an open line. Only Alice can compute x ←− D(y, SKA), because only she knows the decryption key SKA that corresponds to encryption key PKA. Note that there is no need for a key-distribution center, as there is when one is using a symmetric-key cryptosystem, but there is a need for public-key directories. a) What is a public-key certificate? What is the problem with public-key directories that certificates…arrow_forwardThe Virtual Weight (VW) of an integer number (which consists of more than 1 digit) is the sumof the individual digits that are composing the number. For example, consider the followingtwo numbers; 5638 and 1145, then the VW of each is calculated as following:VW(5638) = 5+6+3+8 = 22VW(1145) = 1+1+4+5 = 11Then, the VW can be classified as L (mean Low) or H (means High) using a specific cut-offvalue. For example, if the cut-off value is 15, then the VW of the number 5638 is H (High),and the VW of the number 1145 is L because 22 > 15 and 11 ≤ 15 respectivelyWrite a C++ program that: reads a positive integer n (where 5≤n≤20) from the user. If the user enters invalidnumber, then the program should continue prompting until he/she enters a valid numberwithin the specified range. Then, the program should generate n random numbers using the built-in rand()function. Every time a random number is generated, the program will classify that number as Lor H using the above method. Use a…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education