In cryptography, you could often break the algorithm if you know what was the original (plain) text that was encoded into the current ciphertext. This is called the plain text attack. In this simple problem, we illustrate the plain text attack on a simple substitution cipher encryption, where you know each letter has been substituted with a different letter from the alphabet but you don’t know what that letter is. You are given the cipherText as the input string to the function getwordSets(). You know that a plain text "AMMUNITION" occurs somewhere in this cipher text. Now, you have to find out which sets of characters corresponds to the encrypted form of the "AMMUNITION". You can assume that the encryption follows simple substitution only. [Hint: You could use the pattern in the "AMMUNITION" like MM occurring twice together to identify this]

2433

Which function in C can be used to append a string to another string?

1184

What is string in c language?

1095

What is string constants?

1115

Define the scope of static variables.

1078

Can one function call another?

1061

How can I find out the size of a file, prior to reading it in?

1124

How do I get a null pointer in my programs?

1071

How do you determine a file’s attributes?

1032

Linked lists -- can you tell me how to check whether a linked list is circular?

1041

Given an array of 1s and 0s arrange the 1s together and 0s together in a single scan of the array. Optimize the boundary conditions?

1459

What are the various types of control structures in programming?

1024

What is scope and lifetime of a variable in c?

1008

Can a function argument have default value?

1108

What is a program flowchart?

1137