Answer Posted / ajit

#include<stdio.h>
void main()
{
int a[20],i,j,temp;
printf("enter the 20 values\n");
for(i=0;i<20;i++)
scanf("%d",&a[i]);
for(i=0;i<20;i++)
{
for(j=i+1;j<20;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("the second largest number is %d\n",a[18]);
}

Will a recursive function without an end condition every quit, in practice a) Compiler-Specific (Some can convert to an infinite loop) b) No c) Yes

1068

---

What are guid?

1228

---

why is c++ called oops? Explain

1029

---

How can you prevent accessing of the private parts of my class by other programmers (violating encapsulation)?

1067

---

What are register variables?

1135

---

What size is allocated to the union variable?

1044

---

Define a nested class. Explain how it can be useful.

1067

---

What is the difference between the indirection operator and the address of oper-ator?

1095

---

What is binary search in c++?

1022

---

How much is c++ certification?

1038

---

What are the manipulators in c++?

1033

---

What is the difference between a reference and a pointer?

1094

---

Assume an array of structure is in order by studentID field of the record, where student IDs go from 101 to 500. Write the most efficient pseudocode algorithm you can to find the record with a specific studentID if every single student ID from 101 to 500 is used and the array has 400 elements. Write the most efficient pseudocode algorithm you can to find a record with a studentID near the end of the IDs, say in the range from 450 to 500, if not every single student ID in the range of 101 to 500 is used and the array size is only 300

2206

---

What is the use of register keyword with the variables?

929

---

What is #include ctype h in c++?

1150

---