2.3 List Slicing

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-3-python/collections-strings/lists/asset-23-list-slicing 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 list slicing. The instructor begins by introducing the concept of list slicing as a method to access a subset of data items from a list. The core syntax is presented as `list_name[startindex:endindex]`, with the explanation that the slice includes elements from the start index up to, but not including, the end index. The lesson then transitions to a practical example using a list named `Age` containing the values [20, 24, 17, 26, 22, 28, 32, 25, 36, 31, 32, 42]. A diagram on the screen illustrates both positive and negative indexing for this list. The instructor demonstrates how to use the slicing syntax with various combinations of positive and negative indices, such as `Age[0:3]` to get the first three elements and `Age[-11:-7]` to get a slice from the negative index perspective. The video concludes with a 'Guess Output?' section, where the instructor walks through several more complex slicing expressions, including those with step values, and writes the expected output for each on the screen, reinforcing the concepts of start, end, and step in list slicing.

Chapters

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

    The video opens with a title slide for a Python lecture on 'List Slicing'. The instructor, a man in a black polo shirt, stands in front of a large screen. He begins by introducing the topic, explaining that list slicing is a way to access a set of data items from a given list. The on-screen text defines the syntax as `list_name[startindex:endindex]` and clarifies that the slice includes elements from the start index up to, but not including, the end index. The instructor emphasizes that slice indices can be positive or negative.

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

    The instructor moves to a detailed example. The screen displays a list `Age=[20,24,17,26,22,28,32,25,36,31,32,42]` with a diagram showing both positive and negative indices. He explains the syntax `L[S:E]` and demonstrates `Age[0:3]`, writing the output `[20,24,17]` on the screen. He then explains that the end index is exclusive, so `Age[0:3]` does not include the element at index 3. He proceeds to show `Age[-11:-7]`, explaining that this slice starts at the 11th element from the end and ends at the 7th element from the end, writing the output `[24,17,26,22]` to illustrate the concept of negative indexing.

  3. 5:00 – 6:49 05:00-06:49

    The instructor transitions to a 'Guess Output?' section, presenting a series of print statements to be solved. He systematically works through each one, writing the expected output on the screen. For example, he explains `print(Age[1:1+4+0])` as `Age[1:5]`, resulting in `[24,17,26,22]`. He continues with `print(Age[0:2*3])` which is `Age[0:6]`, yielding `[20,24,17,26,22,28]`. He also demonstrates slicing with negative indices, such as `print(Age[-12:-7+3])` which simplifies to `Age[-12:-4]`, resulting in `[20,24,17,26,22]`. The final example shown is `print(Age[2:2])` which returns an empty list `[]` because the start and end indices are the same.

The video provides a comprehensive, step-by-step tutorial on Python list slicing. It begins with a clear definition of the concept and its syntax, `list_name[start:end]`, emphasizing the exclusive nature of the end index. The lesson is built around a single, well-structured example list, `Age`, which is used to demonstrate both positive and negative indexing. The instructor effectively uses a diagram to visualize the list and its indices, making the abstract concept of negative indexing more concrete. The progression from basic slicing to more complex examples with arithmetic expressions and negative indices, culminating in a 'Guess Output?' section, creates a logical and engaging learning path that reinforces the core principles of list slicing.

Loading lesson…