Community presentation

Computational Thinking for Teachers - DAV / CBSE Training Handbook

COMPUTATIONAL THINKING FOR TEACHERS DAV / CBSE Training Handbook A bilingual professional-learning handbook Hindi + English | Teacher Training Edition Prepared for DAV / CBSE te…

Shared by Rajat JaiswalOct 26, 20263 views0 likes14 slides

Create your own version

Use this visual direction as inspiration for a new Presenton deck.

Use this design

Slide 01

The idea behind this presentation

COMPUTATIONAL THINKING FOR TEACHERS DAV / CBSE Training Handbook A bilingual professional-learning handbook Hindi + English | Teacher Training Edition Prepared for DAV / CBSE teacher development Reference framework: NEP 2020, NCF-SE 2023 and CBSE curriculum resources How to Use This Handbook | इस पुस्तक का उपयोग This handbook is designed for teacher learning, workshop facilitation and classroom planning. It is a practical training resource, not an official DAV or CBSE publication. Verify current circulars, prescribed grade-wise outcomes and local school instructions before using it as a compliance document. • Read each chapter and connect the concept to a real classroom problem. • Try the unplugged activity before introducing a computer or coding tool. • Use the reflection prompts to discuss how students reason, not only whether they reach the correct answer. • Use the sample lesson plans as adaptable models; adjust for grade, language, accessibility and available materials. Contents | विषय-सूची 1. Foundations of Computational Thinking 2. The Four Pillars of CT 3. Algorithms, Flowcharts and Pseudocode 4. Unplugged Activities for Every Classroom 5. CT Across Subjects 6. CT in Computer Science and Coding 7. Artificial Intelligence Literacy and Responsible Use 8. Lesson Planning and Facilitation 9. Assessment, Rubrics and Evidence of Learning 10. Inclusive Pedagogy and Differentiation 11. Teacher Workshop Plan 12. Question Bank and Answer Key 13. Glossary and Further Reading Chapter 1 — Foundations of Computational Thinking Learning outcomes • Define Computational Thinking (CT) in accessible language. • Explain why CT is broader than programming. • Identify everyday problems that can be approached systematically. Definition | परिभाषा Computational Thinking is a problem-solving approach that uses strategies such as decomposition, pattern recognition, abstraction and algorithm design to understand problems and develop, test and improve solutions. कम्प्यूटेशनल थिंकिंग समस्या को समझने, छोटे भागों में बाँटने, समानताओं को पहचानने, आवश्यक जानकारी चुनने और चरणबद्ध समाधान तैयार करने की व्यवस्थित प्रक्रिया है। What CT is—and is not CT is… CT is not… A way to frame, analyse and solve problems. Only typing code or using a computer. Useful in many subjects and everyday life. A fixed recipe that always has one answer. A process that can include testing and revision. Memorising technical terms without reasoning. Why it matters in school CT helps learners explain their reasoning, organise information, identify regularities, design clear procedures and evaluate whether a solution works. These capabilities can support learning in mathematics, science, languages, social science, arts and digital technology. Teacher reflection Choose one recurring school problem—late submissions, organising a school event, analysing common errors or planning a class trip. What information is needed? What smaller tasks exist? What would count as a successful solution? Chapter 2 — The Four Pillars of CT Pillar Meaning Classroom example Prompt for learners Decomposition Break a complex task into smaller parts. Plan an examination: timetable, papers, rooms, invigilation, results. What smaller tasks make up this problem? Pattern recognition Find similarities, repetitions or trends. Compare several assessments to identify a recurring misconception. What is repeating or similar? Abstraction Focus on relevant information and leave out unnecessary detail. A bus-route map shows stops and directions, not every building. Which details matter for this goal? Algorithm design Create clear, ordered steps for a task. Write the steps for checking attendance or solving a type of problem. What steps should happen, and in what order? Distinguishing the pillars • Divide / break into parts → Decomposition. • Find repeated features / similarities → Pattern recognition. • Keep essential details / simplify a model → Abstraction. • Specify ordered instructions / decisions → Algorithm design. Important nuance Real tasks may use several pillars together. For example, analysing student results may involve decomposing the work, recognising trends, abstracting irrelevant details and designing a repeatable analysis procedure. Identify the main thinking move in the question. Worked example: School assembly 14. Decomposition: split the assembly into prayer, announcements, student contribution and closing. 15. Pattern recognition: identify which sequences and time allocations have worked well before. 16. Abstraction: keep the essential activities, time and responsibilities in the plan. 17. Algorithm design: specify the order, transitions and what happens if a speaker is absent. 18. Testing and iteration: try the plan, observe timing and revise it. Chapter 3 — Algorithms, Flowcharts and Pseudocode What is an algorithm? An algorithm is a finite, ordered set of clear instructions for completing a task or solving a problem. Good algorithms specify inputs, steps, decisions and expected outputs where relevant. Example: Check whether a score meets a threshold 19. Input the student's percentage. 20. If percentage is at least 40, label it 'Meets threshold'. 21. Otherwise, label it 'Below threshold'. 22. Display the label. Pseudocode INPUT percentage IF percentage >= 40 THEN OUTPUT 'Meets threshold' ELSE OUTPUT 'Below threshold' END IF Common flowchart symbols Symbol (described) Typical use Oval Start or end Rectangle Process or action Diamond Decision with branches such as Yes/No Parallelogram Input or output Arrow Direction of flow Quality checklist • Are the instructions unambiguous? • Is the order logical? • Are all important cases covered? • Does each decision have a clear outcome? • Can another person follow the steps and get the intended result? • Has the algorithm been tested with ordinary and unusual examples? Chapter 4 — Unplugged Activities Unplugged activities teach CT without requiring computers. They are useful for movement, discussion, collaboration and making invisible reasoning visible. Activity A: Human Robot Goal: practise precise instructions and debugging. Materials: classroom objects and a safe open path. One learner acts as a robot; a partner gives one-step commands to reach a destination. The robot follows instructions literally. The pair revises ambiguous commands and tests again. • CT focus: algorithms, sequencing and debugging. • Discussion: Which instruction caused the robot to fail? How could it be made precise? • Safety: keep movement slow, avoid obstacles and never blindfold participants. Activity B: Pattern Detectives Provide number sequences, shapes, word endings, musical rhythms or examples from a science topic. Learners group examples, explain the pattern and test whether new examples fit. Include a counterexample so they do not overgeneralise. • CT focus: pattern recognition and evidence-based reasoning. • Assessment: ask learners to state the rule and give one example that does not fit. Activity C: Design a School Route Map Learners draw a simplified map showing important stops and directions for a school visitor. They decide what information is essential for the user and omit irrelevant detail. • CT focus: abstraction and representation. • Assessment: can another learner navigate using the map? Activity D: Sort and Search Give teams a set of cards containing names, numbers or objects. Ask them to agree on a sorting rule and then find a specified item. Compare strategies and discuss when one strategy is more efficient. • CT focus: decomposition, rules, search strategies and efficiency. • Extension: compare linear search with searching a sorted list. Chapter 5 — CT Across Subjects Subject Example task CT opportunity Mathematics Find a strategy for solving word problems. Break the problem down; notice number relationships; describe steps. Science Plan an investigation into which material absorbs more water. Identify variables, record observations, look for patterns, test claims. Languages Organise a story into a coherent sequence. Identify components, detect narrative patterns, design and revise a sequence. Social Science Compare settlement or climate data. Choose relevant variables, find trends and represent evidence. Art and Music Create a repeating motif or rhythm. Recognise patterns, specify rules and test variations. Physical Education Design a fair round-robin tournament. Decompose fixtures, identify constraints and create a schedule. Computer Science Write a program to classify scores. Translate a rule into steps, conditions and tests. Interdisciplinary planning prompt Start with the subject learning outcome, not with a CT label. Ask: What reasoning will learners need to make visible? Which CT strategy naturally supports the subject goal? What evidence will show learning? Chapter 6 — CT in Computer Science and Coding From algorithm to program A program expresses an algorithm in a programming language. Coding can make CT processes executable, but learners should still explain the problem, inputs, assumptions, logic and tests. Example in Python score = float(input('Enter percentage: ')) if score >= 40: print('Meets threshold') else: print('Below threshold') Testing the program Test input Expected output 39 Below threshold 40 Meets threshold 75.5 Meets threshold Debugging routine 23. Reproduce the problem. 24. Describe the expected and actual result. 25. Locate the smallest step or condition that may be wrong. 26. Change one thing at a time. 27. Test the original case and other relevant cases. 28. Explain what was learned. Teaching caution Avoid assessing CT only through code correctness. A learner may demonstrate strong algorithmic reasoning without advanced syntax; another learner may produce working code by imitation without understanding the logic. Use explanation, tracing, testing and revision as evidence. Chapter 7 — AI Literacy and Responsible Use CT and AI CT supports the framing of problems, representation of information, testing of procedures and evaluation of outputs. AI literacy adds understanding of what AI systems can and cannot do, the role of data, uncertainty, bias, privacy and human oversight. Core ideas • AI outputs can be plausible but incorrect; verify important claims. • Data selection and quality can affect system behaviour. • Examples may contain bias or fail to represent every group fairly. • Protect personal and sensitive information; follow school policies and age-appropriate safeguards. • Use AI as a support for learning, not as a substitute for learner reasoning or teacher judgement. • Make it clear when AI has been used if the task or school policy requires disclosure. Classroom activity: Evaluate an AI answer 29. Give learners a question with an answer generated by an AI tool or a teacher-created sample. 30. Ask learners to identify claims that can be checked. 31. Verify claims against reliable sources or subject materials. 32. Look for missing context, bias or unsupported certainty. 33. Revise the answer and explain the evidence for the revision. Do not upload identifiable student data or confidential school records into an AI service unless the service and use are approved under applicable policy. Chapter 8 — Lesson Planning and Facilitation A practical 40-minute lesson structure Time Teacher and learner activity Evidence 5 min Launch a relatable problem; elicit prior knowledge. Learners describe the problem. 8 min Model a thinking strategy aloud. Learners identify the strategy. 15 min Teams solve a task using paper, cards or a suitable tool. Plans, diagrams, explanations. 7 min Teams test and compare solutions. Test cases and revisions. 5 min Exit ticket and reflection. Individual response showing understanding. Sample lesson plan: Human Robot Target group: adaptable for upper primary or middle school. Duration: 40 minutes. Materials: direction cards, tape or paper markers, open floor space. • Learning objective: learners will write and test precise step-by-step instructions. • Success criteria: instructions are ordered, unambiguous, safe and lead to the destination. • Introduction: discuss why a person might misunderstand vague directions. • Model: demonstrate a short route using forward, turn left, turn right and stop. • Group task: one learner writes instructions, another follows them literally, and an observer records errors. • Reflection: revise instructions and explain how testing helped. • Differentiation: provide icon cards or a shorter route; extend by adding obstacles or a decision point. Facilitator prompts • What are you trying to achieve? • What information or materials do you need? • Can the problem be divided further? • What rule or pattern did you notice? • What information can safely be ignored? • How will you know the solution works? • What would happen in an unusual case? Chapter 9 — Assessment and Rubrics Formative assessment Use observation, think-alouds, learner explanations, diagrams, peer review, exit tickets and test cases. Give feedback on the reasoning process, not only on the final answer. Sample four-level rubric Criterion 4 — Strong 3 — Secure 2 — Developing 1 — Beginning Problem framing Clearly identifies goal and constraints. Identifies goal and most constraints. Goal partly clear; constraints missed. Needs substantial support to define task. CT strategy Selects and explains suitable strategy. Uses suitable strategy with minor gaps. Uses strategy inconsistently. Strategy not yet evident. Solution quality Clear, logical and handles cases. Mostly clear and workable. Some gaps or ambiguity. Difficult to follow or incomplete. Testing and revision Tests, explains results and improves. Tests and makes a useful correction. Limited testing or explanation. No meaningful testing yet. Adapt rubric language to the grade level and subject. Do not use it as a fixed high-stakes score without local review. Exit ticket 34. Name the CT strategy you used today. 35. Describe one decision you made and why. 36. Show one test or piece of evidence that your solution works. 37. State one improvement you would make. Chapter 10 — Inclusive Pedagogy and Differentiation • Offer multiple ways to represent a problem: words, pictures, objects, diagrams or spoken explanation. • Allow learners to demonstrate reasoning orally, in writing, through cards or through code where appropriate. • Use mixed-ability groups with rotating roles so every learner participates. • Break instructions into manageable chunks and provide visual supports when helpful. • Offer extensions that increase complexity rather than merely adding more of the same work. • Check that examples are culturally relevant and do not assume every learner has a device or reliable internet. Equity check Ask whose perspective is represented in a dataset or example, whose needs are missing and whether a solution works for learners with different circumstances. Chapter 11 — Suggested Teacher Workshop Plan Session Focus Participant output 1 CT foundations and four pillars Annotated examples and concept map 2 Unplugged learning One activity tried and reflected on 3 Interdisciplinary design A subject-linked CT task 4 Algorithms and coding Algorithm, pseudocode or flowchart 5 AI literacy and ethics AI output evaluation checklist 6 Assessment and action planning Rubric, exit ticket and classroom action plan Workshop norms • Model the learner experience before discussing theory. • Make thinking visible through diagrams and explanations. • Treat mistakes as information for debugging. • Encourage more than one valid strategy where appropriate. • Close with a concrete next step and evidence to collect. Chapter 12 — Question Bank Choose the best answer. The answer key follows the questions so the material can be used for self-study or a training workshop. 1. Breaking a large task into smaller manageable tasks is: A. Abstraction B. Decomposition C. Pattern recognition D. Evaluation 2. Finding that the same misconception appears across several assessments is: A. Pattern recognition B. Decomposition C. Coding D. Storage 3. Keeping only route stops and directions on a map demonstrates: A. Testing B. Decomposition C. Abstraction D. Iteration 4. A clear ordered set of instructions is a/an: A. Dataset B. Algorithm C. Pattern D. Model bias 5. Why test an algorithm? A. To decorate it B. To check whether it works across cases C. To avoid explaining it D. To make it longer 6. CT is best described as: A. Only programming B. A systematic problem-solving approach C. Only mathematics D. Memorising symbols 7. When an algorithm gives a wrong result, a useful response is to: A. Hide the result B. Debug and retest C. Stop testing D. Change many things at once 8. Which is good AI practice? A. Assume every answer is true B. Upload confidential student data freely C. Verify important outputs D. Ignore bias 9. A strong CT assessment should consider: A. Only speed B. Only final answer C. Reasoning, solution and testing D. Handwriting alone 10. CT across subjects should begin with: A. A random coding app B. The subject learning outcome and reasoning needed C. A device requirement D. A vocabulary test only Answer key with brief explanations • 1. B — Decomposition divides a complex task into smaller parts. • 2. A — Pattern recognition identifies recurring similarities or trends. • 3. C — Abstraction retains relevant details and omits unnecessary ones. • 4. B — An algorithm specifies ordered instructions. • 5. B — Testing checks correctness and reveals edge cases or errors. • 6. B — CT is broader than coding and supports systematic problem-solving. • 7. B — Debugging identifies and corrects the cause, followed by retesting. • 8. C — Important AI outputs need verification and critical evaluation. • 9. C — Process evidence helps reveal whether learners understand the reasoning. • 10. B — CT should support genuine subject learning rather than replace it. Chapter 13 — Glossary Term Hindi meaning / explanation Computational Thinking कम्प्यूटेशनल थिंकिंग; व्यवस्थित समस्या-समाधान Decomposition समस्या को छोटे भागों में बाँटना Pattern recognition समानताओं और दोहराव की पहचान Abstraction उद्देश्य के लिए आवश्यक जानकारी पर ध्यान देना Algorithm किसी कार्य के लिए स्पष्ट, क्रमबद्ध निर्देश Pseudocode प्रोग्राम जैसी संरचना में लिखे गए अनौपचारिक निर्देश Flowchart प्रक्रिया को प्रतीकों और तीरों से दर्शाना Debugging त्रुटि ढूँढना, सुधारना और दोबारा जाँचना Iteration प्रतिक्रिया या परीक्षण के आधार पर सुधार दोहराना Data bias डेटा या प्रक्रिया में ऐसा झुकाव जो परिणामों को अनुचित रूप से प्रभावित करे Formative assessment सीखने के दौरान प्रगति समझने के लिए मूल्यांकन Unplugged activity डिजिटल उपकरण के बिना की जाने वाली सीखने की गतिविधि Further Reading and Official Resources • National Education Policy 2020 — Ministry of Education, Government of India: https://www.education.gov.in/ • National Curriculum Framework for School Education 2023 — Ministry of Education: https://www.education.gov.in/sites/upload_files/mhrd/files/ncf_2023.pdf • CBSE Academic — curriculum, circulars and academic resources: https://cbseacademic.nic.in/ • UNESCO — guidance and resources on AI in education: https://www.unesco.org/en/digital-education Source-use note: This handbook provides a teacher-facing synthesis and practical examples. Curriculum details, grade-specific expectations, circular dates and implementation requirements can change. Consult the latest official documents and school instructions before making formal compliance claims. Personal Action Plan | व्यक्तिगत कार्ययोजना Within 2 weeks Action Try Teach one unplugged CT activity. Collect Keep one learner artifact or exit ticket as evidence. Reflect Record what learners understood and where they struggled. Improve Revise the activity and share one lesson with a colleague. Final reflection: What is one way you will make students’ thinking visible in your next lesson? Follow Design: {"palette":["Academic Navy #1A365D — primary headers and institutional structure","Marigold Gold #D97706 — focal accents and chapter milestones","Chalk Blue #EBF4FF — callout card backgrounds and pillar tiles","Deep Slate #1E293B — high-contrast body typography","Sage Emerald #059669 — verification checks and positive rubric benchmarks","Crisp Off-White #F8FAFC — clean slide canvas"],"fonts":{"Plus Jakarta Sans":"https://fonts.googleapis.com/css2?family=Plus+Jakarta+Sans:ital,wght@0,200..800;1,200..800&display=swap","IBM Plex Sans":"https://fonts.googleapis.com/css2?family=IBM+Plex+Sans:ital,wght@0,100..700;1,100..700&display=swap","Fira Code":"https://fonts.googleapis.com/css2?family=Fira+Code:wght@300..700&display=swap"},"type":"Plus Jakarta Sans in bold and semi-bold for clear hierarchical headings, bilingual chapter banners, and slide titles; IBM Plex Sans in regular and medium weights for dense bilingual explanatory prose, reflection prompts, and multi-column tables; Fira Code in medium 11pt/13pt tracking for algorithm steps, pseudocode logic, and technical syntax tags.","layout":"Structured 12-column pedagogical layout with generous top margins and dedicated bilingual dual-track columns; left column reserves space for English instructional directives while right or indented sub-rows house Hindi translations; persistent top anchor shows handbook chapter number, NCF-SE framework tag, and module progress indicator.","framework_treatment":"Crisp 1px slate-bordered card containers for the four CT pillars, soft blue fill boxes for classroom teacher reflections, mono-styled code-blocks with syntax indentation for pseudocode demonstrations, and structured matrix borders for the four-level assessment rubrics and unplugged lesson step flows.","feels_like":"A premier national technology-institute curriculum lab meets an executive CBSE teacher-training masterclass handbook"}

Computational Thinking for Teachers - DAV / CBSE Training Handbook

The idea behind this presentation

About this Computational Thinking for Teachers - DAV / CBSE Training Handbook presentation example

Three things to review before creating your version

Story structure

Visual hierarchy

Design consistency

Turn inspiration into an original presentation