Answer / abby

array is a homogenous collection of elements, it cannot
contain dissimilar elements.

Answer / beginner in learning c!!

An array can never contain dissimilar elements. You dont
call that derived data type as array!! so the two questions
hav NO ANSWER.. :)

Answer / vadivel t

Hi this code ll work for the second question but first
question i dint understand...

here in souce buff we have 16 nos, in which 1 to 5 repeats
3 times.

but at the end of the program u ll get only nos 1 to 6 as
out in dest buff without duplicate.


Note: Compiler used Visual studio 2005.


#include<stdio.h>
#include<conio.h>
void main()
{
int source[16] = {5,3,4,1,2,1,2,3,4,5,2,3,1,5,4,6};
int dest[6], i, j, count = 0, flag;

int test = 0;
/*Copy the first element*/
dest[0] = source[0];
count++;
for(i = 1; i<= 15; i++)
{
/*Check whether the same element is already
available in the dest buff*/
for(j = 0; j<count; j++)
{
if(dest[j] == source[i])
{
/*Already available*/
flag = 0;
break;

}
else
{
flag = 1;
}
}
if(flag == 1)
{
/*The same element is not available
already - so copy it to the dest buffer*/
dest[count] = source[i];
count++;
}
}

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

_getch();
}

Answer / prakash

QUESTION WAS NOT DISSIMILAR ,BUT DIFFERENT ELEMENT LIKE,
12344214211LIKE THIS ......
TELL ME THE ANSWER

Three major criteria of scheduling.

1 Answers  

---

The % symbol has a special use in a printf statement. Explain how would you place this character as part of the output on the screen?

0 Answers  

---

What is Dynamic Initialization.

3 Answers  

---

Why can’t we compare structures?

0 Answers  

---

A.C func() { pritnf(" in fuction %d",MACRO); } MAIN.c testfunc() { #define MACRO 10 printf("in test function %d", MACRO); } main() { printf("in main %d",MACRO); func(); testfunc(); getch(); }

2 Answers   Wipro,

---

String concatenation

2 Answers  

---

How do you determine a file’s attributes?

0 Answers  

---

What is the use of extern in c?

0 Answers  

---

Explain what a Binary Search Tree is.

3 Answers  

---

You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;i<n1-1;i++) { if( !( (a1[i]>a1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

0 Answers   Facebook,

---

how to print 212 as Twohundreds twelve plz provide me ans soon

1 Answers  

---

1. Can we use the for loop this way? for(;i>5;) 2. What is the use of pointers? 3. what is array of pointer? 4. What is the difference between file and database? 5. Define data structure?

1 Answers  

---