Insertion in Link List

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/linked-list/sll-basics-standard-operations/asset-insertion-in-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.

The lecture focuses on implementing linked list insertion operations in C-style pseudocode. The instructor begins by addressing the task of inserting a node at the beginning of a list, detailing the necessary structure definition and function logic. He then transitions to inserting a node after a specific location, highlighting the critical order of pointer updates to prevent data loss.

Chapters

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

    The session addresses "Write a C-style pseudocode for inserting a node with a key in the starting of link-list?". The instructor displays the node structure definition: `typedef struct node { int data; struct node *next; };`. The instructor defines the function `Void Insert(Node** head, int key)`. The core logic involves three steps: first, creating a new node using `node* new = Create_new_node(key);`. Second, linking the new node to the current head with `new -> next = *head;`. Third, updating the head pointer itself using the double pointer syntax `*head = new;`. A diagram illustrates the new node becoming the new head, pointing to the previous first node. He also details the helper function `CreateNewNode(int key)`, which uses `malloc` to allocate memory, assigns the key to `data`, and initializes `next` to `NULL`. This allows the function to modify the original head pointer in the calling scope.

  2. 2:00 – 3:58 02:00-03:58

    Next, the topic addresses "Write a C-style pseudocode for inserting a node with a key after a location in a link-list?". The function signature changes to `Void Insert(Node* Loc, int key)`. A safety check `if(Loc == null) { return; }` ensures the location pointer is valid. The insertion logic follows: create the new node `node* new = Create_new_node(key);`. Crucially, he explains the order of operations. First, the new node's next pointer must point to the node currently following Loc: `new -> next = Loc -> next;`. Only then is Loc's next pointer updated to point to the new node: `Loc -> next = new;`. A diagram shows the new node inserted between `Loc` and the subsequent node. The instructor emphasizes that reversing this order would lose the reference to the rest of the list. The function is reviewed, confirming it allocates memory and initializes fields.

The lesson systematically builds understanding of pointer manipulation in linked lists. By contrasting insertion at the head (which requires a double pointer) with insertion after a node (which requires careful sequencing of pointer assignments), the instructor provides a clear framework for modifying list structures without losing data. The visual progression from code to diagram reinforces the abstract pointer logic.

Loading lesson…