LINKS
- 60 Linux Commands you NEED to know (in 10 minutes) —
This video compiles 60 significant Linux commands along with brief explanations. It could be a very convenient resource for a quick review during this Operating Systems course.
- REGEX (REGULAR EXPRESSIONS) WITH EXAMPLES IN DETAIL | Regex Tutorial —
This video provides a clear explanation of the fundamental concepts of regex. It is perfect for beginners who are just starting to learn about it.
- Asymmetric Encryption - Simply explained —
This video explains public and private keys in everyday language. It also uses relatable analogies to simplify the difference between asymmetric and symmetric encryption.
- Zero Trust Security —
This video captures the key points of the Zero Trust Security model. It introduces four pillars of Zero Trust: Machine Identity, Human Identity, Machine-to-Machine Communication, and Human-to-Machine Communication. This type of approach helps make sure everything stays secure.
- FAT32 vs exFAT vs NTFS - Windows File Systems —
This video provides a clear overview of three major file systems: FAT32, exFAT, and NTFS. It explains their compatibility, limitations, and unique features. It’s an excellent video for anyone who wants to know more about file systems in operating systems.
- Linux - Tarballs, Archive and Compress Folders (tar) —
This video explains how to work with tarballs in Linux, which are similar to zips in Windows. It demonstrates the process of creating an archive, compressing, and listing its items. This video also covers how to extract the information in tarballs, making it a valuable guide for Linux users.
- Paging in Operating Systems with Example & Working - Memory Management —
This video digs into how computers handle their memory, with a particular focus on something called paging. It does a great job of using pictures and practical examples to illustrate the significance of paging in managing processes.
- Main Memory Management [by OS] —
This video outlines how the operating system handles main memory, emphasizing the difference between logical (program’s perspective) and physical addresses (actual memory location). It also introduces memory management techniques like swapping and types of program allocation.
- Page Replacement in OS —
This article introduces the concept of page replacement in operating systems, which is crucial for managing virtual memory. It provides explanations and practical examples for various algorithms like FIFO, LRU, LIFO, and Optimal Algorithm, all designed to minimize page faults.
- Non-Uniform Memory Access (NUMA) —
This article explains the concept of Non-Uniform Memory Access (NUMA) in operating systems. NUMA is used in multiprocessing systems to allow microprocessors to share memory locally, aiming to enhance performance and scalability. It describes how NUMA works while also highlighting its advantages and disadvantages.
- Inter Process Communication (IPC) —
This article offers a thorough exploration of Inter Process Communication (IPC) in operating systems, detailing how it enables multiple processes to exchange information and coordinate activities. It introduces various IPC methods such as pipes, shared memory, message passing, and message queues. It also underscores the significance of synchronization techniques for maintaining data integrity within IPC.
- Threads And Concurrency —
This article dives into threads and how they work in operating systems. It explains the difference between processes and threads and discusses the advantages of using multiple threads in a program. It also covers tools like mutexes to ensure threads work together smoothly.
- Introduction to Semaphore in Operating Systems (OS) —
This article comprehensively explains the concept of semaphores in operating systems. It covers the definition of semaphores and how to solve synchronization problems using semaphores.
- Introduction of Deadlock in Operating System —
This article discusses how a deadlock happens when a set of processes is blocked because each process holds a resource and waits for another. It also delves into various methods for handling deadlock, including prevention, avoidance, and recovery.
- Preemptive and Non-Preemptive Scheduling —
This article explains the concepts of preemptive and non-preemptive scheduling in operating systems. Preemptive scheduling interrupts a process during execution, allocating resources for a limited time, while non-preemptive scheduling waits for a process to complete its CPU burst time. It also details their advantages, disadvantages, and key differences.
- What is Round Robin Scheduling in OS? —
This article provides a comprehensive overview of the Round Robin scheduling algorithm. It explains the algorithm’s preemptive nature, cyclic execution of processes, and its significance in ensuring fair CPU allocation. Furthermore, it includes a practical C++ implementation to enhance understanding.