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.

What are the c keywords?

1207

---

What are valid operations on pointers?

1203

---

What is array of structure in c programming?

1292

---

Why is c called a mid-level programming language?

1211

---

Write a function which takes as parameters one regular expression(only ? and * are the special characters) and a string and returns whether the string matched the regular expression.

1103

---

What does %p mean c?

1074

---

If i have an array 0 to 99 i.e,(Size 100) I place the values 1 to 100 randomly like a[0]=29,a[1]=56 upto array[99].. the values are only between 1 to 100. getting the array values by using scanf.. If i entered one wrong element value line a[56]=108. how can i find it.. and also how to find the missing value in 1 to 100.. and i want to replace the missing values.. any one of them know please post your answer..

2023

---

what is the role you expect in software industry?

2154

---

What is the difference between a function and a method in c?

1088

---

What is the heap in c?

1085

---

List some basic data types in c?

1030

---

What is hashing in c language?

1322

---

What is modifier & how many types of modifiers available in c?

1032

---

What is the incorrect operator form following list(== , <> , >= , <=) and what is the reason for the answer?

1474

---

What is far pointer in c?

1318

---