Question 12
A word is said to be perfect if no letter is repeated. Let isPerfect be a procedure that takes a row X in the “Words” table as input and decides whether the word is perfect. Choose the correct implementation of the procedure isPerfect.
A word is said to be perfect if no letter is repeated. Let isPerfect be a procedure that takes a row X in the “Words” table as input and decides whether the word is perfect. Choose the correct implementation of the procedure isPerfect.
Correct answer
Question 12 of 27 in the IIT Madras BS Computational Thinking (Computational Thinking (CT)) End Term paper sat on 3 Apr 2022, in the January 2022 term (IIT M FOUNDATION DIPLOMA ENDTERM FN1 3 Apr 2022). It carries 5 marks.