Linked lists for absolute beginners

Linked lists for absolute beginners, available at Free, has an average rating of 4.4, with 20 lectures, 2 quizzes, based on 63 reviews, and has 6079 subscribers.

You will learn about Linked lists structure implementation Algorithms related to linked lists This course is ideal for individuals who are Beginner programmers that want to fully understand linked lists and their potential It is particularly useful for Beginner programmers that want to fully understand linked lists and their potential.

Enroll now: Linked lists for absolute beginners

Summary

Title: Linked lists for absolute beginners

Price: Free

Average Rating: 4.4

Number of Lectures: 20

Number of Quizzes: 2

Number of Published Lectures: 20

Number of Published Quizzes: 2

Number of Curriculum Items: 22

Number of Published Curriculum Objects: 22

Original Price: Free

Quality Status: approved

Status: Live

What You Will Learn

Linked lists structure implementation
Algorithms related to linked lists

Who Should Attend

Beginner programmers that want to fully understand linked lists and their potential

Target Audiences

Beginner programmers that want to fully understand linked lists and their potential

Learn the basics of linked lists in the C programming language. This course treats the student as a complete beginner to linked lists that has a basic understanding of arrays/pointers and other similar concepts of the C language. What we want is, at the end of this course, for you to be able to use a linked list exactly like a plain old array.

After finishing the course you will be able to

Create the data structure for a singly and doubly linked list
Insert any element wherever in the linked list
Remove an element from the linked list
Understand how the linked list is allocated in memory
Properly deallocate the linked list
And to code other useful algorithms

Course Curriculum

Chapter 1: Singly linked lists

Lecture 1: Introduction to linked lists

Lecture 2: Iterating a linked list

Lecture 3: Inserting at the end

Lecture 4: Deallocating (or deleting) a linked list

Lecture 5: Inserting at the beginning

Lecture 6: Inserting after a node

Lecture 7: Inserting in a sorted list

Lecture 8: Removing an element

Lecture 9: Reversing a linked list

Lecture 10: Detecting cycles/loops

Lecture 11: Introduction to recursive functions on linked lists, counting number of elements

Chapter 2: Doubly linked lists

Lecture 1: Introduction to doubly linked lists

Lecture 2: Iterating a doubly linked list

Lecture 3: Deallocating (or deleting) a doubly linked list

Lecture 4: Inserting at the beginning

Lecture 5: Inserting at the end

Lecture 6: Inserting after a node

Lecture 7: Removing a node

Lecture 8: Finding a node

Lecture 9: Reversing a doubly linked list

Instructors

Sergiu Muresan
Knowledgeable developer and dedicated teacher

Rating Distribution

1 stars: 0 votes
2 stars: 2 votes
3 stars: 14 votes
4 stars: 16 votes
5 stars: 31 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu