Computer Science · Soft Computing
Match List-I (Genetic Algorithm Encodings) with List-II (Best Application / Property): List-IList-II A. Binary EncodingI. Uses a string of bits (0s and 1s) to represent solutions B. Real-valued EncodingII. Suitable for continuous optimization domains without discretization C. Permutation EncodingIII. Used in ordering/sequencing problems like the Traveling Salesperson Problem (TSP) D. Gray EncodingIV. Reduces Hamming cliff/distance errors where adjacent integers differ by one bit Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A-I, B-IV, C-III, D-II
- 2A-III, B-IV, C-II, D-I
- 3A-II, B-I, C-IV, D-III
- 4A-I, B-II, C-III, D-IV✓
Correct answer
A-I, B-II, C-III, D-IV
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