Answer Posted / jyoti

1.In case of array storing is easy and simple rather than
that of linked list because linked list need more space to
store same amount of data than amount of memory required by
array.
2.In case of linked list operations like
insertion,deletion,merging etc are easy than that of array.
3.Size of array is predefined but in case of linked list it
is defined at run time.
4.Array is randomly accessed but list is sequentially
accessed only.
5There is problem of memory wastage in case of array.

a number whose only prime factors are 2,3,5, and 7 is call humble number,,write a program to find and display the nth element in this sequence.. sample input : 2,3,4,11,12,13, and 100.. sample output : the 2nd humble number is 2,the 3rd humble number is 3,the 4th humble number is ,the 11th humble number is 12, the 12th humble number is 14, the 13th humble number is 15, the 100th humble number is 450.

5061

---

How can I make sure that my program is the only one accessing a file?

1262

---

Are enumerations really portable?

1025

---

Are the outer parentheses in return statements really optional?

1113

---

What are the features of c languages?

1101

---

How do I get an accurate error status return from system on ms-dos?

1120

---

which is an algorithm for sorting in a growing Lexicographic order

1801

---

Is calloc better than malloc?

1015

---

Which operators cannot be overloaded a) Sizeof b) .* c) :: d) all of the above

1139

---

What is class and object in c?

1116

---

which of the following statement is wrong a) mes=123.56; b) con='T'*'A'; c) this='T'*20; d) 3+a=b;

3253

---

Why & is used in c?

1186

---

What is the right way to use errno?

1049

---

What type is sizeof?

1037

---

Are negative numbers true in c?

1061

---