种子简介

种子名称： [Tutorialsplanet.NET] Udemy - Linux System Programming Techniques & Concepts
文件类型： 视频
文件数目： 153个文件
文件大小： 3.65 GB
收录时间： 2023-10-15 22:33
已经下载： 3次
资源热度： 76
最近下载： 2024-5-18 22:19

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:8e94a2ca26804dd065d241f815e0a2c9687dc609&dn=[Tutorialsplanet.NET] Udemy - Linux System Programming Techniques & Concepts 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[Tutorialsplanet.NET] Udemy - Linux System Programming Techniques & Concepts.torrent

01 - Introduction/001 Introduction.mp4110.39MB

01 - Introduction/002 Join Telegram Group.mp4580.34KB

01 - Introduction/003 Setting up Linux Development Environment.mp417.89MB

01 - Introduction/004 Begin - Doubly Linked List as a Library.mp434.24MB

01 - Introduction/005 Quick Compilation Steps.mp422.99MB

01 - Introduction/006 Summary.mp48.3MB

02 - Understanding Header Files/001 What are Header Files and their Purpose _.mp413.77MB

02 - Understanding Header Files/002 Relationship between Source and Header Files.mp455.2MB

02 - Understanding Header Files/003 Text Substitution.mp436.8MB

02 - Understanding Header Files/004 Text Substitution Example.mp419.07MB

02 - Understanding Header Files/005 Text Substitution Demonstration.mp410.3MB

03 - Preprocessing Directives/001 Problem Of Duplicate Inclusion of Header Files.mp417.73MB

03 - Preprocessing Directives/002 What are Pre-processing Directives _.mp425.58MB

03 - Preprocessing Directives/003 Solution to Duplicate Inclusion of Hdr files using Preprocessing Directives.mp436.53MB

04 - Correct Way of Using Structures and Functions/001 Structure Definitions and Use.mp412.97MB

04 - Correct Way of Using Structures and Functions/002 Function Declaration and Use.mp426.57MB

04 - Correct Way of Using Structures and Functions/003 Recursive Dependency.mp424.92MB

04 - Correct Way of Using Structures and Functions/004 Solution to Recursive Dependency.mp412.86MB

04 - Correct Way of Using Structures and Functions/005 Summary.mp44.59MB

05 - Quick Creation of Static and Dynamic Libraries/001 Resuming with Doubly Linked List Library.mp421.73MB

05 - Quick Creation of Static and Dynamic Libraries/002 Static and Dynamic Libraries - Quick Creation.mp488.96MB

05 - Quick Creation of Static and Dynamic Libraries/003 Linking with Static Library.mp438.41MB

05 - Quick Creation of Static and Dynamic Libraries/004 Linking with Dynamic Library.mp410.36MB

05 - Quick Creation of Static and Dynamic Libraries/005 Summary.mp42.47MB

06 - Four Stages of Compilation Process/001 4 Stages of Compilation Process.mp416.34MB

06 - Four Stages of Compilation Process/002 Stage 1 of 4 - Preprocessing stage.mp410.93MB

06 - Four Stages of Compilation Process/003 Stage 2 of 4 - Compilation Stage.mp49.64MB

06 - Four Stages of Compilation Process/004 Stage 3 of 4 - Assembler Stage.mp434.71MB

06 - Four Stages of Compilation Process/005 Stage 4 of 4 - Linking Stage.mp421.42MB

07 - Build Project using Makefiles/001 Introducing Makefile.mp415.23MB

07 - Build Project using Makefiles/002 Makefile Analogy - Dependency Tree.mp417.04MB

07 - Build Project using Makefiles/003 Makefile Assignment - part1.mp457.34MB

07 - Build Project using Makefiles/004 Makefile Assignment - part2.mp447.19MB

07 - Build Project using Makefiles/005 Final Makefile.mp434.21MB

08 - Programmable Libraries - Generics/001 Introduction.mp414.16MB

08 - Programmable Libraries - Generics/002 Revisiting DLL.mp450.82MB

08 - Programmable Libraries - Generics/003 Problem Statement.mp416.37MB

08 - Programmable Libraries - Generics/004 Solution - Responsibility Delegation.mp441.22MB

08 - Programmable Libraries - Generics/005 Using Programmable DLL Library - Code Walk.mp49.87MB

08 - Programmable Libraries - Generics/006 Search Callback Summary.mp48.13MB

08 - Programmable Libraries - Generics/007 Comparison Callback.mp483.51MB

08 - Programmable Libraries - Generics/008 Comparison Callback Demo.mp47.96MB

08 - Programmable Libraries - Generics/009 Summary.mp45.17MB

09 - Iterative Macros/001 Getting Started.mp447.08MB

09 - Iterative Macros/002 For loop Semantics.mp48.63MB

09 - Iterative Macros/003 Iterative Macros For LinkedList.mp438.09MB

09 - Iterative Macros/004 Iterative Macros for Binary Trees.mp425.54MB

09 - Iterative Macros/005 Tree Iterators Prerequisites.mp410.92MB

09 - Iterative Macros/006 Tree Iterators Implementation.mp418.17MB

09 - Iterative Macros/007 Summary.mp44.32MB

10 - Glue Based Data structures/001 Introduction.mp410.68MB

10 - Glue Based Data structures/002 Glthreads Definition.mp412.88MB

10 - Glue Based Data structures/003 Difference - Traditional Vs Glue Based DLL.mp414.56MB

10 - Glue Based Data structures/004 Structure Field Offset.mp423.14MB

10 - Glue Based Data structures/005 GLNode Insertion.mp411.06MB

10 - Glue Based Data structures/006 GLThread Iteration.mp49.52MB

10 - Glue Based Data structures/007 GLNode Removal.mp43.69MB

10 - Glue Based Data structures/008 Code Walk - Demo.mp423.77MB

10 - Glue Based Data structures/009 Traditional List Problems.mp416.84MB

10 - Glue Based Data structures/010 GLThread Benefits.mp414.81MB

11 - Opaque Pointers/001 Introduction.mp45.73MB

11 - Opaque Pointers/002 Typical Library Design.mp47.72MB

11 - Opaque Pointers/003 Problem Statement.mp411.52MB

11 - Opaque Pointers/004 Solution Strategy.mp414.9MB

11 - Opaque Pointers/005 Conclusion.mp46.58MB

12 - Bit Programming/001 Introduction to Bit Programming.mp440.84MB

12 - Bit Programming/002 XOR Operator.mp427.92MB

12 - Bit Programming/003 Using Bits as Flags.mp466.87MB

12 - Bit Programming/004 Using Enums as Bits.mp410.58MB

12 - Bit Programming/005 Bit Pattern Matching.mp412.65MB

12 - Bit Programming/006 Bit Pattern Matching Steps.mp414.51MB

12 - Bit Programming/007 BitMaps.mp442.65MB

12 - Bit Programming/008 BitMap APIs and Implementation.mp422.37MB

13 - TLV Based Communication/001 TLVs Introduction.mp422.6MB

13 - TLV Based Communication/002 Why we need TLVs _.mp461.53MB

13 - TLV Based Communication/003 Why we need TLVs - Another scenario.mp419.12MB

13 - TLV Based Communication/004 Understanding TLVs.mp431.07MB

13 - TLV Based Communication/005 TLV Addressing the problem of Heterogeneity.mp4172.02MB

13 - TLV Based Communication/006 TLV Addressing the problem of Software Upgrade.mp416.81MB

13 - TLV Based Communication/007 Data Structure - STREAMS.mp426.24MB

13 - TLV Based Communication/008 TLV De-Serialization using STREAMS.mp427MB

14 - Working with Linux Posix Timers/001 Agenda and Prerequisites.mp413.49MB

14 - Working with Linux Posix Timers/002 Timer Relevance.mp410.65MB

14 - Working with Linux Posix Timers/003 Timer Types.mp416.27MB

14 - Working with Linux Posix Timers/004 Posix APIs for Timers.mp413.79MB

14 - Working with Linux Posix Timers/005 Timer Design.mp434.21MB

14 - Working with Linux Posix Timers/006 Timer Creation Steps.mp453.34MB

14 - Working with Linux Posix Timers/007 Timer Implementation and Demo.mp499.66MB

15 - Machine Endianness/001 Machine Endianness.mp414.05MB

15 - Machine Endianness/002 Program to find Machine Endianness.mp43.99MB

16 - Memory Layout of Linux Process/001 Agenda.mp49.31MB

16 - Memory Layout of Linux Process/002 Virtual Memory Memory Basics.mp429.1MB

16 - Memory Layout of Linux Process/003 Memory Layout of Linux Process.mp430.17MB

16 - Memory Layout of Linux Process/004 Example _ Memory Layout of Linux Process.mp474.4MB

16 - Memory Layout of Linux Process/005 Exercise on size command.mp46.61MB

17 - Stack Memory Management/001 Stack Memory Basics.mp416.67MB

17 - Stack Memory Management/002 Stack Memory Contents.mp432.4MB

17 - Stack Memory Management/003 Stack-Overflow and Prevention.mp49.67MB

17 - Stack Memory Management/004 Stack Memory Corruption.mp414.58MB

17 - Stack Memory Management/005 Procedure Call and Return - Getting Started.mp449.45MB

17 - Stack Memory Management/006 Common Cpu Registers.mp49.32MB

17 - Stack Memory Management/007 Procedure Call Mechanism.mp431.29MB

17 - Stack Memory Management/008 Purpose of Base Pointer register (ebp).mp412.63MB

17 - Stack Memory Management/009 Formalizing Procedure Call Algorithm.mp411.82MB

17 - Stack Memory Management/010 Procedure Return - Goals.mp412.05MB

17 - Stack Memory Management/011 Procedure Return Explained - Step by Step.mp418.73MB

17 - Stack Memory Management/012 Formalizing Procedure Return Algorithm.mp412.99MB

18 - Heap Memory Management/001 Heap Memory Management - Goals and Introduction.mp411.74MB

18 - Heap Memory Management/002 Malloc() - Quick Revision.mp426.89MB

18 - Heap Memory Management/003 Break pointer.mp47.49MB

18 - Heap Memory Management/004 brk and sbrk system calls.mp417.98MB

18 - Heap Memory Management/005 Malloc Version 1.0.mp415.32MB

18 - Heap Memory Management/006 Problem Statement.mp410.75MB

18 - Heap Memory Management/007 Heap Memory Management Requirement.mp48.46MB

18 - Heap Memory Management/008 MetaBlock and DataBlock.mp418.7MB

18 - Heap Memory Management/009 Allocations and Deallocations.mp422.34MB

18 - Heap Memory Management/010 Block Splitting.mp424.82MB

18 - Heap Memory Management/011 Block Merging.mp411.38MB

18 - Heap Memory Management/012 Problem of Fragmentation.mp437.01MB

19 - Concepts of Paging/001 Introduction.mp410.58MB

19 - Concepts of Paging/002 Byte Addressable Memory.mp413.67MB

19 - Concepts of Paging/003 What is 32 bit Or 64 bit system _.mp412.33MB

19 - Concepts of Paging/004 Bus System.mp424.85MB

19 - Concepts of Paging/005 CPU Generates Virtual Addresses.mp422.93MB

19 - Concepts of Paging/006 Data bus and Address Bus.mp432.15MB

19 - Concepts of Paging/007 Mapping of Virtual Address to Physical Address.mp427.25MB

19 - Concepts of Paging/008 Physical Pages and Frames.mp413.41MB

19 - Concepts of Paging/009 Page Swapping.mp48.9MB

19 - Concepts of Paging/010 Virtual Memory Pages.mp456.91MB

19 - Concepts of Paging/011 1_1 Mapping between Physical and Virtual Page.mp421.88MB

19 - Concepts of Paging/012 Virtual Address Composition.mp411.96MB

19 - Concepts of Paging/013 Page Table.mp420.01MB

19 - Concepts of Paging/014 Paging in Action.mp482.65MB

19 - Concepts of Paging/015 Multiple Process Scenario.mp412.79MB

19 - Concepts of Paging/016 Resolve External Fragmentation.mp46.5MB

19 - Concepts of Paging/017 Page Allocation to a Process - Part1.mp418.52MB

19 - Concepts of Paging/018 Page Allocation to a Process - Part2.mp417.46MB

19 - Concepts of Paging/019 Shared Physical Pages.mp441.48MB

19 - Concepts of Paging/020 Page tables Problems.mp46.18MB

19 - Concepts of Paging/021 Page Table Problem 1 - Large Page Table Size Matters.mp413.68MB

19 - Concepts of Paging/022 Page Table Problem 2 - Need for Contiguous Main Memory.mp49.31MB

19 - Concepts of Paging/023 Page Table Problem 3 - Page Table Hollowness.mp419.21MB

20 - Multi Level Paging/001 Introduction.mp416.39MB

20 - Multi Level Paging/002 Multi Level Paging In Action - Part1.mp456.91MB

20 - Multi Level Paging/003 Multi Level Paging In Action - Part2.mp478.22MB

21 - Paging on Demand/001 Problem Statement.mp413.15MB

21 - Paging on Demand/002 Demand Paging Steps.mp431.07MB

21 - Paging on Demand/003 Effective Access Time.mp48.03MB

22 - Memory Management for Multi-threaded Processes/001 Introduction.mp413.91MB

22 - Memory Management for Multi-threaded Processes/002 Virtual Memory Management.mp415.31MB

22 - Memory Management for Multi-threaded Processes/003 Page Table Management.mp423.73MB

22 - Memory Management for Multi-threaded Processes/004 Thread Termination.mp47.33MB

23 - Bonus/001 Bonus Lecture - Time to get some Candies __.mp46.03MB