Coding-Decoding
Coding-Decoding is a Aptitude concept from the MPSC syllabus, tested in 22 past MPSC questions across 9 exam years between 2013 and 2025. Below are those real questions with their correct answers and explanations, plus the concepts worth being comfortable with first.
📅 Today's Daily Challenge
Five fresh MPSC questions, the same for everyone today — free, no signup.
Asked in
What you need to know first
Real questions that test this
खालील प्रश्नात @, $, φ व # या चिन्हांचा पुढीलप्रमाणे उपयोग केला आहे. A φ B म्हणजे A हा B पेक्षा मोठा नाही A $ B म्हणजे A हा B पेक्षा लहान किंवा समान नाही A @ B म्हणजे A हा B पेक्षा मोठा किंवा समान नाही A # B म्हणजे A हा B पेक्षा लहान नाही विधान : H φ D, T $ D, F $ H अनुमाने : (I) F φ D (II) T # F (III) D $ F कोणते अनुमान/अनुमाने सत्य आहे? In following question, the symbols @, $, φ and # are used as follows. A φ B means A is not greater than B A $ B means A is neither smaller than or equal to B A @ B means A is neither greater than or equal to B A # B means A is not smaller than B Statement : H φ D, T $ D, F $ H Conclusions : (I) F φ D (II) T # F (III) D $ F Which conclusion/conclusions are true?
Decode symbols: φ = ≤, $ = >, @ = <, # = ≥. Statements: H ≤ D, T > D, F > H. Combining gives F > H ≤ D < T. Check conclusions: (I) F ≤ D is False, (II) T ≥ F is False, (III) D > F is False. Thus, none are true.
एका शब्द संयोजन यंत्रास जेव्हा शब्दांची एक ओळ इनपुट म्हणून दिली जाते, त्यावेळी ते यंत्र त्या ओळीला एका पायरीत एका विशिष्ट नियमानुसार व्यवस्थित संयोजित करते. खाली इनपुट म्हणून दिलेली माहिती व संयोजनाच्या पायऱ्या दिलेल्या आहेत. इनपुट → NO, GO, Fit, COUNTER, FORCE, I, TURN, NET पायरी I → I, NO, GO, Fit, COUNTER, FORCE, TURN, NET पायरी II → I, GO, NO, Fit, COUNTER, FORCE, TURN, NET पायरी III → I, GO, NO, Fit, NET, COUNTER, FORCE, TURN पायरी IV → I, GO, NO, Fit, NET, TURN, COUNTER, FORCE पायरी V → I, GO, NO, Fit, NET, TURN, FORCE, COUNTER जर इनपुट “Class, Rat, An, UP, PEN, TRUE” असेल तर, “An, UP, Class, Rat, PEN, TRUE” हे कोणत्या पायरीत येईल ? When a line of words is given as an input to a word-processing machine, the machine rearranges the line in a step by a definite rule. The input and the steps of re-arrangements are given below : Input → NO, GO, Fit, COUNTER, FORCE, I, TURN, NET Step I → I, NO, GO, Fit, COUNTER, FORCE, TURN, NET Step II → I, GO, NO, Fit, COUNTER, FORCE, TURN, NET Step III → I, GO, NO, Fit, NET, COUNTER, FORCE, TURN Step IV → I, GO, NO, Fit, NET, TURN, COUNTER, FORCE Step V → I, GO, NO, Fit, NET, TURN, FORCE, COUNTER If the input is, “Class, Rat, An, UP, PEN, TRUE” then, “An, UP, Class, Rat, PEN, TRUE” will be in what step ?
Observe the rearrangement pattern in the input-output machine: words are arranged based on specific criteria (such as length or alphabetical order). Tracing the steps for the given input yields the required step.
69. खालील अक्षर त्रिकोणावरून ती व्यवस्था काय आहे ते ओळखा. त्या व्यवस्थेच्या आधारावर सर्वात खालच्या ओळीवर तुमच्या उजवीकडून तिसरे अक्षर कोणते ? From the following alphabet triangle find out what that system is. On the basis of the system, which is the third letter on the base line from your right ?
Decoding the alphabet triangle pattern row by row reveals the structured arrangement, and tracing the path to the third letter from the right on the base line gives F.
खालील कोष्टकात गणितीय चिन्हांची नवी परिभाषा दिली आहे. — | + | ÷ | × | = | > | < --------------------------- A | E | C | D | F | G | B वरील कोष्टकाला अनुसरून खालील पर्यायांपैकी कोणते उत्तर अचूक आहे ते ठरवा. Some mathematical symbols are represented in a new notation by letters as shown in the following table. — | + | ÷ | × | = | > | < --------------------------- A | E | C | D | F | G | B Choose the correct expression from the following alternatives.
Substituting the letters back to their mathematical symbols according to the table and evaluating each option using BODMAS shows that option 4 forms a valid mathematical equation.
एका सांकेतिक भाषेत COMPUTER ला LNBVQSFU असे लिहिले जाते. तर त्याच भाषेत BULKHEAD कसे लिहिता येईल ? In a code language COMPUTER is written as LNBVQSFU. How BULKHEAD will be written in that code language ?
Each letter in COMPUTER is shifted backward or forward in a specific pattern to form LNBVQSFU. Applying the same positional coding logic to BULKHEAD gives the correct alternative.