Sum of Subsets

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 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, समसामयिकी / Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, Data Sufficiency, अशाब्दिक तर्क / Non-Verbal Reasoning, Analytical Reasoning (Counting Figures Reasoning), रक्त संबंध / Blood Relations, Syllogisms, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, दिशा एवं दूरी / Direction and Distance, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, आँकड़ों की पर्याप्तता एवं निर्णय क्षमता / Data Sufficiency and Decision Making, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, Crypt Arithmetic, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, आँकड़ा निर्वचन / Data Interpretation, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, Logarithm, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, Pipe and Cistern, घन क्षेत्रमिति / Solid Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, 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, Verbs and Tenses, Reading Comprehension, Parts of Speech, Sentence Construction, Prepositions and Conjunctions, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Structure and Common Errors, Modals, Transformation of Sentences, 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: वृद्धि और विकास / Growth and Development, Concept of Pedagogy, विकास के सिद्धांत / Theories of Development, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, आकलन और मूल्यांकन / Assessment and Evaluation, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, शिक्षण योजना और शिक्षण कौशल / Teaching Planning and Teaching Skills, Personality Development, शिक्षण विधियाँ / Teaching Methods, अधिगम और व्यवहारवादी सिद्धांत / Learning and Behavioural Theories, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, आकलन एवं मूल्यांकन / Assessment and Evaluation, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development
  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, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  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, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, प्रतिचयन / Sampling
  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, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, प्रबंध के सिद्धांत एवं कार्य / Principles and Functions of Management, लेखांकन के आधार एवं लेन-देनों का अभिलेखन / Accounting Fundamentals and Recording of Transactions, Business Economics, ह्रास, अंतिम खाते व कंप्यूटरीकृत लेखांकन / Depreciation, Final Accounts and Computerised Accounting, Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the Sum of Subsets problem using backtracking, contrasting it with brute force enumeration. The instructor begins by defining the task: given a set of n positive integers and a target value M, find all subsets whose elements sum to M. A primary example uses the set S = {5, 10, 12, 13, 15, 18} with M = 30. The valid subsets identified are {5, 10, 15}, {5, 12, 13}, and {12, 18}. The lecture then transitions to a smaller set S = {5, 7, 2} with M = 7 to demonstrate algorithmic efficiency. The brute force method is introduced first, calculating the total number of subsets as 2^n (where n=3), resulting in 8 combinations. The instructor systematically lists these subsets to verify which sum to the target, establishing a baseline for comparison. Subsequently, the backtracking approach is detailed using a state space tree. Each node represents a decision to include (x_i = 1) or exclude (x_i = 0) an element. The instructor illustrates pruning conditions where the current sum S is less than, equal to, or greater than M. Valid solutions are marked with checkmarks, while invalid branches exceeding the target sum are pruned with red crosses. The lecture emphasizes how backtracking reduces the search space by eliminating paths that cannot lead to a solution, unlike brute force which explores all possibilities.

Chapters

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

    The instructor introduces the 'Sum of Subsets using Backtracking' problem, defining it as finding all subsets of a set of positive integers that sum to a target value M. On-screen text displays the problem statement: 'Given a set of n positive integers and a target value M, find all subsets whose sum of elements is equal to M.' A concrete example is presented with set S = {5, 10, 12, 13, 15, 18} and M = 30. The instructor lists the valid subsets satisfying this condition: {5, 10, 15}, {5, 12, 13}, and {12, 18}. Key terms like 'positive integers' are underlined to emphasize constraints.

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

    The lecture shifts to a new problem instance with set S = {5, 7, 2} and target sum M = 7. The instructor introduces the brute force approach as a baseline method, calculating the total number of possible subsets using the formula 2^n. For n=3, this yields 8 total combinations. The slide explicitly asks to 'Find all subsets whose sum is equal to 7 using: Brute Force, Backtracking' and 'Also compare the number of subsets explored by both approaches.' The instructor begins enumerating specific subsets, starting with the empty set and {5}, to demonstrate the exhaustive nature of brute force.

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

    The instructor explains the backtracking approach for S = {5, 7, 2} and M = 7. A decision tree is drawn where each node represents including or excluding an element. The instructor defines binary decision variables x_i, where x_i = 1 indicates inclusion and x_i = 0 indicates exclusion. Three pruning cases are established based on the current sum S: Case 1 (S < M), Case 2 (S == M), and Case 3 (S > M). The visual structure shows branching logic, with the first branch labeled x_1 = 1 for including the element 5. This section establishes the theoretical framework for pruning invalid paths before full enumeration.

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

    The demonstration of the state space tree continues, focusing on branching logic for subsequent elements. The instructor draws branches for x_2 = 1 and x_2 = 0, evaluating the sum at each step. A subset {5, 7} is marked with a red cross to indicate an invalid solution because the sum exceeds M. The instructor points to decision nodes and writes 'Valid Solution' under paths where S == M. The visual cues include red crosses for invalid branches and green text or checkmarks for valid ones, illustrating how the algorithm prunes paths where S > M to save computational effort.

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

    The instructor evaluates further branches in the state space tree, specifically exploring Case 1 where S < M to continue searching. A valid solution {5, 2} is identified and marked with a checkmark as S = M. The instructor gestures towards specific nodes to explain inclusion/exclusion logic, writing conditions like x_1 = 1, x_2 = 0 to denote variable assignments. The slide displays 'Further Case: S < M' and 'Valid Solution: S == M', reinforcing the termination conditions. Invalid branches are consistently pruned, demonstrating the efficiency of backtracking over brute force by avoiding unnecessary exploration.

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

    The lecture concludes with a summary of the state space tree for S = {5, 7, 2} and M = 7. The instructor points to the root node and branches of the tree, highlighting valid solutions {5, 2} and {7} marked with checkmarks. Invalid branches where the sum exceeds M, such as {5, 7}, are pruned with red crosses. The instructor uses color coding to distinguish valid and invalid paths, writing 'Invalid Solution: S > M' on the slide. The final visual emphasizes that backtracking identifies all valid subsets by systematically exploring and pruning the search space, contrasting with the exhaustive enumeration of brute force.

The lecture effectively contrasts two algorithmic strategies for the Sum of Subsets problem: brute force and backtracking. The instructor uses a consistent example set S = {5, 7, 2} with target M = 7 to illustrate the mechanics of both methods. Brute force is shown to be exhaustive, generating all 2^n subsets regardless of their sum, which serves as a baseline for comparison. Backtracking is introduced as an optimization that uses a state space tree to explore potential solutions incrementally. The core mechanism involves decision variables x_i for inclusion/exclusion and pruning conditions based on the current sum S relative to M. Visual evidence from the slides, including red crosses for invalid paths and checkmarks for valid ones, reinforces the concept of pruning. The instructor explicitly labels cases where S < M (continue search), S == M (valid solution found), and S > M (prune branch). This structured approach demonstrates how backtracking reduces the search space by eliminating paths that cannot lead to a solution, making it more efficient than brute force for larger sets.

Loading lesson…