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]
What is the Difference between Class and Struct?
Explain what is output redirection?
In a byte, what is the maximum decimal number that you can accommodate?
n=7623 { temp=n/10; result=temp*10+ result; n=n/10 }
How do c compilers work?
when to use : in c program?
difference between memcpy and strcpy
What is the right type to use for boolean values in c?
int j =15,i; for (i=1; 1<5; ++i) {printf ("%d%d ",j,i); j = j-3; }
a number whose only prime factors are 2,3,5, and 7 is call humble number,,write a program to find and display the nth element in this sequence.. sample input : 2,3,4,11,12,13, and 100.. sample output : the 2nd humble number is 2,the 3rd humble number is 3,the 4th humble number is ,the 11th humble number is 12, the 12th humble number is 14, the 13th humble number is 15, the 100th humble number is 450.
Define and explain about ! Operator?
What is pass by reference in functions?