4.9. Linked List&State Machine and Multithreading - C Language Part Intensive Lecture Part 9

This course will learn the linked list data structure

106316 people study

senior 17 class hours Updated on October 22, 2015

 QR code Download the school APP Cache video for offline viewing

 Zhu Youpeng
    • Best selling package
    • Selected Package
    • Popularity package
    • Exclusive package
    • High salary package
Embedded Software Engineer's Complete Learning Roadmap Topic - Actual Project Attacks
Embedded Engineer Cultivation Plan Series Courses -- 0.1. Embedded Software Engineer Learning Guide
90410 people study
¥1.00
Embedded Engineer Cultivation Plan Series Course -- 0.2. Mr. Zhu will take you to learn Linux
337338 people study
¥1.00
Embedded Engineer Cultivation Plan Series Courses -- 0.3. Embedded Linux C Programming Foundation
551667 people study
¥1.00
More 70 courses
Zhu Youpeng's Advanced Intensive Lecture on Embedded - C Language (the most complete 2.0)
4.1 The big topic of memory -- the opening part of the intensive lecture on C language
146281 people study
¥1.00
4.2. C Language Bit Operation Details - C Language Part Intensive Lecture Part 2
70107 people study
¥1.00
4.3. Pointer is the essence of C - Part 3 of the Intensive Lecture of Language C
137281 people study
¥35.00
More 10 courses
ARM Bare Metal Combat Complete Video Course Topic
1.1. What you need to know about ARM - the opening part of the bare machine
176996 people study
¥1.00
1.2 ARM Architecture and Assembly Instructions - ARM Bare Metal Part II
238532 people study
¥39.00
1.3. Development board, schematic diagram and data manual - ARM Bare Metal Part III
101623 people study
¥29.00
More 16 courses
U-Boot and System Transplantation Practical Collection Video Course Topic
2.1. U-Boot learning prequel - U-Boot and system migration opening part
89841 people study
¥1.00
2.2. Basic shell and Makefile-U-Boot and system migration Part 2
52666 people study
¥23.00
2.3. Zero distance initial experience of U-Boot and system migration Part 3
38706 people study
¥18.00
More 20 courses
U-Boot and System Transplantation Practical Collection Video Course Topic
2.1. U-Boot learning prequel - U-Boot and system migration opening part
89841 people study
¥1.00
2.2. Shell and Makefile-U-Boot and System Migration Part 2
52666 people study
¥23.00
2.3. Zero distance initial experience of U-Boot and system migration Part 3
38706 people study
¥18.00
More 20 courses
  • Course Introduction
  • Course outline

Suitable for:

This topic is suitable for students who have a certain foundation of C language (at least have learned C language, master the gcc development environment, and can write, compile, run, and debug simple C language programs under the linux command line)

You will learn:

This course will learn the linked list data structure

Course introduction:

Embedded is a hot topic in the current IT field. Its main application fields cover various industries related to mankind:

*Consumer electronics (mobile phones, tablets, game consoles)

*Internet of Things (smart home, smart city)

*Industrial automation (unmanned factory, industrial robot)

The huge business opportunities and talent gap have led to the high salary of embedded software engineers, which has attracted numerous young talents and college students to join and study hard.


Course features

*Zero foundation can be learned to lower the learning threshold.

*Easy to understand. Not afraid to learn, but afraid that you will not learn.

*Clear thinking, funny language, and will not sleep when watching the video······

*Videos+documents+exercises+Q&A to ensure the quality of learning in many ways.

*The teaching method of basic knowledge+train of thought guidance is to teach students how to fish more than to teach them how to fish.

*Series of courses. This tutorial is just an introduction, and there will be more exciting video updates in the future.


Expand more

Course outline- 4.9. Linked List&State Machine and Multithreading - C Language Part Intensive Lecture Part 9

  • one

    4.9.1. Importing Linked Lists This section introduces the concept of linked list from the defect of array, so that we can naturally understand the meaning and purpose of linked list.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [38:13]
  • two

    4.9.2. Implementation of Single Linked List This section introduces the idea and programming implementation of single linked list, focusing on the encapsulation and implementation of linked list nodes.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [32:52]
  • three

    4.9.3. Insertion Node of Single Linked List Algorithm This section describes the first algorithm of single linked list operation, node insertion. This paper mainly introduces two different algorithms: head insertion and tail insertion.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [35:23]
  • four

    4.9.4. Algorithm of Single Linked List Insert Node Continued This section is about the programming practice of inserting nodes at the end of the linked list. It takes you to write code to insert nodes from the end.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [30:18]
  • five

    4.9.5. Insert a New Node from the Linked List Header This section is about the programming practice of inserting the head of the linked list. It takes you to write code to insert nodes from the head.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [26:54]
  • six

    4.9.6. Algorithm Traversal Node of Single Linked List This section is the second algorithm of single linked list: the principle and programming implementation of traversing linked list.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [32:30]
  • seven

    4.9.7. Delete Node of Single Linked List Algorithm This section implements the third algorithm of single linked list: delete the specified node.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [35:15]
  • eight

    4.9.8. Reverse order of single linked list algorithm This section introduces the last algorithm of single linked list: linked list inversion, which is also the most difficult algorithm we deal with.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [31:35]
  • nine

    4.9.9. Introduction and Basic Implementation of Double linked List This section analyzes the defects of the single linked list, introduces the double linked list, and programs the nodes of the double linked list.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [20:25]
  • ten

    4.9.10. Insertion node of double linked list algorithm This section explains the first algorithm of double linked list: insert node. It is also divided into head insertion and tail insertion.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [35:26]
  • eleven

    4.9.11. Double linked list algorithm traversal node This section explains the second algorithm of double linked list: traversing nodes.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [23:57]
  • twelve

    4.9.12. Delete Node of Double linked List Algorithm This section introduces the algorithm of deleting nodes from double linked lists and carries out programming practice.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [29:09]
  • thirteen

    4.9.13. Linux kernel linked list This section introduces the kernel linked list by analyzing some defects of the linked list we talked about, and introduces the design ideas and main features of the kernel linked list.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [33:11]
  • fourteen

    4.9.14. Basic algorithm and usage introduction of kernel linked list This section introduces the basic algorithm implementation of the kernel linked list and the use of the kernel linked list. Guang'an uses the kernel linked list in the kernel code, especially in various drivers.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [25:25]
  • fifteen

    4.9.15. What is a state machine This section introduces the definition and classification of the state machine from the theoretical point of view, and then analyzes the main uses, application directions and problems to be solved of the state machine, so that we can understand why there is a state machine.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [29:07]
  • sixteen

    4.9.16. Implementation of simple state machine in C language This lesson uses C language to implement a simple state machine. The purpose is to further understand the implementation of the state machine, what the state machine has achieved, and what problems it has solved.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [25:25]
  • seventeen

    4.9.17. Introduction to Multithreading This lesson briefly introduces the concept of multithreading and multithreading programming, which is the beginning of using multithreading in later application programming.

    "Only for paying users" Click to download "4.9. Linked List&State Machine and Multithreading. txt"

    [19:11]
on-line
customer service
APP
download

Download Android client

Download iPhone client

official
WeChat

Follow official WeChat

return
Top
! function(f,p){"use strict"; var h=new RegExp("\\.css"),y=p.head||p.getElementsByTagName("head")[0],r=+navigator.userAgent.replace(/.*(?:AppleWebKit|AndroidWebKit)\/? (\d+).*/i,"$1")<536; function s(e){return"complete"===e.readyState||"loaded"===e.readyState}function b(e,t,n){var o="onload"in e; function a(){e.onload=e.onreadystatechange=null,e=null,t()}"css"!== n||!r&&o?o? (e.onload=a,e.onerror=function(){e.onerror=null,f._cdnFallback(e)}):e.onreadystatechange=function(){s(e)&&a()}:setTimeout(function(){!function e(t,n){var o; t.sheet&&(o=! 0),setTimeout(function(){o?n():e(t,n)},20)}(e,t)},1)}function u(t,n,e,o){if(t)if(h.test(t)){var a=t,r=e,c=u,i=p.createElement("link"); if(r.attrs)for(var l in r.attrs)i.setAttribute(l,r.attrs[l]); r.prefetch? (i.href=a,i.rel="prefetch",c&&c()):(i.rel="stylesheet",b(i,c,"css"),i.href=a),y.appendChild(i)}else{var c=t,d=e,a=u,f=d.prefetch?p.createElement("link"):p.createElement("script"); if(d.attrs)for(var s in d.attrs)f.setAttribute(s,d.attrs[s]); d.prefetch? (f.href=c,f.rel="prefetch",a&&a()):(f.charset="utf-8",b(f,a,"js"),f.async=!1,f.src=c),y.appendChild(f)}else setTimeout(function(){u()}); function u(){var e=n.indexOf(t);-1 r&&e.left