0% found this document useful (0 votes)
11 views15 pages

Computer Science Chapter 1 2 Short Note Live Notes

Uploaded by

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

Computer Science Chapter 1 2 Short Note Live Notes

Uploaded by

aneesalithanathu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

discipline of computing

-
-
Pascaline Jacquards loom
Babylonian/ges (60)
The loom is controlled by punch
● It is capable of adding and
-

cards with punched holes , each


-
-

-
.
number system subtracting two numbers
row of which corresponds to one
-
ionian
-

row of the design.


-
-

-
(20]
-
- Leibniz’s calculator Reduce amount of human labour
Abacus a
calculating Step reckoner expanded on
Allowed to store patterns on cards
• Considered the first pascals ideas and extended
the capabilities to perform to be utilised again to create the
computer for basic
multiplication and division same product
arithmetical calculations
These cards had the capability to
• Also called counting frame
Difference engine store information on them
Napiers bone First step towards creation of Analytical engine
computers Real predecessor of modern day
These numbered rods could computer
perform multiplication of any Perform arithmetic
number in the range of 2 to 9 calculations and print results Marks development from
automatically arithmetic calculation to general
purpose computations
Fill
Hollerith’s machine
First electromechanical
punched card tabulator

Used punch cards for input ,


output and instructions

Hollerith started the tabulating


machine corporation

Tabulated huge amount of data


related to US census Bureau

MARK-1
• Large automatic
electromechanical computer
• Can handle logarithms and
trigonometric functions
• Two numbers could be added in
3-6 seconds
FIRST GENERATION COMPUTERS SECOND GENERATION THIRD GENERATION
COMPUTERS COMPUTERS

• Built using vaccum tubes Integrated circuits are used


• Vaccum tube is a device • Vaccum tubes replaced by
controlling electric transistors
Developed by jack kilby
current through a vaccum
in a sealed container • Smaller , powerful , faster
Small size , increased speed ,
ENIAC Less expensive , less
efficiency of computing
(ELECTRONIC NUMERICAL electricity , emitted less heat
INTEGRATOR AND CALCULATOR) Manufacturing cost is less
Several programs can run at a
EDVAC • Used concept of
(ELECTRONIC DISCRETE VARIABLE
time
programming language
AUTOMATIC COMPUTER)
Keyboards and monitors
• Primary storage – magnetic introduced
tape
Secondary storage – magnetic BASIC is developed
disk

Eg : IBM 1401 • Eg : IBM 360 and IBM 370


: IBM 1620
FOURTH GENERATION
COMPUTERS Set of instructions given to a Algorithm – step by step
computer for performing a procedure to solve a problem
• Microprocessors are used specified task is known as
• GUI , mouse used programs
Theory of computation – branch
• Small size , fast
Agusta ada lowelace that deals with how efficiently
processing speed , high
data processing problems can be solved based
World first on computation models and
• Internet used related algorithms
computer
• Eg : IBM PC programmer
Father of modern
• : Apple Mackintosh
A programming language is an computerscience aswell
artificial language designed to as artificial intelligence-
FIFTH GENERATION communicate instructions to a Alan turing
COMPUTERS computer.
CAN MACHINE THINK??
• Machine language(first
Based on AI programming language)
• Assembly language(English Turing machine is the model of
It is the ability to simulate computer proposed by alan turing
like words)
human intelligence It consist of infinitely long tape
EDSAC(electronic delay storage
Can process large amount of automatic calculator) act like memory.
data • High level languge 3 symbols-0,1,’ ‘(blank)
data representation
and boolean algebra
on
DATA REPRESENTATION is the
method used internally to ⑫it > hexa
-
hexa-
De multiplication

D ⑪
represent data in a computer

Number system O Bin >


-

&
oct
Bin
I
&
hexa

Ligtece
-

• Systematic way to represent


numbers
• Number of symbols used in a &

numbersystem – base/radix
225 (0.101)2 = 12-1+02-2+12-3 out
>
= 0.5 + 0 + 0.125 = 0.625 Bin

·
421

J
(0.101)2 = (0.625)10
.
42

(
--u

⑳o
MSD: The leftmost digit of a number is
called Most Significant Digit (MSD)
20]
- O --
0421842184218421

O e
LSD: The right most digit of a number
is called Least Significant Digit(LSD) -00
· ⑧
(11001
y
is
⑰ 100 + ox ox2+
E

+
1424 + 1X2 1x20
= 16 + 8 + 1
Binary addition

- -
O S Subtraction using 1’s compliment • Representation of numbers
O
-
1.Integers~
-

-
-

= sign and magnitude


- -

biron
1’s compliment
-

--

T
- -

2’s compliment
-

- -
-
- -

Subtraction using 2’s compliment


-
- -

=
-

2.Floating point numbers


-

&

-
g
25 .
45- ·
2545x102
SubtractO
100 from 1010
-

Subtraction using 1’s compliment


-
-
1010 .
Any number in floating point
notation contains two parts ,
-
10

&
SubtractE
100 from 1010 andr
% 1100
mantissa and exponent
-
-
&

i O 110
. -

" -
-

❖ Represent e -105 in sign and Representation of characters Representation of images,audio,video
magnitude form : audio -
-

1.ASCII-American standard code


Number is negative ,so MSB=1 O - -

for information interchange


-
MP3:MOVING PICTURE EXPERTS
7 bit binary binary = (1101001)2 - GROUP AUDIOLAYER3
-
..
• 7bits to represent a character -

WAV:WAVEFORM AUDIO FILE FORMAT


So -105 = (11101001)2 • O
-

27(128)characters -
-

*
- MIDI:MUSICAL INSTRUMENT DIGITAL
-

INTERFACE
-

❖ Represent -119 in 1’s compliment 2.ISCII-Indian standard code for -

form :
=>
- AIFF:AUDIO INTERCHANGE FILE
information interchange
-
- -

FORMAT
-

Binary of 119 in 8bit –(01110111)2 • 8bits to represent a character -

Images
O
-

1s complement – (10001000)2 • 28(256)characters


- JPEG:JOINT PICTURE EXPERTS GROUP
- - -

BMP:BITMAP
❖ RepresentO -38 in 2’s compliment 3.EBCDIC-Extended binary coded - -

-
TIFF:TAGGED IMAGE FILE FORMAT
form -
decimal interchange code -

O
-

- GIF:GRAPHIC INTERCHANGE FORMAT


binary of 38 in 8bit form – (00100110) • 8bits to represent a character -

PNG:PORTABLE NETWORK GRAPHIC


&
-
2s complement – (11011001)2 + 1 • 2 8(256)characters -

video
-

E
-

-
&

-
=(11011010)2 MP4:MOVING PICTURE EXPERTS
4.UNICODE –it can represent all
GROUP4
-

characters in world
-
-

AVI:AUDIO VIDEO INTERLEAVE


• 16bits to represent a character -

WMV:WINDOWS MEDIA VIDEO


-
-

• 216(65536)characters
-
-
-
I S
Eccomplet
is
magnited complet
&

sign &
- -

Binary
① Binary
① Binary

② 8-bit
& 8-bit

② 7-bit + ve som

>⑧
tre => Bozoaziggan 1
tre
- - ve = 0-

o -
1
-ve 190
-
ve -1 -

13 O Is complent +
• The fundamental logical AND operator NOT operator inverter
operators are:
Input Input Output
1.AND (LOGICAL A B AB Input A Output A
MULTIPLICATION) =-
0 0 O0
2.OR (LOGICAL
-

0 1 0 0
O 1
-
-
Do
ADDITION) ~ -
-

1 0 0
O 1 ②
0
3.NOT -

-
= -
(negation/complement) -
1 1 1
- Basic postulates of Boolean algebra
-

• TRUTH TABLE is a table that


- OR operator - - -

shows boolean operations


Input Input Output
and their results
-
-

A B AB
E
-

=>
• LOGIC GATE is a
physical device that
0= 0
- O0 -
- -

0 1 1
E
-

can perform logical


- - -

- 1 0 O
1
Principle of duality
operations on one or - -

-
-
1 1- 1
more logical inputs and - -
- -

produce a single output


-

--
-

-
-
-
Implementation of basic gates using NAND or NOT
-
-
S
-

-
- -

- - -
-
=
&

- --- ---

-
2 > 4 7 -
=
-
-
- ---
=>

0
-
- -
-

De Morgan's Theorem
*
F

A
(X+Y)’=X’.Y’ P
(X.Y)’=X’+Y’

·
---

Universal gates :

NAND NOR-

You might also like