Sum of Subsets Practice Question

Duration: 22 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/design-analysis-of-algorithms/advanced-algorithms/backtracking-technique/asset-sum-of-subsets-practice-question after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, GK- Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Directions (Direction Test), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Powers and Exponents (Surds and Indices), Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Articles, Sentence Construction, Preposition, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Modals, Active Passive Voice (Voice), Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  10. Section B: Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section B: Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  12. Section B: Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  13. Section B: Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  14. Section B: Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture provides a detailed walkthrough of the Sum of Subsets problem using the backtracking algorithm. The instructor begins by defining the problem: given a set S = {5, 10, 12, 13, 15, 18} and a target sum M = 30, the goal is to find all subsets whose elements sum exactly to 30. The core method involves constructing a state space tree where each node represents a decision to include or exclude an element from the current subset. The instructor maps set elements to variables x1 through x6, where xi = 1 indicates inclusion and xi = 0 indicates exclusion. The algorithm proceeds by exploring branches based on three conditions: if the current subset sum is less than M, exploration continues; if it equals M, a valid solution is recorded; and if it exceeds M, the branch is pruned immediately. The video demonstrates this process visually by drawing a decision tree, marking invalid paths with red crosses, and identifying valid solutions such as {5, 10, 4, 18} (noting a potential transcription error in the source text regarding '4' vs set elements) and {5, 10} combined with other exclusions. The instructor emphasizes the pruning mechanism to avoid unnecessary computation, showcasing how backtracking efficiently navigates the solution space by abandoning paths that cannot lead to a valid result.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the Sum of Subsets practice problem, defining the set S = {5, 10, 12, 13, 15, 18} and target M = 30. He writes variable labels x1 through x6 above the set elements to prepare for demonstrating the recursive selection process. The on-screen text explicitly states 'Q. Given the set S = {5, 10, 12, 13, 15, 18}, M = 30, Find all subsets whose sum is equal to 30 using: Backtracking'. The instructor begins mapping elements to variables, setting x1 = 5 and initializing the first node of the state space tree with x1 = 1, indicating the inclusion of the first element.

  2. 2:00 – 5:00 02:00-05:00

    The instructor categorizes the backtracking logic into three distinct cases based on the current subset sum relative to M. He writes 'Case 1: Subset Sum < M' for exploration, 'Case 2: Subset Sum == M' for valid solutions, and 'Case 3: Subset Sum > M' for invalid paths requiring backtracking. The visual progression shows the construction of a state space tree, starting with adding element 5 to form subset {5}, then adding element 10 to form {5, 10}. The instructor points to these conditions on the board to clarify the decision-making process for each node in the tree.

  3. 5:00 – 10:00 05:00-10:00

    The demonstration continues with the instructor exploring branches where elements are included or excluded. He marks a path as invalid with a red cross when the subset sum exceeds M = 30. The instructor then backtracks to explore an alternative branch where the current element is excluded (x4 = 0). The screenshots show the progression of adding elements like {5, 10, 18} and evaluating their sums. The instructor emphasizes the branching factor of 2 (include/exclude) at each node and visually traces the path through the tree structure.

  4. 10:00 – 15:00 10:00-15:00

    The instructor traverses the state space tree, evaluating nodes based on whether the current subset sum is less than, equal to, or greater than M = 30. The process involves branching on variables xi (taking an element or not) and pruning branches where the sum exceeds the target. The visual progression shows the identification of valid solution subsets, such as {5, 10} combined with other elements. The instructor points to specific nodes in the tree structure and writes conditions for valid and invalid solutions on the board, explaining the logic behind including or excluding elements.

  5. 15:00 – 20:00 15:00-20:00

    The instructor continues solving the Sum of Subsets problem, traversing a state space tree to find subsets summing exactly to 30. He marks branches as valid solutions or invalid based on whether the subset sum equals, is less than, or exceeds M = 30. The process involves making decisions for each element (xi = 1 or xi = 0) and pruning branches where the sum exceeds the target. The on-screen text highlights 'Valid Solution {Case 2 Subset Sum == M}' and 'Invalid Solution {Case 3 Subset Sum > M}', reinforcing the classification of paths.

  6. 20:00 – 22:23 20:00-22:23

    In the final segment, the instructor concludes the backtracking demonstration by identifying valid solution subsets. He traces through the decision tree, evaluating inclusion/exclusion of elements x1 through x6. The visual evidence shows the marking of valid solutions where subset sum equals 30 and pruning of invalid branches. The instructor summarizes the application of the backtracking algorithm, ensuring all subsets summing to 30 are found. The final on-screen text confirms '30 == 30' as a valid match, solidifying the solution criteria.

The lecture effectively demonstrates the Sum of Subsets problem using backtracking, a fundamental technique in combinatorial optimization. The instructor's approach is systematic: first defining the problem parameters (set S and target M), then mapping elements to binary decision variables, and finally constructing a state space tree. The core educational value lies in the visualization of pruning; by marking branches where the sum exceeds M with a red cross, students can see how backtracking avoids exhaustive search. The three-case logic (Sum < M, Sum == M, Sum > M) provides a clear decision framework for algorithm implementation. The video serves as a practical guide for understanding how to translate abstract backtracking concepts into concrete steps, emphasizing the importance of constraint checking at each node. The use of specific numerical examples (S = {5, 10, 12, 13, 15, 18}, M = 30) allows students to follow the logic step-by-step, making it an excellent resource for exam preparation on recursive algorithms and tree traversal.

Loading lesson…