• Placement Questions
• /
• Others
• /
• Programming
• /
• Program

Frequently Asked others Programming - Program Math Questions and Answer

(#M40034298) OTHERS QUESTION find output Keep an EYE

What is the output of the program

void main()
{
int i,j,k;
i=2;
j=4;
k=i++>j&2;
printf("%d\n",k);
if(++k && ++i<--j|| i++)
{
j=++k;
}
printf(" %d %d %d",i,-j--,k);
getch();
}
Option
A. 4,-3,2
B. 5,-3,2
C. 4,-2,2
D. 5,-2,2

Asked In Others priyanka aggarwal (11 years ago)

Unsolved Read Solution (5)

Is this Puzzle helpful?   (22)   (8) Submit Your Solution Program

(#M40034291) OTHERS QUESTION twin prime number Keep an EYE

4,6,12,18,30,42,60,72,102,108,...
Print next 3 number through c programming.

Asked In Others mithilesh kumar (11 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (18)   (4) Submit Your Solution Program

(#M40019806) OTHERS QUESTION Keep an EYE

Problem:
A sequence is said to be progressive if it doesn’t decrease at any point in time.
For example 1 1 2 2 is a progressive sequence but 1 2 1 is not a progressive sequence. Let S be the sequence and be represented by T spaced integers Ki, now your task is to find out the first longest progressive sequence present in the given sequence (S).

Input Format:
First line will contain T, the length of the sequence and next line will contain T spaced integers Ki (where i = 0,1, …,T).

Line 1 T,where T is the length of the sequence

Line 2 Ki,where Ki is integer in sequence separated by space

Constraints:
1

Asked In Others bala (12 years ago)

Unsolved

Is this Puzzle helpful?   (17)   (5) Submit Your Solution Program

(#M40034290) OTHERS QUESTION twin prime number Keep an EYE

Print the next 3 number of the given pattern series:
4,6,12,18,30,42,60,72,102,108,...

Asked In Others mithilesh kumar (11 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (2)   (1) Submit Your Solution Program

(#M40034065) OTHERS QUESTION programming Keep an EYE

Write a class that represents a minimal heap. The heap class should at a minimum support the following methods: - AllocTinyHeap() which should initialize the heap with a given amount of bytes - DeleteTinyHeap() which frees all memory associated with the heap - TinyAlloc() which allocates a given number of bytes on the heap if there is room - TinyFree() which frees a specific location on the heap You may define whatever parameters are necessary for the above methods as well as write any additional methods. Overall consideration will be given to correctness, design, code readability as well as any unit testing done. As part of a final solution please submit test cases you used to verify correctness in addition to any unit tests done.

Asked In Others srinivas (11 years ago)

Unsolved

Is this Puzzle helpful?   (1)   (0) Submit Your Solution Program