Linux Timers Implementation & Design in C

Data Structure & Algorithm to Schedule future events, Linux System Programming, Operating systems, C/C++ programming

What you'll learn
Design and Implementing Timers
Schedule and Trigger events in Future
Solve concurrency problem with Timers, Develop Timer Library
Develop Scalable and hierarchical Timers

Requirements
C coding language, Linux Operating System only
You should familiar with basic data structures such as linked list and function pointers.
Basics of Multi-threading - to start a thread
Must know Callbacks (function pointers)

Description
O Ghosh !! I just cannot shout-out more how important TIMERS are in almost all applications or projects. Timers are used to schedule events to be triggered or fired in future. How have you been doing this till now ?Timers Use case Scenarios :1. Firing One time future Event : Delete something after 100 seconds2. Firing Repeated Regular future Events : Send packet to machine X after every 5 seconds3. Periodic Waits : Try something 5 times at an interval of 3 secondsHow would you design a timer ?   PET Question for interview. So better prepare for it.About this Course This is short project based course, yet important course to cover Data Structures and Algorithms involved in designing efficient timers.  We shall be using C as a programming language, but you are free to use your favorite programming language. This course is Programming language agnostic.Course Pre-requisiteIf you can code in any programming language, that suffice. You should familiar with basic data structures such as linked list and function pointers.Basics of Multi-threadingAlso, Please just do not sit and watch my codes. Write your own codes, even if it is same as mine !No Third Party librariesWhatever logic you implement, you need to implement it from scratch. This course do not suggest taking help of any third party library to get the jobs done. Use of external libraries completely defeats the purpose of the course. However, it is recommended to use third party libraries for commonly used data structures such as linked lists/Trees/Queues etc which saves a lot of time implementing these data structures.Warning : This course has auto system-generated subtitles which may not be perfect. Please disable subtitles as per your convenience.

Who this course is for:
Beginners, Intermediates and Professionals, Those who want to grow as Champ Developers, Ace interview Design Questions