• Placement Questions
• /
• Programming

Placement Papers with Solutions

(#M40154187) TECTURA QUESTION c Keep an EYE

main()
{
int i=1,j=1,k=0,l=2,m;
m=i++&&j++&&k++||l++;
printf("%d%d%d%d%d",i,j,k,l,m);
}

Asked In tectura Deepak Singh (10 years ago)

Unsolved

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

(#M40154186) TECTURA QUESTION c Keep an EYE

main()
{
int c[]={2,8,3,4,4,6,7,5};
iny j,*p=c,*q=c;
for(j=0;j<5;j++)
{
printf("%d",*c);
++q;
}
for(j=0;j<5;j++)
{
printf("%d",*p);
++p;}

Asked In tectura Deepak Singh (10 years ago)

Unsolved

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

(#M40154185) TECTURA QUESTION c Keep an EYE

main()
{
float me =1.1;
double you =1.1;
if(me==you)
{
printf("i love Birds");
else
printf("i hate rats");
}

Asked In tectura Deepak Singh (10 years ago)

Unsolved

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

(#M40154184) TECTURA QUESTION Keep an EYE

#include



int main(){
int i;
int a=12;
int *ptr;

ptr=&a;
printf("address %dn",&a);
for(i=0;i<=3;i++)
printf("%dn ",*ptr++);
return 0;
}

Asked In tectura Deepak Singh (10 years ago)

Unsolved

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

(#M40154181) JAVA QUESTION Keep an EYE

You have a block of platinum that can be exchanged in your bank either for cash or for smaller blocks of platinum. If you exchange a block of m grams, you get three blocks of weight m/2, m/3 and m/4 grams each. You don't get any fractional part, as the division process rounds down the value. If you exchange the block of platinum for cash, you get m units of currency. You can do any number of exchanges for smaller blocks or currency.
Given the value of a block in grams as input, write a program that would print the largest possible currency value that you can receive as the output. Assume that the maximum value of a block that can be given as an input is 1,000,000,000 grams and the minimum value is 2 grams.

Asked In Java kumar anand (10 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (11)   (10) Submit Your Solution Arrays

(#M40154178) JOSH TECHNOLOGY QUESTION ans Keep an EYE

#include
struct node
{
int value ;
struct node *next;

};
/*void fun(int *p)
{
int q=10;
printf("function %dn",*p);
p=&q;
printf("function %dn",*p);
}*/
void rearrange(struct node *list)
{
struct node *p,*q;
int temp;
if((!list)||!list->next)
return;
p=list;
q=list->next;
while(q)
{
temp=p->value;
p->value=q->value;
q->value=temp;
p=q->next;
q=p?p->next:0;

}
}

Asked In josh technology Deepak Singh (10 years ago)

Unsolved Read Solution (4)

Is this Puzzle helpful?   (35)   (15) Submit Your Solution

(#M40154177) JOSH TECHNOLOGY QUESTION ans 20 Keep an EYE

#include
void fun(int *p)
{
int q=10;
p=&q;
}
int main(void) {
int r=20;
int *p=&r;
fun(p);
printf("%d",*p);
return 0;
}

Asked In josh technology Deepak Singh (10 years ago)

Unsolved Read Solution (6)

Is this Puzzle helpful?   (17)   (7) Submit Your Solution

(#M40154176) JOSH TECHNOLOGY QUESTION Keep an EYE

#include

int main(void) {
int i=1024;
for(;i;i>>=1)
printf("jtg");
return 0;
}

Asked In Josh technology Deepak Singh (10 years ago)

Solved Kartik agarwal Read Solution (7)

Is this Puzzle helpful?   (30)   (12) Submit Your Solution Definition

(#M40154158) PRATIAN TECHNOLOGIES QUESTION what is the logic? Keep an EYE

2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131.......

Asked In Pratian technologies suresh (10 years ago)

Solved sharda sharma Read Solution (30)

Is this Puzzle helpful?   (229)   (46) Submit Your Solution Puzzles

(#M40154145) TCS QUESTION Keep an EYE

The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered?

Asked In TCS kriti kankariya (10 years ago)

Solved sireesha.yammanuru Read Solution (4)

Is this Puzzle helpful?   (16)   (6) Submit Your Solution Technical