Answer / vivin

A hashing function is a key-to-address transformation, which acts upon a given key to compute the relative position of the key in an array.
A simple hash function
HASH(KEY value)=KEYvalue MOD TABLESIZE

(ex) HASH(92)=92 MOD 10
=2

Here 10 is table size associated with records

Answer / sanjeevkumar.v

hashing table is used on C-language .first to give the
values and these are divide into 3. the values are
individually divided in the 3. the REMAINDER will be
considered at the TABLE . the columns are in

TABLE--0

TABLE--1

TABLE--2

these are in having hashing table........

pictorial diagram is used on the programming languages
and these are used in the .architecture of the function to
be view

What is a template?

7 Answers  

---

What is overriding vs overloading?

0 Answers  

---

namespace is working on which compiler?

3 Answers  

---

string is a class or data type in java?

3 Answers  

---

Why is oop better than procedural?

0 Answers  

---

What is new keyword in oops?

0 Answers  

---

What is multilevel inheritance in oop?

0 Answers  

---

//what is wrong with the programme?? #include<iostream.h> template <class first> class dd { first i; public: void set(); void print(); }; void dd< first>:: set() { cin>>i; } void dd< first>::print() { cout<<"\n"<<i; } void main() { dd <char>g; g.set(); g.print(); }

1 Answers  

---

what are abstract classes and how they impliment , with example

2 Answers  

---

In which Scenario you will go for Interface or Abstract Class?

1 Answers   InfoAxon Technologies,

---

Which is the best institute in hyderabad for C/C++ and it also has fast track course structure.

13 Answers   Wipro,

---

Is data hiding and abstraction same?

0 Answers  

---