Linked Lists with C

Linked Lists with C, available at $64.99, has an average rating of 4.63, with 17 lectures, based on 183 reviews, and has 1053 subscribers.

You will learn about Student will learn how to create and use linked lists in C by developing a library of functions. This course is ideal for individuals who are Students interested in learning about data structures in C programming. It is particularly useful for Students interested in learning about data structures in C programming.

Enroll now: Linked Lists with C

Summary

Title: Linked Lists with C

Price: $64.99

Average Rating: 4.63

Number of Lectures: 17

Number of Published Lectures: 17

Number of Curriculum Items: 17

Number of Published Curriculum Objects: 17

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will Learn

Student will learn how to create and use linked lists in C by developing a library of functions.

Who Should Attend

Students interested in learning about data structures in C programming.

Target Audiences

Students interested in learning about data structures in C programming.

In this course you will be taught through step-by-step live coding examples how to create and use a library of functions for working with Linked Lists in the C programming language!

Linked Lists are an important type of data structure in computer science and computer programming, so before we walkthrough how to create and use them, we’ll also cover what Linked Lists are, how they work, and some practical applications of Linked Lists.  The bulk of the course is spent on learning how to work with Linked Lists using C, with over 3 hours of video covering a series of common functionalities explaining step-by-step how they are implemented.  We’ll also teach you how to package your functions together into a re-usable library, and how to document your code.

By the end of the course you will have a C library of Linked List functions that will help you build a great programming portfolio!

Linked List functionalities that are covered include:

Creating a linked list

Inserting nodes on the head and tail of a linked list

Deleting nodes from the head and tail of a linked list

Sorting a linked list

Deleting matching nodes from a linked list

Deleting duplicate nodes from a linked list

Reversing a linked list

Duplicating a linked list

Determining if a value is in a linked list

and many others, over 20 functions in total.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Course Overview

Lecture 2: Introduction to Linked Lists

Chapter 2: Linked Lists in C

Lecture 1: Creating and Printing Linked Lists

Lecture 2: Inserting Nodes into a Linked List

Lecture 3: Deleting Nodes from a Linked List

Lecture 4: Length, Search, Count and Replace Operations for Linked Lists

Lecture 5: Deleting Matches from a Linked List

Lecture 6: Efficiently Deleting Matches from a Linked List

Lecture 7: Appending and Reversing Linked Lists

Lecture 8: Sorting and Removing Duplicates from a Linked List

Lecture 9: Delete and Insert After a Value in a Linked List

Lecture 10: Practice Challenge Questions

Lecture 11: Practice Challenge Question Solutions

Lecture 12: Performance Test: Linked List vs Array

Chapter 3: Creating the Linked List C Library

Lecture 1: Creating the Library

Lecture 2: Documenting the Library

Chapter 4: Building your portfolio

Lecture 1: Building Your Portfolio with Linked Lists

Instructors

Portfolio Courses
Build your portfolio. Impress employers.

Rating Distribution

1 stars: 1 votes

2 stars: 0 votes

3 stars: 2 votes

4 stars: 42 votes

5 stars: 138 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!