0% found this document useful (0 votes)
28 views92 pages

Computer Applications in Business Overview

computer applications in business

Uploaded by

HERAMBA KEJRIWAL
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)
28 views92 pages

Computer Applications in Business Overview

computer applications in business

Uploaded by

HERAMBA KEJRIWAL
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

COMPUTER

APPLICATIONS IN
BUSINESS(CAB)
Sem-III cc-5
UNIT 1: COMPUTER BASICS

a) Definition and Characteristics of computer. Generations of computer. CPU


organisation and architecture: Arithmetic/Logic Unit (ALU), control Unit
(CU).
b) Memory organization: Memory representation, Cache memory, Primary
memory – RAM and ROM. Functions of RAM and ROM. Different types of
RAM and ROM. Secondary memory – Magnetic and optical storage
devices (brief description of different types).
c) Input and Output devices: Major types and their functions.
d) Operating System: Concept, types, functions.
COMPUTER

 A computer is an electronic device which is capable of


solving problems and manipulating data.
 Computers can be defined in terms of its functions:-
 Acceptance of data
 Storge of data
 Processing of data as desired by doing some
mathematical or logical operations
 Retrieval of stored data as and when required
 Printing the resultant data in desired format
CHARACTERISTICS
GENERATIONS OF COMPUTER
1ST 2ND 3RD 4TH 5TH
GENERATION GENERATION GENERATION GENERATION GENERATION

• Main electronic component • Main electronic component • Main electronic • Main electronic • Main electronic component:
– vacuum tube – transistor component – integrated component – very large- based on artificial
• Main memory – magnetic • Memory – magnetic core circuits (ICs) scale integration (VLSI) and intelligence, uses the Ultra
drums and magnetic tapes and magnetic tape / disk • Memory – large magnetic microprocessor. Large-Scale Integration
• Programming language – • Programming language – core, magnetic tape / disk • VLSI– thousands of (ULSI) technology and
machine language assembly language • Programming language – transistors on a single parallel processing method.
• Power – consume a lot of • Power and size – low power high level language microchip. • ULSI – millions of
electricity and generate a consumption, generated (FORTRAN, BASIC, Pascal, • Memory – semiconductor transistors on a single
lot of heat. less heat, and smaller in COBOL, C, etc..) memory (such as RAM, microchip
• Speed and size – very slow size (in comparison with the • Size – smaller, cheaper, and ROM, etc..) • Parallel processing
and very large in size (often first generation computers). more efficient than second • Programming language – method – use two or more
taking up entire room). • Speed – improvement of generation computers (they high level language microprocessors to run
• Input/output devices – speed and reliability (in were called minicomputers). (Python, C#, Java, tasks simultaneously.
punched cards and paper comparison with the first • Speed – improvement of JavaScript, Rust, Kotlin, • Language – understand
tape. generation computers). speed and reliability (in etc..). natural language
• Example – ENIAC, UNIVAC1, • Input/output devices – comparison with the second • Size – smaller, cheaper and (human language).
IBM 650, IBM 701, etc.. punched cards and generation computers). more efficient than third • Power – consume less
• Quantity – there were about magnetic tape. • Input / output devices – generation computers. power and generate less
100 different vacuum tube • Example – IBM 1401, IBM magnetic tape, keyboard, • Speed – improvement of heat.
computers produced 7090 and 7094, UNIVAC monitor, printer, etc.. speed, accuracy, and • Speed – remarkable
between 1942 and1963. 1107, etc.. • Example – IBM 360, IBM reliability (in comparison improvement of speed,
370, PDP-11, UNIVAC 1108, with the third generation accuracy and reliability (in
etc.. computers). comparison with the fourth
• Input / output devices – generation computers).
keyboard, pointing devices, • Size – portable and small in
optical scanning, monitor, size, and have a huge
printer, etc.. storage capacity.
• Network – a group of two or • Input / output device –
more computer systems keyboard, monitor, mouse,
linked together. trackpad (or touchpad),
• Example – IBM PC, STAR touchscreen, pen, speech
1000, APPLE II, Apple input (recognise voice /
Macintosh, etc.. speech), light scanner,
https://www.academia.edu/2021391/Computer_Fundamentals_Lectures_1_to_5 printer, etc..
CENTRAL PROCESSING UNIT (CPU)
• The CPU or the microprocessor (or simply
processor) is referred as the brain of a
computer system.
• CPU consists of three main subsystems, the
Control Unit (CU), the Arithmetic Logic Unit
(ALU), and the Registers.
• Speed of the computer system is defined by
the architecture of the processor being used.
PARTS OF CPU
ARITHMETIC LOGIC UNIT
• The ALU contains electronic circuits
necessary to perform arithmetic and logical
operations.
• The arithmetic operations are ADD,
SUBSTRACT, MULTIPLY, DIVIDE, etc..
• The logical operations include COMPARE,
SHIFT, ROTATE, AND, OR, etc.
• The control unit analyses each instruction in
the program and sends the relevant signals
to all other units – ALU, Memory, Input unit
and Output unit
CONTROL UNIT
• It is responsible for directing and coordinating
most of the computer system activities.
• It does not execute instructions by itself. It
tells other parts of the computer system what
to do.
• It determines the movement of electronic
signals between the main memory and
arithmetic logic unit as well as the control
signals between the CPU and input/output
devices.
MEMORY
• Memory is the computer's electronic scratchpad
or local store in computer terminology.
• Used for temporary storage of calculations,
data, and other work in progress.
• Two types: Primary and Secondary
• Primary memory or the main memory is part of
the main computer system. The primary
memory itself is of two types.
• The first is called random access memory (RAM)
and the other is read only memory (ROM).
RANDOM ACCESS MEMORY (RAM)

• The processor directly stores and retrieves


information from it.
• Memory is organized into locations. Each
memory location is identified by a unique
address. The access time is same for all
location.
• It is volatile: when turned off, everything in
RAM disappears.
TYPES OF RAM
• Dynamic Random Access Memory (DRAM):
This type RAM retain the content of any
location only for a few milliseconds. Within that
period, each location must be written again
with the same contents. This is known as
refreshing.
• Static Random Access Memory (SRAM):
This type of RAM preserves the contents of all
the locations as long as the power supply is
present. SRAM is generally included in a
computer system by the name of cache.
ROM
• Computers almost always contain a small amount of read-only
memory that holds instructions for starting up the computer.Unlike
RAM, ROM cannot be written to.
• Because data stored in ROM cannot be modified (at least not very
quickly or easily), it is mainly used to distribute firmware (software
that is very closely tied to specific hardware, and unlikely to require
frequent updates).
• It is non-volatile which means once you turn off the computer the
information is still there.
TYPES OF ROM

• A type of memories that can only be read from any selected


address in sequence.
• Stored data cannot be changed at all or cannot be changed
without
specialized equipment.
• Writing a data is not permitted.
• Reading data from any address does not destruct the
content of
read address.
• Usually to store data that is used repeatedly in system
application.
Programmable ROM (PROM)
• Is a memory chip on which data can be written onlyonce.
• Once a program has been written onto a PROM, it remainsthere
forever.
• Nonvolatile memory - unlike RAM, PROM's retain their contents
when the computer is turned off.
• The difference between a PROM and a ROM (read-only memory) is
that a PROM is manufactured as blank memory, whereas a ROM is
programmed during the manufacturing process.
• To write data onto a PROM chip, you need a special device called
a PROM programmer or PROM burner.
• PROM uses some type of fusing process to store bits. Fusible link is
programmed open or left intact to represent 0 or 1. The link cannot
be changed once it is programmed.
EPROM
• Once it is erased, it can be reprogrammed.
• Two basic types
• Ultraviolet (UV) EPROM
UV EPROM can be recognized by transparent quartz lid on
the
package.
Entire UV EPROM data can be erased by exposing
the transparent quartz lid to the high intensity UV
light.
• Electrically EPROM (EEPROM)
Individual bytes in EEPROM can be erased and
programmed
by electrical pulses (voltage).
Mask ROMs

• Usually referred to simply as ROM (the oldest type of solid state ROM)

• The data are permanently stored in the memory during the


manufacturing process and it cannot be changed.
• Most IC ROMs utilize the presence or absence of a transistor
connection at a row/column junction to represent a 1 or 0.
• Mask ROM and PROM can be of either MOS or bipolar technology.
• Despite the simplicity of mask ROM, economies of scale and field-
programmability often make reprogrammable technologies more
flexible and inexpensive.
SECONDARY MEMORY

Secondary memory is used for different purposes but the main purposes of
using secondary memory are:
• Permanent storage: As we know that primary memory stores data only
when the power supply is on, it loses data when the power is off. So we need a
secondary memory to stores data permanently even if the power supply is off.
• Large Storage: Secondary memory provides large storage space so that we
can store large data like videos, images, audios, files, etc. permanently.
• Portable: Some secondary devices are removable. So, we can easily store or
transfer data from one computer or device to another.
TYPES OF SECONDARY MEMORY
Secondary memory is of two types:
1. Fixed storage
In secondary memory, a fixed storage is an internal media device that is used to
store data in a computer system. Fixed storage is generally known as fixed disk
drives or hard drives. Generally, the data of the computer system is stored in a
built-in fixed storage device. Fixed storage does not mean that you can not remove
them from the computer system, you can remove the fixed storage device for
repairing, for the upgrade, or for maintenance, etc.. with the help of an expert or
engineer.
Types of fixed storage:
• Following are the types of fixed storage:
• Internal flash memory (rare)
• SSD (solid-state disk)
• Hard disk drives (HDD)
2. Removable storage
In secondary memory, removable storage is an external media device that is used to store data
in a computer system. Removable storage is generally known as disks drives or external drives.
It is a storage device that can be inserted or removed from the computer according to our
requirements. We can easily remove them from the computer system while the computer
system is running. Removable storage devices are portable so we can easily transfer data from
one computer to another. Also, removable storage devices provide the fast data transfer rates
associated with storage area networks (SANs).

Types of Removable Storage:


• Optical discs (like CDs, DVDs, Blu-ray discs, etc..)
• Memory cards
• Floppy disks
• Magnetic tapes
• Disk packs
• Paper storage (like punched tapes, punched cards, etc..)
TYPES OF MEMORY SRAM
RAM
DRAM

Primary Factory Permanent


Memory programmed non-erasable

PROM
ROM UVEPROM
EPROM
EEPROM
MASK ROMs

Memory
Internal Flash
Memory

Fixed SSD

HDD CDs

Secondary Optical Discs DVDs


Memory

Memory cards Blue Ray Discs

Floppy Discs
Removable
Magnetic Tapes

Disc Packs
Punched Tapes
Paper Storage

https://www.geeksforgeeks.org/secondary Punched Cards


INPUT DEVICES

• An input device is any hardware component that allows you


to enter data and instructions onto a computer. Six Widely
used input devices are the keyboard, mouse, microphone,
scanner, digital camera and PC video camera.
OUTPUT DEVICES

• An output device is any hardware component that conveys


information to one or more people. Some commonly used
output devices are printers, monitors, speakers, and
projectors.
INPUT & OUTPUT DEVICES

• Any peripheral used to provide • Any piece of computer


data and control signals to an
hardware equipment used to
information processing system
communicate the results of
such as a computer or other
information appliance. processed data to the user.
• Common input devices: Keyboard, • Example: Monitors, Printers,
Mouse Speakers, etc..
• Other devices: microphone, digital
camera, scanner.
OPERATING SYSTEMS
• All devices have an operating system
• Software which manages the hardware
• Creates the interface between the
hardware and the user

Functions performed by the operating


systems:
• Managing the hardware resources of the
computer
• Providing the user-interface components
• Providing a platform for software developers
to write applications

Most popular are Microsoft Windows,


Apple Mac OS, and Linux
Types of
OS

Real-time Single user- Single user- Multi user-


Single Multi tasking Multi tasking
OS tasking OS OS OS

One user works User performs Many users


Very fast small
at a time on the many tasks at connect to one
OS computer one time computer

Performs Most Each user


Built into a
device one work at common has a unique
a time form of OS session

Respond Takes little Require


Maintenance is
Quickly to space on expensive easy
user input computers
disk
MP3 players, Run on Requires a
Tend to be
medical inexpensive
complex
powerful
devices computers computer

MS-DOS and Palm Windows XP and UNIX,LINUX,


OS OS X VMS
FUNCTIONS OF OPERATING SYSTEMS

• Provide a user interface


• Run programs
• Manage hardware devices
• Organized file storage
UNIT 2: NUMBER SYSTEM AND BINARY
ARITHMETIC AND LOGIC
GATES
Positional Number Systems – Decimal, Binary, Octal, Hexadecimal;
Binary Arithmetic – Addition, Subtraction, Number Representation –
One’s Complement, Two’s Complement. Digital Logic Gates; Truth
Table, Logic Diagrams, Simplified Circuits (Half adder, Full adder)
BYTE
• Computer memory is organized into groups of eight
bits
• Each eight bit group is called a byte
HOW MANY NUMBER SYSTEMS ???
RADIX NUMBER SYSTEM
BINARY SIGNALS

• It means two-states
• 1 and 0
• true and false
• on and off
• A single “on/off”, “true/false”, “1/0” is called a bit
• Example: Toggle switch
WHY COMPUTERS USE BINARY

• They can be represented with a transistor that is


relatively easy to fabricate (in silicon)
• Millions of them can be put in a tiny chip
• Unambiguous signal (Either 1 or 0)
• This provides noise immunity
INSTANCES
CONVERSION FROM ONE RADIX TO
ANOTHER
• From decimal to binary
CONVERSION FROM ONE RADIX TO
ANOTHER

• From binary to octal


• Divide into groups of 3 bits
• Example
• 11001101001000.1011011 = 31510.554

• From octal to binary


• Replace each octal digit with three bits
• Example
• 75643.5704 = 111101110100011.101111000100

https://slideplayer.com/slide/12693846/
CONVERSION FROM ONE RADIX TO
ANOTHER

• From binary to hexadecimal


• Divide into groups of 4 bits
• Example
• 11001101001000.1011011 = 3348.B6

• From hexadecimal to binary


• Replace each digit with four bits
• Example
• 7BA3.BC4 = 111101110100011.101111000100

https://slideplayer.com/slide/12693846/
CONVERSION FROM ONE RADIX TO
ANOTHER

• From decimal to base-r


• Separate the number into an integer part and a fraction
part
• For the integer part
• Divide the number and all successive quotients by r
• Accumulate the remainders

165
4 0.6875 x 2 = 1 +
23 0.3750
2
3 0.3750 x 2 = 0 +
3 0.7500
0
0.7500 x 2 = 1 +

¿
0.5000
¿ 0.5000 x 2 = 1
0.0000
+
RADIX NUMBERS CONVERSION FORMULA

• A number in a base-r system


x = xn-1xn-2 ... x1x0 . x-1 x-2 ... X-(m-1) x-m

𝑛−1 𝑛− 2 0 −1 −2 −𝑚
𝑉𝑎𝑙𝑢𝑒(𝑥)=𝑥𝑛 −1 ⋅𝑟 +𝑥𝑛 −2 ⋅𝑟 +...+𝑥 0 ⋅𝑟 +𝑥 −1 ⋅𝑟 +𝑥− 2 ⋅𝑟 +...+𝑥 −𝑚 ⋅𝑟

¿
¿
FINDING THE BASE OF THE NUMBER SYSTEM

• Find r such that (121)r=(144)8, where r and 8 are the


bases

1*82 + 4*8+4*80 = 64+32+4 =100


=> 1*r2+2*r+1*r0 = r2+2r+1=(r+1)2
=> (r+1)2 = 100
=> r+1 = 10
=> r = 9
RADIX
OPERATIONS
• The same as for decimal numbers
 10
1010 (101101)2 by110
+20
 30
+10100 101 5 111.  7.5
* 110 X6 )
6 110 110110145
11110  203
11001011 -
000
+157
+10011101 110
101x
 360
101101000 1010
+ 101xx
-
11110 110
11001011
 203 30

- 10011101
-157 1001
00101110
 46 -
110

110
-
COMPLEMENTS

• They are used to simplify the subtraction


operation
• Two types (for each base-r system)
• Diminishing radix complement (r-1 complement)
• Radix complement (r complement)
For n-digit number N

𝑛
(𝑟 − 1)− 𝑁 r-1 complement

𝑛
𝑟 −𝑁 r complement
NEGATIVE BINARY NUMBERS
• Three different systems have been used
• Signed magnitude
• One’s complement
• Two’s complement

NOTE: For negative numbers the sign bit is always 1, and for
positive numbers it is 0 in these three systems
SIGNED MAGNITUDE

• The leftmost bit is the sign bit (0 is + and 1 is -


) and the remaining bits hold the absolute
magnitude of the number
• Example
• -47 = 1 0 1 0 1 1 1 1
• 47 = 0 0 1 0 1 1 1 1
For 8 bits, we can represent the signed integers –128 to +127
How about for N bits?
ONE’S COMPLEMENT

• Replace each 1 by 0 and each 0 by 1


• Example (6)
• First represent 6 in binary format (00000110)
• Then replace (11111001)
TWO’S COMPLEMENT

• Find one’s complement


• Add 1
• Example (6)
• First represent 6 in binary format
(00000110)
• One’s complement (11111001)
• Two’s complement (11111010)
1’S AND 2’S COMPLEMENTS
• 1’s complement of
10111001
• 11111111 – 10111001 =
01000110
•Simply replace 1’s and 0’s
• 1’s complement of
10100010
• 01011101
• 2’s complement of
10111001
• 01000110 + 1 = 01000111
• Add 1 to 1’s complement
9’S AND 10’S COMPLEMENTS
• 9’s complement of 674653
• 999999-674653 = 325346
• 9’s complement of 023421
• 999999-023421 = 976578
• 10’s complement of 674653
• 325346+1 = 325347
• 10’s complement of 023421
• 976578+1=976579
CIRCUITS

• Let’s learn to design digital circuits


Digital circuit
• We’ll start with a simple form of circuit: 1
• Combinational circuit a
0
Combinational 1
F
b digital circuit
• A digital circuit whose outputs depend solely on the
present combination of the circuit inputs’ values
1
a Sequential ?
0 F
b digital circuit
SWITCHES

• Electronic switches are the basis


of binary digital circuits
• Electrical terminology
• Voltage: Difference in electric – +
9V
potential between two points
4.5 A 4.5 A
• Current: Flow of charged particles
2 ohms
• Resistance: Tendency of wire to
resist current flow 0V 9V

• V = I * R (Ohm’s Law)
4.5 A
SWITCHES

• A switch has three parts control


input
• Source input, and output “off”
• Current wants to flow from
source input to output source output
input a

• Control input control


input
“on”
• Voltage that controls whether
that current can flow source output
input
BOOLEAN LOGIC GATES
BUILDING BLOCKS FOR DIGITAL CIRCUITS
(BECAUSE SWITCHES ARE HARD TO WORK WITH)

• “Logic gates” are better digital circuit building blocks than switches (transistors)
• Why?...
BOOLEAN ALGEBRA

• Also known as Switching Algebra


› Invented by mathematician George Boole in 1849
› Used by Claude Shannon at Bell Labs in 1938
• To describe digital circuits built from relays
• Digital circuit design is based on
› Boolean Algebra
• Attributes
• Postulates
• Theorems
› These allow minimization and manipulation of logic gates for
optimizing digital circuits
ANALYSIS PROCEDURE
To obtain the output Boolean functions from a logic diagram,
proceed as follows:
1. Label all gate outputs that are a function of input variables with
arbitrary symbols. Determine the Boolean functions for each
gate output.
2. Label the gates that are a function of input variables and
previously labeled gates with other arbitrary symbols. Find the
Boolean functions for these gates.
3. Repeat the process outlined in step 2 until the outputs of the
circuit are obtained.
DESIGN PROCEDURE

1. The problem is stated


2. The number of available input variables and required output
variables is determined.
3. The input and output variables are assigned lettersymbols.
4. The truth table that defines the required relationship betweeninputs
and outputs is derived.
5. The simplified Boolean function for each output isobtained.
6. The logic diagram is drawn.
BOOLEAN ALGEBRA AND ITS RELATION TO DIGITAL CIRCUITS

a b AND
0 0 0
0 1 0
 Variables represent 0 or 1 only 1 0 0
1 1 1
 Operators return 0 or 1 only
 Basic operators
 AND: a b OR
a AND b returns 1 only
0 0 0
when both a=1 and b=1
0 1 1
 OR: a OR b returns 1 if either 1 0 1
(or both) a=1 or b=1 1 1 1

 NOT: NOT a returns the opposite


of a (1 if a=0, 0 if a=1)
a NOT
0 1
1 0
CONVERTING TO BOOLEAN EQUATIONS

• Convert the following English


statements to a Boolean equation
• Q1. a is 1 and b is 1.
• Answer: F = a AND b
• Q2. either of a or b is 1.
• Answer: F = a OR b
• Q3. both a and b are not 0.
• Answer:
• (a) Option 1: F = NOT(a) AND NOT(b)
• (b) Option 2: F = a OR b
RELATING BOOLEAN ALGEBRA TO DIGITAL DESIGN

NOT OR AND
x x
Symbol x F F F
y y

x F x y F x y F
Truth table 0 1 0 0 0 0 0 0
1 0 0 1 1 0 1 0
1 0 1 1 0 0
1 1 1 1 1 1

1 0 0
y
x y

Transistor x F
x F
circuit F y

x y
0 x

1 1

• Implement Boolean operators using


transistors
• Call those implementations logic gates.
EXAMPLE: SEAT BELT WARNING LIGHT SYSTEM

• Design circuit for warning light


• Sensors
• s=1: seat belt fastened
• k=1: key inserted
• p=1: person in seat
• Capture Boolean equation
• person in seat, and seat belt not k Belt Warn
fastened, and key inserted
p w
• Convert equation to circuit
s

w = p AND NOT(s) AND k


COMBINATIONAL
CIRCUITS
• Block diagram:
possible combinations of input values.

• Specific functions of combinational circuits


Adders,subtractors,multiplexers,comprators,encoder,Decoder.
MSI Circuits and standard cells.
BINARY ADDERS

Half Adder
A Half Adder is a combinational circuit with two binary inputs (augends
and addend bits and two binary outputs (sum and carry bits.) It adds
the two inputs (A and B) and produces the sum (S) and the carry (C)
bits.

Fig 1:Block diagram Fig 2:Truth table

Sum=A′B+AB′=A B
Carry=AB
FULL ADDER
The full-adder adds the bits A and B and the carry from the previous
column called the carry-in Cin and outputs the sum bit S and the
carry bit called the carry-out Cout .

Fig 3: block diagram Fig 4:Truth table


BCD ADDER
BCD Adder
• Perform the addition of two decimal digits in BCD, together with an
input carry from a previousstage.
• When the sum is 9 or less, the sum is in proper BCD form and no
correction is needed.
• When the sum of two digits is greater than 9, a correction of 0110
should be added to that sum, to produce the proper BCD result.
This will produce a carry to be added to the next decimal position.
UNIT 3: INTERNET, AND ITS APPLICATIONS

Meaning of Internet, IP Address, URL, Domain Name System, Internet Protocols - TCP/IP, UDP, FTP,
TELNET [brief ideas only], HTML, DHTML AND XML [Concepts only]
WHAT IS THE INTERNET?

• The Internet is a network of networks of computers.


PARTS OF THE INTERNET

• World Wide Web


• Telnet
• Email
• Ftp
WHAT IS THE WORLD WIDE
WEB?
• The World
Wide Web is
a
hyperlinked
network of
documents
and other
resources
found on the
computers
of the
Internet.

http://internet-map.net/
LOCATING RESOURCES

• In order for the WWW to be useful, we need a way of referencing all


the resources available.
• URL( UNIFORM RESOURCE LOCATOR).
• A URL allows every resource (e.g. HTML page, image, sound clip etc.)
on the WWW to have a unique address.
PARTS OF A
URL

• The protocol gives the method of communication to be used. http is most common, but you
may see ftp as well.
• The domain name is the name of the computer that has the resource you want.
• This computer is often called the host.
• The port specifies the port number that the server is listening to for requests.
• Port number is optional
• If not given, the default of port 80 is used.
• The exact path to the desired resource follows the domain name (and port number if given).
DOMAIN NAMES

• Domain names are broken down into different levels.


• E.g. www.someaddress.com
• The top level domain name is com
• The second level domain name is someaddress
• The third level domain name is www
• Host machines actually have IP (internet protocol) addresses, not domain names.
• IP addresses have the form 255.255.255.255
• A series of Domain Name Servers keep lists which map domain names to IP
addresses.
IP ADDRESSES

• The current method of IP addressing uses 32 bit addresses,


and we are quickly running out of addresses
• Work is underway to introduce IPv6 or IPng, which uses 128
bit addressing.
• This will provide
340,282,366,920,938,463,463,374,607,431,768,211,456
addresses, which could give up to
3,911,873,538,269,506,102 addresses per square metre of
the Earth’s surface.
FTP/TELNET

TELNET: The Internet allows computers to converse with each other over
networks. A telnet program allows us to log into a distant computer
almost as if we were actually sitting physically at that computer.

FTP: File Transfer Protocol allows us to transfer files between two different
computers on the Internet.
WHAT IS HTML?
 HTML is a mark up language.
 HTML stands for Hypertext Mark up Language.
 It doesn’t support data type, operator, function, control structure like programming language.
 It interpreted by interpreter, where the interpreter is a browser .that mean HTML execute through browser.
 HTML used to design a webpage.
 HTML provide web element like table, panel, textbox, checkbox, form etc.
 Element is known as Tag.
 Each tag associate with some attribute.
 Attribute is used to change the behaviour of the element.
 HTML describes the structure of webpages using mark up.
 HTML element are the building blocks of HTML pages.
 HTML elements are represented by tag.
 Browser don’t display the HTML tags but use them to render the content of the page.
 HTML can embed programs written in a scripting language such as JavaScript which affect the behaviour of web
pages.
WHAT IS DHTML?

 DHTML isn’t a language or web standard.


 DHTML stands for Dynamic Hypertext Mark up
Language.
 DHTML is a term used to describe the technologies
used to make webpages dynamic and interactive.
 That allow to the documented to be animated.
 DHTML is the combination of HTML , C++ , JavaScript ,
sql etc.
DIFFERENCE BETWEEN HTML AND DHTML

HTML DHTML
• Static webpage • Dynamic webpage

Nothing Happened Happened

NOKIA htc NOKIA htc

Add to Add to
Add to Add to
cart cart
cart cart
WHY XML ?
Although HTML is widely used for formatting and
structuring Web documents, it is not suitable for
specifying structured data that is extracted from
databases

A new language—namely XML has emerged as


the standard for structuring and exchanging data
over the Web.
WHAT IS
XML ?

• XML stands for eXtensible Markup Language.


• A markup language is used to provide information
about a document.
• Tags are added to the document to provide the extra
information.
• XML tags give a reader some idea what some of the
data means
• XML and HTML have a similar syntax … both derived
from SGML
EXAMPLE :
<?xml version = “1.0” ?>
<address>
<name>
<first>AMU</first>
<last>MCA</last>
</name>
<email>csdamu@gmail.com</email>
<phone>123-45-6789</phone>
<birthday>
<year>1920</year>
<month>01</month>
<day>09</day>
</birthday>
</address>
HTML
XML
 Extensible set of
•Fixed set of tags
tags
• Presentation oriented  Content orientated
• No data validation  Standard Data
capabilities
infrastructure
• Single presentation  Allows multiple

• Tags are used for output forms


display.  Tags are used to
describe documents
and data.
ADVANTAGES OF XML DISADVANTAGES OF XML

XML is text (Unicode) based. More difficult ,demanding


• Takes up less space.
and precise than HTML.
• Can be transmitted efficiently.
One XML document can be displayed Lack of browser support /
differently in different media. end user applications.
• Html, video, CD, DVD,
• You only have to change the XML Still experimental / not
document in order to change all the rest.
solidified.
XML documents can be modularized.
Parts can be reused.
UNIT 4: INTRODUCTION TO DBMS

Concepts of database and database management system (DBMS). Components of database management
system (DBMS) Data abstraction. Architecture – three schema architecture. Data models: hierarchical
model, network model and relational model.
DBMS(DATABASE MANAGEMENT
SYSTEM)
• A database refers to a collection of logically related information organized so that it can be
easily accessible, managed, and updated. Databases are generally accessed electronically
from a computer system and are usually controlled by a database management system
(DBMS).
• Enterprises typically make use of both internal databases and external databases. Internal
databases typically include operational databases and data warehouses. External databases
refer to databases external to an organization and are generally accessed over the Internet
and are owned by other organizations.
• The five major components of a database are hardware, software, data, procedure, and
database access language.
• DBMS is a collection of data (database) and programs to access that data. The goal of
DBMS is to store, retrieve, and display information
• Key characteristics of DBMS are: performance, store large volume of database, share data
(access), provide security (authorization), remove redundancy (normalization) and provide
concurrent access (different users at the same time).

https://corporatefinanceinstitute.com/resources/knowledge/data-
DATA ABSTRACTION

• Physical level: Describe how the data are actually store


(word or bytes)
• Conceptual level: Describe what data are actually stored in
the database (Structure). it gives Schematic representation
of phenomena
• View level: Describe only a part of the entire database. Many
users of the database may be concerned with a subset of
information. The system may provide many views for the
same database
TYPES OF DATABASE MODELS

Data model is a collection of conceptual tools for describing data, data


relationship, data semantics, and consistency constraints. There are
mainly three types of models
• Object-based logical models
They are used to describe data at the conceptual and view level.
Example of these are the Entity-Relationship model and object-oriented
model
• Record-based logical models
Are used to describe data at the conceptual and view level. Example of
these are: Network model, Hierarchical model, and relational model.
• Physical data models
Are used to describe data at the physical level (bytes and words). It is
mainly deal with hardware.
E-R MODEL

• It is based on simulation of the real world which consists of


basic objects called entities and relationship among these
objects
• The overall logical data structure of a database can be
expressed graphically by an E-R diagram. Which consists of
rectangle (entity), ellipse (attribute), diamond(relationship),
and lines.
OBJECT ORIENTED MODEL
• The basic unit that an object-oriented (OO-DBMS) manages is the object. It is
based on four basic concepts of abstraction:
• Classification: Mapping of several objects (instances) to common class
• Generalization: Group several classes which have the same properties in
common (roads, railway)-transportation network
• Association: Relation between similar objects is considered a higher level set
object
• Aggregation: Objects which consist of several other objects (Composed objects)
• OO model uses objects rather than records to manage data
• An object is a collection of data elements and operations that together are
considered a single entity
• An object has associated with it a set of variables that contain the data for the
object, a set of messages to which the object respond, and a method which
Object oriented Model-Continue
For example student can be a superclass. First
and second
year student may represented by a classes that
are
specialization of a student class variables and
methods
specific to first year students are associated
1
ST
with
YEA
fist year student class. R
Variables and methods that apply both to first
and second STUDE
3RD NT 2
ND
year students are associated with student
YEA class.
YEA
The variables associated with each class
R may be:R

Student: Name, ID, address


HIERARCHICAL MODEL

•Based on Tree structure (child-parent)


•No element can have more than one parent
•Requires knowledge by the user of the actual
storage scheme used by the DBMS

•Examples of database are: System2000 and


IMS

• Not commonly applicable in GIS


NETWORK MODEL

• Organized data in a network or plex structure


(child-parent)

• Children may have more than one parent


• The query language is procedural
• Examples of database are: DBMS-10,
DMS1100, IDMS

• Not commonly applicable in GIS


DATABASE TREE STRUCTURE (HIERARCHICAL, NETWORK)

Root (Parent)
A1
Child
B2 Parent
B1

C1 C2 C3
C4 C5 C6
Child
Child
RELATIONAL MODEL
• A relational database consists of a collection of
tables, each of which is assigned a unique
name
• The relational models differs from network and
hierarchical models in that it does not use
pointers or links. Instead , the relational model
relate records by the value they contain. This
freedom from the use of pointers allows formal
mathematical foundation to be defined
• Examples of RDBMS are Oracle, Informix, and
Sybase
REASONS TO USE RELATIONAL MODEL
• Independence of the physical data storage and logical
database structure. Results in users do not need to
understand the underlying physical layout of the data
to access data from a logical structure, such as a table
• Variable and easy access to all data. Results in access
to data is not predefined as in hierarchical databases
in which users must understand and navigate through
the hierarchy to retrieve data
• Flexible in database design. i.e. complex objects are
expressed as simple tables and relationships
• Applying relational design methods reduces data
redundancy (Normalization) and storage requirements

You might also like