At the end of the execution of the given procedure on the “Words” dataset, what will A represent? This is a Multiple Choice Question (MCQ)Step 1. Arrange all cards in a single pile called Pile 1Step 2. Maintain two variables A, B and initialize A to 1000 and B to 0Step 3. If Pile 1 is empty then stop the iterationStep 4. Read the top card in Pile 1Step 5. Add Letter Count to variable BStep 6. If Word does not end with a full stop then execute Step 9Step 7. If Word ends with a full stop and B < A then store B in AStep 8. Re-initialize the variable B to 0Step 9. Move the current card to another pile called Pile 2 and repeat from Step 3
Question
At the end of the execution of the given procedure on the “Words” dataset, what will A represent? This is a Multiple Choice Question (MCQ)Step 1. Arrange all cards in a single pile called Pile 1Step 2. Maintain two variables A, B and initialize A to 1000 and B to 0Step 3. If Pile 1 is empty then stop the iterationStep 4. Read the top card in Pile 1Step 5. Add Letter Count to variable BStep 6. If Word does not end with a full stop then execute Step 9Step 7. If Word ends with a full stop and B < A then store B in AStep 8. Re-initialize the variable B to 0Step 9. Move the current card to another pile called Pile 2 and repeat from Step 3
Solution
The variable A will represent the smallest letter count of a word that ends with a full stop in the "Words" dataset.
Here's the step-by-step explanation:
- All cards are arranged in a single pile called Pile 1.
- Two variables A and B are initialized, with A starting at 1000 and B at 0.
- The procedure stops if Pile 1 is empty.
- The top card in Pile 1 is read.
- The letter count of the word on the card is added to variable B.
- If the word does not end with a full stop, the procedure jumps to Step 9.
- If the word does end with a full stop and the value of B (the letter count of the word) is less than A (which started at 1000), then B is stored in A. This means A now holds the letter count of the shortest word that ends with a full stop.
- Variable B is re-initialized to 0.
- The current card is moved to another pile called Pile 2 and the procedure repeats from Step 3.
So, at the end of the procedure, A will hold the smallest letter count of a word that ends with a full stop.
Similar Questions
What will (A–B) represent after execution of the following procedure using the “Shopping Bills” dataset? (MCQ)Step 1 : Arrange all cards in a single pile called Pile 1Step 2 : Initialize variables A and B to 0Step 3 : If Pile 1 is empty then stop the iterationStep 4 : Read the top card in Pile 1Step 5 : If the bill contains an item “Bananas” then add 1 to variable AStep 6 : If Total < 600 and the bill contains an item “Bananas” then add 1 to variable BStep 7 : Move the current card to another pile called Pile 2 and repeat from Step 3
At the end of the execution of the given procedure on the “Scores” dataset, what will A and B represent? (MCQ)Step 1. Arrange all cards in a single pile called Pile 1Step 2. Maintain two variables A, B and initialize A to 101 and B to 0.Step 3. If Pile 1 is empty then stop the iterationStep 4. Read the top card in Pile 1Step 5. If A > Chemistry marks , then store Chemistry marks in AStep 6. If B < Mathematics marks, then store Mathematics marks in BStep 7. Move the current card to another pile called Pile 2 and repeat from Step 3
What will be the value of X after the execution of the following procedure using the “Scores” dataset? (MCQ)(Note: Consider the same sequence as given in the Scores datasets)Step 1: Arrange all cards in a single pile called Pile 1Step 2: Maintain variables A, B, C, D, Y and Initialize them all to 0 except Y. Initialize Y to 100Step 3: Maintain a variable X and initialize it to “None”Step 4: If Pile 1 is empty then stop the iterationStep 5: Read the top card in Pile 1Step 6: If the Town/City is “Chennai” then add one to A. If A < Y then store A in Y and “Chennai” in XStep 7: If the Town/City is “Bengaluru” then add one to B. If B < Y then store B in Y and “Bengaluru” in XStep 8: If the Town/City is “Madurai” then add one to C. If C < Y then store C in Y and “Madurai” in XStep 9: If the Town/City is “Vellore” then add one to D. If D < Y then store D in Y and “Vellore” in XStep 10: Move the current card to another pile called Pile 2 and repeat from Step 4Chennai
The following pseudocode is executed using the “Scores” dataset. Step 1: Arrange all cards in a single pile called Pile 1 Step 2: Initialize variables A and B to 1000 Step 3: If Pile 1 is empty then stop the iteration Step 4: Read the top card in Pile 1 Step 5: If Mathematics marks < A then store Mathematics marks in A Step 6: If Physics marks < B then store Physics marks in B Step 7: Move the current card to another pile called Pile 2 and repeat from step 3What is the value of A + B?
The following procedure took data from the “Scores” dataset and A represents the number of male students whose Physics marks are less than the Mathematics marks but equal to their Chemistry marks. The programmer may have made mistakes in one or more steps. Identify all such steps (if any). It is a Multiple Select Question (MSQ).Step 1 : Arrange all cards in a single pile called Pile 1Step 2 : Initialize variable A to 1Step 3 : If Pile 1 is empty then stop the iterationStep 4 : Read the top card in Pile 1Step 5 : If Gender is ‘M’ and Physics marks = Mathematics marks and Chemistry marks > Physics marks then add 1 to AStep 6 : Move the current card to another pile called Pile 2 and repeat from Step 3
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.