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

What is the purpose of dictionary in c#?

958

---

List down the differences between public, static and void keywords?

915

---

What does .length do in c#?

1003

---

List out the differences between array and arraylist in c#?

1048

---

What is a linked list c#?

930

---

How big is int16?

994

---

What is thread.sleep()?

952

---

How are delegates chosen?

941

---

If a.equals(b) is true then a.gethashcode & b.gethashcode must always return same hash code.

1067

---

Name some string escape sequences in c#.

1093

---

Define Abstract Class in C#

1028

---

Define an assembly in .net?

1014

---

What is callback delegate in c#?

910

---

What do you mean by the delegate in c#?

960

---

Why to use “using” in c#?

1140

---