Answer Posted / meena

/* Program to insert element into array */
#include<stdio.h>
#include<conio.h>
void main()
{
int arr[50],i,n,pos,num;
clrscr();
printf("How Many Elements:-");
scanf("%d",&n);
printf("\n\tEnter Elements into Array");
for(i=0;i<n;i++)
{
scanf("\t%d",&arr[i]);
}
printf("\nArray Elements before inserting");
for(i=0;i<n;i++)
{
printf("\n%d",arr[i]);
}
printf("\nEnter the position");
scanf("%d",&pos);
if(pos==0 || pos>=n)
{
printf("Invalid position");
}
else
{
printf("\nEnter the number you want to insert into an
array");
scanf("%d",&num);
/*shift the existing elements*/
for(i=n;i>=pos;i--)
arr[i]=arr[i-1];
arr[pos-1]=num;
printf("\nArray elements after insertion");
for(i=0;i<n;i++)
{
printf("\n%d",arr[i]);
}
}
getch();
}

the maximum length of a character constant can be a) 2 b) 1 c) 8

1091

---

Mention the storage classes in c++.

1076

---

Is c++ fully object oriented?

964

---

What is the benefit of learning c++?

979

---

what is upcasting in C++?

1176

---

Explain the volatile and mutable keywords.

1066

---

What is the sequence of destruction of local objects?

974

---

What is function prototyping? What are its advantages?

1081

---

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

2217

---

What is singleton pattern in c++?

984

---

Why cout is used in c++?

1024

---

Specify some guidelines that should be followed while overloading operators?

1199

---

Explain binary search.

983

---

What are the extraction and insertion operators in c++?

997

---

What is the exit function in c++?

983

---