What is the difference between a declaration and a definition?

0 Answers  

---

Can we remove an element in a single linked list without traversing? Lets suppose the link list is like this 1 2 3 4 5 6 We need to remove 4 from this list (without traversing from beginning) and the final link list shud be 1 2 3 5 6 only thing we know is the pointer to element "4". How can we remove "4" and link "3" to "5"?

6 Answers   CSC,

---

Difference between pass by value and pass by reference?

0 Answers  

---

Which programming language's unsatisfactory performance led to the discovery of c++?

0 Answers  

---

How can you quickly find the number of elements stored in a dynamic array?

0 Answers  

---

Do the parentheses after the type name make a difference with new?

0 Answers  

---

Explain register storage specifier.

0 Answers  

---

Does c++ have finally?

0 Answers  

---

How many lines of code you have written for a single program?

4 Answers   BoA,

---

Find out the bug in this code,because of that this code will not compile....... #include <iostream> #include <new> #include <cstring> using namespace std; class balance { double cur_bal; char name[80]; public: balance(double n, char *s) { cur_bal = n; strcpy(name, s); } ~balance() { cout << "Destructing "; cout << name << "\n"; } void set(double n, char *s) { cur_bal = n; strcpy(name, s); } void get_bal(double &n, char *s) { n = cur_bal; strcpy(s, name); } }; int main() { balance *p; char s[80]; double n; int i; try { p = new balance [3]; // allocate entire array } catch (bad_alloc xa) { cout << "Allocation Failure\n"; return 1; }

2 Answers   Impetus,

---

const char * char * const What is the differnce between the above two?

11 Answers   TCS,

---

Assume an array of structure is in order by studentID field of the record, where student IDs go from 101 to 500. Write the most efficient pseudocode algorithm you can to find the record with a specific studentID if every single student ID from 101 to 500 is used and the array has 400 elements. Write the most efficient pseudocode algorithm you can to find a record with a studentID near the end of the IDs, say in the range from 450 to 500, if not every single student ID in the range of 101 to 500 is used and the array size is only 300

0 Answers  

---