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

Is string null or empty?

973

---

Why do we need private constructor in c#?

947

---

How to rotate an Image in C#?

1172

---

what are implementation inheritance and interface inheritance?

988

---

Can we create instance of private class in c#?

959

---

What is an example of a delegate?

1005

---

Can you specify nested classes as partial classes?

1027

---

Why do I get a "cs5001: does not have an entry point defined" error when compiling?

1044

---

What does || mean in programming?

1065

---

Is a char?

925

---

What is string method in c#?

977

---

Define mutex in C#?

1108

---

What does the parsefloat function do?

965

---

Can datetime be null c#?

921

---

Is overriding of a function possible in the same class?

1015

---