• Placement Questions
• /
• Persistent

Frequently Asked Persistent Placement Papers with Solution : Unsolved Question

(#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

(#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

(#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

(#M40155021) PERSISTENT QUESTION ds Keep an EYE

A tree was given with nodes assigned clours red, blue, yellow, green and more that one node is
having colour red.They have asked that how many times the output will be red if the total number of
evaluation is 11.

Asked In persistent sonali (9 years ago)

Unsolved

Is this Puzzle helpful?   (89)   (31) Submit Your Solution Database

(#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

(#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

(#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

(#M40037550) PERSISTENT QUESTION 20 min program writing Keep an EYE

Design a data structure for Income Tax department. . Following information is to be stored about users :

Income tax no.
Name
Address(as a single string)
Tax amount
Whether tax paid or not paid for previous year
Group (valid values are High/Low depending on amount of tax to be paid. If tax to be paid > 1,50,000 then Group should be stored as High else Low)
Category (Valid values range between 1 to 10)
Write a program which will populate this data structure.
The count of users(records) to be created should be accepted as user input.
Once the date structure is ready, the program should search and display users with any of the given criteria like Income tax no., Tax amount, Name, Whether tax paid or not paid for previous year, group and category.

Asked In Persistent saloni daga (11 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (47)   (13) Submit Your Solution Database

(#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

(#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