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.

Write a c program to demonstrate character and string constants?

1693

---

hi send me sample aptitude papers of cts?

1665

---

shorting algorithmS

1811

---

What is the explanation for prototype function in c?

579

---

What is the best way of making my program efficient?

575

---

---

What is c definition?

760

---

What is %d called in c?

767

---

Explain how do you override a defined macro?

598

---

2) Write a program that will help Air Traffic Control for an airport to view the sequence of flights ready for take-off. The airport can accommodate 10 flights waiting for take-off at any point in time. Each flight has a unique 3 digit numeric identifier.  Each time a flight takes-off, Air Traffic Control adds a flight to the waitlist. Each time a flight is added to the waitlist, the list of flights waiting to take-off must be displayed.  When a flight is cleared for take-off, Air Traffic Control removes the flight from the waitlist. Each time a flight takes-off, the list of flights waiting to take-off must be displayed.  Sequence of take-off is the sequence of addition to the waitlist

2527

---

about c language

1614

---

What are the properties of union in c?

600

---

Which of these functions is safer to use : fgets(), gets()? Why?

643

---

Should I learn c before c++?

651

---

#define MAX(x,y) (x) >(y)?(x):(y) main() { inti=10,j=5,k=0; k= MAX(i++,++j); printf("%d..%d..%d",i,j,k); }

788

---

What would happen to X in this expression: X += 15; (assuming the value of X is 5)

1315

---