Interested to Buy Any Domain ? << Click Here >> for more details...
Unsigned char c;
for ( c=0;c!=256;c++2)
printf("%d",c);
No. of times the loop is executed ?
- 8 Answers
- 20437 Views
- Mascot, TCS, I also Faced
- E-Mail Answers
Answer Posted / shalabh
This will be an infinite loop as the value of unsigned char
cannot exceed 255....c++2 can be errornous..but the value
of unsigned char cannot go beyond 255
| Is This Answer Correct ? | 5 Yes | 1 No |
Post New Answer View All Answers
the maximum length of a character constant can be a) 1 character b) 8 characters c) 256 chaacters d) 125 characters
Write a code on reverse string and its complexity.
How can I display a percentage-done indication that updates itself in place, or show one of those twirling baton progress indicators?
Explain null pointer.
Explain the properties of union.
What is the role of this pointer?
What is the difference between typedef struct and struct?
What does node * mean?
Can I use base-2 constants (something like 0b101010)? Is there a printf format for binary?
How do you determine a file’s attributes?
a=10;b= 5;c=3;d=3; if(a printf(%d %d %d %d a,b,c,d) else printf("%d %d %d %d a,b,c,d);
An integer that indentifies the position of a data item in a sequence of data items a) value b) number c) index d) all of the above
which is an algorithm for sorting in a growing Lexicographic order
What does c mean before a date?
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]
