Answer / Govind Singh Patel

Zero-based addressing is a method used for indexing arrays or lists in computer programming. In this method, the first element of an array or list is stored at position 0, instead of 1. This makes the indices consistent with the mathematical notation for sequences and allows for easy use of loop constructs.

How to write a multi-statement macro?

1 Answers  

---

write a programme that inputs a number by user and gives its multiplication table.

2 Answers  

---

What are the salient features of c languages?

1 Answers  

---

what is the difference between NULL & NUL keywords in C?

3 Answers  

---

What is the memory allocated by the following definition ? int (*x)();

2 Answers   ADITI,

---

Write a program to find whether the given number is prime or not?

6 Answers  

---

What is the difference between getch() and getche()?

1 Answers   NSPL,

---

Why are all header files not declared in every c program?

1 Answers  

---

Which is best linux os?

1 Answers  

---

What are the types of pointers in c?

1 Answers  

---

What are the output(s) for the following ? #include char *f() {char *s=malloc(8); strcpy(s,"goodbye")} main() { char *f(); printf("%c",*f()='A'); }

1 Answers   Wilco,

---

Tell me when would you use a pointer to a function?

1 Answers  

---