Computer Science · Soft Computing
Arrange the following encoding schemes in Genetic Algorithms, prioritizing those specifically suitable for solving permutation problems (like Travelling Salesperson Problem): (A) Binary Encoding (B) Gray Coding (C) Permutation Encoding (D) Real-Valued Encoding
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(C), (D), (A), (B)✓
- 2(B), (A), (D), (C)
- 3(D), (C), (A), (B)
- 4(C), (A), (D), (B)
Correct answer
(C), (D), (A), (B)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Soft Computing MCQs →Want more practice questions on Soft Computing?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Soft Computing