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]

0 Answers   Infosys,

---

How will you find a duplicate number in a array without negating the nos ?

0 Answers  

---

main() { static char *s[]={"black","white","yellow","voilet"}; char **ptr[]={s+3,s+2,s+1,s}, ***p; p=ptr; **++p; printf("%s",*--*++p+3); }

1 Answers  

---

write a program that will read the temperature in Celsius and convert that into Fahrenheit.

1 Answers  

---

What are the 5 elements of structure?

0 Answers  

---

---

what is mallloc()?how it works?

4 Answers   Excel,

---

why array index always starts from zero??

4 Answers   TCS,

---

What are data types in c language?

0 Answers  

---

Define and explain about ! Operator?

0 Answers  

---

what is ur strangth & weekness

0 Answers   Cognizant, LG Soft, NetEnrich,

---

You have an array of n integers, randomly ordered with value 1 to n-1.The array is such that there is only one and one value occurred twice. How will you find this number?

1 Answers  

---

How main function is called in c?

0 Answers  

---