Answer:
hello the options to your question is incomplete below are the options
A.
Linear probing causes secondary collisions.
B. Higher space utilization tends to cause more collisions.
C. Chained entries will be ordered by key.
D. (a) and (b).
E. All of the above.
answer : (a) and (b) --- D
Explanation:
The true statements about collisions in hashing are ;Linear probing causes secondary collisions and Higher space utilization tends to cause more collisions.
collisions in hashing is when two data sets whom are distinctively different have the same hash value or checksum. the collision in hashing can be resolved by checking the hash table for an open slot to keep the data set that caused the collision.
It will be the performance tab.
Answer:
Answered below
Explanation:
# Program is written in Java
class WeekHours{
double school;
double fun;
double sleep;
double sports;
WeekHours( ){
school = 0.0;
fun = 0.0;
sleep = 0.0;
sports = 0.0;
}
public void setSchool ( double x){
school = x;
}
public void setFun( double y){
fun = y;
}
public void setSleep( double w){
sleep = w;
}
public void setSports( double z){
sports = z;
}
public void totalHours(){
double tHours = school + fun + sleep + sports;
System.out.print(tHours);
}
}
