Answer Posted / rani

Linked list has an overhead cost of maintaining reference
pointers it uses. They too consume lot of memory. And this
cost is more in case of doubly linked lists.

Linked lists always provide sequential access. While arrays
give random access.

Is void a keyword in c?

986

---

Can a variable be both static and volatile in c?

1044

---

Do pointers store the address of value or the actual value of a variable?

1083

---

Why is #define used?

1278

---

explain what are pointers?

1021

---

Is null always defined as 0(zero)?

1118

---

Which control loop is recommended if you have to execute set of statements for fixed number of times?

1351

---

What functions are used in dynamic memory allocation in c?

1088

---

What are pointers?

1117

---

What are the rules for identifiers in c?

1073

---

Take an MxN matrice from user and then sum upper diagonal in a variable and lower diagonal in a separate variables. Print the result

1910

---

Explain how do you override a defined macro?

1081

---

Create a structure to specify data on students given below: Roll number, Name, Department, Course, Year of joining Assume that there are not more than 450 students in the college. 1.write a function to print names of all students who joined in a particular year 2.write a function to print the data of a student whose roll number is given

3066

---

Can we replace the struct function in tree syntax with a union?

1312

---

Why is c faster?

1109

---