6.3 String Negative Indexing

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-16-python/collections-strings/strings/asset-63-string-negative-indexing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Time and Work, Mensuration and Geometry, Simple Interest and Compound Interest, Speed Time and Distance, Age Problems, Mixture and Alligation, Algebra, Powers and Exponents (Surds and Indices), Pipe and Cistern, Trigonometry, Statistics, Data Interpretation, Arithmetic
  3. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Analogy, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Seating Arrangements, Syllogisms, Venn Diagram, Puzzle Solving (Puzzles), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Calendar, Clock
  4. General Knowledge: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, GK- Current Affairs, Static General Knowledge
  5. Art of Teaching: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Classroom Management & Communication, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement, Professional Development & Ethics, Policies, Acts & Contemporary Issues, Curriculum & School Environment, Guidance, Counselling & Mental Health, Inclusive Education & Special Needs, Micro-Teaching & Teaching Skills, Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML
  18. Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on Python string negative indexing, presented by an instructor in front of a digital screen. The lesson begins by defining negative indexing as a method to access string characters from the right-hand side, starting with -1 for the last character and ending with -12 for the first character in the example string "Anand Biswas". The instructor uses a diagram to visually map the negative indices to each character. The core concept is demonstrated with the code snippet `print(StudentName[-2])`, which accesses the second-to-last character. The lecture progresses to a practical exercise titled "Guess Output?", where the instructor analyzes a series of print statements using negative indexing on the string "Institute of Engineering and Technology". He systematically evaluates each expression, such as `print(College[-4])` and `print(College[-6-4])`, explaining the result of each calculation and writing the output characters on the screen. The video concludes with a "Thank You..." slide.

Chapters

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

    The video opens with a title slide for a Python lecture on "String Negative Indexing". The instructor introduces the concept, explaining that negative indexing starts from -1 for the last character and moves leftward. A diagram on the screen illustrates this with the string "Anand Biswas", showing the negative indices from -1 (for 's') to -12 (for 'A'). The instructor points to the diagram, emphasizing that the index for the first character 'A' is -12. The slide also shows the code `StudentName="Anand Biswas"` and `print(StudentName[-2])` as an example of accessing a character via negative index.

  2. 2:00 – 2:37 02:00-02:37

    The instructor transitions to a new slide titled "Guess Output?". This slide presents a string `College="Institute of Engineering and Technology"` and a list of print statements using negative indexing, such as `print(College[-4])` and `print(College[-6-4])`. The instructor analyzes each statement, explaining the calculation of the index. For example, he points to `print(College[-4])` and writes the output 'y' on the screen, explaining that -4 refers to the fourth character from the end. He continues this process for all the listed expressions, writing the corresponding output characters (e.g., 'n', 'T', 'y', 'g', 'e', 'I', 'n', 'g', 'y') to demonstrate the concept of accessing characters from the right side of the string.

The video provides a clear, step-by-step tutorial on Python's negative indexing for strings. It begins with a foundational definition and a visual aid to establish the concept, then moves to a practical example to demonstrate its application. The lesson culminates in a problem-solving exercise that reinforces the concept by having the student predict the output of various indexing expressions, thereby solidifying their understanding of how to calculate and use negative indices.

Loading lesson…