Practice Set 5 (List and Set) Q1-13

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-3-python/collections-strings/sets/asset-practice-set-5-list-and-set-q1-13 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow 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
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a Python programming tutorial focused on the concepts of lists and sets, specifically addressing common pitfalls related to object references and shallow copying. The instructor begins by analyzing a question where a list A is assigned to another variable B, and then B is modified. The key concept demonstrated is that B is a reference to the same list object as A, so modifying B also changes A. The instructor then moves to a second question to illustrate the difference between shallow and deep copying. He shows that when a list contains a nested list, a shallow copy (using .copy()) creates a new outer list but shares the same inner list object. This means that modifying the inner list through one variable affects the other. The video uses a digital whiteboard to write out the code and its execution step-by-step, including the final state of the lists. The lesson concludes with a brief discussion on other list operations like extend, set operations, and list multiplication.

Chapters

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

    The video opens on a digital whiteboard displaying a Python practice sheet titled 'Practice Set-V' with a section on 'LIST and SET'. The instructor begins with Question 1, which presents the code: A = [1, 2, 3], B = A, B.append(4), print(A). The instructor explains that since B is assigned the value of A, B is a reference to the same list object. When B.append(4) is executed, it modifies the list object that both A and B point to. Therefore, the final print(A) will output the modified list [1, 2, 3, 4]. The instructor writes the final state of the list as [1, 2, 3, 4] on the board, indicating the correct answer is B) [1, 2, 3, 4].

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

    The instructor transitions to Question 2, which demonstrates the concept of shallow copying. The code is: A = [1, 2, 3], B = A.copy(), B.append(4), print(A). The instructor explains that A.copy() creates a new list object, so B is a new list. Modifying B does not affect A, so the output of print(A) is [1, 2, 3]. He then moves to Question 3, which introduces a nested list: A = [1, 2, [3, 4]], B = A.copy(), B[2][0] = 99, print(A). The instructor explains that a shallow copy creates a new outer list, but the inner list [3, 4] is still shared between A and B. When B[2][0] = 99 is executed, it modifies the shared inner list, so A is also affected. The final output of print(A) is [1, 2, [99, 4]]. He writes 'Shallow Copy' on the board to label this concept.

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

    The instructor continues with Question 4: A = [i for i in range(4)], print(A[::2]). He explains that this is a list comprehension creating [0, 1, 2, 3], and the slice A[::2] returns every second element starting from index 0, resulting in [0, 2]. He then moves to Question 5: A = [1, 2, 3], A.insert(1, 4), A.insert(1, 5), print(len(A)). He explains that insert(1, 4) adds 4 at index 1, making the list [1, 4, 2, 3], and then insert(1, 5) adds 5 at index 1, making it [1, 5, 4, 2, 3]. The length is 5. The video then shows Question 6: A = [1, 2, 3], B = [4, 5], A.extend(B), print(A). The instructor explains that extend adds all elements of B to the end of A, resulting in [1, 2, 3, 4, 5]. Question 7: A = [10, 20, 30, 40], print(A[-2:-1]) is shown, and he explains the slice returns a list with the second-to-last element, [30].

  4. 10:00 – 12:24 10:00-12:24

    The instructor covers the final questions. Question 8: A = [1, 2, 3, 2, 1], print(set(A)), print(set(A)). He explains that set(A) removes duplicates, so it returns {1, 2, 3}. Question 9: A = {1, 2, 3}, B = {3, 4, 5}, print(A ^ B). He explains that ^ is the symmetric difference operator, which returns elements in either A or B but not in both, resulting in {1, 2, 4, 5}. Question 10: A = {1, 2, 3}, B = {3, 4, 5}, print(A == B). He states this is False. Question 11: A = {1, 2, 3}, B = {3, 4, 5}, print(A < B). He states this is False. Question 12: nums = [1, 2, 3, 4], print(nums.pop(nums.index(3))). He explains that nums.index(3) returns 2, and pop(2) removes and returns the element at index 2, which is 3. Question 13: A = [1, 2, 3], print(A * 2). He explains that this multiplies the list, resulting in [1, 2, 3, 1, 2, 3].

The video provides a comprehensive walkthrough of Python list and set operations, with a strong emphasis on understanding the difference between object assignment and copying. The core teaching point is the distinction between shallow and deep copying, illustrated through the behavior of nested lists. The instructor uses a clear, step-by-step approach, writing out the code and its execution on a digital whiteboard to visually demonstrate how changes to one variable can or cannot affect another. This practical, problem-solving approach helps students grasp the underlying memory model of Python objects, which is crucial for avoiding common bugs in their code.

Loading lesson…