[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-seo-315086-105":3,"detail-sidebar-cat-0-en-105":81,"doc-detail-315086-en":131},{"code":4,"msg":5,"data":6},0,"ok",{"site_id":7,"language":8,"slug":9,"title":10,"keywords":11,"description":12,"schema_data":13,"social_meta":74,"head_meta":76,"extra_data":78,"updated_unix":80},105,"en","ap-computer-science-a-course-and-exam-course-at-a-glance","AP Computer Science A Course and Exam - Course at a Glance","","AP Computer Science A Course and Exam “Course at a Glance” provides a visual plan for structuring the AP Computer Science A curriculum. It outlines a sequence of units with approximate weighting and suggested pacing based on 45-minute class periods throughout a full academic year. It also maps topic progression within each unit and highlights computational thinking practices across units. Required content is tied to assessment through learning objectives, essential knowledge statements, and unit Progress Checks with multiple-choice and free-response items.",{"@graph":14,"@context":73},[15,34,56],{"@type":16,"itemListElement":17},"BreadcrumbList",[18,23,27,31],{"item":19,"name":20,"@type":21,"position":22},"https://docshare.wps.com","Home","ListItem",1,{"item":24,"name":25,"@type":21,"position":26},"https://docshare.wps.com/document/","Document",2,{"item":28,"name":29,"@type":21,"position":30},"https://docshare.wps.com/document/exam/","Exam",3,{"item":32,"name":10,"@type":21,"position":33},"https://docshare.wps.com/document/ap-computer-science-a-course-and-exam-course-at-a-glance/315086/",4,{"url":32,"name":10,"@type":35,"image":36,"author":41,"headline":10,"publisher":44,"fileFormat":47,"inLanguage":8,"description":12,"dateModified":48,"datePublished":49,"encodingFormat":47,"isAccessibleForFree":50,"interactionStatistic":51},"DigitalDocument",{"url":37,"@type":38,"width":39,"height":40},"https://docshare.wps.com/thumbnails/ap-computer-science-a-course-and-exam-course-at-a-glance/315086.png","ImageObject",300,407,{"name":42,"@type":43},"Tawan","Person",{"url":19,"name":45,"@type":46},"DocShare","Organization","application/pdf","2026-10-23","2026-09-20",true,{"@type":52,"interactionType":53,"userInteractionCount":55},"InteractionCounter",{"@type":54},"ViewAction",12,{"@type":57,"mainEntity":58},"FAQPage",[59,65,69],{"name":60,"@type":61,"acceptedAnswer":62},"What does the “Course at a Glance” section provide for AP Computer Science A?","Question",{"text":63,"@type":64},"It provides a visual organization of curricular components, including the sequence of units, approximate weighting, suggested pacing, and topic progression within each unit.","Answer",{"name":66,"@type":61,"acceptedAnswer":67},"How is pacing determined in the plan?",{"text":68,"@type":64},"Pacing is based on 45-minute class periods, meeting five days each week for a full academic year.",{"name":70,"@type":61,"acceptedAnswer":71},"What format do Progress Checks use and how do they help students?",{"text":72,"@type":64},"Each Progress Check includes formative multiple-choice and free-response questions. Feedback indicates the areas where students need to focus.","https://schema.org",{"og:url":32,"og:type":75,"og:title":10,"og:site_name":45,"og:description":12},"article",{"robots":77,"canonical":32},"index,follow",{"doc_id":79,"site_id":7},315086,1789976558,{"code":4,"msg":82,"data":83},"success",[84,88,92,95,100,105,110,115,120,123,127],{"id":22,"doc_module":4,"doc_module_name":25,"category_name":85,"show_sort_weight":86,"slug":87},"Story & Novel",90,"story-novel",{"id":26,"doc_module":4,"doc_module_name":25,"category_name":89,"show_sort_weight":90,"slug":91},"Literature",80,"literature",{"id":33,"doc_module":4,"doc_module_name":25,"category_name":29,"show_sort_weight":93,"slug":94},70,"exam",{"id":96,"doc_module":4,"doc_module_name":25,"category_name":97,"show_sort_weight":98,"slug":99},5,"Comic",60,"comic",{"id":101,"doc_module":4,"doc_module_name":25,"category_name":102,"show_sort_weight":103,"slug":104},6,"Technology",50,"technology",{"id":106,"doc_module":4,"doc_module_name":25,"category_name":107,"show_sort_weight":108,"slug":109},7,"Healthcare",40,"healthcare",{"id":111,"doc_module":4,"doc_module_name":25,"category_name":112,"show_sort_weight":113,"slug":114},8,"Research & Report",30,"research-report",{"id":116,"doc_module":4,"doc_module_name":25,"category_name":117,"show_sort_weight":118,"slug":119},9,"Religion & Spirituality",20,"religion-spirituality",{"id":118,"doc_module":4,"doc_module_name":25,"category_name":121,"show_sort_weight":118,"slug":122},"World Cup","world-cup",{"id":124,"doc_module":4,"doc_module_name":25,"category_name":125,"show_sort_weight":124,"slug":126},10,"Lifestyle","lifestyle",{"id":128,"doc_module":4,"doc_module_name":25,"category_name":129,"show_sort_weight":96,"slug":130},19,"General","general",{"code":4,"msg":82,"data":132},{"doc_id":79,"user_id":133,"nickname":42,"user_avatar":134,"doc_module":4,"category_id":33,"category_name":29,"doc_title":10,"doc_description":12,"doc_content":135,"file_id":136,"file_url":137,"file_type":138,"file_size":139,"view_count":55,"is_deleted":4,"is_public":22,"is_downloadable":22,"audit_status":22,"page_count":26,"language":140,"language_code":8,"site_id":7,"html_lang":8,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":12,"update_tm":144,"read_time":96,"preview_page_count":4},2336475104042,"https://ap-avatar.wpscdn.com/avatar/22000c4c32af1715be0?x-image-process=image/resize,m_fixed,w_180,h_180&k=1786537525561427321","Course ata Glance  \nPlan  \nThe Course at a Glance provides a useful visual organization oftheAP Computer Science A curricular components, including:  \n§ Sequence of units, along with approximate weighting and suggested pacing. Please note, pacing is based on 45-minute class periods, meeting five days each week for a full academic year.  \n§ Progression of topics within each unit.  \n§ Computational thinking practices across units.  \nTeach  \nCOMPUTATIONAL THINKING PRACTICES  \n 1  Design Code  \n 2  Develop Code  \n 3  Analyze Code  \n 4  Document Code and Computing Systems  \n 5  Use Computers Responsibly  \nRequired Course Content  \nEach topic contains required learning objectivesand essential knowledge statements that form the basis of the assessment on the AP Exam.  \nAssess  \nAssign the Progress Checks—either as homework or in class—for each unit. Each Progress Check contains formative multiple-choice and free-response questions. The feedback from the Progress Checks shows students the areas where they need to focus.  \nAP Computer Science A Course and Exam  \n2 1.4 Assignment  \n4 Statements and Input  \n24 1.5 Casting and Range of ~~ ~~ Variables  \n3 1.6 Compound Assignment Operators  \n4 1.7 Application Program Interface (API) and  \nLibraries  \n4  \n1.8 Documentation with Comments  \n3  \n1.9 Method Signatures  \n2 3  \n1.10 Calling Class Methods  \n\n| 2 4 | 1.11 | Math Class |\n| --- | --- | --- |\n| 4 | 1.12 | Objects: Instances of Classes |\n| 2 | 1.13 | Object Creation and Storage (Instantiation) |\n| 2 3 | 1.14 | Calling Instance Methods |\n\n2 3  \n4  \n1.15 String Manipulation  \nProgress Check Unit 1 Part 1: Topics 1.1–1.4  \nMultiple-choice:~12 questions  \nProgress Check Unit 1 Part 2: Topics 1.5–1.9  \nMultiple-choice:~15 questions  \nProgress Check Unit 1 Part 3: Topics 1.10–1.15  \nMultiple-choice:~18 questions  \nFree-response: 1 question  \n§ Methods and Control Structures (partial)  \n1  2.1 Algorithms with Selection and  \nRepetition  \n 3  2.2 Boolean Expressions  \n2 3  \n4 2  \n4  \n2.3 if Statements  \n2.4 Nested if Statements  \n2 3  \n2.5 Compound Boolean Expressions  \n2 2.6 Comparing Boolean 3  \nExpressions  \n2 3  \n4  \n2.7 while Loops  \n\n| 2 3 | 2.8 | for Loops |\n| --- | --- | --- |\n| 2 3\u003Cbr>4 | 2.9 | Implementing Selection and Iteration Algorithms |\n| 2 3 | 2.10 | Implementing String Algorithms |\n| 2 3\u003Cbr>4 | 2.11 | Nested Iteration |\n\n4 2.12 Informal Run-Time Analysis  \nProgress Check Unit 2 Part 1: Topics 2.1–2.6  \nMultiple-choice:~18 questions  \nFree-response: 1 question  \n§ Methods and Control Structures (partial)  \nProgress Check Unit 2 Part 2: Topics 2.7–2.12  \nMultiple-choice:~21 questions  \nFree-response: 2 questions  \n§ Methods and Control Structures (partial)  \nNOTE: Partial versions of the free-response questions are provided to prepare students for more complex, full questions that they will encounter on the AP Exam.  \nDescription V.1 | 17  \nReturn to Table of Contents  \n© 2025 College Board  \n1 3.1 Abstraction and Program Design  \n12 3.3 Anatomy of a Class  \n2 3.4 Constructors 3  \n2 3  \n4  \n3.5 Methods: How to Write Them  \n3.6 Methods: Passing and Returning References of  \nan Object  \n23 3.7 Class Variables and Methods  \n34 3.8 Scope and Access  \n2 3.9 this Keyword  \nProgress Check Unit 3 Part 1: Topics 3.1–3.4  \nMultiple-choice:~12 questions  \nProgress Check Unit 3 Part 2: Topics 3.5–3.9  \nMultiple-choice:~15 questions  \nFree-response: 2 questions  \n§ Class Design  \n1 4.2 Introduction to Using  \nData Sets  \n23 4.3 Array Creation and Access  \n2 4.4 Array Traversals 3  \n2 3  \n4  \n4.5 Implementing Array Algorithms  \n2 3  \n4  \n2  \n4.6 Using Text Files  \n4.7 Wrapper Classes  \n23 4.8 ArrayList Methods  \n2 3  \n4  \n4.9 ArrayList Traversals  \n2 3  \n4  \n4.10 Implementing ArrayList Algorithms  \n2 3  \n4.11 2D Array Creation and Access  \n\n| 2 3 | 4.12 | 2D Array Traversals |\n| --- | --- | --- |\n| 2 3\u003Cbr>4 | 4.13 | Implementing 2D Array Algorithms |\n| 2 3\u003Cbr>4 3\u003Cbr>4 3\u003Cbr>4 | 4.14 | Searching Algorithms |\n|  | 4.15 | Sorting Algorithms |\n| ","cbCais0AyaN8NSt0","https://ap.wps.com/l/cbCais0AyaN8NSt0","pdf",185233,"English","# Course at a Glance\n## Plan\n## Teach: Computational Thinking Practices\n## Required Course Content\n## Assess: Progress Checks\n## Progress Check Unit 1\n## Progress Check Unit 2\n## Progress Check Unit 3\n## Progress Check Unit 4\n## Notes","[{\"question\":\"What does the “Course at a Glance” section provide for AP Computer Science A?\",\"answer\":\"It provides a visual organization of curricular components, including the sequence of units, approximate weighting, suggested pacing, and topic progression within each unit.\"},{\"question\":\"How is pacing determined in the plan?\",\"answer\":\"Pacing is based on 45-minute class periods, meeting five days each week for a full academic year.\"},{\"question\":\"What format do Progress Checks use and how do they help students?\",\"answer\":\"Each Progress Check includes formative multiple-choice and free-response questions. Feedback indicates the areas where students need to focus.\"}]","AP Computer Science A Course and Exam - Course at a Glance | PDF",1789903088]