2.7 Nested List

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-16-python/collections-strings/lists/asset-27-nested-list 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 video is a Python programming tutorial that explains the concept of nested lists. The instructor begins by defining nested lists as a way to store multiple sublists within a single list, providing the syntax `List_name=[[item-1,item-2],[item-3,item-4],......,item-n]` and an example `Student=[['Allen','Bob','Jhon','Jerry'],[21,19,24],[7.5,8.0,8.5,7.6]]`. The lecture then transitions to a new topic, 'Nested Lists Indexing & Slicing', where the syntax for accessing data is shown as `list_name[startindex:endindex][,][,]`. The instructor uses a diagram to illustrate positive and negative indexing for a list `nlist=[['a','b','c'],[65,66,67]]`, showing that the first sublist contains elements 'a', 'b', 'c' with positive indices 0, 1, 2 and negative indices -3, -2, -1, and the second sublist contains numbers 65, 66, 67 with positive indices 0, 1, 2 and negative indices -3, -2, -1.

Chapters

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

    The video starts with a title slide for 'Nested Lists'. The instructor, standing in front of a screen, introduces the topic. The slide defines nested lists as a way to store multiple sublists in a single list. It provides the syntax `List_name=[[item-1,item-2],[item-3,item-4],......,item-n]` and an example `Student=[['Allen','Bob','Jhon','Jerry'],[21,19,24],[7.5,8.0,8.5,7.6]]`. The instructor then begins to write a new example on the screen, `L=[[1,2,3],[4,5,6]]`, to demonstrate the concept of a nested list with two sublists.

  2. 2:00 – 4:04 02:00-04:04

    The instructor transitions to a new slide titled 'Nested Lists Indexing & Slicing'. The slide explains that indexing and slicing are ways to access data items from a list, with the syntax `list_name[startindex:endindex][,][,]`. It clarifies that the slice includes the start index but excludes the end index. The instructor then presents a diagram for a list `nlist=[['a','b','c'],[65,66,67]]`. The diagram visually represents the positive indices (0, 1, 2) and negative indices (-3, -2, -1) for both sublists, with the first sublist containing 'a', 'b', 'c' and the second containing 65, 66, 67. The instructor points to the diagram while explaining the indexing system.

The video provides a structured lesson on Python's nested lists. It first establishes the definition and syntax for creating a nested list, using a clear example. The lesson then progresses to the practical application of accessing data within these structures through indexing and slicing. The use of a visual diagram to explain positive and negative indexing for a two-level list effectively demonstrates the hierarchical nature of the data structure, which is fundamental for understanding how to manipulate complex data in Python.

Loading lesson…