Answer / san

Infinite loop

Answer / lalitha

Evaluates the whole loop to be true infinite

Answer / balajisrikanth

for(;;) - is an infinite loop

Answer / piyush

for gating infinite time looping use for(;;),second approach
same as while(true).

Answer / arun n patil

for using first inisilization;second test counter;third
increment/decrement
int i;
syntax: for(i=0;i<=100;i++)

Write a program using one dimensional array that searches a number and display the number of times it occurs on the list of 12 input values. Sample input/output dialogue: Enter 12 values: 13 15 20 13 30 35 40 16 18 20 18 20 Enter number to search: 20 Occurences: 3

2 Answers  

what is the difference between int &r and int& r

3 Answers  

How to swap two ASCII numbers?

0 Answers  

can you please write a program for deadlock that can detect deadlock and to prevent deadlock.

0 Answers  

Write a C/C++ program that connects to a MySQL server and displays the global TIMEZONE.

0 Answers   Facebook, Webyog, Wipro,

output for printf("printf");

0 Answers  

write a program that reverses the input number of n.Formulate an equation to come up with the answer.

0 Answers   Satyam,

a program using one dimensional array that searches a number if it is found on the list of given input numbers given by the user and locate its exact location in the list.. ""EXAMPLE"" enter how many numbers to be inputted: 5 12 14 11 09 30 what number to search: 11 11 IS FOUND IN LOCATION 3 PLZZZ.. ELP ME...

3 Answers  

how to diplay a external image of output on winxp by using c & c++,

0 Answers  

Display Pattern: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 &#8230;

2 Answers   Mind Tree,

An array of size 5X5 is given to us. The elements from 1 to 25 are to be inserted in the array, such that starting from a particular position for an element i, the next element i+1can be inserted only at the mentioned positions (u,v), and if these all positions are occupied then it returns giving a count of how many positions have been occupied in the array: (u,v) = (x+/-3 , y) (u,v) = (x , y+/-3) (u,v) = (x+/-2 , y+/-2). Example: if the starting element is 1 with the given positions (1,2), then next element 2 can be placed at any one of the positions marked with *. _ _ _ _ _ 1 _ _ _ * _ _ _ _ _ _ _ * _ _ * _ _ _ _

0 Answers   Nagarro,

Given 1 to n random number, find top 10 maximum numbers and explain the time complexity of the algorithm.

1 Answers   IMO, NetApp,