Diploma Engineering

Semester III

CE, IT, AIML, Cloud Computing &

Big Data, Gaming & Animation
 An Overview of Major Computer & Technology Disciplines

Computer Engineering is a branch of engineering

that integrates several fields of computer science and
electronic engineering required to develop computer
hardware and software. Computer engineers design,
test, implement and maintain computer software and
hardware systems.

Information Technology (IT) is the use of computers

to store or retrieve data and information. IT is typically
used within the context of business operations as
opposed to personal or entertainment technologies.
You can find IT specialization in every branch of
education, from IT & Software, Engineering, Aviation
and Medicine to MBA and even Hospitality.

Artificial Intelligence (AI) is intelligence

demonstrated by machines, as opposed to the natural
intelligence displayed by humans or animals. AI
applications include advanced web search engines,
recommendation systems used by YouTube, Amazon
and Netflix, Siri or Alexa, Tesla, and strategic game
systems (such as chess and Go).

Cloud Computing & Big Data is the on-demand

availability of computer system resources, especially
data storage (cloud storage) and computing power,
without direct active management by the user. Big data
is a field that treats ways to analyze, systematically
extract information from, or otherwise, deal with data
sets that are too large or complex to be dealt with by
traditional data-processing application software.

Gaming & Animation is the process of

developing/designing a game. The effort is
undertaken by a developer, ranging from a single
person to an international team dispersed across the
globe. Animation is a method in which figures are
manipulated to appear as moving images. Various
tools available in the market today, ease out the tasks
of game development and animation.
 Disclaimer
This handbook is compiled to provide subject information to the students. Every
effort has been made to avoid errors & omissions and ensure accuracy. Any error
noted may be brought to the notice of the compiler, which shall be taken care of in
the updated edition of this handbook. The sources of information/material are
provided in the appendix.
The information contained in this handbook is strictly for education and learning
purposes and not for any commercial use.
Furthermore, The University reserves the right to unilaterally and without notice
make changes to this handbook at any time.
Evaluation Methodology
Theory Marks
PA: Progressive Assessment
Units’ examinations will be conducted during the semester. Each unit examination is
compulsory. Unit examination may be taken from objectives, short questions, long questions,
etc.
Unit-1 Exam: Maximum Marks 10
Unit-2 Exam: Maximum Marks 10
Unit-3 Exam: Maximum Marks 10
Unit-4 Exam: Maximum Marks 10

Total Marks 40

ESE: End Semester Exam

End semester examination will be conducted from all Five (5) units and it is compulsory. It may
be taken in the form of objectives, short questions, long questions etc.

End Semester Exam: Maximum Marks 50

CA: Continuous Assessment

Continuous assessment will be evaluated from the activity assigned in the semester and the
attendance of that particular subject.

Activity Assessment / Attendance: Maximum Marks 10

Practical Marks
PV: Practical Viva
Practical viva will be conducted through group task. Thereafter viva will be conducted
individually based on the given task of the concerned subject.

Practical Viva: Maximum Marks 30

TW: Term Work

Term work will be considered from the assignment and laboratory work done by the student
during the semester of that particular subject.

Term Work: Maximum Marks 20

 EVALUATION SCHEME

The performance of students is evaluated on the basis of continuous and semester-end

examinations with letter grades O+++, O++, A++, B, etc. Which have numerical equivalents called
grade points as indicated below:

Percentage Grade Point Grade Class

95 100 10 O+++
90 94 9.5 O++
85 89 9 O+ First Class with
80 84 8.5 O Distinction
75 79 8 A++
70 74 7.5 A+
65 69 7 A
First Class
60 64 6.5 B++
55 59 6 B+ Higher Second Class
50 54 5.5 B
45 49 5 C Second Class

ic
40 44 4.5 D
35 39 4.0 E Pass Class
less than 35 0 F Fail

hn
The performance of a student in a semester is indicated by a number called SPI (Semester
Performance Index). The SPI is the weighted average of the grade points obtained in all the subjects
taken by the student during the semester. Example: Suppose in a given semester a student has taken
ec
subjects having credits C1, C2, C3, C4, C5..... And the numerical equivalent of grades obtained in
those subjects are G1, G2, G3, G4, and G5 respectively.
yt
Grade Points Earned ∑𝑛
𝑖=1 𝐶𝑖 𝐺𝑖
Then his/her SPI = Total Offered Credits = ∑𝑛
𝑖=1 𝐶𝑖

SPI will be calculated (after re-examination, if any) up to two decimal places on the basis of the final
ol

grades.
An overall assessment from the time the student entered the course is obtained by calculating PPI
P

(Progressive Performance Index). The PPI is the weighted average of the grade points obtained in
all the subjects taken by the student since he/she entered the course. It is calculated in the same
manner as the SPI. The CGPA (Cumulative Grade Points Average) is the weighted average of the
LJ

grade points obtained in all the subjects in the last six semesters of the course.
Detention:
Formula for conversion of equivalent percentage of PPI
An equation to find equivalence between PPI or CGPA may be obtained as follows:
Percentage Marks = (PPI or CGPA — 0.5) x 10. SPI or PPI or CGPA equivalent class shall be as
follows:
Below 4.00 : Fail
4.00 – 4.49 : Pass Class
4.50 – 5.50 : Second Class
5.51 – 6.00 : Higher Second Class
6.01 – 7.49 : Firsrt Class
7.50 and above : First Class with Distinction

For all courses, where the duration of the course is more than 2 years, the degree shall be awarded
to the students on the basis of CGPA of the last six semester's performance in the exams.

In case of the courses where duration is of two years, the degree shall be awarded to students based
on PPI considering the performance in all four semesters.
About Bloom’s Taxonomy
Bloom’s Taxonomy is a classification of the different objectives and skills that educators set for
their students (learning objectives). The taxonomy was proposed in 1956 by Benjamin Bloom, an
educational psychologist at the University of Chicago. The terminology has been recently updated
to include the following six levels of learning. These 6 levels can be used to structure the learning
objectives, lessons, and assessments of your course.
1. Remembering: Retrieving, recognizing, and recalling relevant knowledge from long‐term
memory.
2. Understanding: Constructing meaning from oral, written, and graphic messages through
interpreting, exemplifying, classifying, summarizing, inferring, comparing, and explaining.
3. Applying: Carrying out or using a procedure for executing, or implementing.
4. Analyzing: Breaking material into constituent parts, determining how the parts relate to one
another and to an overall structure or purpose through differentiating, organizing, and
attributing.
5. Evaluating: Making judgments based on criteria and standards through checking and
critiquing.
6. Creating: Putting elements together to form a coherent or functional whole; reorganizing
elements into a new pattern or structure through generating, planning, or producing.
Operating System

OPERATING SYSTEM

Prepared and Compiled by

CE & IT Department

LJ Polytechnic
Operating System

Course
Course Title Operating System
Course Type HSSC BSC ESC PCC OEC PEC
Legends: HSSC: Humanities and Social Sciences Courses
BSC: Basic Science Courses
ESC: Engineering Science Courses
PCC: Program Core Courses
OEC: Open Elective Courses
PEC: Program Elective Courses

Teaching and Evaluation Scheme

Evaluation Scheme
Teaching Hours / Week
Theory Marks Practical Marks
Total
Total Marks
L T P ESE CA PA Total PV TW Total
Credit
3 - 2 4 50 10 40 100 30 20 50 150

Legends: ESE: End Semester Exam

CA: Continuous Assessment (Attendance + Activity)
PA: Progressive Assessment
PV: Practical Viva
TW: Term Work

LJ Polytechnic
Operating System

Contents
Unit %
Topics Sub-Topics Learning Outcomes Hours
No. Weightage
1.1 Basics of • To understand
Operating System what is Operating
• Definition System, what are
• Need of Operating the needs of an
System Operating
• Functions of System, which
Operating System are the functions
• Operating System of the Operating
Services System and
1.2 Operating systems which are the
Types Services of the
• Batch Operating Operating
System System.
• Multi-Processing • To understand
Operating System Batch Operating
• Time-Sharing System, Multi -
1 Introduction Operating System Processing 20 08
• Real-Time Operating
Operating System System, Time-
• Distributed Sharing
Operating System Operating
• Network Operating System, Real-
System Time Operating
• Mobile Operating System,
System Distributed
Operating
System, Network
Operating
System and how
Mobile
Operating
System works

2.1 Process • To understand

• Process & Program the basic concept
• Process States of Process
Management,
• Process Control
how Process
Process Block
2 States work, 25 10
Management 2.2 Scheduling and what is Program
Scheduler and Process and
• Scheduling Criteria where the
Process is
executed using

LJ Polytechnic
Operating System

• First Come First Process Control

Serve Block.
• Round Robin • To understand
Scheduling
• Shortest Job First criteria using
• SRTN different types of
• Types of Scheduler Scheduling
2.3 Inter-Process algorithms and
Communication & types of
Scheduler.
Synchronization
• To understand
• Race Condition how Processes
• Mutual Exclusion Communicate
• Semaphore with each other,
2.4 Deadlock Race Condition ,
• Deadlock Mutual
Exclusion and
Conditions
Semaphore.
• Prevention • To understand
• Avoidance how Deadlock
occurs and
Deadlock
Conditions.
• To learn
Prevention and
Avoidance of
Deadlock.
3.1 Memory • To understand
Management the basic concept
• Memory of Memory, how
Management to manage the
• Logical and Physical Memory and
Address what is Logical
3.2 Memory Allocation and Physical
• Contiguous Address using
Allocation: Fixed &
Memory
Dynamic Partition
Management.
• External & Internal
Fragmentation • To understand
Memory
3 techniques of 20 08
Management • Compacting
Memory
• Swapping,
Allocation
Relocation,
methods along
Protection, and
with their
Sharing
examples,
• Non-Contiguous
Fragmentation
Allocation
and how to swap
• Paging
Memory between
• Translate Look-
Logical Address
Aside Buffer
to a Physical
• Inverse Page Table

LJ Polytechnic
Operating System

• Multi-Level Pages Address,

• Demand Paging Relocation,
• Segmentation Protection and
• Virtual Memory Sharing of
Memory.
• To understand
Non-Contiguous
Memory
methods.
4.1 File Management • To understand
• File Concept, the basic concept
Access Methods of File, methods
• File types used in File, File
• File operations types, File
• Directory Structure Operations, File
• File System System and what
File is Directory
4 4.2 File Allocation 15 08
Management
Methods Structure and
• (Contiguous, how it works in
Linked, Indexed) File.
• Security and • To understand
Protection File Allocation
Mechanism Methods along
with examples.
5.1 Linux Basics • To understand
• Overview of Linux what is Linux
• Installation and installation
5.2 Introduction to of the Operating
Shell Commands System.
• pwd, cd, mkdir, • To learn how to
use Shell
rmdir, ls, cat, cp, rm,
Commands in
mv, wc, split, cmp, scripting.
Linux diff, head, tail, grep, • To learn the use
Operating sort, apt-get install, of some of the
5 20 08
System apt-get remove; standard
Basics
• Introduction to commands like
Editor vi, vim, gedit etc.
“vi/vim/gedit”
• Linux Basic
Commands, Shell
Script
• Commands for
Administrations
Total
42
Hours

LJ Polytechnic
Operating System

Suggested Specification Table with Hours

Distribution of Topics
According to Bloom’s
Unit Teaching
Chapter Name Taxonomy
No. Hours
R U App C E An
% % % % % %
1 Introduction 8 50 50 - - - -
2 Process Management 10 25 25 35 - 5 10
3 Memory Management 8 25 25 40 - 5 5
4 File Management 8 25 25 40 - 5 5
5 Linux Operating System Basics 8 20 25 40 5 5 5
Legends: R: Remembering U: Understanding
App: Applying C: Creating
E: Evaluating An: Analyzing
Textbooks
1) Operating Systems: A Concept Based Approach, Dhananjay M. Dhamdhere, McGraw Hill
India
2) Operating System Concepts", by Avi Silberschatz,8th Edition, Peter Baer Galvin
3) Unix Concepts And Application, Sumitabha Das, 4th Edition, McGraw Hill India
Reference Books
1) Modern Operating System 3rd Edition, 2008, Andrew Tanenbaum
Open Sources (Website, Video, Movie)
1) https://nptel.ac.in/courses/106/108/106108101/
2) www.freeos.com/guides/lsst
3) https://www.guru99.com/os-tutorial.html
4) https://www.geeksforgeeks.org/operating-systems/

LJ Polytechnic
Operating System

Introduction
An Operating System acts as an intermediary between the user of a Computer and Computer
hardware. The purpose of an Operating System is to provide an environment in which a user can
execute programs conveniently and efficiently. An Operating System is a software that manages
Computer hardware. The hardware must provide appropriate mechanisms to Computer ensure the
correct operation of the Computer System and to prevent user programs from interfering with the
proper operations of the System.
Objectives
✓ This course aims to help the students to attain the following industry-identified competency
through various teaching-learning experiences.
✓ To install & configure various Operating Systems.
Learning Outcome
✓ This subject provides an understanding the different services provided by Operating System
at a different level.
✓ This subject provides real-life applications of Operating System in every field.
✓ Understands the use of different process scheduling algorithms and synchronization
techniques to avoid deadlock.
✓ This subject provides different types of Memory Management techniques like paging,
segmentation and demand paging etc.

LJ Polytechnic
Operating System

Introduction

Short Questions

Sr. Bloom’s
Questions
No. Taxonomy
1. Define operating system. Remember
2. Load balancing and load sharing are features of _________ OS. Remember
3. Give name of any two protocols that are used for network OS. Remember
4. What are the goals of operating system? Understand
5. Give examples of soft real time operating system. Remember
6. Give examples of hard real time operating system. Remember
7. Give examples of application programs. Remember
8. Which are two categories of multiprocessing OS? Remember
9. Time sharing operating system is also referred as ___________. Remember
10. Define JOB. Remember
11. Memory is an example of resource that is multiplexed in ______. Remember
12. Give example of resource multiplexed by time. Remember
13. Transistor was used in the _________ generation of computers. Remember
14. Which hardware is used in 4th generation of computers? Remember

Long Questions

Sr. Bloom’s
Questions
No. Taxonomy
1. Explain Time-Sharing operating system with their advantages and Understand
disadvantages.
2. Explain real-time operating system and explain their types with Understand
example.
3. Explain batch operating system. Understand
4. Write a difference between multi-processing and multi-tasking Understand
operating system.
5. Explain functions of operating system. Remember

LJ Polytechnic
Operating System

Essential Assignments

1. What is operating system? Explain needs of operating system.

2. Explain multi-processing operating system.
3. Difference between time-sharing operating system and real-time operating system.
4. Difference between network operating system and distributed operating system.
5. Explain services of operating system.

Activities

1. Prepare a case study on various generations of operating system available.

• A case study will include a various generations of computers. A document will
cover aspect of essentiality of all generation listed previously such as duration of
generation, hardware, input devices and output devices.
• You can make a chart or presentation for the same.
2. Prepare statistical document by identifying various types of Operating System available
now a days.
• Document will include various operating system being used in various fields now a
days. It will include some parameters of all the operating system like founder name,
logo, current version & possible applications.

Learning Outcomes

❖ Basic concepts of Operating System like importance and needs of Operating System,
how to install Operating System will be learnt.
❖ Basic functions and working of the Operating System will be understood.
❖ Various types of Operating System will be understood.

LJ Polytechnic
Operating System

Process Management

Short Questions

Sr. Bloom’s
Questions
No. Taxonomy
1. PCB stands for____________. Remember
2. List states of process life cycle. Remember
3. ‘Preemptive scheduling does not require Timer and Clock’– Remember
True or False?
4. Long-term scheduler works with __________ queue. Remember
5. What is process? Remember
6. From running state, process can enter which states? Remember
7. What is CPU bound process? Remember
8. Define scheduling. Remember
9. List four necessary conditions for deadlock to occur. Remember
10. What is the objective of short-term scheduler? Remember
11. Define response time. Remember
12. Define dispatcher. Remember
13. Define independent process. Remember
14. What is critical section? Remember

Long Questions

Sr. Bloom’s
Questions
No. Taxonomy
1. Discuss Long Term, Short Term and Medium Term Scheduler. Understand
2. Write a short note on SRTN algorithm. Understand
3. Explain Semaphore. Understand
4. Describe Task Control Block. Understand
5. Explain Inter-process communication with various issues and Understand
example.

LJ Polytechnic
Operating System

6. Calculate average waiting time and average turnaround time for Apply
SRTN algorithm with Gantt chart for following data.
Process Arrival Time Completion Time
P0 0 8
P1 1 4
P2 4 2
P3 6 6

Essential Assignments

1. Explain process life cycle with diagram.

2. Write a short note on mutual exclusion and race condition.
3. Explain deadlock and explain their conditions.
4. Explain round robin algorithm.

Activities

1. Make a transaction schedule on given deadlock scenario:

• Transaction T1 is waiting for data item X which is locked by transaction T3.
Transaction T3 is waiting for Y which is locked by transaction T2 and transaction
T2 is waiting for data item Z which is locked by transaction T1.
• Prepare Wait-for diagram for given scenario of deadlock.

Learning Outcomes

❖ The basic concept of Process Management which includes Process, Program, Process
State and Process Control Block will be learnt.
❖ Basic terms related to Scheduling and types of Scheduling Algorithms will be learnt.
❖ Basic terms related to IPC, Race Condition, Mutual Exclusion, Semaphore and
Deadlock will be learnt.

LJ Polytechnic
Operating System

Memory Management

Short Questions

Sr. Bloom’s
Questions
No. Taxonomy
1. Logical address is generated by ____________. Remember
2. Give name of six operations performed by Memory Manager. Remember
3. Define internal fragmentation. Remember
4. Which two registers are used to solve problem of memory
Remember
relocation and protection?
5. Define external fragmentation. Remember
6. Which partition selection strategy is most sensitive to external Remember
fragmentation?
7. Define swapping and swap area. Remember
8. What is the use of valid-invalid bit in Demand Paging? Remember
9. What is TLB hit & TLB miss? Remember
10. Define a page fault. Remember
11. In Paging, Logical address consists of ______ and ______. Remember
12. Which partition selection strategy is only used with dynamic Remember
partitioning?
13. What is the full form of MMU? Remember
14. What are the two types of memory allocation? Remember
15. What is segment table? Remember

Long Questions

Sr. Bloom’s
Questions
No. Taxonomy
1. Discuss problem of Continuous Memory allocation with fixed and Understand
dynamic partition.
2. Explain virtual memory in detail. Understand
3. Explain Segmentation in memory management. Understand
4. Explain TLB method. Understand
5. Describe Swapping of Memory Management. Understand

LJ Polytechnic
Operating System

Essential Assignments

1. Explain Inverted Page Table.

2. Write a short note on Paging.
3. Explain Fragmentation with their types.
4. Explain Memory Protection and Relocation.
5. Differentiate Contiguous and Non-Contiguous Memory Allocation.

Activities

1. Prepare case study document on Classification of Memory Allocation.

• It will include assignment of Memory Allocation, merits and demerits of Memory
Allocation.
• You can make a chart or presentation for the same.
2. Make a document on various types of Memory Partition techniques and also mention
strategies to select partitions. You have to mention technique to manage unused
memory.
3. Solve the following example using Address Translation technique in Paging.
• Consider that Page size or frame size is of 4 bytes and the Logical Address generated
by the CPU is 7. Find Page Number, Offset and corresponding Physical Address.

Learning Outcomes

❖ The concept of Memory Management in Operating System will be learnt.

❖ The basic concept of Memory Allocation and various techniques of Memory Allocation
such as Contiguous and Non-Contiguous Memory Allocation will be understood.
❖ Concepts such as, Fragmentation, Swapping, Memory Reallocation and Protection will
be understood.

LJ Polytechnic
Operating System

File Management

Short Questions
Sr. Bloom’s
Questions
No. Taxonomy
1. Define sector. Remember
2. Define File. Remember
3. ‘.pdf’ extension stands for __________________. Remember
4. Give name of three common file structures. Remember
5. What is directory? Remember
6. ‘Acyclic graph directory system does not contain cycle’ –
Remember
True or False?
7. Give name of three main disk allocation method. Remember
8. File Allocation Table (FAT), used by MS-DOS is variation of Remember
___________ disk space allocation method.
9. ACL stands for _________________. Remember
10. What are the two types of file paths? Remember

Long Questions

Sr. Bloom’s
Questions
No. Taxonomy
1. Explain Directory Structure of Operating System along with its types. Understand
2. Explain types of File Access Methods? Understand
3. Explain Logical Structure of Hard Disk. Understand
4. Explain Physical Structure of Hard Disk. Understand
5. Explain Contiguous Disk Space Allocation method. Understand

Essential Assignments

1. What is File and File System?

2. Explain File Attributes.
3. Differentiate Linked Allocation method & Indexed Allocation Method.

LJ Polytechnic
Operating System

4. Explain File Operations in detail.

Activities

1. Make a statistical document on physical structure of a Disk and various types of Disk
management tools which perform all the tasks and keep functioning of disk smooth
and mention functions of Disk management Tools.
• You can prepare chart or Presentation of the same.
2. Prepare a case study document of File System.
• It includes File naming, File Extension, File Attributes, File Operations, File Types
and Structure of File System.
• Make a chart or Presentation on the same.

Learning Outcomes

❖ Knowledge of basic concepts of File such as methods used in File, File Types, File
Operations and File System will be gained.
❖ Basic concepts of File Allocation methods will be learnt.

LJ Polytechnic
Operating System

Linux Operating System

Basics

Short Questions

Sr. Bloom’s
Questions
No. Taxonomy
1. State True or False: Linux is the free & open-source operating Remember
system.
2. What is Shell? Remember
3. What are the different layers of Linux architecture? Remember
4. What is Kernel? Remember
5. PWD stands for ________________. Remember
6. Give name of any five general purpose command. Remember
7. ____________ command is used to change file permission. Remember
8. What is Piping? Remember
9. What are the types of files used in Linux? Remember
10. Root directory is denoted by ______ symbol. Remember

Long Questions

Sr. Bloom’s
Questions
No. Taxonomy
1. Explain architecture of Linux Operating System. Understand
2. Discuss Filters command in Linux with example. Understand
3. List the installation steps of Linux Operating System. Understand
4. Explain file types. Understand
5. List & explain directory commands of Linux Operating System. Understand

Essential Assignments

1. Explain Features of Linux Operating System.

2. What is Kernel, System Call and Shell?
3. Explain commands for managing and manipulating Files.

LJ Polytechnic
Operating System

4. Explain General Purpose Commands.

Activities

1. Make a case study on architecture of Linux Operating System and list various ways to
install and upgrade Linux Operating System.
• You can prepare a chart or presentation on the same.

Learning Outcomes

❖ Basic concepts of Linux Operating System will be learnt.

❖ Concepts of Shell commands will be learnt and implemented.

LJ Polytechnic
 Quotes from Pioneers

“The advance of technology is based on making it fit in so that

you do not really even notice it, so it is part of everyday life.”
- Bill Gates, Co-Founder, Microsoft.

“Have the courage to follow your heart and intuition. They

somehow already know what you truly want to become.
Everything else is secondary.”
- Steve Jobs, Co-Founder, Apple Inc.

“Success breeds complacency. Complacency breeds failure.

Only the paranoid survives.”
- Andy Grove, Former Chairman & CEO, Intel.

“If you are changing the world, you are working on important
things. You’re excited to get up in the morning.”
- Larry Page, Co-Founder, Google & Alphabet Inc.

“Progress is often equal to the difference between mind and

mindset.”
- N. R. Narayana Murthy, Chairman Emeritus, Infosys.

“The only way to learn new programming language is by

writing programs in it.”
- Dennis Ritchie, Co-Creator of C Programming.

“Success is achieved twice. Once in the mind and the second

time in the real world.”
- Azim Premji, Founder Chairman, Wipro.

“The digital world has power because it has dynamic

information, but it's important that we stay human instead of
being another machine sitting in front of a machine.”
- Pranav Mistry, President & CEO of STAR Labs.
 LJ Polytechnic

Offers Diploma in
❖ Artificial Intelligence & Machine Learning
❖ Electronics & Communication Engineering
❖ Cloud Computing & Big Data
❖ Architectural Assistantship
❖ Automation & Robotics
❖ Gaming & Animation
❖ Automobile Engineering
❖ Mechanical Engineering
❖ Information Technology
❖ Computer Engineering
❖ Electrical Engineering
❖ Civil Engineering

info_poly@ljku.edu.in

www.ljku.edu.in

9687010057
9228010057

LJ Campus,
Near Sarkhej-Sanand Circle, Off. S. G. Road, Ahmedabad, Gujarat-382210