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.

Explain what does the function toupper() do?

1071

---

Why doesn't C support function overloading?

2749

---

What are the two types of structure?

1083

---

What happens if a header file is included twice?

1034

---

How does struct work in c?

1081

---

What is a constant?

1058

---

c language supports bitwise operations, why a) 'c' language is system oriented b) 'c' language is problem oriented c) 'c' language is middle level language d) all the above

1040

---

Hello. How to write a C program to check and display president party like if i type in the console "biden" and hit enter the output shoud be : "biden is democrat" and if i type "trump" and hit enter the output shoud be: "trump is republican"

2075

---

What is 'bus error'?

1144

---

Which one to choose from 'initialization lists' or 'assignment', for the use in the constructor?

1085

---

Can we assign string to char pointer?

1098

---

Explain how do you declare an array that will hold more than 64kb of data?

1446

---

Is main is user defined function?

1141

---

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

1304

---

What is the role of this pointer?

1070

---