Answer / pushpendra

array is faster than pointer because accessing array elements
by pointers always faster.there is used one array and more pointer.we know pointer is a "value at address".
so pointers stores only address of variable but arrays are stores similar data types.

Answer / andeep singh

Pointer is faster than array if there is only one pointer used

Answer / narendra

arrays are very faster because it stores a sequential


block of memory and similar data types

pointers stores only adders of variable

but arrays are stores similar data types

Answer / s

i think pointers are faster if we talk in terms of element
addition and deletion,the priomary req..

Answer / sandeep

when compared pointers work fast ,beacause:
1.array too is pointer
eg:char s[20];
gets(s);
here we are supplying base address.
2.array notation will be inter coverted as pointers
where we can directly use pointers.

sir, i cannot find the way how to write aprogram by using array on queue

1 Answers   IISIT,

---

Explain what does the function toupper() do?

0 Answers  

---

How can a number be converted to a string?

1 Answers  

---

we have to use realloc only after malloc or calloc ? or we can use initially with out depending on whether we are using malloc or calloc in our program ?

2 Answers  

---

main() { int l=6; switch(l) { default:l=l+2; case 4:l=4; case 5:l++; break; } printf("%d",l); }

1 Answers  

---

---

how can we Declare a variable in c without defining it.

1 Answers   TCS,

---

program to find the magic square

1 Answers   Infosys,

---

Explain how can a program be made to print the line number where an error occurs?

0 Answers  

---

What is the size of empty structure in c?

0 Answers  

---

How can you allocate arrays or structures bigger than 64K?

0 Answers  

---

write a C program to print the program itself ?!

16 Answers   TCS,

---

#include<stdio.h> #include<conio.h> void main() { char ch='\356'; printf("%d",ch); } o/p=-18 why?plz.explain

2 Answers  

---