Doubly Link List

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/linked-list/doubly-circular-variants/asset-doubly-link-list after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. 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, Hardware basics, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video introduces the Doubly Linked List data structure. The instructor explains that it can be traversed in two directions: in the unusual forward direction from the beginning of the list to the ends or in the end direction from the end of the list to the beginning. A critical feature is that given the location of a specific node, the structure provides immediate access to both the next node and the preceding node. This is useful for deleting a node without traversing the entire list. The lecture uses a slide with text definitions and a diagram showing nodes with 'Prev', 'Data', and 'Next' fields.

Chapters

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

    The instructor starts by explaining the on-screen text definition of a Doubly Linked List. He emphasizes bidirectional traversal, noting movement from the beginning to the ends or in the end direction from the end to the beginning. He discusses the advantage of having immediate access to both the next and preceding nodes given a location LOC. He mentions that this means one is able to delete a node N from the list without traversing any part of the list. To visualize this, he begins drawing a rough sketch of linked nodes with arrows at the bottom of the screen.

  2. 2:00 – 2:39 02:00-02:39

    The instructor moves to a concrete example using the diagram on the slide. He writes memory addresses '100', '200', and '300' above the nodes containing data values 10, 20, and 30 respectively. He uses red ink to draw arrows representing the 'Prev' and 'Next' pointers, explicitly showing the bidirectional links between the nodes. He points out the 'start' pointer at the first node and the 'end' pointer at the last node, reinforcing how the list is anchored. He draws additional arrows to demonstrate the flow of pointers in both directions.

The lecture transitions from a theoretical definition to a practical visualization of a Doubly Linked List. By annotating the slide with memory addresses and drawing pointer arrows, the instructor clarifies how the 'Prev' and 'Next' fields facilitate bidirectional traversal and efficient node manipulation. This visual approach helps students understand the underlying memory mechanics and the specific advantages of this data structure over a singly linked list.

Loading lesson…