GTUT DIPLOMA Basics of Operating System GTU 21 Course ( III - CE - 4330703) Basics of Operating System GTU 21 Course ( III - CE - 4330703) Basics of Operating System GTU 21 Course ( III - CE - 4330703)

Rs. 225.00
Tax included. Shipping calculated at checkout.

Syllabus Basics of Operating System - 4330703 Total Credits (CI+T/2+P/2) Examination Scheme Theory Marks Practical Marks Total Marks C CA ESE CA ESE 4 30 70 25 25 150 Unit Unit Outcomes (UOs) Topics and Sub-topics Unit - 1 : Introduction of Operating System 1a. 1b. 1c. Explain needs of Operating system Classify types of Operating System Describe OS services – User point of view and System point of view. 1.1 1.2 1.3 1.4 1.5 Fundamental Goals of Operating system Overview of Operating Systems i. Multi programming ii. Time Sharing iii. Real Time iv. Multithreading v. Distributed Operating System services Case Study i. Linux ii. Latest Windows Operating System Generations of Operating System (Chapter - 1) Unit - 2 : Process Management 2a. 2b. 2c. 2d. 2e. 2f. 2g. Define process model Describe process Life Cycle Compare different process scheduling algorithm. Compare different schedulers Describe Critical Section & mutual exclusion Identify conditions for Deadlock Solve Deadlock conditions using Resource allocation graph 2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 2.9 2.10 2.11 2.12 Concepts of Process Overview of the Process & threads Process Life Cycle / Process States Process Control Block Process Scheduling Scheduling Criteria Scheduling Algorithms i. First Come First Serve ii. Shortest Job First iii. Round Robin Overview of Schedulers Scheduling Queues Context Switch Process Synchronization Critical Section Mutual Exclusion Deadlock Conditions for Deadlock Resource allocation graph (Chapter - 2) Unit - 3 : Memory Management 3a. 3b. 3c. 3d. Describe memory management Differentiate Contiguous and Non- contiguous memory allocation Differentiate primary and secondary memory Apply different page replacement algorithms for memory allocation 3.1 3.2 3.3 Memory Management Logical and physical address map Swapping Memory Allocation Contiguous memory allocation i. Fixed and variable partition ii. Internal and External Fragmentation and compaction iii. Memory relocation and protection mechanism iv. Allocation techniques - First Fit, Best Fit and Worst Fit 3.4 Non Contiguous Memory allocation i. Overview of Paging ii. Address translation using basic method of paging iii. Overview of Segmentation iv. Page replacement algorithm - FIFO, LRU (Chapter - 3) Unit - 4 : File Management System 4a. 4b. 4c. 4d. 4e. Apply file management concepts in Operating System Explain Directory structure of Operating System Describe physical disk structure. Discuss Allocation methods of directory system. Compare different disk scheduling algorithms. 4.1 4.2 4.3 4.4 4.5 4.6 4.7 4.8 Files System Files Attributes File Operations File Types Directory System Directory Structures Protection Allocation Methods - Contiguous, Linked Secondary Storage Structure Disk Structure Disk Scheduling Algorithm -SCAN, CSCAN (Chapter - 4) Unit - 5 : Linux Basics 5a. 5b. 5c. Test and Execute basic Linux commands Test and Execute shell commands in different shell scripts Develop shell scripts in ‘Unix/ Linux’ 5.1 5.2 5.3 5.4 5.5 5.6 5.7 5.8 5.9 5.10 Linux Introduction Basic architecture of Unix/ Linux Introduction to shell and commands Commands : pwd, cd, mkdir, rmdir, ls, cat, cp, rm, mv, wc, split, cmp, comm, diff, head, tail, grep, sort Editing files with “vi”, “vim”, “gedit”, “gcc” Linux Basic shell scripts Read using command line argument the logical operators Evaluate expression using test and [..] Branching : if, case Basic of Looping : while, for (Chapter - 5)

Pickup available at Nashik Warehouse

Usually ready in 24 hours

Check availability at other stores
Pages: 184 Edition: 2022 Vendors: Technical Publications