0% found this document useful (0 votes)
42 views19 pages

Basics of Computer Engineering

The document discusses different concepts related to computer engineering including assembler, compiler, interpreter, operating system, file management, process, process scheduling, process synchronization, deadlock, and memory management schemes like paging. It defines each concept and provides examples to explain the key aspects in 3 sentences or less.

Uploaded by

Nipun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
42 views19 pages

Basics of Computer Engineering

The document discusses different concepts related to computer engineering including assembler, compiler, interpreter, operating system, file management, process, process scheduling, process synchronization, deadlock, and memory management schemes like paging. It defines each concept and provides examples to explain the key aspects in 3 sentences or less.

Uploaded by

Nipun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

ASSEMBLER

DEFFINATION: ASSEMBLER is a program that can convert


Assembly language into machine language program.

ASSEMBLY LANGUAGE MACHINE LANGUAGE


PROGRAM PROGRAM
ASSEMBLER
INPUT
OUTPUT

THE TRANSLATION PROCESS OF ASSEMBLER

BASIC COMPUTER ENGINEERING Prepared by: M. CHETAN GUPTA


COMPILER
DEFFINATION: A compiler is a program that can convert
high level language into machine level language.

HIGH LANGUAGE MACHINE LANGUAGE


PROGRAM PROGRAM
COMPILER
INPUT
OUTPUT

THE TRANSLATION PROCESS OF COMPILER

BASIC COMPUTER ENGINEERING Prepared by : Mr. CHETAN GUPTA


INTERPERTOR
DEFFINATION: A Interpreter is a program that can convert
high level language into machine level language.

HIGH LANGUAGE MACHINE LANGUAGE


PROGRAM INTERPERTOR (Translate PROGRAM
and Execute Statement By
INPUT Statement)
OUTPUT

THE TRANSLATION PROCESS OF INTERPERTOR

BASIC COMPUTER ENGINEERING Prepared by: Mr. CHETAN GUPTA


Memory Representation:

1Byte 8 Bits Memory cell

1KB 1024 Bytes


(kilo Byte ) 1

2
1MB 1024 KB
(Mega Byte)

1GB 1024 MB N
(Giga Byte)
Memory Representation

1TB 1024 GB
(Tera byte)
OPERATING SYSTEM
Operating system is a collection of programs which makes interface
between Hardware, Software and user.

USER APPLICATION

OS INTERFACE

SCHEDULER & RESOURCE MANAGER

FILE SYSTEM & NETWORK PROTOCOLS

DEVICE DRIVER

HARDWARE
USER INTERFACE WITH OS
FUCTIONS OF OPERATING SYSTEM
1. User Interface
2. Running Program
3. Managing files
4. Memory Management
5. I/O system Management
6. Scheduling Jobs
7. Task Management
8. Controlling Network
9. Security
TYPES OF OPERATING SYSTEM

1. Batch processing operating system


2. Multiuser and single user operating system
3. Multi-tasking and single-tasking operating system
4. Real-time operating system
5. Distributed operating system
6. Embedded system
FILE MANAGEMENT
What is file system?
Types of file system:
1. Disk file system
2. Network file system
3. Special purpose file
File attributes:
4. File name
5. Type
6. Size
7. Read only
8. location
9. Hidden
10. System
11. Volume label
12. Archive
File Operation
1. Copy file
2. Move file
3. Rename file
4. Create directory
5. Delete file
6. Merge files
7. Set attributes
8. Trunked
File access permission:
9. Read
10. Write
11. Execute
PROCESS
PROSESS STATE
1. Ready
2. Running
3. Blocked
4. Suspend
5. Waiting
6. Terminate
PROCESS SCHEDULING
Definition:-process scheduling is a task perform by an

OS for deciding the priority of the job.

Types of Scheduling:-
1. Long Term Scheduling
2. Medium Term Scheduling
3. Short Term Scheduling

Basic Computer Engineering Prepare


d By: CHETAN GUPTA
PROCESS SCHEDULING

Basic Computer Engineering Prepare


d By: CHETAN GUPTA
Scheduling Algorithms
1. First come First Serve (FCFC)
2. Shortest Job First (SJF)
3. Shortest Remaining Time First (SRTF)
4. Priority Scheduling
5. Round Robin (RR)

BASIC COMPUTER ENGINEERING PREPARED BY: Mr. CHETAN GUPTA


Process Synchronization

BASIC COMPUTER ENGINEERING PREPARED BY: Mr. CHETAN GUPTA


DEADLOCK
Definition: Deadlock is a situation where group of
process are permanently blocked.

A Deadlock situation can arise if the following four


contestation hold simultaneously in a system.
1. Mutual Exclusion
2. Hold and wait
3. No Preemption
4. Circular Waiting
BASIC COMPUTER ENGINEERING PREPARED BY: Mr. CHETAN GUPTA
Memory Management Scheme
1. Swapping
2. Paging
3. Segmentation
Paging
Page 0

Page no. Frame no.


Page 1
0 9 0

1
Page 2 1 5 2

3
Page 3 2 2 5

3 7 7
Logical memory
8

Page table Main Memory

You might also like