Linux Basics


1.Linux History and GNU

2.Linux Basic Features and Architecture

3.How to Install Linux

4.Install Linux Inside Windows using WSL

5.Free software

6.Linux Chronology

7.Package Management

8.Compile and install from source

9.Important Directories

10.File Permissions

11.Special Permissions

12.Shell

13.Bash shell in windows 10

14.Basic Linux command for beginners

15.Input Output Redirection 

16.Directory Commands

17.File Commands

18.Communication Commands

19.Information Commands 

20.IO Commands  

21.Process Management Commands

22.Account Administration Commands

23.Pipes and Filters 

24.Top 100 commands to learn.

Shell Programming

1.Shell Script

2.Shell Variables

3.Arithmetic Expressions

4.Special Shell Variables

5.Shell Script for getting important info

6.if and case statement

7.looping statements while,until,for

8.Menu driven Programs

9.GUI Menus

10.Functions in scripts

11.String Handling

12. Command line arguments in scripts

13.Arrays in shell script

Assignment-1 - Simple Shell Scripts

Assignment-2- Learn Control Statements

Assignment-3- Learn Filter Command and Data Processing

Assignment-4 Write System Level Scripts

Comments

Post a Comment

Popular posts from this blog

Operating Systems OS Lab PCCSL407 Semester 4 KTU BTech CS 2024 Scheme - Dr Binu V P

 About Me Scheme and Syllabus Learn about the Linux Operating system Before You Start Learn The Operating System Theory Experiments 1.Familiarisation of Basic commands for OS programming     ps      top     strace      fuser      time     gdb     strings     objdump     nm     file     od     xxd 2.Use /proc file system to gather basic information about your machine: (a) Number of CPU cores (b) Total memory and the fraction of free memory (c) Number of processes currently running. (d) Number of processes in the running and blocked states. (e) Number of processes forked since the last bootup. How do you compare this value with the one in (c) above? (f) The number of context switches performed since the last bootup for a particular process. 3. Measuring process execution time Write a simple program to print the system time and exe...
Read more

FCFS First Come First Serve - CPU Scheduling

  FCFS (First Come First Served)  CPU SCHEDULING 1. AIM To input a list of processes with their arrival times and burst times , simulate the FCFS CPU Scheduling Algorithm , and compute: Completion Time Turnaround Time Waiting Time Average Waiting Time 2. THEORY CPU Scheduling CPU scheduling determines the order of execution of processes in a ready queue. FCFS Scheduling (Non-Preemptive) FCFS executes processes in the order of arrival . The process that comes first gets the CPU first. It is simple but suffers from convoy effect . Important Performance Metrics Completion Time (CT) Time at which a process finishes execution. Turnaround Time (TAT) T A T = C T − A r r i v a l   T i m e Waiting Time (WT) W T = T A T − B u r s t   T i m e 3. ALGORITHM Input the number of processes n . Input each process's: Process ID Arrival Time Burst Time Sort processes in ascending order of arrival time . For each pr...
Read more

Banker’s Algorithm -Finding safe execution sequence

  Banker’s Algorithm 1. Aim To obtain a deadlock-free process mix and simulate Banker’s Algorithm to determine whether the system is in a safe state and to find a safe execution sequence . 2. Objectives To understand the concept of deadlock avoidance To apply Banker’s Algorithm To determine whether a system is in a safe or unsafe state To find a safe sequence of processes 3. Theory Deadlock A deadlock occurs when a set of processes are blocked forever, each waiting for resources held by others. Deadlock Avoidance Deadlock avoidance ensures that the system never enters an unsafe state . The Banker’s Algorithm is a classic deadlock avoidance algorithm. Banker’s Algorithm The algorithm checks for system safety by simulating resource allocation and ensuring that: There exists a safe sequence Each process can finish execution with available resources If such a sequence exists → Safe State Otherwise → Unsafe State 4. Data Structures Used St...
Read more