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

3 Answers  

---

simple program for virtual function?

1 Answers  

---

A global variable when referred to in another file is declared as this a) local variable b) external variable c) constant d) pointers

0 Answers  

---

how to find out the union of two character arrays?

2 Answers  

---

int far *near * p; means

0 Answers   Honeywell,

---

what is difference between null and nul in c language

2 Answers  

---

Write a program to add a given duration with time(24hrs format)

1 Answers   Protech,

---

What is scanf () in c?

0 Answers  

---

what is the use of bitfields & where do we use them?

2 Answers  

---

Why is conio.h not required when we save a file as .c and use clrscr() or getch() ?

2 Answers  

---

What is indirection?

0 Answers  

---

char ch=10;printf("%d",ch);what is the output

14 Answers   Accenture,

---