Home > Computer Engineering > Quizzes > Soft Computing: Genetic Algorithm
Soft Computing: Genetic Algorithm
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 26% Most missed: “The .....”
Soft Computing: Genetic Algorithm
Time left 00:00
25 Questions

1. .....- of bit involves changing bits from 0 to 1 and 1 to 0.
2. .... is the first operator applied on population.
3. ....-is the degree to which the better individuals are favoured
4. The ......
5. ....-is the degree to which the better individuals are favoured
6. ...... means that the element of DNA is modified.
7. Matrix crossover is also known as ....
8. The selection method which is less noisy is ....
9. .... mimics the behaviour of social insects
10. Crossover operator proceeds in ....- steps
11. The .....
12. The ....-causes all the bits in the first operand to the shifted to the left by the number of positions indicated by the second operand.
13. The ....-causes all the bits in the first operand to the shifted to the left by the number of positions indicated by the second operand.
14. ...... means that the genes from the already discovered good individuals are exploited
15. The space for all possible feasible solutions is called ......
16. In ......, inversion was applied with specified inversion probability p to each new individual when it is created.
17. The space for all possible feasible solutions is called ......
18. ....-selection is slow cooling of molten metal to achieve the minimum function value in a minimization problem.
19. In .....
20. ...... means that the element of DNA is modified.
21. ......performs linear inversion with a specified probability of 0.75.
22. Reproduction operator is also known as ...
23. Crossover operator proceeds in ....- steps
24. .... is the first operator applied on population.
25. The .....