Answer Posted / naga samrat chowdary narla

In both these data structures you require index to access the element(s). in case of hash table we use hash function to calculate the index from key.

one more we can say with respect to time complexity for insert, delete and search

Thanks,
Naga Samrat Chowdary, Narla

Define encapsulation?

1036

---

How do I declare inout arguments in c#?

887

---

Explain the three services model (three-tier application). Presentation (ui), business (logic and underlying code) and data (from storage or other sources).

854

---

What does out mean in c#?

870

---

Define collections?

879

---

Is java better than c sharp?

901

---

Explain copy constructor?

1087

---

What are the advantages of using delegates in c#?

863

---

Explain about Error handling and how this is done

895

---

What are the applications of c#?

1561

---

I have 3 overloaded constructors in my class. In order to avoid making instance of the class do I need to make all constructors to private?

907

---

What is tryparse?

877

---

What is the differences between datagrid, datalist and repeater in .net?

924

---

What is a method c#?

899

---

What are the steps to create a webservice and consume it?

865

---