Computer System and Organization

A. Basic computer organisation: description of a computer

system and mobile system, CPU, memory, hard disk, I/O,
battery.

* Computer System: - Key Points: Input, Process and Output. Process – ALU, MU,
CU. Peripherals names. Digital Vs Analog. Generations.
* Mobile System: - Key Points: Wireless Technology, Communication Medium,
Telnet –VoIP & GPRS, CDMA & GSM, Lte/Volte - 2G/3G/4G/5G. Part of Computer
System.
* CPU: - Key Points: ALU, MU & CU. Processor names. RAM & ROM, BIOS, Cache,
Transistor, IC, etc.
* Memory: - Key Points: Storage Unit. Memory Units – bit, Byte, KB, GB, TB, etc.
RAM, ROM, Cache, Harddisk, Pendrive, DVD, Floppy disk, etc.
* Hard Disk: - Key Points: Types, Size/Storage Capacity, and External Unit of CPU,
Few Companies manufacturing it.
* I/O: - (stands for Input/Output) Key Points: Input Devices, Output Devices
names. They can be physical devices as mentioned before or “could be soft
resources/virtual resources from MU/Cloud.”
* Battery: - Key Point: Power Source, offline resource (AC/DC), Power Unit,
Battery Size, Backup capacity, Few companies names , Few modal names, Power
Bank.

B. Types of software: Application software, System

software and Utility software.
* Application Software: - Key Points: They are useful entity/program that help
user to do particular task. It is an external resource which runs on System
Software. Thus they need specific modification as per the System Software used.
Name some Application Softwares.

* System Software: - Key Points: It is a program that interacts with

BIOS/RAM/ROM/Cache to make the peripherals functional for user in a GUI/CUI
mode. So without system software all peripherals are inactive units for application
softwares. Thus a user cannot be able to utilize the device in hand. Some examples
of System Softwares: DOS, UNIX, LINUX, Windows, MAC, etc

* Utility Software: - Key Points: It is a program that is predefined with System

Softwares. They help the System Software to do necessary changes/alterations as
per the user‟s choice. They act as an Accessories/Accessibility unit for a System
Software. Few examples are: Format, Scandisk, System Restore, Defragmentation,
Clock, Calculator, Snipping Tool, etc.
C. Memory Units: bit, byte, KB, MB, GB, TB, and PB.
 Key Points:
o Full form of all units
o bit is the smallest unit of Memory.
o 1 Nibble = 4 bits
o 1 Byte = 8 bits
o 1 KB = 1024 bytes
o 1 MB = 1024 KB
o 1 MB = 1024 x 1024 bytes OR 1 MB = (1024)2 bytes
o and so on ...

D. Boolean logic: NOT, AND, OR, NAND, NOR, XOR, NOT,

truth tables and De Morgan’s laws, Logic circuits
Explained after point F.....

E. Concept of Compiler and Interpreter

Compiler: - Key Points – It debugs complete program in a go before executing a
code. On complete success only executes it. So debugging is more significant than
the codes execution. It has two basic units – compiling (debug) and linking
(execution). Some examples of languages that operates on compiler purely – C, C++,
Java, etc.

Interpreter: - Key Points – It debug code line by line. Thus partial execution of
codes takes place with its writing. Its advantage is instant error finding and
correction. Secondly, handle both logical and syntax error along with writing of
codes. Some example of pure Interpreter based languages is LOGO, Python, etc.

F. Operating System (OS) - need for an operating system, brief

introduction to functions of OS, user interface

Operating System: - Key Points – It includes System Software and Utility

Softwares. Examples: Windows, DOX, UNIX, Linux, MAC, etc. They are system
softwares that act as a GUI interface for a user. Describe System Software, Utility
Software, Application Software, etc.

Functions of OS: - GUI Interface, User friendly, Memory Management, Processing

Management, Security (passwords, firewalls, antivirus, etc), Device management.

Extra Notes:
 Flowchart
 Pseudo code / Algorithm

*
D. Boolean logic: NOT, AND, OR, NAND, NOR, XOR, truth
tables and De Morgan’s laws, Logic circuits
Boolean – It means True and False. True means 1 and False means 0. The word
Boolean also represents Logical Constant.

Logical constant - True(1) and False(0).

Boolean Algebra – A number system based on 0 or 1 is known as binary number

system. In the middle of 19th century, an English mathematician Sir George E.
Boole develops rules for manipulation of binary variables, known as Boolean
Algebra. This is the basis of all digital systems like computer, calculator, mobile,
biometrics, etc.

Boolean Operators/gates: - Add(+), Product(*), Complement(‟ )

OR AND NOT

NOT: - NOT is a name given to a gate which represents the complement (inverter)
operator. Complement operator returns the opposite state of input i.e. if the input
is 1(True) then the output will be 0(False) and vice versa. The symbols used for
representing Not in an expression : - (~x) or ( x‟ ) or ( x )

X X‟

INPUT OUTPUT
X X’
0 1
1 0

AND: - It is the product operator/gate. So it takes two or more inputs to derive a

logical result. We will take two inputs state to represent the diagram of AND gate.
The symbol used to represent AND in a Boolean expression is .(dot).

Y XY

INPUT 1 INPUT 2 RESULT

X Y XY
0 0 0
0 1 0
1 0 0
1 1 1

OR : - It is the add/sum operator which operators on two or more inputs and

derive a sum of all inputs as result. The symbol of or operator/gate is +. The gate
diagram of OR operator is based on two inputs:

INPUT 1 INPUT 2 RESULT

A B A+B
0 0 0
0 1 1
1 0 1
1 1 1

In Binary Number System:

1+1 = (2)10 = (10)2

1+1+1=(3)10 = (11)2
1+1+1+1+1+1 = (6)10 = (110)2
and so on...

In Boolean Algebra:
1+1 = 1
1+1+1 = 1

Universal Gates and Basic Gates: - And, Or, Not are basic gates which represents
product, summation and complement theory (details are given above). While, NAND
& NOR are called Universal Gates.
Note: Each variable in Boolean Algebra has either 1 or 0 as value. When you use
two or more variables you need to have operators with them.

let x=1 then x‟ will be 0

let y = 0 then y‟ will be 1

If we try to combine them:

x+y or x‟+y or x+y‟ or x‟+y‟ or xy or x‟y or xy‟ or x‟y‟ or (x+y)‟ or (xy)‟ or ...

Suppose you have 4 variables say x, y, z, w and the expression goes:

x‟yzw + xyzw + xy‟zw + x‟y‟zw
NAND: - This gate is the combination of AND and NOT gate. The nand gate is and
gate with a inverter on its output.

(A . B)„ = Z = A‟ + B‟

Input1 Input2 Part Final

Result Result
A B A.B (A.B)’
0 0 0 1
0 1 0 1
1 0 0 1
1 1 1 0

NOR Gate : - This gate is the combination of NOT and OR gate. The nor gate is an
or gate with inverter on its output.

(A + B)‟ = Q = A‟.B‟

Input1 Input2 Part Final

Result Result
A B A+B (A+B)’
0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 0
XOR – (Exclusively OR) Gate. An XOR gate recognizes only that pairs which have
odd number of 1‟s. The XOR gate is similar to an OR gate. It can have any number
of inputs and its output will be 1 if and only if number of 1‟s is odd, otherwise
output will be 0.

Input1 Input2 Final

Result
A B A+B
0 0 0
0 1 1
1 0 1
1 1 0

Truth Table : - Each variable has two possible values(say 0 and 1). Therefore, any
logical operation can also be defined in the form of a table containing all possible
input combinations (2N) for N inputs and their corresponding outputs. This is
known as Truth Table. In Truth Table each row represents an unique input
combination.
For example:
Write a truth table for an expression: x+yz + z‟

X Y Z Z’ YZ YZ+Z’ X+YZ+Z’
0 0 0 1 0 1 1
0 0 1 0 0 0 0
0 1 0 1 0 1 1
0 1 1 0 1 1 1
1 0 0 1 0 1 1
1 0 1 0 0 0 1
1 1 0 1 0 1 1
1 1 1 0 1 1 1

Demogan’s Law: - This is the most powerful law of Boolean algebra. This states
that:
 (x+y)‟ = x‟.y‟ NOR
 (x.y)‟ = x‟ + y‟ NAND