Answer / avinash

DENIS RITCHE IN 1973,

Answer / billuyadav208

Dennis Ritchie

Answer / sanjaykuma

denni's reche in 1970 at at&tbell lab's

Answer / haritha

Dennis Ritche

Which of the following data structures is on average the fastest for retrieving data: 1) Binary Tree 2) Hash Table 3) Stack

3 Answers  

---

struct tag{ auto int x; static int y; };main() { struct tag s; s.x=4; s.y=5; printf(“%d”,s.x); }

2 Answers   Vector,

---

Explain bitwise shift operators?

0 Answers  

---

wat is output of the following int main() { const int j=2; int i; switch(i) { case 1:break; case j:break; default:break; } }

2 Answers  

---

What is null pointer constant?

0 Answers  

---

main() { int a=4,b=2; a=b<<a + b>>2; printf("%d", a); }

4 Answers   CTS,

---

What is a pointer in c plus plus?

0 Answers  

---

what is use of loop?

10 Answers   Infosys,

---

how does the C compiler interpret the following two statements p=p+x; q=q+y; a.p=p+x; q=q+y b.p=p+xq=q+y c.p=p+xq; q=q+y d.p=p+x/q=q+y

4 Answers   TCS,

---

c program to arrange digits in a no in ascending and descending order

1 Answers  

---

Function which gives a pointer to a binary trees const an integer value at each code, return function of all the nodes in binary tree.?

0 Answers   Infosys,

---

is c language is a object oreinted language?

5 Answers   TCS,

---