Answer Posted / upendra singh and avinash cho

#include<stdio.h>
#include<string.h>
void main()
{
int arr[4]={1,10,5,4},c,i,k,j=1;
k=arr[0];
for( i=0;i<3;i++)
{ c=k-arr[i+1];
c=c>>15;
if(c)
k=arr[i+1];
}
printf("largest number %d",k);
getch();
}

Can you please explain the scope of static variables?

1072

---

Differentiate between Macro and ordinary definition.

1405

---

What does #pragma once mean?

1183

---

What is equivalent to ++i+++j?

1108

---

Write a program to swap two numbers without using third variable in c?

1145

---

What are the rules for the identifier?

1182

---

What is 1d array in c?

1109

---

What is string length in c?

1119

---

What are the __date__ and __time__ preprocessor commands?

1131

---

What is the basic structure of c?

1101

---

The performance of an operation in several steps with each step using the output of the preceding step a) recursion b) search c) call by value d) call by reference

1247

---

What is the use of typedef in structure in c?

987

---

What is floating point constants?

1153

---

What does 3 periods mean in texting?

1084

---

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]

2493

---