[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-403651-105":59,"doc-detail-403651-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","week-1-programming-fundamentals-basics-conditionals","Week 1 - Programming Fundamentals - Basics & Conditionals","","Week-by-week programming curriculum covering core fundamentals and progressively deeper problem-solving topics. Week 1 introduces data types, variables, operators, flowcharts, conditional logic, loops, functions, time complexity, and an introduction to recursion with tracing. The plan continues through arrays, strings, sorting, binary search and recursion patterns, backtracking, divide-and-conquer sorting, OOP concepts, linked lists, stacks, queues, hashing, trees and BSTs, plus heaps, prefix sums, sliding window techniques, prime computation, advanced binary search, backtracking, greedy strategies, and dynamic programming foundations.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":30,"@type":76,"position":81},"https://docshare.wps.com/document/technology/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/week-1-programming-fundamentals-basics-conditionals/403651/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/week-1-programming-fundamentals-basics-conditionals/403651.png","ImageObject",300,407,{"name":92,"@type":93},"Fans","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-22","2026-09-27",true,{"@type":102,"interactionType":103,"userInteractionCount":44},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What topics are covered in Week 1 of the course plan?","Question",{"text":112,"@type":113},"Week 1 covers data types, variables, input/output, operators, conditional statements (if-else and switch-case), flowcharts, loops, and pattern printing. It also introduces functions, time complexity, and recursion fundamentals with base/recursive cases and tracing.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How does the curriculum approach arrays, strings, and sorting?",{"text":117,"@type":113},"It includes 1D and 2D array operations, matrix traversal and rotations, string manipulation such as palindrome/anagram checks and substring extraction, and sorting methods like bubble, selection, and insertion with dry run and time complexity analysis.",{"name":119,"@type":110,"acceptedAnswer":120},"Which advanced techniques are introduced after binary search in the later weeks?",{"text":121,"@type":113},"After binary search fundamentals and applications, the plan moves into recursion patterns (Fibonacci, power, factorial), subsets and permutations, then backtracking via decision trees and pruning. It later adds divide-and-conquer sorting (merge sort, quick sort), OOP concepts, linked lists, and further data-structure and algorithm topics through heaps, sliding window, primes, greedy strategies, and dynamic programming.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},403651,1790831598,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":29,"category_name":30,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":44,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":139,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145},5909892330395,"https://ap-avatar.wpscdn.com/davatar_6f874abed73319feea01a86fa6f0fab8","Week 1 : Programming Fundamentals Session 1 : Basics & Conditionals  \n● Data types, variables, input/output  \n● Operators and expressions  \n● if-else, nested if-else, switch-case  \n● Flowcharts and logic building  \nSession 2: Loops & Pattern Printing  \n● For, while, do-while loops  \n● Nested loops  \n● Pattern-based problems  \n● Loop-based complexity  \nSession 3: Functions & Method Concepts  \n● Function declaration, parameters, return types  \n● Call by value/reference  \n● Method scope and recursion intro  \nSession 4: Time Complexity & Flowcharts  \n● Big O Notation  \n● Time complexity of common code patterns  \n● Analyzing loop + nested structures  \n● Intro to dry run strategies  \nSession 5: Introduction to Recursion  \n● Recursive calls & call stack  \n● Base and recursive case  \n● Simple problems: factorial, power  \n● Recursion tracing  \nWeek 2: Arrays, Strings & Sorting Session 6: 1D Arrays – Operations & Applications  \n● Declaration and initialization  \n● Traversal, insertion, deletion  \n● Max/min, prefix sum, reversal  \nSession 7: 2D Arrays – Traversal & Matrix Operations  \n● Row/column/diagonal traversal  \n● Transpose and rotation  \n● Spiral matrix and boundary traversal  \nSession 8: Time and Space Complexity Analysis  \n● Best/worst/average case  \n● Space vs time trade-offs  \n● Practical analysis on loops and recursion  \nSession 9: String Manipulation & Problem Solving  \n● String creation and operations  \n● Palindrome and anagram check  \n● String reversal, substring extraction  \nSession 10: Sorting – Bubble, Selection & Insertion  \n● Dry run examples  \n● Time complexities  \n● When and why to use each  \nWeek 3: Binary Search & Recursion Session 11: Fundamentals of Binary Search  \n● Mid-point logic, base condition  \n● Binary Search on sorted arrays  \nSession 12: Applications of Binary Search  \n● First/last occurrence  \n● Count of occurrences  \n● Search in rotated array  \nSession 13: Recursive Patterns – Fibonacci, Power, Factorial  \n● Top-down recursion  \n● Stack depth  \n● Multiple return calls  \nSession 14: Recursion with Subsets and Permutations  \n● Generating subsets  \n● All permutations  \n● Bitmasking intro  \nSession 15: Backtracking Intro  \n● Decision trees  \n● Pruning invalid paths  \n● N-Queens problem  \nWeek 4: Sorting, OOPs & Linked Lists Session 16: Merge Sort – Divide and Conquer  \n● Splitting arrays  \n● Merge step  \n● Merge sort with recursion  \nSession 17: Quick Sort – Partition and Optimization  \n● Lomuto/ Hoare partition  \n● Worst vs best case  \n● In-place sorting  \nSession 18: OOPs Concepts – Classes & Inheritance  \n● Class/object basics  \n● Inheritance types  \n● Access modifiers  \nSession 19: OOPs Concepts – Abstraction & Interfaces  \n● Abstraction vs encapsulation  \n● Abstract classes and interfaces  \n● Constructor overloading  \nSession 20: Linked List – Basics & Implementations  \n● Singly linked list  \n● Insert/delete operations  \n● Traversal techniques  \nWeek 5: Stacks, Queues & Hashing  \nSession 21: Stack Data Structure – Operations & Use Cases  \n● Push/pop/peek  \n● Stack using arrays  \n● Expression validation  \nSession 22: Stack Interview Problems  \n● Next greater element  \n● Stock span  \n● Valid parentheses  \nSession 23: Queue Variants & Implementations  \n● Queue operations  \n● Circular queue  \n● Queue using stacks  \nSession 24: Queue-Based Interview Problems  \n● First non-repeating character  \n● Sliding window maximum  \n● Rotten oranges ( BFS)  \nSession 25: HashMaps & HashSets in Depth  \n● Hash function and collision  \n● Frequency maps  \n● Two-sum, union/intersection  \nWeek 6: Trees & Binary Search Trees Session 26: Binary Trees – Structure & Traversals  \n● Preorder/inorder/postorder  \n● Recursive/iterative traversal  \n● Height/depth  \nSession 27: Tree Views – Level, Vertical, Zigzag  \n● Level order ( BFS)  \n● Left/right/top/bottom view  \n● Diagonal and zigzag traversal  \nSession 28: Binary Search Trees – Insert, Delete, Search  \n● Insert/search/delete logic  \n● Validate BST  \n● Min/max in BST  \nSession 2","cbCaibMqyjr7QZ38","https://ap.wps.com/l/cbCaibMqyjr7QZ38","pdf",128451,11,"English","# Week 1\n## Session 1: Basics & Conditionals\n## Session 2: Loops & Pattern Printing\n## Session 3: Functions & Method Concepts\n## Session 4: Time Complexity & Flowcharts\n## Session 5: Introduction to Recursion\n# Week 2\n## Session 6: 1D Arrays – Operations & Applications\n## Session 7: 2D Arrays – Traversal & Matrix Operations\n## Session 8: Time and Space Complexity Analysis\n## Session 9: String Manipulation & Problem Solving\n## Session 10: Sorting – Bubble, Selection & Insertion\n# Week 3\n## Session 11: Fundamentals of Binary Search\n## Session 12: Applications of Binary Search\n## Session 13: Recursive Patterns – Fibonacci, Power, Factorial\n## Session 14: Recursion with Subsets and Permutations\n## Session 15: Backtracking Intro\n# Week 4\n## Session 16: Merge Sort – Divide and Conquer\n## Session 17: Quick Sort – Partition and Optimization\n## Session 18: OOPs Concepts – Classes & Inheritance\n## Session 19: OOPs Concepts – Abstraction & Interfaces\n## Session 20: Linked List – Basics & Implementations\n# Week 5\n## Session 21: Stack Data Structure – Operations & Use Cases\n## Session 22: Stack Interview Problems\n## Session 23: Queue Variants & Implementations\n## Session 24: Queue-Based Interview Problems\n## Session 25: HashMaps & HashSets in Depth\n# Week 6\n## Session 26: Binary Trees – Structure & Traversals\n## Session 27: Tree Views – Level, Vertical, Zigzag\n## Session 28: Binary Search Trees – Insert, Delete, Search\n## Session 29: Tree Problems – LCA, Diameter, Mirror Tree\n## Session 30: Tree Practice – Recursive Techniques\n# Week 7\n## Session 31: Heaps – Min/Max & Priority Queues\n## Session 32: Prefix Sum Techniques\n## Session 33: Sliding Window – Fixed & Dynamic Windows\n## Session 34: Prime Numbers – Efficient Computation\n## Session 35: Sieve of Eratosthenes & Number Theory\n# Week 8\n## Session 36: Advanced Binary Search Techniques\n## Session 37: Backtracking Problems – N-Queens, Maze, Sudoku\n## Session 38: Greedy Algorithms – Activity Selection & Knapsack\n## Session 39: Greedy Algorithms – Job Scheduling & Gas Station\n## Session 40: Greedy Applications – Minimum Platforms, Intervals\n# Week 9\n## Session 41: DP Foundations – Memoization & Tabulation\n## Session 42: Classic Problems – Knapsack, Subset Sum\n## Session 43: Coin Change","[{\"question\":\"What topics are covered in Week 1 of the course plan?\",\"answer\":\"Week 1 covers data types, variables, input/output, operators, conditional statements (if-else and switch-case), flowcharts, loops, and pattern printing. It also introduces functions, time complexity, and recursion fundamentals with base/recursive cases and tracing.\"},{\"question\":\"How does the curriculum approach arrays, strings, and sorting?\",\"answer\":\"It includes 1D and 2D array operations, matrix traversal and rotations, string manipulation such as palindrome/anagram checks and substring extraction, and sorting methods like bubble, selection, and insertion with dry run and time complexity analysis.\"},{\"question\":\"Which advanced techniques are introduced after binary search in the later weeks?\",\"answer\":\"After binary search fundamentals and applications, the plan moves into recursion patterns (Fibonacci, power, factorial), subsets and permutations, then backtracking via decision trees and pruning. It later adds divide-and-conquer sorting (merge sort, quick sort), OOP concepts, linked lists, and further data-structure and algorithm topics through heaps, sliding window, primes, greedy strategies, and dynamic programming.\"}]","Week 1 - Programming Fundamentals - Basics & Conditionals | PDF",1790542223,28]