Scribd
Upload
65 views39 pages

Information & Data: EEU 336 AADS-Lecture 1

The document discusses algorithms, data structures, sets, relations, and their roles in computing. It defines algorithms as step-by-step procedures to solve problems using computers, and data structures as ways of organizing data for programming or efficient computation. Sets are collections of elements that can be ordered or unordered. Relations represent connections between elements of different sets and can be binary or n-ary. Normal forms reduce redundancy in relational representations. Formal relations can model data and languages use notations like semantics and grammar.

Uploaded by

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

Information & Data: EEU 336 AADS-Lecture 1

The document discusses algorithms, data structures, sets, relations, and their roles in computing. It defines algorithms as step-by-step procedures to solve problems using computers, and data structures as ways of organizing data for programming or efficient computation. Sets are collections of elements that can be ordered or unordered. Relations represent connections between elements of different sets and can be binary or n-ary. Normal forms reduce redundancy in relational representations. Formal relations can model data and languages use notations like semantics and grammar.

Uploaded by

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

Information & Data

EEU 336 AADS-Lecture 1

Information
There is a flight from Calicut to Delhi
There is one Air India flight from Calicut to Delhi
There is one Air India flight at 2:00PM on all days
from Calicut to Delhi
There is only one flight IC 658 of Air India from
Calicut to Delhi and the fare is Rs.24,450/-

Information
There is only one flight from Calicut to Delhi.
It is IC 658 of Air India and the Economy class fare
is Rs.24,450/ Flight leaves at 2:00PM reaching Delhi by 7:40PM

DATA
CCJ DEL IC 658 14:00 19:40 24450 INR Y

There are eight pieces of information in the above


chain.
These 8 pieces plus the knowledge of the User about
the meanings of the abbreviations help one to get the
required information

DATA in the Computing


A=(B+C)+(D+E)
B,C,D & E are the operands and the + sign is the
operator.
There are two terms, each enclosed in parentheses.
How can the evaluation progress?

Computation

Find D+E get Sum1


push Sum1 to a memory
Find B+C giving say Sum 2 and hold it
Add Sum1 with Sum2
It gives the sum as needed in the expression
This could be assigned to A, on the LHS

COMPUTER
Computer is used to process data and provide the
information in a form required by the users
Operating System, Compilers, DBMS, MIS, ERP
Solutions- all are Softwares that enable the use of
the Computers for the various purposes
Computers work in isolation or in networked forms
(for the purpose of data processing and
presentation)

DATA AGGREGATION &


ABSTRACTION
DATA MODELLING?

DATA AGGREGATION

DATA ABSTRACTION

INFORMATION

ALGORITHM

Step by step solution to solve a problem on the


computer
Time for computation is important in certain cases
But in general, time taken for computation is a factor
that always get counted
So, one motivating factor for the search of new
algorithm for a job that will take less

ALGORITHM
Another aspect that is important for an algorithm is
the amount of memory needed (according to certain
model of computation)
This is the SPACE factor!!

COMPLEXITY
Complexity of Algorithm refers to some indications
of this TIME and SPACE factors
We can have only asymptotic estimates of these
complexities
Effort is to obtain ALGORITHMS with lesser
complexity, perhaps using suitable or appropriate
DATA STRUCTURES

DATA STRUCTURE
Data Structure is the way of organizing DATA
Because of the compulsion in the programming
Or, for providing better performing ALGORITHMS
for a given JOB

Programmers must learn to assess


applicationneeds first, then find a data
structure with matching capabilities.

Model of Computation
Computer consists of a Processor, and Memory
The time for action is counted in terms of the clock pulses
For example, if a calculation technique takes the order of
n2 pulses and another calculation technique for the same
job takes the order of n pulses, then
Second one more efficient than the first one

COMPUTER
DATA FLOW

COMPUTER
PROCESSOR

MEMORY(RAM)

ADVANCED MODEL/Model with


DATA FLOW
CACHE

COMPUTER
PROCESSOR

CACHE Level 1

CACHE Level 2

MAIN MEMORY
(RAM)

THESE ARE ON THE PROCESSOR CHIP


DISK STORAGE

Basic Data Structures


Set, List, Tree and Graph are the four basic Data
Structures
Set is a general concept of aggregating the data
List is a Linear Data Structure
Tree and Graph are Nonlinear Data Structures

Cell in the Data Structure


A Cell is the basic building block of a Data
Structure
A Cell could be a simple atomic,basic data type
or
o

A complex aggregation of data of different types

This Cell is referred to as Element, Member,


Node or Vortex (as the case may be) in the
context of Data Structures

Linear and NonLinear


In a linear organization of data cells we can
uniquely proceed to next cell by incrementing the
present address by unity(logically)
In nonlinear data structure the next cell can not be
accessed uniquely by incrementing the present
address by unity

Linear and Nonlinear

TREE

LIST

GRAPH

Set
A set is a collection of objects
That are eligible to be member of the set
Each member will be have to satisfy the properties
envisioned or attributed to the Set
o Arrangements of members in the set does not follow any
order
o But the members can be arranged or ordered as well, if
so required
o
o

Unordered set & Ordered Set


If there is no order of appearance then set is not
ordered
If there is an order for the appearance of members
then the Set is an Ordered Set

Ordered Set-Examples
List of names arranged in the Alphabetical Order is
one Ordered Set
Numbers arranged in the ascending order or
descending order gives one Ordered Set
Words arranged in the Lexical order is an example
of Ordered Set

Set
Apple, Orange, Pappaya and Guava are fruits of
four different types
As fruits they belong to the set of fruits
We write the set as
{Apple, Orange, Pappaya, Guava}
Or
(Apple, Guava, Orange, Pappaya)

Set & Multiset


A set has none of the member occur/appear more
than once
In a multiset, any member can occur more than
once
o
o

{1,4,6,8} is a Set
{1,4,1,1,6,6,8} is a multiset

Cartesian Product
A Cartesian Product of two sets is the set of all
Ordered Pairs of Elements of the two sets

Example
A ={P,Q,R}
B={45,35,56,85}
AB={(P,45),(Q,45),(R,45),(P,35),(Q,35), (R,35),
(P,56),(Q,56),(R,56),(P,85),(Q,85), (R,85)}

Relation
A Relation could be the connection between two
Sets
A relation can be thought of as a Table that lists the
relationship of elements in a set to the elements in
another sets
In Database Modeling there could be
o
o
o
o

One-to-One Relation
One-to-Many Relation
Many-to-One Relation
Many-to-Many Relation

Example of Relation

Relation of Course Code to Course Title


Relation of Student to a Course
Relation of Price to Commodity
Relation of Person to Body height
Relation of Student to Teacher

Binary & N-ary relation


Binary relation is one-to-one relation
o
o

Course Code to Course Title


Roll Number to Student

N ary relations hold the relationship between


multiple data units
N ary relation appear as multi column Table or a
Tuple (N Tuple)

8 Tuple
CCJ DEL IC 658 14:00 19:40 24450 INR Y

Normal Form of Relation


In the context of Database Systems
Normal form of the Relations is the representation
where the redundancy in representing the relations of
the data units is removed

(Formal) Relations
In the context of Languages we may express
relation in a formal way by using notations like
semantics, grammar etc.

Summary

Algorithm
Algorithm is the step by step procedure for solution
using computer
Algorithm accept the Input and give the well defined
Output
Complexity of the Algorithm is an issue that can be
systematically analyzed
Algorithm design refers to the development of good and
efficient algorithms for a given task

Data Structure
Data Structure is an abstraction of the
representation of Data for specific purposes of
manipulation using computers with a view to
achieve better convenience in programming or
better efficiency in computing

Sets and Relations


A Set is a collection of objects(that are qualified to be
members or elements of the Set)
There can be Ordered Set & Unordered set
Relation between multiple sets can be depicted in a
Table
A two column table can show the Binary Relation
Normal Forms depict the reduced(abstract)
representation of relations that will not be containing
any redundancy

Relations and Formal Relations


Relations can be used in the formal context
Relations can be used to model data in the case of
Database Systems or Data Warehousing

Thank you

You might also like