Answer Posted / dhayalan.n

we will store the header node into some other variable, then traverse the list, if we get null at the next part of any node, then that is not circular, otherwise we will check the next node is same as the stored node or not, if so then that is circular

Is c++ harder than java?

1083

---

Name four predefined macros.

1053

---

Write a corrected statement in c++ so that the statement will work properly. if (4 < x < 11) y=2*x;

2021

---

Define what is constructor?

1074

---

Write an algorithm that determines whether or not an almost complete binary tree is a heap.

3933

---

What is the insertion operator and what does it do?

1055

---

Are strings immutable in c++?

1169

---

What are built-in functions? What is the syntax for the definition?

1094

---

Would you rather wait for quicksort, linear search, or bubble sort on a 200000 element array? (Or go to lunch...) a) Quicksort b) Linear Search c) Bubble Sort

1055

---

What is pair in c++?

1079

---

Explain one method to process an entire string as one unit?

1598

---

Carry out conversion of one object of user-defined type to another?

1052

---

Will a C compiler always compile C++ code a) Yes b) No c) Only optimized compilers

1064

---

Explain what you mean by a pointer.

1116

---

Explain the term memory alignment?

1251

---