Unordered List
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
- Computer Networks & Cybersecurity: 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, Hardware Basics, Network Security
- Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
- Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
- TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
- 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, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
- Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
- Live Classes: ISRO Live classes
- Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces HTML ordered lists, explaining that they display items in a specific sequence using numbers or letters. The instructor demonstrates the basic syntax with <ol> and <li> tags, showing a rendered numbered list of drinks such as lemon juice, pineapple juice, and mango shake. Handwritten annotations illustrate practical uses for instructions or procedures, including steps like 'boil', 'add cf', 'add su', and 'milk' for a mango shake recipe, as well as rankings such as race fractions 1/2, 2/3, and 3/4. The lesson then covers the type attribute, which modifies the numbering format. A reference table maps values 1, A, a, I, and i to their corresponding outputs: default numbers, uppercase letters, lowercase letters, uppercase Roman numerals, and lowercase Roman numerals. The instructor draws arrows connecting code snippets like <ol type="A"> to their visual browser outputs and places checkmarks next to correct pairs. Finally, the lecture transitions to controlling list counting with the start attribute. Examples such as <ol start="50"> and <ol type="I" start="50"> show how to begin numbering from a custom value, with rendered outputs like '50. Orange', '51. Apple', and Roman numeral entries for Kiwi and Banana.
Chapters
0:00 – 2:00 00:00-02:00
The video introduces the ordered list in HTML, defining it as a list that displays items in a specific sequence using numbers or letters. On-screen text states: 'An ordered list displays items in a specific sequence using numbers or letters.' The instructor shows HTML code with <ol> and <li>Lemon juice</li>, producing a rendered numbered list including '1. Lemon juice', '2. Pineapple juice', and '3. Mango shake'. Handwritten notes appear with steps like 'Boil', 'add cf', 'add su', and 'milk' to illustrate instructions, while a race example with fractions 1/2, 2/3, and 3/4 demonstrates rankings. The instructor underlines 'instructions' in the definition to emphasize suitable uses.
2:00 – 5:00 02:00-05:00
The lesson moves to the type attribute, with on-screen text reading 'Ordered List Type Attribute' and 'The type attribute modifies numbering format.' A table presents values 1, A, a, I, and i alongside their results. The instructor maps code snippets to visual outputs using arrows: <ol type="A"> produces uppercase letters, <ol type="a"> lowercase letters, <ol type="I"> uppercase Roman numerals, and <ol type="i"> lowercase Roman numerals. A checkmark confirms the type="I" pairing. The screen then transitions to a slide titled 'Control List Counting', introducing the start attribute with examples <ol start="50"> and <ol type="I" start="50">.
5:00 – 5:16 05:00-05:16
The final segment focuses on the start attribute for controlling ordered list numbering. The instructor draws a bracket around the first two <li> items and writes '50' to indicate the starting value, then draws an arrow from the code annotation to the rendered list showing '50. Orange' and '51. Apple'. The instructor writes '1 2 3 y' above the code to illustrate default counting and underlines start="50" in a second <ol> tag. Checkmarks appear next to 'Kiwi' and 'Banana', with outputs including 'L. Kiwi' and 'II. Banana'. A red line under the word 'control' in the introductory text reinforces that the start attribute overrides default numbering.
The lecture progresses from defining ordered lists to demonstrating their syntax, then to customizing appearance and counting. Central ideas include the <ol> and <li> tags, the type attribute for changing numbering style (numbers, letters, Roman numerals), and the start attribute for setting a custom starting value. Worked examples include a drink list, a mango shake recipe with procedural steps, and race rankings to show practical applications. The instructor uses handwritten annotations, arrows connecting code to output, checkmarks for correct pairings, and a reference table for type values. Key transitions occur from basic list creation to the type attribute, then to the start attribute for controlling counting. The lesson emphasizes that ordered lists are suitable for instructions, procedures, and rankings, and that attributes can be combined to modify both style and starting value.