• Placement Questions

Placement Papers with Solutions

(#M40039803) PERSISTENT QUESTION Programming Keep an EYE

when you want to use
-printf() scanf()
-log() abs() pow()
-clrscr() getch() terminate()
and your program restrictions are such that you have to use only 1 header file
Is it Possible......if yes which header file will you use....
How you will do it?

Asked In Persistent RAHUL UBHALE (11 years ago)

Unsolved Read Solution (6)

Is this Puzzle helpful?   (46)   (27) Submit Your Solution Program

(#M40039758) PERSISTENT QUESTION CPU utilization Keep an EYE

If there are n proceses and each process waits p time in waiting state then cpu utilization is-:

Asked In Persistent RAHUL UBHALE (11 years ago)

Unsolved Read Solution (3)

Is this Puzzle helpful?   (34)   (12) Submit Your Solution

(#M40039757) PERSISTENT QUESTION Find O/P 1 Keep an EYE

#include
int a[5] ={1,2,3,4,5},i,j=2,b;
func(int j,int *a)
{
j=j+1;
a=a+j;
b= b+2;
}
int main()
{
for (i =0;i<5;i++ )
func(j,a[i]);
for (i =0;i<5;i++ )
printf("%d",a[i]);
return 0;
}

Asked In Persistent RAHUL UBHALE (11 years ago)

Unsolved Read Solution (10)

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

(#M40039756) PERSISTENT QUESTION Find O/P Keep an EYE

void main()
{
int a[5] ={1,2,3,4,5},i,j=2,b;
for (i =0;i<5;i++ )
func(j,a[i]);
for (i =0;i<5;i++ )
printf(?%d?,a[i]);
}
func(int j,int *a)
{
j=j+1;
a=a+j;
b= b+2;
}

Asked In Persistent RAHUL UBHALE (11 years ago)

Unsolved Read Solution (10)

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

(#M40039755) PERSISTENT QUESTION predicate the o/p Keep an EYE

#include
func(char *s1,char * s2)
{
char *t;
t=s1;
s1=s2;
s2=t;
}
int main()
{
char *s1="jack", *s2="jill";
func(s1,s2);
printf("
%s
%s ",s1,s2);
return 0;
}

Asked In Persistent RAHUL UBHALE (11 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (14)   (3) Submit Your Solution

(#M40039754) PERSISTENT QUESTION C Keep an EYE

what is int(*(*ptr (int))(void)

Asked In Persistent RAHUL UBHALE (11 years ago)

Unsolved Read Solution (4)

Is this Puzzle helpful?   (12)   (8) Submit Your Solution

(#M40039753) PERSISTENT QUESTION DS Keep an EYE

A hash table has a size of 11 and data filled in its position like{3,5,7,9,6}how many comparisons have to be made if data is not found in the list in worst case
a) 2
b) 6
c) 11

Asked In Persistent RAHUL UBHALE (11 years ago)

Unsolved Read Solution (4)

Is this Puzzle helpful?   (32)   (12) Submit Your Solution

(#M40039752) PERSISTENT QUESTION DS Keep an EYE

From the following when 43 will not be found by binary search (a series was given with last element 43 in each)

Asked In Persistent RAHUL UBHALE (11 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (16)   (8) Submit Your Solution undefined

(#M40039751) PERSISTENT QUESTION Data Structures Keep an EYE

2)On which maximum operations cannot be performed .if we want to use abstract data type.
a)Array
b)Hash Table
c)Linked List
d)Heap
e)Binary Tree

Asked In Persistent RAHUL UBHALE (11 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (41)   (18) Submit Your Solution

(#M40039710) INFOSYS QUESTION installation OS Keep an EYE

Is it necessary to uninstall Linux OS to install Any of the Windows version??
Note: Linux is already installed on primary partition

Asked In Infosys RAHUL UBHALE (11 years ago)

Unsolved Read Solution (5)

Is this Puzzle helpful?   (8)   (7) Submit Your Solution Interview