INTERVIEW QUESTIONS WITH ANSWERS.

Sample Job Interview HR Questions With Answers.

2012-01-30T00:05:00.000+05:30

Here are some very important HR questions which are often asked during Interviews and I believe these answers can really help you to get through.......

Click on them to view the answer:

1) Tell Me Something About Yourself ?

2) What Are Your Strengths?

3) What Are Your Weaknesses?

4) How Do You Handle Pressure / Can You Work Well Under Pressure?

5) What Are Your Short Term Goals?

6) What Are Your Long Term Goals?

7) Where Do You See After 5 Years?

8) Why Should We Hire You?

9) What Is Your Salary Expectation?

10) Why Do You Want To Leave Your Current Job?

11) Do You Prefer To Work Alone Or As A Team Player?

12) What Made You Choose Your Major / Stream?

13) Why Didn’t You Pursue A Career In Your Major / Stream?

14) Why Do You Want To Work For Us?

15) Are You Willing To Travel?

16) Are You Willing To Take Risks?

17) What Do You Know About This Company?

18) What Do You Seek From A Job?

19) How Do You Evaluate Success?

20) During Your Performance Reviews, What Criticism Do You Hear The Most?

21) Is There Anything Else That We Should Know About You That Would Impact Our Decision?

22) If I Tell You, You Are an IDIOT, a FOOL, a RASCAL; Can You Think Anything Positive About It?

23) If You Were an Animal / a Can Of Soup / Some Other Random Object Which One Would You Prefer & Why?

24) What Will You Do If You Are Asked To Give a Bribe?

25) Suppose I Tell You I Don’t Like Your Face? Then Why Should I Select You?

26) If Your Boss Is Taking All The Credits For Your Work, What Will You Do?

27) Suppose You Find Yourself In a Deserted Island. What Three Things You Will Need To Survive?

28) How Do You Think You Conducted Or Performed During This Interview?

29) How Mobile Are You?

30) Why From ECE To IT Domain?

31) If After Sometime You Start Disliking The Job? What Would You Do?

32) What Have You Learnt From Your Failures?

33) Tell Us An Incident Where You Had a Problem With Your Team-Mate. How Did You Handle It?

--- Questions You Can Ask During Interview.

Resume Format.

Curriculum Vitae / Chronological Vitae.

Cover Letter / Job Application Format.

Cover Letter / Job Application .

Personality Development.

Best Online Job Portals And Educational Sites For Freshers.

SUBMIT YOUR RESUME TODAY: Click Here.

Your suggestions and comments are welcome in this section. If you want to share something or if you have some answer of your own, please do post them in the comments section.

Sample C Program To Implement Quick Sort Using Pointers, Functions & Arrays.

2012-01-29T00:46:00.000+05:30

ALGORITHM:

STEP 1: Start the program.
STEP 2: Assign the pointer array *a[100] as global, Read the value of n.
STEP 3: Set a for loop to read the elements of array.
for(i = 0; i < n; i++)
STEP 4: Call the function sort(0, n - 1).
STEP 5: Print the sorted array a.
STEP 6: Stop the program

FUNCTION SORT (int first, int last)

STEP 1: Declare the local variable.
STEP 2: Check if first is less than last.
first < last

STEP 3: If so then assign the following
pivot = a[first]
i = first
j = last

STEP 4: Assign a while loop till the condition.
I < j

STEP 5: Assign a while loop to increment i till
a[i] < pivot and i < last

STEP 6: Assign a while loop to decrement j till
a[j] > pivot and j > first

STEP 7: Check whether i is than j if so then swap the values of a[i] and a[j]
temp = a[i]
a[j] = a[j]
a[j] = temp

STEP 8: Then swap the values of a[j] and a[first].
temp = a[j]
a[j] = a[first]
a[first] =temp

STEP 9: Call another functions sort(first, j - 1) and sort(j + 1, last)

SAMPLE PROGRAM:

#include<stdio.h>
#include<conio.h>

int *a[50], n, i;
void sort(int, int);

void main()
{

clrscr();
printf(" Enter the no of elements: ");
scanf(" %d ", &n);

printf(" Enter the array elements one by one: ");

for(i = 0; i < n; i++)
scanf(" %d ", &a[i]);

printf(" \n UNSORTED ARRAY ELEMENTS ");

for(i = 0; i < n; i++)
printf(" \t %d ", a[i]);

sort(0, n - 1);

printf(" \n SORTED ARRAY ");

for(i = 0; i < n; i++)
printf(" %d ", a[i]);

getch();

}

void sort(int first, int last)
{

int *temp, *pivot, i, j;

if(first < last)
{
pivot = a[first];
i = first;
j = last;
while(i < j)
{
while((a[i] <= pivot) && (I < last))
i++;
while((a[j] >= pivot) && (j > first))
j--;
if(i < j)
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}

temp = a[first];
a[first] = a[j];
a[j] = temp;

sort( first, j – 1 );

sort( j + 1, last );
}

}

OUTPUT:

Enter the number of elements: 6

Enter the array elements one by one
23
45
89
98
09
65

UNSORTED ARRAY ELEMENTS 23 45 89 98 09 65

SORTED ARRAY 09 23 45 65 89 98

Sample C Program To Implement Binary Search Without Using Recursive Function.

2012-01-29T00:19:00.000+05:30

ALGORITHM:

STEP 1: Start the program.
STEP 2: Read the value of n.
STEP 3: Set a for loop to read the elements of array.
for(i = 0; i < n; i++)
STEP 4: Set a for loop.
for(i = 0; i < n; i++)
STEP 5: Nest another for loop.
for(j = i + 1; j < n; j++)

STEP 6: Check the condition a[i] > a[j]
STEP 7: If so swap the two values using temporary variable t as
t = a[i]
a[i] = a[j]
a[j] = t
STEP 8: Else go back to step 6.
STEP 9: Set a for loop to print the value of array a.
for(i = 0; i < n; i++)
STEP 10: Read the search key as k.

STEP 11: Assign low = 0 and high = n – 1.
STEP 12: Call the function binsearch(a, k, low, high)
STEP 13: Check if ans is not equal to 1, if so print the position b + i. else print that element is not found.
STEP 14: Stop the program.

FUNCTION BINARY SEARCH (int *a[ ], int x, int low, int high)

STEP 1: Check if low > high if so return -1.
STEP 2: Else assign mean value of low and high to mid.
mid = ( high + low ) / 2.
STEP 3: Assign the value of a[mid] to p
p = a[mid]
STEP 4: Check if x == p if so then return mid
STEP 5: Else check whether x < p if so then return binsearch(a, x, low, mid - 1)
STEP 6: Else return binsearch(a, x, mid + 1, high)

SAMPLE PROGRAM:

#include<stdio.h>
#include<conio.h>

binarysearch(int *[], int, int);

void main()
{

int i, j, n, a[10], t, k, b ;
clrscr();
printf(" Enter The number of elements: ");
scanf(" %d ", &n);

printf(" Enter array elements: \n ");

for(i = 0; i < n; i++)
scanf(" %d ", &a[i]);

printf(" Sorted array: \n ");

for(i = 0; i < n; i++)
for(j = i + 1; j < n; j++)
if(a[i] > a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}

for(i = 0; i < n; i++)
printf(" %d ", a[i]);

printf(" \n Enter the element to search: \n ");
scanf(" %d ", &k);

b = binarysearch(&a, n, k);

if(b !=-1)
printf(" Position:%d ", b);
else
printf(" Search element not found.\n ");

getch();

}

binarysearch(int *a[],int n,int k)
{

int mid, low, high, p;
low = 0;
high = n - 1;

while(low <= high)
{
mid = (low + high) / 2;
p = a[mid];

if(p > k)
high = mid - 1;
else if(p < k)
low = mid + 1;
else if(k == p)

return mid;

}

return-1;

}

OUTPUT:

Enter the number of elements: 6
Enter the array elements
23
45
89
98
09
65

Sorted array 09 23 45 65 89 98

Enter the element to search: 23
Position: 2
Enter the element to search: 50
The number is not present in the list.

Sample C Program To Implement Binary Search Using Recursive Function.

2012-01-28T18:16:00.000+05:30

ALGORITHM:

STEP 1: Start the program.
STEP 2: Read the value of n.
STEP 3: Set a for loop to read the elements of array.
for(i = 0; i < n; i++)
STEP 4: Set a for loop.
for(i = 0; i < n; i++)
STEP 5: Nest another for loop.
for(j = i + 1; j < n; j++)

STEP 6: Check the condition a[i] > a[j].
STEP 7: If so swap the two values using temporary variable t as
t = a[i]
a[i] = a[j]
a[j] = t
STEP 8: Else go back to step 6.
STEP 9: Set a for loop to print the value of array a.
for(i = 0; i < n; i++)
STEP 10: Read the search key as k.

STEP 11: Assign low = 0 and high = n – 1.
STEP 12: Call the function binsearch(a, k, low, high)
STEP 13: Check if ans is not equal to 1, if so print the position b + i. Else print that element is not found.
STEP 14: Stop the program.

FUNCTION BINARY SEARCH (int *x[ ], int x, int low, int high)

STEP 1: Set a while loop till low is greater than high.
STEP 2: Assign mean value of low and high to mid.
mid = (high + low) / 2
STEP 3: Assign the value of x[mid] to p.
p = x[mid]
STEP 4: Check if x < p if so assign.
high = mid - 1
STEP 5: Else check whether x > p if so then assign.
low = mid + 1

STEP 6: Else check whether x == p, if so return mid.
STEP 7: Else return -1.

SAMPLE PROGRAM:

#include<stdio.h>
#include<conio.h>

binarysearch(int *[], int, int, int);

void main()
{

int i, j, k, t, low, high, n, a[50], ans;
clrscr();

printf(" \n Enter the number of elements: ");
scanf(" %d ", &n);

printf(" \n Enter the array element one by one \n ");
for(i = 0; i < n; i++)
scanf(" %d ", &a[i]);

printf(" \n Sorted array \n ");

for(Ii= 0; i < n; i++)
for(j = I + 1; j < n; j++)
if(a[i] > a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}

for(i =0; i < n; i++)
printf(" \t a[%d] = %d \n ", i, a[i]);

printf("\t Enter the element to search:");
scanf("%d",&k);

low = 0;
high = n - 1;

ans = binarysearch(a, k, low, high);

if(ans !=-1)
printf(" \n The number %d is present in the list at location %d. ", k, ans);
else
printf(" The number is not present in the list. ");

getch();

}

int binarysearch(int *a[], int x, int low, int high)
{

int mid, p;

if(low > high)
return-1;

mid = (low + high) / 2;
p = a[mid];

if(x == p)
return(mid);
else if(x < p)
return binarysearch(a, x, low, mid - 1);
else
return binarysearch(a, x, mid + 1, high);

}

OUTPUT:

Enter the number of elements: 6
Enter the array elements one by one
23
45
89
98
09
65

Sorted Array 09 23 45 65 89 98

Enter the element to search 23.
The number 23 is present in the list at location 2.

Enter the element to search 50.
The number is not present in the list.

Sample C Program To Implement Merge Sort Using Divide & Conquer Strategy.

2012-01-27T21:59:00.001+05:30

ALGORITHM:

STEP 1: Start the program.
STEP 2: Read the value of n.
STEP 3: Set a for loop to read the elements of array.
for (i = 0; i < n; i++)
STEP 4: Call the function split ( a, 0, n – 1 )
STEP 5: Print the sorted array a.
STEP 6: Stop the program.

FUNCTION MERGE_SORT (int *a, int low, int high)

STEP 1: Declare the local variable.
STEP 2: If low is less than high then assign the mean value of low and high to mid.
mid = ( low + high ) / 2
STEP 3: Call the function merge_sort ( a, low, mid ).
STEP 4: Call the another function merge_sort ( a, mid + 1, high ).
STEP 5: Call the function combine ( a, low, mid, high ).

FUNCTION SPLIT(int *c, int first, int last)

STEP 1: Declare the local variables.
STEP 2: Set the while loop till the condition i <= mid && j <= high is failed.
STEP 3: Check whether a[i] < a[j]
STEP 4: If so the assign the value of a[j] to temp[k] and increment j and k
temp[k] = a[i]
j++
k++
STEP 5: Else assign a[j] to temp[k] and then increment j and k
temp[k]=a[j]
j++
k++

STEP 6: Set another while loop till i is less than mid.
STEP 7: Assign the value of a[i] to temp[k]
temp[k] = a[i]
j++
k++
STEP 8: Set another while loop till j is greater than mid.
STEP 9: Assign the value of a[j] to temp[k]
temp[k] = a[j]
j++
k++
STEP 10: Construct a for loop for k.
for(k = low; k <= high; k++)

STEP 11: Assign the value of temp[k] to a[k].
a[k] = temp[k]

SAMPLE PROGRAM:

#include<stdio.h>
#include<conio.h>

void split(int *, int, int);
void merge(int *, int, int, int, int);
int a[25], b[25];

void main()
{

int i, n;
clrscr();
printf(" Enter the limit ");
scanf(" %d ", &n);

printf(" \n Enter the elements ");

for(i = 0; i < n; i++)
scanf(" %d ", &a[i]);

split(a, 0, n – 1 );
printf("\n The sorted list is: ");

for(i = 0 ;i < n; i++)
printf(" \n %d ", a[i]);

getch();

}

void split(int *c, int first, int last)
{

int mid;
if(first < last)
{
mid = ( first + last ) / 2;

split(c, first, mid);
split(c, mid+1, last);

merge(c, first, mid, mid + 1, last);

}
}

void merge(int *a, int f1, int l1, int f2, intl2)
{

int i, j, k = 0;
i = f1;
j = f2;
while(i <= l1&& j <= l2)
{

if(a[i] < a[j])
b[k] = a[i++];
else
b[k] = a[j++];

k++;
}

while(i <= l1)
b[k++] = a[i++];

while(j <= l2)
i = f1;

j = 0;

while(i <= l2 && j < k)
a[i++] = b[j++]

}

OUTPUT:

Enter the limit: 6
Enter the elements
23
45
89
98
09
65
The Sorted List is: 09 23 45 65 89 98

Sample C Program To Implement Selection Sort Using Pointers, Arrays & Functions.

2012-01-04T19:47:00.003+05:30

ALGORITHM:

STEP 1: Start the program.
STEP 2: Read the value of n.
STEP 3: Set a for loop to read the elements of array
for( i = 0; i < n; i++ )
STEP 4: Call the function sel (a, 0, n – 1 )
STEP 5: Print the sorted array a.
STEP 6: Stop the program.

FUNCTION SEL (int *x, int start, int stop )

STEP 1: Declare the local variable.
STEP 2: Assign begin = start and small = begin and check if
start < stop.
STEP 3: If so then set a for loop
for(i = begin + 1 ; i <= stop; i++ )
STEP 4: Check the condition
x[i] < x[small]
STEP 6: If so then assign the value of i to small
small = i
STEP 7: Then swap the values of x[begin] and x[small] using temp
temp = x[begin]
x[begin] = x[small]
x[small] = temp
STEP 8: Call another function sel ( x, start + 1, stop )

SAMPLE PROGRAM:

#include<stdio.h>
#include<conio.h>

void sel(int *[],int,int);

int main()
{

int a[100], i, n;
clrscr();

printf(" \n Enter the number of elements: " );
scanf(" %d ", &n);
printf(" \n Enter the array elements one by one \n ");

for(i = 0; i < n; i++)
scanf(" %d ", &a[i]);

printf("\nUNSORTED ARRAY ELEMENTS");

for(i = 0; i < n; i++)
printf(" \t %d ", a[i]);

sel( a, 0, n – 1 );
printf(" SORTED ARRAY: \n ");

for(i = 0; i < n; i++)
printf(" \t %d ", a[i]);

getch();
return(0);

}

void sel(int *x[], int start, int stop)
{

int begin = start;
int small = begin;
int temp, i;

if(start < stop)
{
for(i = begin + 1; i <= stop; i++)
{
if( x[i] < x[small] )
small = i;
}

temp = x[begin];
x[begin] = x[small];
x[small] = temp;

sel(x, start + 1, stop);
}

}

OUTPUT:

Enter the number of elements: 6
Enter the array elements one by one
23
45
89
98
09
65

UNSORTED ARRAY ELEMENTS
23
45
89
98
09
65

SORTED ARRAY
09
23
45
65
89
98

ALSO READ:

Sample C Program To Implement Recursive Algorithm Using Pointers.

Sample C Program With Algorithm To Implement Bubble Sort Using Pointers.

Sample C Program On Use Of Array & Pointer Concept Together.

Sample C Program On Pointers & 2 - Dimensional Array.

Sample C Program On Strings Into Array Of Pointers.

Sample C Program To Accept & Add Ten Numbers Using Pointers.

Sample C Program With Algorithm To Implement Bubble Sort Using Pointers.

2012-01-04T18:23:00.002+05:30

ALGOTITHM

STEP 1: Start the program.
STEP 2: Read the value of n.
STEP 3: Set for loop to read the elements of array for( i = 0; i < n; i++ ).
STEP 4: Call the function bubblesort ( a , n ).
STEP 5: Print the sorted array a.
STEP 6: Stop the program.

FUNCTION BUBBBLESORT ( int *b [], int n )

STEP 1: Declare the local variable.
STEP 2: Set a for loop for( i = 0; i < n; i++ )
STEP 3: Nest another for loop for( j = 1; j < n; j++ )
STEP 4: Check the condition b[i] > b[j]
STEP 5: If so swap the two values using temporary y variable t as
t = a[i]
b[i] = b[j]
b[j] = t
STEP 6: Else go back to step3.

SAMPLE PROGRAM:

#include<stdio.h>
#include<conio.h>

void bubblesort( int *[], int);

void main()
{

int i, n, a[100];
clrscr();

printf( " \n Enter the number of elements: " );
scanf( " %d ", &n );

printf( " \n Enter the array elements " );
for( i = 0; i < n; i++)
scanf( " %d ", &a[i] );

printf( " \n UNSORTED ARRAY ELEMENTS " );

for(i = 0; i < n; i++ )
printf( " \t %d ", a[i] );

bubblesort( a, n );
printf( " \n SORTED ARRAY ");

for( i = 0; i < n; i++)
printf( " \t %d ", *(a + i) );

getch();

}

void bubblesort(int* b[],int n)
{

int i, j, t;
for( i = 0; i < n; i++ )
{
for( j = i + 1; j < n; j++ )
{
if( b[i] > b[j] )
{
t = b[i];
b[i] = b[j];
b[j] = t;
}
}
}
}

OUTPUT:

Enter the number of elements: 6
Enter the array elements 34
32
12
456
43
56
UNSORTED ARRAY ELEMENTS 34 32 12 456 43 56
SORTED ARRAY 12 32 34 43 56 456

ALSO READ:

Sample C Program To Implement Recursive Algorithm Using Pointers.

Sample C Program To Implement Selection Sort Using Pointers, Arrays & Functions.

Sample C Program On Use Of Array & Pointer Concept Together.

Sample C Program On Pointers & 2 - Dimensional Array.

Sample C Program On Strings Into Array Of Pointers.

Sample C Program To Accept & Add Ten Numbers Using Pointers.

Sample C Program To Implement Recursive Algorithm Using Pointers.

2012-01-04T17:55:00.001+05:30

ALGORITHM:

STEP 1: Start the program.
STEP 2: Declare the variable, *no, factorial, sum, p, i, and the function fact (int p), sum (int p), fib (int p).
STEP 3: Read the value of no.
STEP 4: Call the function fact (*no), sum (*no).
STEP 5: Use for loop call the function fib (int p) and display the Fibonacci series & also display factorial & summation.
STEP 6: Stop the program.

FUNCTION FIB (int p) - FIBONACCI SERIES.

STEP 1: Check whether the value of n is equal to '0' if so return '0'.
STEP 2: Else check whether (p >= 1 && p <= 2), if so return the value '1'.
STEP 3: Else return ( fib ( p – 1 ) + fib( p – 2 ) ).

FUNCTION FACT (int p) - FACTORIAL OF A NUMBER.

STEP 1: Check whether (p == 0), if so return '1' .
STEP 2: Else return (p * fact( p – 1 ) ).

FUNCTION SUM (int p) - SUMMATION OF A NUMBER.

STEP 1: Check whether p == 0, if so return '0'.
STEP 2: Else return (p + sum( p – 1 ) ).

SAMPLE PROGRAM:

#include<stdio.h>
#include<conio.h>

void main()
{

int i, p, *no, factorial, umm;
int fact (int p);
int sum (int p);
int fib (int p);

clrscr();
printf( " \n Enter The Number: " );
scanf( " %d ", no );

printf( " \n The Fibonnacci series: \n " );

for( i = 0; i < *no; i++ )
printf( " %d \n ", fib( i ) );

factorial = fact ( * no );
printf( " \n The factorial of %d: %d \n ", *no, factorial );

summ = sum ( *no );
printf( " \nThe summation of %d: %d \n ", *no, sum );
getch();

}

int fib(int p)
{

if( p == 0 )
return(0);
if( p >= 1 && p <= 2 )
return(1);
else
return( fib( p – 1 ) + fib( p – 2 ) );

}

int fact( int p )
{

if( p == 0 )
return(1);
else
return( p * fact( p – 1 ) );

}

int sum(int p)
{

if( p == 0 )
return(0);
else
return( p + sum( p – 1 ) );

}

OUTPUT:

Enter the Number: 5
The Fibonacci series: 0 1 1 2 3
The factorial of 5: 120
The summation of 5: 15

ALSO READ:

Sample C Program With Algorithm To Implement Bubble Sort Using Pointers.

Sample C Program To Implement Selection Sort Using Pointers, Arrays & Functions.

Sample C Program On Use Of Array & Pointer Concept Together.

Sample C Program On Pointers & 2 - Dimensional Array.

Sample C Program On Strings Into Array Of Pointers.

Sample C Program To Accept & Add Ten Numbers Using Pointers.

Sample C Program To Find Out The No. Of Times A Character Is Present In The String.

2011-12-25T13:10:00.000+05:30

This is a Sample C Program To Accept A String & Find Out Whether This Character Is Present In The String.

If Present Then Display How Many Times This Character Occurs.

#include<stdio.h>
#include<conio.h>
#include<string.h>

void s(char *p,char hc);

void main()
{

char str[10];
char ch;
clrscr();

printf(" \n \n Enter the string: \t ");
gets(str);

printf(" \n \n Enter the character: \t ");
scanf("%c",&ch);
s(str,ch);

}

void s(char *p,char hc)
{

int a = 0;
int i,l;
l = strlen(p);

for(i = 0; i < l; i++)
{
if ( p[i] == hc)
{
a++;
}
else
continue;
}

printf(" \n \n The Entered Character occurs %d times. ", a);
getch();

}

OUTPUT:

Enter the string: Googleplus
Enter the character: l
The Entered Character occurs 2 times.

ALSO READ:

Sample C Program To Accept A String & Find Out Whether This Character Is Present In The String.

Sample C Program To Accept A String & Display It's Substring.

Sample C Program To Accept A String & Display It's Alternate Characters In Reverse.

Sample C Program To Accept Two Strings & Display The Largest String.

Sample C Program To Accept A String & Display Vowels.

Sample C Program To Accept A String & Display Number Of Vowels.

Sample C Program To Accept A String & Display Number Of Each Vowels.

Sample C Program To Accept A String & Find Out Whether This Character Is Present In The String.

2011-12-25T13:03:00.000+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

void s(char *p,char hc);

void main()
{

char str[10];
char ch;

clrscr();
printf(" \n \n Enter the string: \t ");

gets(str);
printf(" \n \n Enter the character: \t ");

scanf("%c",&ch);
s(str, ch);

}

void s(char *p,char hc)
{

int a;
int i,l;

l = strlen(p);

for(i = 0; i < l; i++)
{
if(p[i] == hc)
{
a++;
}
else
continue;
}

if(a >= 1)
{
printf(" \n \n Yes, the entered character is present in the string. ");
}
else
{
printf(" \n \n No, the entered character is not present in the string. ");
}
getch();
}

OUTPUT:

Enter the string: Malayalam
Enter the character: z
No, the entered character is not present in the string.

ALSO READ:

Sample C Program To Accept A String & Display It's Substring.

Sample C Program To Accept A String & Display It's Alternate Characters In Reverse.

Sample C Program To Accept Two Strings & Display The Largest String.

Sample C Program To Accept A String & Display Vowels.

Sample C Program To Accept A String & Display Number Of Vowels.

Sample C Program To Accept A String & Display Number Of Each Vowels.

Sample C Program To Accept A String & Display Number Of Each Vowels.

2011-12-25T12:57:00.000+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

char vowels(char *p);

void main()
{

char str[10];
clrscr();

printf(" \n \n Enter the string: \t ");
gets(str);

vowels(str);
getch();

}

char vowels(char *p)
{

int i, l, v1 = 0, v2 = 0, v3 = 0, v4 = 0, v5 = 0, v6 = 0, v7 = 0, v8 = 0, v9 = 0, v10 = 0;
l = strlen(p);

printf(" \n \n The number of vowels in the string is: \t ");

for( i = 0; i < l; i++ )
{
if ( p[i] == 'a' )
{
v1++;
}

if ( p[i] == 'e' )
{
v2++;
}

if ( p[i] == 'i' )
{
v3++;
}

if ( p[i] == 'o' )
{
v4++;
}

if ( p[i] == 'u' )
{
v5++;
}

if ( p[i] == 'A' )
{
v6++;
}

if ( p[i] == 'E' )
{
v7++;
}

if ( p[i] == 'I' )
{
v8++;
}

if ( p[i] == 'O' )
{
v9++;
}

if ( p[i] == 'U' )
{
v10++;
}

else
continue;
}

printf ( "a = %d e = %d i = %d o = %d u = %d
A = %d E = %d I = %d O = %d U = %d",v1, v2, v3, v4, v5, v6, v7, v8, v9, v10 );

return 1;

}

OUTPUT:

Enter the string: Facebook
The number of vowels in the string is: a = 1 e = 1 o = 2

ALSO READ:

Sample C Program To Accept A String & Display Vowels.

Sample C Program To Accept A String & Display Number Of Vowels.

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Check Whether A String Is Palindrome Or Not.

Sample C Program To Print The Reverse Of A String.

Sample C Program To Accept A String & Display Number Of Vowels.

2011-12-25T12:42:00.000+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

char vowels(char *p);

void main()
{

char str[10];
clrscr();
printf(" \n \n Enter the string: \t ");
gets(str);
vowels(str);
getch();

}

char vowels(char *p)
{

int i,l,v=0;
l = strlen(p);
printf(" \n \n The number of vowels in the string is: \t ");

for(i = 0 ;i < l ; i++)
{
if ( p[i] == 'a' || p[i] == 'e' || p[i] == 'i' || p[i] == 'o' || p[i] == 'u' ||
p[i] == 'A' || p[i] == 'E' || p[i] == 'I' || p[i] == 'O' || p[i] == 'U' )
{
v++;
}
else
continue;
}

printf("%d",v);
return 1;

}

OUTPUT:

Enter the string: Dinosaur
The number of vowels in the string is: 4

ALSO READ:

Sample C Program To Accept A String & Display Vowels.

Sample C Program To Accept A String & Display In Reverse.

Sample C Program To Accept A String & Display Its Alternate Characters.

Sample C Program To Accept A String & Display Alternate Characters In Either Case.

Sample C Program To Accept A String & Display It's Substring.

Sample C Program To Accept A String & Display It's Alternate Characters In Reverse.

Sample C Program To Accept Two Strings & Display The Largest String.

Sample C Program To Accept A String & Display Vowels.

2011-12-25T00:46:00.002+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

char vowels(char *p);

void main()
{

char str[20];
clrscr();

printf(" \n \n Enter the string: \t ");
gets(str);

vowels(str);
getch();

}

char vowels(char *p)
{

int i,l;
l = strlen(p);

printf(" \n \n The vowels in the string are: \t ");
for( i = 0; i < l; i++ )
{
if(p[i] == 'a' || p[i] == 'e' || p[i] == 'i' || p[i] == 'o' || p[i] == 'u'|| p[i] == 'A' || p[i] == 'E' || p[i] == 'I' || p[i] == 'O' || p[i] == 'U')
{
printf("%c",p[i]);
}
else
continue;
}
return 1;

}

OUTPUT:

Enter the string: Malayalam
The vowels in the string are: a a a

ALSO READ:

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Display Array Of Strings.

Sample C Program To Convert String To An Integer Using atoi() Function.

Sample C Program To Find The Length Of A String.

Sample C Program To Accept Two Strings & Display Combination Of Two Strings.

2011-12-25T00:41:00.001+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

void comb(char *p1, char *p2);

void main()
{

char str1[10];
char str2[10];

clrscr();
printf(" \n \n Enter first string:\t ");

fflush(stdin);
gets(str1);

printf(" \n \n Enter second string: \t ");
fflush(stdin);

gets(str2);
comb(str1,str2);

}

void comb(char *p1, char *p2)
{

int i, l1, l2;
l1 = strlen(p1);
l2 = strlen(p2);

printf(" \n \n The combination is: \t ");
for( i = 0; i < l1; i++ )
{
printf(" %c ",p1[i]);
}

for( i = 0; i < l2; i++ )
{
printf(" %c ",p2[i]);
}

getch();
}

OUTPUT:

Enter first string: Rahul
Enter second string: Kulkarni
The combination is: RahulKulkarni

ALSO READ:

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Display Array Of Strings.

Sample C Program To Convert String To An Integer Using atoi() Function.

Sample C Program To Find The Length Of A String.

Sample C Program To Accept Two Strings & Display The Largest String.

2011-12-25T00:34:00.001+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

void largstr(char *p1,char *p2);

void main()
{

char str1[10];
char str2[10];
clrscr();
printf(" \n \n Enter first string: \t ");

fflush(stdin);
gets(str1);
printf(" \n \n Enter second string: \t ");

fflush(stdin);
gets(str2);
largstr(str1,str2);

}

void largstr(char *p1, char *p2)
{

int l1, l2, i;
l1 = strlen(p1);
l2 = strlen(p2);

printf(" \n \n The largest string is: \t ");
if(l1 > l2)
{
for(i = 0; i < l1; i++ )
{
printf(" %c ",p1[i]);
}
}
else
{
for(i = 0; i < l2; i++ )
{
printf("%c",p2[i]);
}
}
getch();

}

OUTPUT:

Enter first string: rahul
Enter Second String: ankush
The largest string is: ankush

ALSO READ:

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Display Array Of Strings.

Sample C Program To Convert String To An Integer Using atoi() Function.

Sample C Program To Find The Length Of A String.

Sample C Program To Accept A String & Display It's Alternate Characters In Reverse.

2011-12-25T00:27:00.001+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

char realt(char *p);
void main()
{

char str[10];
clrscr();
printf(" \n \n Enter the string: \t ");

gets(str);
realt(str);
getch();

}

char realt(char *p)
{

int i,l;
l = strlen(p);

printf(" \n \n Alternate characters in reverse: \t ");
for(i = l - 1; i >= 0; i -= 2)
{
printf(" %c ",p[i]);
}
return 1;

}

OUTPUT:

Enter the string: pneumonia
Alternate characters in reverse:
a
n
m
e
p

ALSO READ:

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Display Array Of Strings.

Sample C Program To Convert String To An Integer Using atoi() Function.

Sample C Program To Find The Length Of A String.

Sample C Program To Accept A String & Display It's Substring.

2011-12-25T00:23:00.001+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

char substr(char *p, int s, int n);

void main()
{

char str[50];
int start,no_of_chars;
clrscr();

printf(" \n \n Enter the string: \t ");
gets(str);

printf(" \n \n Enter start position for substring: \t ");
fflush(stdin);

scanf(" %d ",&start);
printf(" \n \n Enter number of characters: \t ");
fflush(stdin);

scanf(" %d ",&no_of_chars);
substr(str,start,no_of_chars);
getch();

}

char substr(char *p, int s, int n)
{

int i;
printf(" \n \n The substring is: \t ");
for( i = s - 1; i < n;i++)
{
printf("%c",p[i]);
}
return 1;
}

OUTPUT:

Enter the string: Please Mention Your Address:
Enter start position for substring: 20
Enter number of characters: 7
The substring is: Address

ALSO READ:

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Display Array Of Strings.

Sample C Program To Convert String To An Integer Using atoi() Function.

Sample C Program To Find The Length Of A String.

Sample C Program To Accept A String & Display Alternate Characters In Either Case.

2011-12-14T22:10:00.000+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

char altcase(char *p);

void main()
{

char str[20];
clrscr();
printf(" \n \n Enter the string: \t ");
gets(str);
altcase(str);
getch();

}

char altcase(char *p)
{

printf(" \n \n Alternate characters of string are: \t ");
while(*p)
{
if (*p >= 'A' && *p <= 'Z')
{
*p = *p + 32;
}
else if (*p >='a' && *p <='z')
{
*p = *p - 32;
}
printf("%c",*p);
p += 2;
}
return 1;
}

OUTPUT:

Enter the string: LnTInfotech
Alternate Characters of string are: L T n o e h

ALSO READ:

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Display Array Of Strings.

Sample C Program To Convert String To An Integer Using atoi() Function.

Sample C Program To Find The Length Of A String.

Sample C Program To Accept A String & Display Its Alternate Characters.

2011-12-14T22:02:00.000+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

char alt(char *p);

void main()
{

char str[10];
clrscr();
printf(" \n \n Enter the string: \t ");
gets(str);
alt(str);
getch();

}

char alt(char *p)
{

int j,l;
l = strlen(p);
printf(" \n \n Alternate characters of the entered string are: \t ");
for(j = 0; j <= l - 1; j = j + 2)
{
printf("%c",p[j]);
}
return 1;
}

OUTPUT:

Enter the string: BODYGUARD
Alternate characters of the entered string are:
B D G A D

ALSO READ:

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Display Array Of Strings.

Sample C Program To Convert String To An Integer Using atoi() Function.

Sample C Program To Find The Length Of A String.

Sample C Program To Accept A String & Display In Reverse.

2011-12-14T21:57:00.000+05:30

#include<stdio.h>
#include<conio.h>
#include<string.h>

char reverse(char *p);

void main()
{

int i;
char str[10];
clrscr();
printf(" \n \n Enter the String: \t ");
gets(str);
reverse(str);
getch();

}

char reverse(char *p)
{

int j,l;
l = strlen(p);
printf(" \n \n String in reverse is: \t ");
for(j = l - 1; j >= 0; j--)
{
printf("%c",p[j]);
}
return 1;

}

OUTPUT:

Enter the string: Kolaveri
String in reverse is: irevalok

ALSO READ:

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Display Array Of Strings.

Sample C Program To Convert String To An Integer Using atoi() Function.

Sample C Program To Find The Length Of A String.

Sample C Program To Accept A String & Display It.

2011-12-14T21:52:00.001+05:30

#include <stdio.h>
#include <conio.h>

char string( char str2[10] );

void main()
{

int i;
char str1[10];
clrscr();

printf(" \n \n Enter The String: \t ");

for( i = 0; i <= 9; i++ )
scanf(" %c ", &str1[i] );

string( str1 );
getch();

}

char string(char str2[10])
{

int j;
printf(" \n \n The String Is \t ");

for( j = 0; j <= 9; j++ )
printf(" %c ", str2[j] );

return 1;

}

OUTPUT:

Enter The String: Interview

The String Is: Interview

ALSO READ:

Sample C Program To Swap Two Strings Using strcpy() Function.

Sample C Program To Sort A Given Number Of Strings Using strcmp() Function.

Sample C Program To Display Array Of Strings.

Sample C Program To Convert String To An Integer Using atoi() Function.

Sample C Program To Find The Length Of A String.

Data Structure - Interviews Questions With Answers - 10.

2011-10-17T14:02:00.001+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

46) What do you mean by Polish string ?

Polish string refers to the notation in which the operator symbol is placed either before its operands (prefix notation) or after it operands (postfix notation). The usual form, in which the operator is placed in between the operands is called infix notation.

47) What do you mean by an infix, postfix and prefix expression ?

An expression where operators are placed in between the operands is called a infix expression.
E.g.: A + B

An expression where operators are placed after the operands is called a postfix expression.
E.g.: AB+

An expression where operators are placed before the operands is called a prefix expression.
E.g.: +AB

48) What is the evaluation order according to which an infix expression is converted to postfix expression ?

The evaluation order is:

I. Brackets or Parenthesis,
II. Exponentiation,
III. Multiplication or division,
IV. Addition or subtraction.

The operators with the same priority are evaluated from left to right.

49) Give the advantages of using post fix notations over infix notations ?

An infix expression is evaluated keeping in mind the precedence of operators. An infix expression is difficult for the machine to know and keep track of precedence of operators. A postfix expression itself takes care of the precedence of operators as the placement of operators. Thus, for the machine, it is easier to carry out a postfix expression than an infix expression.

50) How can prefix notations be converted to infix form ?

A prefix expression is converted to infix expression by scanning from left to right until we find the first operator that is immediately followed by a pair of operands. This binary expression is converted to infix by placing the operator in between two operands. The resultant expression continues until all the operators are placed between operands.

ALSO READ:

Data Structure - Interviews Questions With Answers - 1.

Data Structure - Interviews Questions With Answers - 2.

Data Structure - Interviews Questions With Answers - 3.

Data Structure - Interviews Questions With Answers - 4.

...Back To Data Structure Index.

Data Structure - Interviews Questions With Answers - 9.

2011-10-17T13:51:00.001+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

41) What do you mean by bubble sort ?

Bubble sort is an array sorting technique in which the adjoining values are compared and exchanged if they are not in the proper order. The process repeats until the entire array is sorted.

42) What is insertion sort ?

In insertion sort, each successive element is picked from its position and inserted at an appropriate position in the previously sorted array.

43) Differentiate between the different types of linked lists ?

Linked lists are of two types viz, singly linked or one-way lists and doubly linked or two-way lists. Singly linked lists contain node with single pointer pointing to the next node in sequence whereas doubly linked lists contain two pointers, one pointing to previous node and other pointing to the next node in sequence.

44) What do you mean by ‘pushing’ and ‘popping’ with regard to stacks ?

Pushing an element into a stack implies inserting a new element into a stack. This can be done only when the stack has more memory to incorporate the new element. i.e., the stack should not be overflow.

Popping is the deletion of an element from a stack. Popping elements from a stack is possible only when the stack has some elements, i.e., it is not underflow.

45) What are input restricted dequeues and output restricted dequeues ?

An input restricted dequeue is a dequeue which allows insertions at only one end but allows deletions at both ends of the list. An output restricted deque is a deque which allows deletions at only one end of the list but allows insertions at both ends of the list.

ALSO READ:

Data Structure - Interviews Questions With Answers - 1.

Data Structure - Interviews Questions With Answers - 2.

Data Structure - Interviews Questions With Answers - 3.

Data Structure - Interviews Questions With Answers - 4.

Data Structure - Interviews Questions With Answers - 5.

...Back To Data Structure Index.

Data Structure- Interviews Questions With Answers - 8.

2011-10-17T13:44:00.001+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

36) What are the differences between linear search and binary search ?

The differences between linear and binary searches are:

Binary search carries out the searching process with the minimum number of comparisons but linear search does not guarantee lesser number of comparisons.
To save on time and comparisons, binary search is much more beneficial than linear search.
Binary search can work for only sorted arrays whereas linear search can work for both sorted as well as unsorted arrays.

37) State the condition(s) under which binary search is applicable ?

The conditions for binary search are:

The list must be sorted.
Lower bound and upper bound, and the sort order of the list must be known.

38) What are the advantages of linked lists over arrays ?

Linked lists overcome the drawbacks of arrays as in linked lists, number of elements need not be predetermined, and more memory can be allocated or released during the processing as and when required, making insertions and deletions much easier and simpler.

39) What is sorting of an array ? Name a few types of sorting techniques ?

Sorting of an array means arranging the array-elements in a specified order, i.e. either ascending or descending order. Numerous sorting techniques are available. A few of them are shell sort, shuttle sort, bubble sort, selection sort, quick sort, heap sort etc.

40) What is the mechanism of selection sort ?

In selection sort, the smallest or largest element key, depending on the user’s desired order, from the remaining unsorted array is searched for and put in the sorted array. This process is repeated until the entire array gets sorted.

ALSO READ:

Data Structure - Interviews Questions With Answers - 3.

Data Structure - Interviews Questions With Answers - 4.

Data Structure - Interviews Questions With Answers - 5.

Data Structure - Interviews Questions With Answers - 6.

Data Structure - Interviews Questions With Answers - 7.

...Back To Data Structure Index.

Data Structure- Interviews Questions With Answers - 7.

2011-10-17T13:24:00.001+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

31) List the basic operations which can be performed on data structures ?

The basic operations which can be performed on data structures are:

Insertion: Addition of new element into a data structure.
Deletion: Removal of a data element from a data structure.
Searching: Searching for and finding a specified data element in a data structure.
Traversal: Traversing along a data structure and processing all the data elements of it.
Sorting: Arranging data elements of a data structure in a specified order.
Merging: Combining elements of two similar data structures to form a new data structure of same type.

32) How can you calculate the size of an array, given the upper and lower bounds of the array ?

When upper bound and lower bound of an array are given, its size is calculated as:

Array size (length) = UB – LB + 1

Where UB = Upper bound and LB = lower bound. In C++, the lower bound is always 0 and the upper bound is (size-1).

33) Which are the two very common search techniques and what are their mechanisms ?

The two most common search techniques are linear search and binary search.

In linear search, each element of an array is compared with the given specified element to be searched for, one by one. But in binary search, the specific element is searched for, in a sorted array. The search segment reduces to half at every successive stage.

34) Describe how linear search is carried out ?

In linear search, each element of an array is compared with the given specified element to be searched for, one by one. In this method, also called the sequential search method, the array is traversed sequentially to locate the given element.

35) How does the binary search work?

In binary search, the search searches for the specific element, in a sorted array. The search segment reduces to half at every successive stage. Binary search searches for an element in minimum possible comparisons.

For the first stage of searching, the segment contains the entire array. In each stage, the element to be searched for is compared with the middle element in that segment. Hence, the scanning process depends completely on the comparison of values with the middle element.

ALSO READ:

Data Structure - Interviews Questions With Answers - 3.

Data Structure - Interviews Questions With Answers - 4.

Data Structure - Interviews Questions With Answers - 5.

Data Structure - Interviews Questions With Answers - 6.

...Back To Data Structure Index.

Data Structure- Interviews Questions With Answers - 6.

2011-10-17T12:37:00.001+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

26) What are the different types of arrays?

Arrays are of different types namely one-dimensional arrays, two-dimensional arrays and multi-dimensional arrays. One-dimensional arrays comprise of finite homogeneous elements while multi-dimensional arrays comprise of elements, each of which is itself an array.

27) What do you mean by the base address of an array?

In memory, one-dimensional arrays are implemented by allocating a sequence of addressed locations so as to accommodate all its elements. The starting address of the very first element of the array is called base address of the array.

28) Give the formula to calculate the address of any element in an array, when the length of the array along with its base address and size of the element are given ?

The formula to calculate address of any element in an array is:

Address of the element with subscript I = Base address + ES (I – L)

- Where ES is the size of an array element;
L is the lower bound of the array and all array elements are of the same size.

29) How is computer memory allotted for a two-dimensional array ?

For two-dimensional array, the computer memory is allotted either in Row-major form or in Column-major form.

Row-major form stores the 2-D arrays row wise i.e. firstly the first row is stored, then the second row, then third row, and so forth.

Column-major form stores the 2-D array column wise i.e. firstly the first column, then the second column, then third, and so forth. The default form is Row-major.

30) What is the difference between an array and a stack housed in an array?

An array is a group of homogeneous elements stored in contiguous memory locations. The elements in an array can be processed from anywhere in the array.

A stack implemented as an array has elements stored in contiguous memory locations. But a stack is always processed in a LIFO manner i.e. Last in First out manner wherein the elements can be added or removed from the top end of the stack. That is why a stack is also called a LIFO data structure.

ALSO READ:

Data Structure - Interviews Questions With Answers - 7.

Data Structure - Interviews Questions With Answers - 8.

Data Structure - Interviews Questions With Answers - 9.

Data Structure - Interviews Questions With Answers - 10.

...Back To Data Structure Index.

Data Structure- Interviews Questions With Answers - 5.

2011-10-17T12:26:00.001+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

21) What advantages and disadvantages, do you think does a circular singly linked list have over a non-circular singly linked list?

A circular singly linked list is advantageous over a non-circular singly linked list because the former helps in sequencing from any node to any other node in the list. And the disadvantage is that it can make the end of the list more difficult to detect than if the last node contained a NULL next pointer.

22) Give the similarities between queues and stacks ?

Both queues and stacks are special cases of linear lists.
Both can be implemented as arrays or linked lists.

23) Differentiate between queues and stacks ?

The differences between queues and stacks are:

A stack is a LIFO list while a queue is a FIFO list.
There are no variations of stack. A queue, however, may be circular or dequeue.

24) To perform recursion, which data structure is generally used?

Stack data structures are generally used to perform recursion. Since stack is a LIFO or ‘Last in First Out’ list, it has the ability to remember and recognize its ‘caller’. Thus, it knows to whom it is supposed to return. In the case of a recursive function’s equivalent iterative, non-recursive function too, explicit stacks are used.

25) What do you mean by merging of data structures?

Merging of data structures is the process of generating new data structures from existing individual data structures. In Merging, elements of two data structures are combined to form a new data structure.

ALSO READ:

Data Structure - Interviews Questions With Answers - 6.

Data Structure - Interviews Questions With Answers - 7.

Data Structure - Interviews Questions With Answers - 8.

Data Structure - Interviews Questions With Answers - 9.

...Back To Data Structure Index.

Data Structure- Interviews Questions With Answers - 4.

2011-10-12T23:26:00.003+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

16) What Is A Circular Queue ?

Circular queues are the queues implemented in circular form rather than a straight line. In these types of queue, the last element is always followed by the first element.

17) What Do You Mean By The Terms ‘Overflow’ & ‘Underflow’ In Data Structures ?

Overflow and Underflow are two states in data structures when further insertions and deletions respectively are not possible in the data structure.

Overflow refers to inserting a node when no memory is available and Underflow refers to deleting from an empty list.

18) What Is Meant By Dequeue ?

Queues in which elements can be added or removed at either end but not in the middle are called dequeues. There are two types of dequeue namely input restricted dequeue and output restricted dequeue.

19) What Do You Mean By Garbage Collection In Data Structures ? What Role Does The AVAIL List Play In A Linked List ?

Garbage collection in data structures is the process by which the deleted nodes, i.e. released memory are added to the AVAIL list.

AVAIL list is also a linked list keeping account of free memory locations, so that memory can be allocated to new nodes at the time of insertion.

20) Differentiate Between A LIFO & FIFO List ?

A LIFO list is a list which uses the Last in First Out technique. A LIFO list is processed in LIFO manner, i.e. elements that are entered last are removed first of all. A stack is an example of a LIFO list.

A FIFO or First in First Out list processes its elements in first come first served basis. A queue is a FIFO list.

ALSO READ:

Data Structure - Interviews Questions With Answers - 5.

Data Structure - Interviews Questions With Answers - 6.

Data Structure - Interviews Questions With Answers - 7.

Data Structure - Interviews Questions With Answers - 8.

...Back To Data Structure Index.

Data Structure- Interviews Questions With Answers - 3.

2011-10-12T23:02:00.003+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

11) What Is A Stack ?

Stack data structure refers to the lists stored and accessed in a special way, where LIFO or Last in First Out technique is followed. In stacks, insertions and deletions take place only at one end, called the top. Stack is similar to a stack of plates or a stack of CDs arranged vertically. In either stacks, objects, i.e. plates or CDs are inserted or removed only from the top of the stack.

12) What Is A Queue ?

Queue data structure is a FIFO or First in First Out list, where insertions take place at the rear end of the queue and deletions take place at the front end of the queue. Queue is much the same as a line of people waiting for their turn to vote, or a queue at a railway station. The first person will be the first in the queue and a new person can join the queue at the rear end of it.

13) What Are Linked Lists ?

Linked lists are special lists of some data elements linked to one another. The logical ordering is represented by having each element pointing to the next element.

Each element is called a node, which has two parts. The information part which stores the information and the pointer part which points to the next element. Linked lists can be singly linked or doubly linked.

14) What Are Trees ?

Trees are non linear data structures having a hierarchical relationship between various elements called nodes. The topmost node is called the root of the tree and the bottommost nodes are the leaves of the tree.

15) What Are Arrays ?

When elements of linear data structures are represented in memory by means of sequential memory locations, these linear structures are called arrays. Arrays are one of the simplest data structures and are very easy to traverse, search, sort etc. An array stores a list of finite number of homogeneous data elements.

ALSO READ:

Data Structure - Interviews Questions With Answers - 4.

Data Structure - Interviews Questions With Answers - 5.

Data Structure - Interviews Questions With Answers - 6.

Data Structure - Interviews Questions With Answers - 7.

Data Structure - Interviews Questions With Answers - 8.

...Back To Data Structure Index.

Data Structure- Interviews Questions With Answers - 2.

2011-10-12T22:50:00.002+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

6) What Are Non Linear Data Structures ?

Non linear data structures are multi level data structures. Examples of non linear data structure are trees and graphs. In such non linear data structures, the elements share a hierarchical relationship among themselves rather than forming a sequence.

7) Differentiate Between Data Types & Data Structures ?

A data type is a named group of data with similar characteristics and behavior, E.g.: Integer, real, Boolean, character etc.

A data structure is a named group of data of different data types, organized in a particular format and characterized by specific operations that can be performed on it. E.g.: Queues, arrays, trees etc.

8) List Four Major Operations On Linear Data Structures ?

Four major operations performed on linear data structures are:

• Searching: Refers to searching for a given ITEM in a given data structure.
• Sorting: Refers to rearranging the elements of a given data structure in a particular order.
• Traversing: Refers to the act of accessing and processing each element of a data structure.
• Inserting: Refers to inserting a given ITEM in a given data structure.

9) What Do You Mean By A Static Data Structure ?

A static data structure is a data structure that requires memory allocation before its processing starts. For such a data structure, a fixed amount of memory is allocated before processing begins.

10) What Is Dynamic Memory Allocation ?

Dynamic data structure is a data structure that does not require fixed amount of memory beforehand; rather, memory is allocated to it dynamically. With such a data structure, more memory can be allocated as and when required and unused memory can be freed during the program execution.

ALSO READ:

Data Structure - Interviews Questions With Answers - 3.

Data Structure - Interviews Questions With Answers - 4.

Data Structure - Interviews Questions With Answers - 5.

Data Structure - Interviews Questions With Answers - 6.

...Back To Data Structure Index.

Data Structure- Interviews Questions With Answers - 1.

2011-10-12T21:47:00.065+05:30

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

1) What Is Data Structure?

A named group of data, of different data types, which can be processed as a single unit is referred to as a data structure. Data structures have well-defined operations, behavior and properties. Arrays, stacks, queues, trees are all examples of data structures.

2) What Is The Need For Data Structures In Programming?

There are various situations in real life when there is need to treat a group of different data types as a single unit.

For example, a record in a file has several fields of different data types and the entire record may be required to be processed in one unit. In such a case, data structures are essential to combine different data types and process them together.

3) What Are The Different Data Types Which A Data Structure May Comprise Of?

Data structures contain mainly three different data types:

• Primitive data types: These are standard or fundamental data types which are not composed of other data types. E.g.: Integer, Real and Character data types.

• Non-primitive data types: These are normally user-defined data types which are composed of primitive data types. E.g.: Array, structure, class, enumeration, union etc.

• Pointers: This is a special kind of data structure which enables storage of pointers, i.e., addresses of some other data locations. E.g.: Linked lists, stacks, queues, trees etc.

4) How Can Data Structures Be Classified?

Data structures are basically classified into two groups:

• Simple data structures: These data structures are normally built from primitive data types like integers, reals, characters, Boolean. Arrays and structures can be termed as simple data structures.

• Compound data structures: These are complex data structures which are formed by combining simple data structures in various ways. Trees, stacks, queues and linked lists are compound data structures.

5) What Are Linear Data Structures?

Compound data structures are classified into two types of data structures namely linear and non linear data structures.

Linear data structures are single level data structures. A data structure can be called a linear data structure if its elements form a sequence. Examples of linear data structures are stacks, queues and linked lists.

ALSO READ:

Data Structure - Interviews Questions With Answers - 2.

Data Structure - Interviews Questions With Answers - 3.

Data Structure - Interviews Questions With Answers - 4.

Data Structure - Interviews Questions With Answers - 5.

...Back To Data Structure Index.

Sample C Program On Strings Into Array Of Pointers

2011-10-12T20:44:00.002+05:30

#include <stdio.h>
#include <conio.h>
#include <alloc.h>
#include <string.h>

#define S 4
main()
{

char*arr_str[S];
char temp[20];
int i, n, len;
clrscr();

for( i = 0; i < S; i++ )
{
printf(" Enter a string %d\n ", i + 1);
gets( temp );
len = strlen( temp );

arr_str[i] = (char*)malloc(len);
strcpy(arr_str[i], temp);
}

printf(" The entered strings are\n ");
for(i = 0; i < S; i++)
printf(" %s\n ", arr_str[i]);
getch();
return 0;

}

OUTPUT:

Enter a string 1
Do or Die

Enter a string 2
Love is life

Enter a string 3
Live and let live

Enter a string 4
Work is worship

The entered strings are
Do or Die
Love is life
Live and let live
Work is worship

ALSO READ:

Sample C Program To Understand Working Of Address Concept.

Sample C Program On Use Of Array & Pointer Concept Together.

Sample C Program On Pointers & 2 - Dimensional Array.

Sample C Program To Accept & Add Ten Numbers Using Pointers.

Sample C Program On Pointers & 2 - Dimensional Array.

2011-10-12T20:37:00.000+05:30

#include <stdio.h>
#include <conio.h>

void input(int**, int, int);
void show(int**, int, int);

main()
{

int a[3][3];
int row = 3, col = 3;
clrscr();

input(( int** )a, row, col);
show(( int** )a, row, col);

getch();
return 0;

}

void input(int **p, int r, int c)
{

int i, j;
for( i = 0; i < r; i++ )
{
for( j = 0; j < c; j++ )
{
printf(" \n Enter p[%d][%d] element: ", i, j);
scanf(" %d ", *(p + i) + j);
}
}

}

void show(int **p, int r, int c)
{

int i, j;
printf(" \n Matrix is\n ");

for( i = 0; i < r; i++ )
{
for( j = 0; j < c; j++ )
printf(" %d ", *(*(p + i) + j));

printf(" \n ");

}

}

OUTPUT:

Enter p[0][0] element: 4
Enter p[0][1] element: 6
Enter p[0][2] element: 3
Enter p[1][0] element: 2
Enter p[1][1] element: 8
Enter p[1][2] element: 7
Enter p[2][0] element: 5
Enter p[2][1] element: 1
Enter p[2][2] element: 9

Matrix is
4 6 3
2 8 7
5 1 9

Sample C Program On Use Of Array & Pointer Concept Together.

2011-10-12T20:12:00.000+05:30

#include <stdio.h>
#include <conio.h>
#define S 5

main()
{

int arr[S], i;
int *ptr = arr;

printf(" Enter %d elements of array \n ", S);

for( i = 0; i < S; i++ )
scanf(" %d ", ptr + i );

printf(" Array elements are \n " );

for( i = 0; i < S; i++ )
printf(" %d %d %d %d \n ", *(ptr + i), *(i + ptr),ptr[i],i[ptr] );

return 0;

}

OUTPUT:

Enter 5 elements of array
1
2
4
7
5
Array elements are
1 1 1 1
2 2 2 2
4 4 4 4
7 7 7 7
5 5 5 5

Sample C Program On Arithmetic Calculations Using Pointers.

2011-10-12T19:45:00.000+05:30

#include <stdio.h>
#include <conio.h>

main()
{

int a=10, *pa;
clrscr();

pa = &a;
printf(" Address = %u \n ", pa++ );
printf(" After pa++ Address = %u \n ", pa++ );

printf(" After one more pa++ Address = %u \n", pa );
printf(" Value of a = %d \n", *( pa - 2 ) );

getch();
return 0;

}

OUTPUT:

Address = 65524
After pa++ Address = 65526
After one more pa++ Address = 65528
Value of a = 10

Sample C Program To Convert String To An Integer Using atoi() Function.

2011-10-11T00:00:00.000+05:30

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
int main()
{

int i;
i = atoi(" 100");

printf(" The integer value is: %d ", i);
getch();

return 0;

}

OUTPUT:

The integer value is: 100

Sample C Program To Display Array Of Strings.

2011-10-10T23:53:00.000+05:30

#include <stdio.h>
#include <conio.h>

void main()
{

clrscr();
char arr[3][12] = { "Soft", "India" , "technologies" };

printf(" Array of String is = %s, %s, %s\n ", arr[0], arr[1], arr[2] );
getch();

}

OUTPUT:

Array of String is = Soft, India, technologies

Sample C Program To Sort A Given Number Of Strings.

2011-10-10T23:38:00.000+05:30

C Program To Sort A Given Number Of Strings.

#include <stdio.h>
#include <conio.h>
#include <string.h>

main()
{

char str[4][10];
int i;
clrscr();

for( i = 0; i < 4; i++ )
{
printf(“ \nEnter name %d: ”, i+1 );
scanf(“ %s ”, str[i] );
}

printf(“\n Original Order\n”);

for(i = 0; i < 4; i++ )
printf(“ %s\t ”, str[i] );

for(i = 0; i < 4; i++ )
{
for(j = i + 1; j < 4; j++ )
if( strcmp(str[i], str[j]) > 0 )
{
strcpy( temp, str[i] );
strcpy( temp, str[i], str[j] );
strcpy( str[j], temp );
}
}

printf(“\n Sorted Order\n”);
for( i = 0; i < 4; i++ )
printf(“ %s\t ”, str[i]);

getch();

}

OUTPUT:

Enter name 1: John
Enter name 2: Mac
Enter name 3: William
Enter name 4: Allen

Original Order
John Mac William Allen

Sorted Order
Allen John Mac William

Sample C Program To Swap Two Strings Using strcpy() Function.

2011-10-09T16:50:00.001+05:30

#include <stdio.h>
#include <conio.h>
#include <string.h>
main()
{
Char s1[10], S2[10], temp[10];
clrscr();

printf(“ Enter first name\n ”);
scanf(“ %s ”, s1);

printf(“ Enter second name\n ”);
scanf(“ %s ”, s2);

printf(“ Before swapping\n ”);
printf(“ s1 = %s\ts2 = %s\n ”, s1, s2);

strcpy(temp, s1);
strcpy(s1, s2);
strcpy(s2, temp);

printf(“ After swapping\n ”);
printf(“ s1 = %s\ts2 = %s\n ”, s1,s2);

getch();
}

OUTPUT:

Enter first name
Lavanya

Enter second name
Suchita

Before swapping
s1 = Lavanya s2 = Suchita

After swapping
s1 = Suchita s2 = Lavanya

Sample C Program To Multiply Two Matrix.

2011-10-09T16:32:00.001+05:30

C Program To Multiply Two 3 * 3 Matrix :

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>

main()
{
int a[3][3], b[3][3], c[3][3];
int i, j, k;
clrscr();

printf(" Enter elements of first matrix\n ");
for( i = 0; i < 3; i++ )
{
for( j = 0; j < 3; j++ )
{
printf(" \n Enter a[%d] [%d] element: ", i, j);
scanf(" %d ", &a[i] [j] );
}
}

printf(" Enter elements of second matrix\n ");

for( i = 0; i < 3; i++ )
{
for( j = 0; j < 3; j++ )
{
printf(" \n Enter b[%d] [%d] element: ", i, j );
scanf(" %d ", &b[i][j]);
}
}

printf(" \n\n First matrix is\n\n ");
for( i = 0; i < 3; i++ )
{
for( j = 0; j < 3; j++ )
printf(" %2d ", a[i][j]);
printf(" \n ");
}

printf(" \n\nSecond matrix is\n ");

for( i = 0; i < 3; i++ )
{
for( j = 0; j < 3; j++ )
printf(" %2d ", b[i][j]);
printf(" \n ");
}

for( i = 0; i < 3; i++ )
{
for( j = 0; j < 3; j++ )
{
c[i][j] = 0;
for( k = 0; k < 3; k++ )
c[i][j] = c[i][j] + a[i][k] * b[k][j];
}
}

printf(" \n\n Multiplication of two matrices is\n ");

for( i = 0; i < 3; i++ )
{
for(j = 0; j < 3; j++ )
printf(" %2d ", c[i][j]);
printf(" \n ");
}

getch();
}

OUTPUT:

Enter a[0] [0] element: 26
Enter a[0] [1] element: 45
Enter a[0] [2] element: 94
Enter a[1] [0] element: 28
Enter a[1] [1] element: 91
Enter a[1] [2] element: 62
Enter a[2] [0] element: 83
Enter a[2] [1] element: 16
Enter a[2] [2] element: 69

Enter elements of second matrix

Enter b[0] [0] element: 29
Enter b[0] [1] element: 39
Enter b[0] [2] element: 32
Enter b[1] [0] element: 28
Enter b[1] [1] element: 73
Enter b[1] [2] element: 18
Enter b[2] [0] element: 73
Enter b[2] [1] element: 27
Enter b[2] [2] element: 93

First matrix is
26 45 94
28 91 62
83 16 69

Second matrix is
29 39 32
28 73 18
73 27 93

Multiplication of two matrices is
8876 6837 10384
7886 9409 8300
7892 6268 9361

Sample C Program To Transpose A Matrix .

2011-10-09T15:39:00.000+05:30

C Program To Find Transpose a 3 * 2 matrix.

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>

main()
{

int arr[3] [2];
int i, j;
clrscr();

printf(" Enter the 6 elements of matrix\n ");

for( i = 0; i < 3; i++ )
for( j = 0; j < 2; j++ )
scanf(" %d ", &arr[i] [j]);

printf(" The matrix is\n ");

for( i = 0; i < 3; i++ )
{
for( j = 0; j < 2; j++ )
printf(" %d ", arr[i] [j]);
printf(" \n ");
}

printf(" The Transposed Matrix is\n ");

for( i = 0; i < 2; i++ )
{
for( j = 0; j < 3; j++ )
printf(" %d ", arr[j] [i]);
printf("\n");
}

getch();

}

OUTPUT:

Enter the 6 elements of matrix
34
63
64
92
16
82

The matrix is
34 63
64 92
16 82

The Transposed Matrix is
34 64 16
63 92 82

Sample C Program On Two Dimensional (2-D) Array.

2011-10-09T15:23:00.000+05:30

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>

main()
{

int arr [3] [4];
int i, j;
clrscr();

for(i = 0; i < 3; i++)
{
for(j = 0; j < 4; j++)
{
printf(" \n Enter the arr[%d] [%d] element: ", i, j);
scanf(" %d ", &arr[i][j] );
}
}

printf(" Array elements are\n ");

for(i = 0; i < 3; i++)
{
for(j = 0; j < 4; j++)
printf(" %d \t ", arr[i][j] );
printf(" \n ");
}

getch();
}

OUTPUT:

Enter the arr[0] [0] element: 678

Enter the arr[0] [1] element: 543

Enter the arr[0] [2] element: 234

Enter the arr[0] [3] element: 543

Enter the arr[1] [0] element: 124

Enter the arr[1] [1] element: 432

Enter the arr[1] [2] element: 456

Enter the arr[1] [3] element: 677

Enter the arr[2] [0] element: 321

Enter the arr[2] [1] element: 564

Enter the arr[2] [2] element: 432

Enter the arr[2] [3] element: 654

Array elements are

678 543 234 543
124 432 456 677
321 564 432 654

Sample C Program Counting Frequencies Of Elements Of Array.

2011-10-09T15:09:00.000+05:30

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define S 6

main()
{

int a[S], freq[S];
int i, j, k,n = S;
clrscr();

for(i = 0; i < S; i++)
{
printf(" \nEnter a[%d] element: ", i);
scanf(" %d ", &a[i]);
freq[i] = 1;
}

clrscr();
printf(" Original Array\n ");

for(i = 0; i < S; i++)
printf(" %d\t ", a[i]);

/* Main Logic Starts Here */

for(i = 0; i < n; i++)
for(j = i + 1; j < n; j++)
{
if(a[i] == a[j])
{
for(k = j; k < n; k++)
a[k] = a[k+1];

freq[i]++;
n--;
}
}

printf(" \nArray with freq\n ");
printf(" \nElement\tFreq\n ");

for(i = 0; i < n; i++)
printf(" %d\t%d\n ", a[i], freq[i]);

getch();

}

OUTPUT:

Enter a[0] element: 3
Enter a[1] element: 4
Enter a[2] element: 7
Enter a[3] element: 8
Enter a[4] element: 4
Enter a[5] element: 6

Original Array
3 4 7 8 4 6

Array with freq
Element Freq

3 1
4 2
7 1
8 1
6 1

Sample C Program To Insert An Element In An Array.

2011-10-09T14:47:00.001+05:30

3. /* Program for insertion of an element in an array*/

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define S 7

main()
{

int arr[10];
int i, pos, num, j;
clrscr();

for( i = 0; i < S; i++ )
{
printf("\n Enter arr[%d] element: ", i);
scanf(" %d ", &arr[i] );
}

clrscr();
printf(" \n\nArray is \n\n ");

for( i = 0; i < S; i++ )
printf(" %2d ", arr[i] );

printf(" \nEnter the element which you want to insert\n ");
scanf(" %d ", &num );
printf(" \nEnter the position (first is 0)\n " );
scanf("%d", &pos);

if( pos > = 0 && pos <= 9)
{
for( j = S;j > pos; j-- )
arr[j] = arr[j-1];

arr[j] = num;
}
else
{
printf(" Wrong position selected\n ");
getch();
exit(1);
}

printf(" Array after insertion\n ");
for(i = 0; i < S; i++ )
printf(" %d ", arr[i]);

getch();
}

OUTPUT:

Enter arr[0] element: 4
Enter arr[1] element: 7
Enter arr[2] element: 3
Enter arr[3] element: 6
Enter arr[4] element: 8
Enter arr[5] element: 4

Array is

4 7 3 6 8 4

Enter the element which you want to insert

3

Enter the position (first is 0)

4

Array after insertion

4 7 3 6 8 4 4

Sample C Program For Deleting An Element From An Array.

2011-10-09T14:19:00.000+05:30

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define S 6

main()
{

int arr[S];
int i, pos, num, j;
clrscr();

for( i = 0; i < S; i++ )
{
printf(" \nEnter a[%d] element: ", i );
scanf(" %d ", &arr[i] );
}

printf(" \n\nArray is\n\n ");

for( i = 0; i < S; i++ )
printf(" %2d ", arr[i] );

printf(" \nEnter the position of the element which you would like to delete\n");

scanf(" %d ", &pos );

if( pos > = S + 1 )
printf(" Deletion not possible.\n ");
else
{
for ( i = pos - 1 ; i < S - 1 ; i++ )
array[c] = array[i+1];
printf(" Array after deletion\n");
for( i = 0 ; i < S - 1 ; i++ )
printf(" %d\n ", array[i] );
}
getch();

}

OUTPUT:

Enter a[0] element: 1

Enter a[1] element: 6

Enter a[2] element: 7

Enter a[3] element: 4

Enter a[4] element: 3

Enter a[5] element: 8

Array is
1 6 7 4 3 8
Enter the position of the element which you want to delete
4
Array after deletion
16748

Sample C Program For Entering An Array Of Elements.

2011-10-09T13:51:00.001+05:30

#include <stdio.h>
#include <conio.h>
#define S 5

main()
{

int a[S];
int i;
clrscr();

for( i = 0; i < S; i++ )
{
printf("\n Enter a[%d] element: ",i);
scanf("%d", &a[i]);
}
printf("Array elements are\n");

for( i = 0; i < S; i++ )
{
printf("a[%d] = %d\n", i, a[i]);
}

getch();
}

OUTPUT:

Enter a[0] element: 4
Enter a[1] element: 3
Enter a[2] element: 6
Enter a[3] element: 7
Enter a[4] element: 9
Array elements are
a[0] = 4
a[1] = 3
a[2] = 6
a[3] = 7
a[4] = 9

Frequently Asked C++/OOPS Interview Questions With Answers - 20.

2011-09-20T23:54:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

96) What is a stack?

The memory area that stores the return address of the functions, arguments passed to functions, and local variables of functions is called a stack.

97) What is meant by overflow in C++?

If one tries to insert a node into a linked list, when there is no memory available, it is called ‘Overflow’.

98) What is an infix expression?

An expression in which operators are placed in between the operands is called an infix expression.

99) What do you mean by static binding?

Static binding or early binding is the process of selection of a particular function for a particular call at the compile time.

100) What do you mean by a node?

A part of a linked list storing information of an element as well as having a pointer to the next node is called a node.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 15.

Frequently Asked C++/OOPS Interview Questions With Answers – 16.

Frequently Asked C++/OOPS Interview Questions With Answers – 17.

Frequently Asked C++/OOPS Interview Questions With Answers – 18.

"> Frequently Asked C++/OOPS Interview Questions With Answers – 19.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 19.

2011-09-20T23:52:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

91) State conditions under which binary search is applicable.

For binary search,

The list must be sorted.
Lower bound and upper bound of the list must be known.

92) What is a linked list?

A linked list is a collection of data elements, called nodes pointing to the next nodes by means of pointers.

93) Differentiate between functions read() and write().

The read() function lest one read a unit of information from a file and the write() function lets one write a unit of information to a file.

94) What is a null pointer?

A pointer that does not point to any data object is called a null pointer, In C++, the null pointer can be represented by the constant 0.

95) What is a memory leak?

A situation in which there lie so many orphaned memory-blocks that are still allocated but no pointers are referencing to them, are referred to as a memory leak.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 15.

Frequently Asked C++/OOPS Interview Questions With Answers – 16.

Frequently Asked C++/OOPS Interview Questions With Answers – 17.

Frequently Asked C++/OOPS Interview Questions With Answers – 18.

Frequently Asked C++/OOPS Interview Questions With Answers – 20.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 18.

2011-09-20T23:49:00.002+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

86) Name the streams generally used for file operations.

Ifstream, ofstream and fstream.

87) What do you mean by ‘this’ pointer?

The ‘this’ pointer is an already created object pointer that points to currently calling object.

88) What is a data structure?

A named group of data of different data types which can be processed as a single unit is referred to as a data structure.

89) List four major operations associated with linear data structures.

Four major operations performed on data structures are searching, sorting, traversing and inserting.

90) What are trees in C++?

Trees are non-linear data structures having a hierarchical relationship between various elements called nodes. Topmost node is called the root of the tree and the bottommost nodes are called leaves of the tree.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 16.

Frequently Asked C++/OOPS Interview Questions With Answers – 17.

Frequently Asked C++/OOPS Interview Questions With Answers – 18.

Frequently Asked C++/OOPS Interview Questions With Answers – 20.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 18.

2011-09-20T23:46:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

81) What is a nested structure ?

A nested structure is a structure having another structure as its member element. It finds a wide range of applications in C++ components like linked lists.

82) How are arrays and structures related to each other ?

Arrays bring together a group of items of the same data type whereas structures bring together a group of related data items of any data type.

83) How are structures and classes related to each other ?
OR
What is the difference between structure and class?

Structure is actually a class in C++ declared with keyword struct. By default, all members are public in a structure, while on the other hand, all members are private by default in classes.

84) What is the difference between get and getline member functions ?

The get() and getline() functions are virtually identical to one another. But the difference between the two of them is that getline() reads and removes the newline character from the input stream if its is encountered, which is not done by the get() function.

85) Differentiate between ifstream class and ofstream class?

The ifstream class is an input stream class, which provides input operations for file. The ofstream class is an output stream class, which provides output operations for a file. Both ifstream and ofstream classes are defined under the header file iostream.h.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 16.

Frequently Asked C++/OOPS Interview Questions With Answers – 17.

"> Frequently Asked C++/OOPS Interview Questions With Answers – 19.

Frequently Asked C++/OOPS Interview Questions With Answers – 20.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 16.

2011-09-20T23:34:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

76) What do you mean by a static data member and a static member function?

A static data member is a class data member common to all the objects of a class. A static member function is a member function that can access only the static data members.

77) What is modularity in C++?

Modularity is the property of a system that has been decomposed into a set of cohesive and loosely coupled modules. In other words, modularity is the act of partitioning a program into individual components is called modularity.

78) What do you mean by data abstraction?

Data abstraction is the act of representing essential features without including the background details.

79) What is a pointer? How will you define a pointer to an integer and a pointer to a character?

A pointer is a variable which holds a memory address which is usually the location of another variable in memory.

A pointer, say ptr, to integer is declared as int *ptr; and a pointer, say cptr, is declared to a character as char *cptr.

80) How does a pointer variable differ from a simple variable?

A simple variable stores a data value whereas a pointer variable stores a memory address of another variable in the memory.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 17.

Frequently Asked C++/OOPS Interview Questions With Answers – 18.

"> Frequently Asked C++/OOPS Interview Questions With Answers – 19.

Frequently Asked C++/OOPS Interview Questions With Answers – 20.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 15.

2011-09-20T23:31:00.002+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

71) What is abstraction?

Data abstraction refers to the act of representing essential features without including the background details or explanations. Data abstraction is an important characteristic of object oriented programming.

72) How is abstraction and encapsulation interrelated?

Encapsulation wraps up data and functions under a single unit and ensures that only essential features get represented without representing the background details which is nothing but abstraction. Therefore, encapsulation is a way of implementing abstraction.

73) What is an adaptor class or Wrapper class?

A wrapper class or an adaptor class refers to the method by which classes wrap their primitive values in a class and offers access to them through objects. A few of the primitive wrapper data types are:
Byte, short, int, long, float, double, char, Boolean.

74) What is a container class? What are the types of container classes?

Two classes such that the objects of a class are enclosed within the other class are called container classes and the property is called containership, nesting or composition.

75) What is polymorphism?

Polymorphism is the ability for a message or data to be processed in more than one form. Function overloading, operator overloading etc are all components of polymorphism.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 16.

Frequently Asked C++/OOPS Interview Questions With Answers – 17.

Frequently Asked C++/OOPS Interview Questions With Answers – 18.

"> Frequently Asked C++/OOPS Interview Questions With Answers – 19.

Frequently Asked C++/OOPS Interview Questions With Answers – 20.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 14.

2011-09-20T22:59:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

66) What is meant by inheritance hierarchy ?

The relationship between a base and derived class is referred to as a derivation or inheritance hierarchy. The derivation from multiple base classes is referred to as a derivation or inheritance graph.

67) Differentiate between multiple and multilevel inheritances ?

Multiple inheritance is the inheritance hierarchy wherein one derived class inherits from multiple base classes.

Multilevel inheritance is the inheritance hierarchy wherein a subclass acts as a base class for other classes.

68) What is an ABC (`Abstract Base Class') ?

A class serving only as a base class for other classes and no objects of which are created is known as an abstract base class.

69) What is a `virtual destructor' ?

A virtual destructor is a destructor which is essential in C++ programming. The virtual destructor is important for a C++ base class to ensure that the destructor from the most called function is chosen.

70) What is a dangling pointer or wild pointers ?

Dangling pointers or wild pointers are pointers in computer programming, which do not point to a valid object of the appropriate type. They are special variations of memory safety violations.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 15.

Frequently Asked C++/OOPS Interview Questions With Answers – 16.

Frequently Asked C++/OOPS Interview Questions With Answers – 17.

Frequently Asked C++/OOPS Interview Questions With Answers – 18.

Frequently Asked C++/OOPS Interview Questions With Answers – 19.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 13.

2011-09-20T22:55:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

61) What is meant by a visibility mode?

The public, private or protected specifier that controls the visibility and availability of a member in a class is called a visibility mode.

62) What's the difference between `public:', `private:', and `protected:' visibility modes?

The differences between the `public:', `private:', and `protected:' visibility modes lie in the ways in which members and functions can be accessed within a class.

In the publicly derived class, the public and protected members of the base class become public and protected members of the derived class.

In the privately derived class, the public and protected members of the base class become private members of the derived class.

In the protectedly derived class, the public and protected members of the base class become protected members of the derived class.

63) When should you use inheritances?

Inheritance finds wide applications in C++ due to the following reasons.

Inheritance has the capability to express the inheritance relationships which makes it ensure the closeness with the real-world models.
Another reason is the idea of re-usability. Inheritance helps in addition of additional features to an existing class without modifying it.
Inheritance possesses a transitive nature.

64) How do you express `private inheritance'?

The private derivation means, the derived class can access the public and private members f the base class privately. Here, the inherited members can be accessed only through member functions of the derived class.

Private inheritance is expressed as :
class derived-class-name : visibility-mode base-class name
{
;
}

65) What are the access rules with `private' and `protected' inheritance?

In private derivation, though the derived class inherits all the public and protected members of the base class become private members of the derived class, the objects of the derived class cannot access them directly. Here, the public and protected members of the base class are directly accessible by the member functions and friends of the derived class as if they were the private members of the derived class.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 14.

Frequently Asked C++/OOPS Interview Questions With Answers – 15.

Frequently Asked C++/OOPS Interview Questions With Answers – 16.

Frequently Asked C++/OOPS Interview Questions With Answers – 17.

Frequently Asked C++/OOPS Interview Questions With Answers – 18.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 12.

2011-09-20T22:51:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

56) Define free store ?

It is a pool of unallocated heap memory given to a program that is used by the program for dynamic allocation during execution.

57) What do you mean by a self referential structure?

A structure having a member element that refers to the structure itself is called a self-referential structure.

58) What is inheritance? What the types of inheritance?

Inheritance is the capability of one class to inherit properties from another class. The class from which properties are inherited is called a base class and the class inheriting properties is called the derived class.

59) What are the different types of inheritances?

Inheritances are of many types namely single inheritance, multiple inheritance, multilevel inheritance, hierarchical inheritance and hybrid inheritance.

60) What is the difference between a virtual base class and a normal base class?

The major and only difference between a virtual base class and a normal one is when an object inherits the base more than once. If virtual base classes are used, then only one base class is present in the object. Otherwise, multiple copies will be found.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 13.

Frequently Asked C++/OOPS Interview Questions With Answers – 14.

Frequently Asked C++/OOPS Interview Questions With Answers – 15.

Frequently Asked C++/OOPS Interview Questions With Answers – 16.

Frequently Asked C++/OOPS Interview Questions With Answers – 17.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 11.

2011-09-20T22:47:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

51) What if I forget the `[ ]' when `delete'ing array allocated via `new X[n]'?

Basically, it is the duty of the programmer, and not the compiler, to get the connection between the ‘new X[n]’ and the ‘[]’. If the programmer fails in this, the compiler will not generate a runtime error or compile-time error but will result in a heap corruption. Otherwise, the program will die.

52) What are free store operators?

Operators that facilitate dynamic memory allocation, i.e., allocation new and de-allocation delete operators are called free store operators.

53) What do you mean by free storage list or AVAIL list?

A list keeping account of available free memory is called an AVAIL list or free storage list.

54) What is meant by static memory allocation?

When the amount of memory to be allocated is known beforehand and the memory is allocated during compilation itself, it is referred to as static memory allocation.

55) What is dynamic memory allocation?

Allocation of memory at runtime is referred to as dynamic memory allocation.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 12.

Frequently Asked C++/OOPS Interview Questions With Answers – 13.

Frequently Asked C++/OOPS Interview Questions With Answers – 14.

Frequently Asked C++/OOPS Interview Questions With Answers – 15.

Frequently Asked C++/OOPS Interview Questions With Answers – 16.

… Back To C++/OOPS Interview QnA Index.

Technical Interview - C++/OOPS Questions With Answers.

2011-09-19T00:04:00.002+05:30

"C++/OOPS Programming" Questions With Answers".

Frequently Asked C++/OOPS Interview Questions With Answers - 10.

2011-09-18T23:33:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

46) Do ‘friends’ violate encapsulation?

The friend lessens the value of encapsulation of separate classes in object oriented programming. Hence, too many external functions or friend functions are not advisable for use in object oriented programs.

47) What are some advantages/disadvantages of using friends?

The major advantage of the friend function is that it allows a great degree of freedom in the interface design option. This function is useful when a class needs to hide certain components from the users and use it elsewhere. Friend function efficiently keeps the data details private and secure from the outside-class area.

The major disadvantage of friend function is that it requires an extra line of code while using dynamic binding.

48) What do you mean by the friend function and friend class?

A friend function is a non-member function that is granted access to a class’s private and protected members.
A friend class is a class whose member functions can access another class’s private and protected members.

49) Why should I use `new' instead of trustworthy old malloc()?

It is necessary to use ‘new’ instead of the old ‘malloc’ to ensure efficiency of the program. Unlike malloc, new calls the specific constructor. Further, the value returned by new is type safe and the new operator can be overridden.

50) How do I allocate / unallocate an array of things?

An array of things is allocated or unallocated using the new and delete operators.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 11.

Frequently Asked C++/OOPS Interview Questions With Answers – 12.

Frequently Asked C++/OOPS Interview Questions With Answers – 13.

Frequently Asked C++/OOPS Interview Questions With Answers – 14.

Frequently Asked C++/OOPS Interview Questions With Answers – 15.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 9.

2011-09-18T23:29:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

41) How is operator overloading implemented successfully in C++?

In C++, operator overloading follows the same procedure of functioning as function overloading. The implementation of operator overloading depends upon the situation where the operator is used. For example, the ‘-‘sign, when used with a number, like -20, is read by the compiler to be a negative number. At the same time, when the ‘-‘ sign is associated with two numbers, like 8-5, then the compiler identifies it to be the subtraction operation.

42) What is abstract class?

Abstract class is a class that defines an interface, but does not necessarily provide implementations for all its member functions. No objects of an abstract class exist, i.e, it cannot be instantiated.

43) What is concrete class?

A concrete class is a derived class of an abstract class that implements all the missing functionality. A concrete class can be instantiated. i.e, its objects can be created.

44) What is function overloading and operator overloading?

A function name having several definitions that are differentiable by the number or types of their arguments is known as function overloading.

Operator overloading is a specific case of polymorphism in C++. In operator overloading, different operators have different implementations, depending on their arguments.

45) What is a ‘friend’ function?

A friend function in C++ is a function which allows access to private or protected data in a class from outside. Friend functions are declared using the ‘friend’ keyword.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 10.

Frequently Asked C++/OOPS Interview Questions With Answers – 11.

Frequently Asked C++/OOPS Interview Questions With Answers – 12.

Frequently Asked C++/OOPS Interview Questions With Answers – 13.

Frequently Asked C++/OOPS Interview Questions With Answers – 14.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 8.

2011-09-18T23:21:00.005+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

36) What is a copy constructor?

A constructor that initializes an object using values of another object passed to it as parameter is called copy constructor. It creates the copy of the passed object. The format of declaration is:
classname (classname &)

37) What is a default constructor? What is its role?

A default constructor is the one that takes no arguments. It is automatically invoked when an object is created without providing any initial values. In case, the programmer has not defined a default constructor, the compiler automatically generates it.

38) What is meant by constructor overloading?

Constructor overloading refers to a class having multiple constructor definitions, each having a different signature.

39) What is operator overloading?

Operator overloading is a specific case of polymorphism in C++. In operator overloading, different operators have different implementations, depending on their arguments.

40) What operators can/cannot be overloaded?

Most can be overloaded. The only C++ operators that can't be are . and ?: (and sizeof, which is technically an operator). C++ adds a few of its own operators, most of which can be overloaded except :: and .*.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 9.

Frequently Asked C++/OOPS Interview Questions With Answers – 10.

Frequently Asked C++/OOPS Interview Questions With Answers – 11.

Frequently Asked C++/OOPS Interview Questions With Answers – 11.

Frequently Asked C++/OOPS Interview Questions With Answers – 12.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 7.

2011-09-18T23:17:00.001+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

31) What is a constructor? Why would I ever use one?

A constructor is a member function with the same name as that of its class. Constructors are automatically invoked when an object of the same class is created. The constructor has the same name as that of the class.
A constructor is used often to initialize the objects of that class type with a legal initial value.

32) What are destructors really for? Why would I ever use them?

A destructor is a member function with the same name as that of its class but is preceded by a tilde (~). Destructors are really for the purpose of de-initializing an object before it goes out of scope.

33) Is a default constructor equivalent to a constructor having default arguments?

Yes, a default constructors is equivalent to a constructor having default arguments because when no initial values are provided for an object at the time of its declaration, the constructor having default argument values is invoked same way as the default constructor is invoked. Therefore, these two are considered equivalent.

34) Why is a destructor function required in a class?

During construction of an object by a constructor, resources are allocated for use. These resources must be de-allocated before the object is destroyed. A destructor achieves this function and performs all clean-up jobs.

35) What is a parameterized constructor?

A constructor that receives arguments or parameters is called a parameterized constructor.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 8.

Frequently Asked C++/OOPS Interview Questions With Answers – 9.

Frequently Asked C++/OOPS Interview Questions With Answers – 10.

Frequently Asked C++/OOPS Interview Questions With Answers – 11.

… Back To C++/OOPS Interview QnA Index.

50 C Programming Interview Questions With Answers.

2011-09-15T23:52:00.000+05:30

C Programs Frequently Asked In Interviews.

This section covers C programs often asked in campus interviews and freshers walk-in. It helps job seekers who are about to attend TECHNICAL interview round.

Here you will find simple C programming questions with answers basically asked in technical interviews.

1) Program To Print Welcome Message.

2) Program To Accept & Display A Number.

3) Program To Add Two Numbers.

4) Program To Perform Arithmetic Operations.

5) Program To Print Sum Of Digits In A Number.

6) Program To Print The System Date.

7) Program To Swap Two Numbers Using Temporary Variables.

8) Program To Swap Two Numbers Without Using Temporary Variables.

9) Program To Print First Ten(10) Natural Numbers.

10) Program To Find Area & Circumference Of A Circle.

11) Program To Find The Area Of A Rectangle (Using Functions).

12) Program To Find Factorial Of A Number.

13) Program To Print Fibonacci Series Upto 100.

14) Program To Calculate Simple Interest.

15) Program To Check Whether A Number Is Prime Or Not.

16) Program To Check Whether A Number Is Even Or Not.

17) Program To Find Greatest Among Three Numbers.

18) Program To Compute The Reverse Of A Number.

19) Program To Convert Degree Celsius Temperature To Fahrenheit.

20) Program To Accept Floating Point Numbers & Print Average.

21) Program To Find The Area Of A Triangle.

22) Program To Sort A Given Set Of Numbers In Ascending Numbers.

23) Program To Specify Size Of Commonly Used Data Types.

24) Program To Accept Input & Multiply Two Numbers.

25) Program To Count The Number Of Times A Digit Occurs In A Number Array.

26) Program To Find The Roots Of A Quadratic Equation.

27) Program To Count The Number Of Times The Largest Digit Occurs In A Number.

28) Program To Print Number Of Vowels, Consonants, Characters, Words & Spaces In A Line Of Text.

29) Program To Find The Sum Of N Numbers.

30) Program To Accept & Add Ten Numbers Using Pointers.

31) Program To Check Whether A Number Is Armstrong Or Not.

32) Program To Display The Days In A Week (Using Switch...Case Statement).

33) Program To Find The Square Of A Number (Using Functions).

34) Program To Find Gross Salary.

35) Program To Check Whether An Year Is A Leap Year Or Not.

36) Program To Print Sum Of Series 1 + 3 + 5 + …. N.

37) Program To Add Complex Numbers.

38) Program To Display A Sequence Using Stars.

39) Program To Print A Star Pyramid.

40) Program To Print Floyd’s Triangle.

41) Program To Transpose A Matrix.

42) Program To Add Two Matrices.

43) Program To Multiply Two Matrices.

44) Program To Find The Length Of A String.

45) Program To Concatenate Two Strings.

46) Program To Swap Two Strings.

47) Program To Compare Two Strings.

48) Program To Check Whether A String Is Palindrome Or Not.

49) Program To Print The Reverse Of A String.

50) Program To Join Two Strings.

51) Program To Add Two Numbers Using Pointers.

Frequently Asked C++/OOPS Interview Questions With Answers - 4.

2011-08-28T20:01:00.008+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

Question - 16) Which header file is required for creating and manipulating data files in C++?

fstream.h

Question - 17) What is an access specifier?

An access specifier is a way to specify the scope and accessibility of members of a class. Access specifiers can be either private or protected or public.

Question - 18) How is memory allocated to a class and its objects?

When a class is defined, memory is allocated for its member functions and they are stored in the memory. When an object is created, separate memory space is allocated for its data members. All objects work with the one copy of member functions shared by all.

Question - 19) What is the difference between an object and a class ?

An object is an identifiable entity with some characteristics and behavior. It represents an entity that can store data and its associated functions.
A class is a group of objects that share common properties and relationships. It represents a group of similar objects.

Question - 20) Differentiate between data hiding and encapsulation ?

Data hiding is the property whereby the internal data structure of an object is hidden from the rest of the program.

Data encapsulation is the mechanism by which the data and associated functions are bound together within an object definition in such a way so that only relevant information is exposed and rest remains hidden. Thus, data encapsulation implements data hiding.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 5.

Frequently Asked C++/OOPS Interview Questions With Answers – 6.

Frequently Asked C++/OOPS Interview Questions With Answers – 7.

Frequently Asked C++/OOPS Interview Questions With Answers – 8.

Frequently Asked C++/OOPS Interview Questions With Answers – 9.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 4.

2011-08-28T20:01:00.007+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

Question - 21) What is polymorphism? Explain with an example ?

Polymorphism is the property by which the same message can be sent to different objects of several different classes, and eah object can respond to it in a different way depending upon its class. In C++, polymorphism is implemented through overloading.

A function name having several definitions that are differentiable by the number of types of their arguments is known as function overloading. For example,

float area (float a)
{
return a * a;
}
float area (float a, float b)
{
return a * b;
}

Question - 22) What is public, protected and private ?

Public, protected and private are access labels in a class. A class provides three access labels namely private, protected and public.

A member declared as public is made available to the outside world. That is, it can be accessed by any function, any expression in the program but only by using an object of the same class type.

A member declared as private or protected remains hidden from outside world and it can only be accessed by the member functions and friend functions of a class.

Question - 23) What is the significance of the protected access specifier ?

The members having protected accessibility are hidden from outside world, like private members, but when inherited, they remain visible in the derived class unlike private members.

Question -24) Do 'derivation' and 'friendship' mean the same ?

No. ‘Friendship’ gets the access privilege for private and protected members of a class. However, ‘derivation’ from that class gets access privilege only for protected members of the class.

Question - 25) Enlist some advantages of object oriented programming ?

The major advantages of object oriented programming are:

Re-usability of code.
Ease of comprehension.
Ease of fabrication and maintenance.
Easy redesign and extension.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 5.

Frequently Asked C++/OOPS Interview Questions With Answers – 6.

Frequently Asked C++/OOPS Interview Questions With Answers – 7.

Frequently Asked C++/OOPS Interview Questions With Answers – 8.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 5.

2011-08-28T20:01:00.006+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

Question - 26) Is prototyping mandatory in C++? Why?

Yes, prototyping is mandatory in C++. C++ makes it mandatory to ensure proper invocation of functions and prompt error reporting.

Question -27) When should a function be made inline?

A function is made inline when:

The function is small.
The function is not returning any value and contains no return statement.
The function does not contain a loop or a switch or a goto.
The function does not contain static variables.
The function is not recursive.

Question - 28) How is a static variable different from a static function?

A static variable has a function scope but the global life time. A static function has a file scope instead of program scope.

Question - 29) What is meant by macro?

A macro is a #define function, whose every occurrence is the program is replaced prior to compilation as per its definition.

Question - 30) What do you mean by inline function?

An inline function is that which is not invoked at the time of function call rather its code is replaced in the program at the time of function call. Thus, inline functions save the overheads of a function call.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 6.

Frequently Asked C++/OOPS Interview Questions With Answers – 7.

Frequently Asked C++/OOPS Interview Questions With Answers – 8.

Frequently Asked C++/OOPS Interview Questions With Answers – 9.

Frequently Asked C++/OOPS Interview Questions With Answers – 10.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 3.

2011-08-28T16:10:00.004+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

Question - 11) Why ‘char’ is often considered as an integer data type?

The memory implementation of char data type is in terms of the number code, which is an integer. Therefore, it is said to be another integer data type.

Question - 12) What is the difference between structure and class in C++?

A structure is a collection of data while the class is a collection of data and functions. Further, all members are public by default in a structure while all members are private by default in class. Class has greater data security than structure.

Question - 13) What is the purpose of ios:app?

The function of ios::app is to retain the previous contents of a file and to append to the end of the existing file contents, rather than truncating them.

Question -14) What is the purpose of ios::ate?

The purpose of ios::ate is to place file pointer at the end of the file, but you can write data anywhere in the file.

Question - 15) How is random access of data achieved in C++?

In C++, random access is achieved by manipulating seekg( ), seekp( ), tellg( ) and tellp( ) functions. The seekg() and tellg() functions allow you to set and examine the get_pointer, and the seekp() and tellp() functions perform these operations on the put_pointer.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 4.

Frequently Asked C++/OOPS Interview Questions With Answers – 5.

Frequently Asked C++/OOPS Interview Questions With Answers – 6.

Frequently Asked C++/OOPS Interview Questions With Answers – 7.

Frequently Asked C++/OOPS Interview Questions With Answers – 8.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 2.

2011-08-28T12:23:00.002+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

Question - 6) What is a reference variable ? What is its use ?

A reference variable is an alias name for a previously declared variable. The use of it is that is that the same data object can be referred to by two names and these names can be used interchangeably.

Question - 7) What are inline functions ? What is the advantage of using them ? How are they declared ?

An inline function is a function upon which the C++ compiler is asked to perform inline expansion, i.e. the compiler is requested to replace every function call with the complete body of the function, rather than generating the function code at each and every position of the function call.

The major advantage of inline functions is that it saves on the overhead of a function call. Since the function is not invoked, but its code is replaced in the program, it saves the compiler time and improves efficiency.

The format to declare an inline function is:

inline datatype function_name(parameters)
{
function content;
}

Question - 8) What are the defining traits of an object-oriented language ?

The defining traits of an object oriented programming language are the following:

Data abstraction.
Data encapsulation.
Inheritance.
Polymorphism.
Modularity.

Question - 9) What is the purpose of the scope resolution operator ?

In C++, the scope resolution operator (::) is used to qualify hidden file names so that
they can be used. Further, the scope resolution operator can also be used to qualify
class names or class member names.

Question - 10) What are the differences between type casting and automatic type conversion ?

Type casting or explicit type conversion is user-defined forced conversion. It is done with the help of casting operator ().

Automatic type conversion or implicit type conversion is a data type conversion performed by compiler on its own. It occurs whenever an expression has different types.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers – 3.

Frequently Asked C++/OOPS Interview Questions With Answers – 4.

Frequently Asked C++/OOPS Interview Questions With Answers – 5.

Frequently Asked C++/OOPS Interview Questions With Answers – 6.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C++/OOPS Interview Questions With Answers - 1.

2011-08-28T12:22:00.004+05:30

Here, are some sample questions based on "C++/OOPS Programming language". Read it carefully as these questions will help you in cracking any interview.

Question - 1) What is a class?

A class is a group of objects, i.e. data members or member-functions that share common properties and relationships. It represents a group of similar objects.

Question - 2) What is an object?

An object is an identifiable entity with some characteristics and behavior. It represents an entity that can store data and its associated functions.

Question - 3) List the advantages of object oriented programming?

Object oriented programming has many advantages:

Re-usability of code.
Ease of comprehension.
Ease of fabrication and maintenance.
Easy redesign and extension.

Question - 4) What is meant by ‘call by value’?

In C++, structures can be passed to functions by two methods namely ‘by value’ and ‘by reference’. In ‘call by value’ method, the called function copies the passed structure on to its own work copy; the original structure then remains unaffected.

Question - 5) What is meant by ‘call by reference’?

In ‘call by reference’ method of calling functions, the called function declares a reference for the passed structure and refers to the original structure elements through its reference.

ALSO READ:

Frequently Asked C++/OOPS Interview Questions With Answers - 2.

Frequently Asked C++/OOPS Interview Questions With Answers - 3.

Frequently Asked C++/OOPS Interview Questions With Answers - 4.

Frequently Asked C++/OOPS Interview Questions With Answers - 5.

Frequently Asked C++/OOPS Interview Questions With Answers - 6.

… Back To C++/OOPS Interview QnA Index.

Frequently Asked C Interview Questions With Answers - 10.

2011-08-27T15:32:00.003+05:30

Here, are some sample questions based on “C Programming language”. Read it carefully as these questions will help you in cracking any interview.

Question -46) How is deletion in an array list carried out?

Deletion from an array list is possible in two ways:

Deletion of the first element.
Deletion of the last element.
Deletion in between.

Question -47) What are the advantages of array lists?

The major advantage of the array list is that we can easily compute the address of the array through index and we can also access the array element through the index.

Question -48) What are the disadvantages of an array list?

The disadvantage of an array list is that we have to keep the total number of elements and array size. We cannot take elements more than array size because array size is fixed. It requires much processing in insertion and deletion of shifting of array elements.

Question -49) What is a linked list in C?

A linked list is a self referential structure in which a member of a structure points to the structure itself. In other words, a linked list is a collection of elements called nodes.

Question -50) What is a node?

A node is the component of a linked list. Each node has two parts, first part contains the information field and second part contains the address of the next node. The address part of the last node of linked list will have NULL value.

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 6.

- Frequently Asked C Interviews Questions With Answers - 7.

- Frequently Asked C Interviews Questions With Answers - 8.

- Frequently Asked C Interviews Questions With Answers - 9.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Frequently Asked C Interview Questions With Answers - 9.

2011-08-27T15:26:00.003+05:30

Here, are some sample questions based on “C Programming language”. Read it carefully as these questions will help you in cracking any interview.

Question - 41) What is the size of the void pointer in C?

The size of void pointer in C is two bytes.

Question -42) What is a nested loop in C?

A nested loop in C is a loop within another loop. Nested loops find wide applications in C as well as C++ programs.

Question -43) What are the operations performed on C++ lists?

The operations performed on lists are insertion, deletion, traversal and search.

Question -44) How is searching in an array list carried out?

For searching an element in an array list, first we traverse the array list and with traversing, we compare each element of array with the given element.

Question -45) Where can an element are inserted in an array list?

Insertion into an array list is possible in two ways:

Insertion at the beginning.
Insertion at the end.
Insertion in between.

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 5.

- Frequently Asked C Interviews Questions With Answers - 6.

- Frequently Asked C Interviews Questions With Answers - 7.

- Frequently Asked C Interviews Questions With Answers - 8.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Frequently Asked C Interview Questions With Answers - 8.

2011-08-27T14:29:00.002+05:30

Here, are some sample questions based on “C Programming language”. Read it carefully as these questions will help you in cracking any interview.

Question -36) What is the purpose of the free() function?

For efficient use of memory space, the memory space that is not required should be released. The free() function achieves this.

Question -37) How to use realloc() to dynamically increase size of an already allocated array?

The function realloc() can be used to change the size of the memory block reserved for a particular object. This is known as reallocation of memory.

The function realloc() moves the content of old block into the new block and the data of the old block is not lost.

Question -38) What is the purpose of the sizeof() operator?

The sizeof() operator is a unary operator. This operator gives the size of its argument in terms of bytes. The argument can be a variable, array or any data type. This operator also gives the size of any structure.

Question -39) What is a wild pointer in C?

A wild pointer in C refers to a pointer which has not been initialized with any particular value. Wild pointer does not point to any specific memory location.

Question -40) What is the purpose of the do-while loop in C?

Do-while loop or post tested loop is the loop used when it is necessary to execute the loop at least once in the execution of the program. The syntax of the do-while loop is:

do
{
loop body
} while (condition);

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 6.

- Frequently Asked C Interviews Questions With Answers - 7.

- Frequently Asked C Interviews Questions With Answers - 9.

- Frequently Asked C Interviews Questions With Answers - 10.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Frequently Asked C Interview Questions With Answers - 7.

2011-08-27T14:04:00.005+05:30

Here, are some sample questions based on “C Programming language”. Read it carefully as these questions will help you in cracking any interview.

Question -31) What is a far pointer in C?

A far pointer in C refers to a pointer which is capable of pointing or accessing the whole of RAM’s residence memory. The far pointer can access all 16 segments of the residence memory.

Question -32) What are the uses of the void data type?

The void data type is used basically to declare generic pointers. They are also used as a function parameter and as a function return type.

Question -33) What is a pointer in C?

A pointer in C is a variable. It contains the memory address, i.e, locations of another variable which is declared as the pointer type.

Question -34) What are the advantages of using pointers?

Pointers help to save memory spaces.
Use of pointer assigns the memory space and also releases it. This helps in making best use of the available memory. In other words, it caters to dynamic memory allocation.
With pointers, data manipulation is done with address, so execution becomes faster.
Array representation is easy with pointers.

Question -35) What are the differences between malloc() and calloc()?

The malloc() function is used to allocate memory space. It reserves a memory space of specified size and gives the starting address to pointer variable.

The calloc() function is used to allocate multiple blocks of memory. This has two arguments. The calloc() function is generally used for allocating the memory space for arrays and structures.

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 8.

- Frequently Asked C Interviews Questions With Answers - 9.

- Frequently Asked C Interviews Questions With Answers - 10.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Frequently Asked C Interview Questions With Answers - 6.

2011-08-27T13:56:00.002+05:30

Question -26) Out of the functions fgets() and gets(), which one is safer to use and why?

Out of fgets() and gets(), the safer one to use is fgets(). The reason is, gets(), after receiving a string from the input device, gets terminated only when the enter key is pressed. The string can be limitless and it may cause buffer overflow.

Question -27) What is the difference between the functions strdup() and strcpy()?

The strdup() function is helpful in duplicating a string to a location decided by the function itself. Here the contents of a string is copied to a memory location and returns the address.

The strcpy() function copies a string to a position demanded by the user. The arguments of the function are the source string and the destination string.

Question -28) What is recursive function?

A recursive function is a function in which the statement of the function within the function body, calls the same function. Such a function is also called circular definition.

Question -29) What is the difference between defining and declaring a variable?

Defining a variable means declaring it and allocating memory space to it.

Declaring a variable means declaring it but not specifying the memory allocation. Declaration of variables just hints the compiler about the type and size of the variable during compile time.

Question -30) What is a constant variable?

By default the value of any variable in C is not constant. Hence, to assign a variable with a constant value throughout the program, the variable can be made a constant variable. Constant variable are declared using the const keyword and they make execution faster than non-constant variables.

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 7.

- Frequently Asked C Interviews Questions With Answers - 8.

- Frequently Asked C Interviews Questions With Answers - 9.

- Frequently Asked C Interviews Questions With Answers - 10.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Frequently Asked C Interview Questions With Answers - 5.

2011-08-27T13:17:00.004+05:30

Here, are some sample questions based on “C Programming language”. Read it carefully as these questions will help you in cracking any interview.

Question - 21) What is the purpose of main() function?

The main() function in C is the most vital part of a program. The program execution occurs from the main() function. The main() function may contain any number of statements and they are sequentially executed. main() function can in turn call other functions.

Question -22) What are the differences between formal arguments and actual arguments of a function?

Formal arguments are parameters or arguments in a function declaration. The scope of such arguments is local to the function definition. Any change made to the formal arguments will not be reflected back in the main program.

Actual arguments are arguments that are passed in a function call. Such arguments are defined inside the function body.

Question -23) What is call by value in functions?

Arguments or parameters can be passed to the functions by call by value. In call by value, the values of the variables are passed to the functions. In this, values of variables are not affected by changing the vale of the formal parameter.

Question -24) What is call by reference in functions?

In Call by reference method of passing arguments to functions, the addresses of the variables are passed. In this, values of variables are affected by changing the value of formal parameters.

Question -25) What are the differences between getchar() and scanf() functions for reading strings?

The getchar() function is used to get a character from the standard input device. While using the getchar() function, there is no need to hit the return key. It is used only with character data types and it can be used to get continuous stream of characters.

The scanf() function is used to get input from the standard input device. Here, return key should be typed after each input. It can be used for all data types but continuous stream of inputs is not facilitated.

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 6.

- Frequently Asked C Interviews Questions With Answers - 7.

- Frequently Asked C Interviews Questions With Answers - 8.

- Frequently Asked C Interviews Questions With Answers - 9.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Frequently Asked C Interview Questions With Answers - 4.

2011-08-27T13:01:00.005+05:30

Here, are some sample questions based on “C Programming language”. Read it carefully as these questions will help you in cracking any interview.

Question -16) What are the differences between a structure and a union?

A structure is a collection of data in which all the declared members are public by default. Data security is limited in structure.

Union is almost the same as the structure as structure contains members of different data types. In structure, each member has its own memory location whereas members of unions have same memory locations. We can assign values to only one member at a time in union.

Question -17) What is meant by union?

Union is almost the same as the structure as structure contains members of different data types. In structure, each member has its own memory location whereas members of unions have same memory locations. We can assign values to only one member at a time in union.

Question -18) What are the advantages of unions?

The greatest advantage of union is that it saves memory. When a union is declared, compiler automatically allocates a memory location to hold the largest data type of members in the union, thereby saving memory. Further, the concept of union is useful when it is not necessary to assign the values to all the members of the union at a time.

Question -19) How can typedef be used to define a type of structure?

typedef is used for defining new data types of structures. The general syntax is:

typedef type data_name;

Here, type is the data type and data_name is the name for that type.

For defining structures, typedef is used in the following manner:

typedef struct{
member1;
member2;
………………
} dataname;
Here, data name is another name for defining the structure.

Question -20) What is enumeration constant?

When an enumeration data type is defined, a set of identifiers are specified which the data enumeration represents. Such an identifier is called an enumeration constant.

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 5.

- Frequently Asked C Interviews Questions With Answers - 6.

- Frequently Asked C Interviews Questions With Answers - 7.

- Frequently Asked C Interviews Questions With Answers - 8.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Frequently Asked C Interview Questions With Answers - 3.

2011-08-27T12:55:00.003+05:30

Here, are some sample questions based on “C Programming language”. Read it carefully as these questions will help you in cracking any interview.

Question -11) Which bitwise operator is used for checking whether a particular bit is ON or OFF?

The bitwise AND operator is used for checking whether a particular bit is ON or OFF.

Question -12) Which bitwise operator is used for turning OFF a particular bit in a number?

Bitwise AND operator (&) and one’s complement operator (~) are suitable for turning OFF a particular bit in a number.

Question -13) What is equivalent of multiplying an unsigned int by 2: left shift of number by 1 or right shift of number by1?

Left shifting of an unsigned integer is equivalent to multiplying an unsigned int by 2.

Question -14) What is Enumeration?

Enumeration is data type. In C++, the user can create user defined data types and define values using them. This helps to make the program more readable. Enumeration data types are defined in similar ways as structures.

Question -15) What is a structure?

A structure is a collection of data in which all the declared members are public by default. Data security is limited in structure. The general format of declaration of a structure is:

struct
{
Member1;
Member 2;
……………….
……………….
Member m;
} var;

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 1.

- Frequently Asked C Interviews Questions With Answers - 2.

- Frequently Asked C Interviews Questions With Answers - 4.

- Frequently Asked C Interviews Questions With Answers - 5.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Frequently Asked C Interview Questions With Answers - 2.

2011-08-27T12:47:00.003+05:30

Here, are some sample questions based on “C Programming language”. Read it carefully as these questions will help you in cracking any interview.

Question -6) What is scope & storage allocation of extern and global variables?

Extern variables are global variables. These variables belong to the external storage class and are stored in the system’s main memory. They are declared in a separate source file which could be outside the current program scope. The scope of these variables is global.

Global variables are variables declared above the main function. They are accessible throughout the program. They have 0 as the default value.

Question -7) What is scope & storage allocation of register?

Register variables are storage allocated in the CPU registers. Since they are stored in the CPU registers, their storage and accessibility is much easier and faster than other variables. The scope of register variables is local to the blocks in which they are defined.

Question -8) What is scope & storage allocation of static and local variables?

The storage allocation of static variables is done at the beginning of program execution. After the program terminates, the memory is reallocated. Scope of static variables is local to the block within which they are defined.

Local variables are variables defined within a function or program. Their default value is a garbage value and they are accessed only by the particular function or program.

Question -9) What is the difference between 'break' and 'continue' statements?

The break keyword is used to terminate a loop or exit from a block. After exiting, the program control jumps to the statement after the loop or block.

The continue keyword is used to skip a current iteration and move to the next iteration.

Question -10) What is the difference between uses of 'for' and 'while' loops?

When a user wants to initialize, check condition and increment or decrement the value of a variable in a single statement, and using an iterative loop, then the loop used may be for loop.

When the user wants to initialize, check condition and increment or decrement value not using a single iterative loop, then he/she may use the while loop. Only one condition can be checked using the while loop.

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 1.

- Frequently Asked C Interviews Questions With Answers - 3.

- Frequently Asked C Interviews Questions With Answers - 4.

- Frequently Asked C Interviews Questions With Answers - 5.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Frequently Asked C Interview Questions With Answers - 1.

2011-08-27T12:37:00.008+05:30

Here, are some sample questions based on “C Programming language”. Read it carefully as these questions will help you in cracking any interview.

Question -1) What is the difference between declaring a variable and defining a variable?

The difference between declaring a variable and defining a variable is that while declaring a variable, the compiler verifies if the variable has been defined elsewhere but does not allocate memory for that variable. It is a kind of explicit declaration of a variable.

But while defining a variable, the compiler allocates specific memory for the variable and initializes the variable to some value. Normally, variables are declared after defining.

Question -2) Define static variable?

A static variable is a variable which has been allocated statically. i.e., the life of the variable extends as long as the entire run of the program. Static variables are global variables and find wide use in programs. It is declared as:

static datatype variable;

Question -3) What is a register variable?

Register variables are special variants of automatic variables. Register variables are stored in processor registers. The system register provides a certain control of efficiency of the program when variables are declared as register variables.

Question -4) Where is an auto variable stored?

An auto variable is stored in the computer’s main memory.

Question -5) What is meant by scope and storage allocation of a variable or function?

The scope of a variable is defined by the storage allocation of that variable. Storage allocation of a variable decides the memory part where storage space is allocated for a particular variable or function.

ALSO READ:

- Frequently Asked C Interviews Questions With Answers - 2.

- Frequently Asked C Interviews Questions With Answers - 3.

- Frequently Asked C Interviews Questions With Answers - 4.

- ...Back To C Questions INDEX.

- ...Back To C Programming INDEX.

Sample C Program To Add Two Numbers Using Pointers.

2011-08-16T22:57:00.001+05:30

#include <stdio.h>
#include <conio.h>
int main()
{

int x, y, *p, *q, sum;
printf(" Enter two integers to add " );
scanf(" %d %d ", &x, &y );

p = &x;
q = &y;
sum = *p + *q;

printf(" Sum of entered numbers = %d\n ", sum );
getch();
return 0;

}

OUTPUT:

Enter two integers to add 3
6
Sum of entered numbers = 9

Sample C Program To Print Floyd’s Triangle.

#include <stdio.h>
#include <conio.h>
main()
{

int n, i, c, number = 1;
printf(" Enter the number of rows of Floyd's triangle you want " );
scanf(" %d ", &n );

for ( i = 1 ; i <= n ; i++ )
{
for ( c = 1 ; c <= i ; c++ )
{
printf(" %d ", number );
number++;
}

printf(" \n " );
}

getch();
return 0;

}

OUTPUT:

Enter the number of rows of Floyd’s triangle you want 6
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
16 17 18 19 20 21

ALSO READ:

Sample C Program To Understand Working Of Address Concept.

Sample C Program On Use Of Array & Pointer Concept Together.

Sample C Program On Pointers & 2 - Dimensional Array.

Sample C Program On Strings Into Array Of Pointers.

Sample C Program To Accept & Add Ten Numbers Using Pointers.

... Back To C Program Index.