Laboratory Manual Data Warehousing and Mining Lab: Department of Computer Science and Engineering

LABORATORY MANUAL
DATA WAREHOUSING AND MINING LAB
B.TECH
(IV YEAR – I SEM)
(2016-17)
DEPARTMENT OF
COMPUTER SCIENCE AND ENGINEERING
MALLA REDDY COLLEGE OF ENGINEERING &

TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
Recogn ized under 2(f) and 12 (B) of UGC ACT
1956
Affiliated to JNTUH, Hyderabad , App roved by AICTE - Accredited b y NBA & NAAC – ‘A’ Grade - ISO
9001:2008
Certified )
Maisammaguda, Dhulapally (Post Via. Hakimpet), Secund erabad – 500100, Telangana State, India
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Vision
 To acknowledge quality education and instill high patterns of
discipline making the students technologically superior and ethically
strong which involves the improvement in the quality of life in
human race.
Mission
 To achieve and impart holistic technical education using the best of
infrastructure, outstanding technical and teaching expertise to
establish the students into competent and confident engineers.
 Evolving the center of excellence through creative and innovative
teaching learning practices for promoting academic achievement to
produce internationally accepted competitive and world class
professionals.
PROGRAMME EDUCATIONAL OBJECTIVES
(PEOs)
PEO1 – ANALYTICAL SKILLS
1. To facilitate the graduates with the ability to visualize, gather information,

articulate, analyze, solve complex problems, and make decisions. These are
essential to address the challenges of complex and computation intensive
problems increasing their productivity.
PEO2 – TECHNICAL SKILLS
2. To facilitate the graduates with the technical skills that prepare them for
immediate employment and pursue certification providing a deeper
understanding of the technology in advanced areas of computer science
and related fields, thus encouraging to pursue higher education and research
based on their interest.
PEO3 – SOFT SKILLS
3. To facilitate the graduates with the soft skills that include fulfilling the mission,
setting goals, showing self-confidence by communicating effectively, having
a positive attitude, get involved in team-work, being a leader, managing
their career and their life.
PEO4 – PROFESSIONAL ETHICS
To facilitate the graduates with the knowledge of professional and

ethical responsibilities by paying attention to grooming, being conservative
with style, following dress codes, safety codes, and adapting themselves to
technological advancements.
PROGRAM SPECIFIC OUTCOMES (PSOs)
After the completion of the course, B. Tech Computer Science and Engineering,
the graduates will have the following Program Specific Outcomes:
1. Fundamentals and critical knowledge of the Computer System:- Able

to Understand the working principles of the computer System and its
components , Apply the knowledge to build, asses, and analyze the software
and hardware aspects of it .
2. The comprehensive and Applicative knowledge of Software Development:

Comprehensive skills of Programming Languages, Software process models,
methodologies, and able to plan, develop, test, analyze, and manage the
software and hardware intensive systems in heterogeneous platforms
individually or working in teams.
3. Applications of Computing Domain & Research: Able to use the

professional, managerial, interdisciplinary skill set, and domain specific tools in
development processes, identify the research gaps, and provide innovative
solutions to them.
PR OG RAM OU T COM E S (P Os )
E nginee rin g G radu a te s w ill b e able t o:
1. Enginee rin g know led ge : Apply the kno wledge o f mathematics,
science, engineering fundamenta ls, and an engineering specialization to the
solution of co mplex engineering proble ms .
2. Proble m analysis : Identify , for mulate, review resea rch literature, and ana
lyze complex engineering proble ms rea ching substantia ted conclusions using
fir st principles o f mathematic s, natura l science s, and enginee ring sciences .
3. Des ign / d e velop ment o f solution s: Design solutions for co mplex engineering
problems and design system components or processes tha t m eet
the specified needs with a ppropria te consideration for the public hea lth
a nd safety, a nd the cultural, societal, and environmental considerations.
4. Con duct inve stigations o f co mp le x p roble ms: Us e research -based
knowledge
and resea rch methods including design of experiments, ana lysis a
nd interpretation of data, and synthesis of the in for ma tion to provide
valid conclusions.
5. Mod ern too l usa ge : C reate, select , and apply appropriate
techniques, resources, a nd modern engineering and IT tools including
prediction a nd modeling to complex engineering activities with an
understanding of the limitations.
6. The eng ineer a nd soc iety : Apply reasoning infor med by the contex tual
knowledge to assess societa l, health, safety, lega l and cultural issues and
the consequent responsibilities relevant to the profe ssional engineerin g
practice.
7. Environ m ent and su stainab ility : Understand the impa ct of the
professional engineering solutions in societal a nd environmental
contexts, and demonstrate the knowledge o f, and need for sustainable
development .
8. Ethics : Apply ethical principles and commit to profes siona l ethics a nd
responsibilities and nor ms o f the en gineering pra
ctice.
9. Ind ividu al and tea m wo rk : Function effectively as an individual, and a s
a me mbe r or lea der in diverse tea ms, a nd in multidisciplinary settings .
10. Co m municat ion : Communicate e ffectively on complex engineering activities
with the engineering community and with society at large, such a s, being
able to comprehend a nd write effective reports and design documentation,
ma ke effective presentations, and give a nd receive clear instructions.
11. Project mana ge men t and finance : De monstrate knowledge
and understa nding of the engineering and ma nagement principles and
apply these to one’s own work , a s a me mber and leader in a team, to
mana ge projects a nd in multi disciplinary environments .
12. Life - lon g learn ing : Reco gnize the need for, and ha ve the preparation
and ability to enga ge in independent and life-long learning in the
broadest contex t of technologica l change.
MALLA REDDY COLLEGE OF ENGINEERING &
TECHNOLOGY
Maisammaguda, Dhulapally Post, Via Hakimpet, Secunderabad – 500100
GENERAL L ABO RAT O RY INSTRUCT

IONS
1. Students are advised to come to the laboratory at least 5 minutes before (to
the starting time), those who come after 5 minutes will not be allowed into the
lab.
2. Plan your task properly much before to the commencement, come prepared to the
lab with the synopsis / program / experiment details.
3. Student should enter into the laboratory with:
a. Laboratory observation notes with all the details (Problem statement, Aim,
Algorithm, Procedure, Program, Expected Output, etc.,) filled in for the lab
session.
b. Laboratory Record updated up to the last session experiments and other utensils
(if any) needed in the lab.
c. Proper Dress code and Identity card.
4. Sign in the laboratory login register, write the TIME-IN, and occupy the
computer system allotted to you by the faculty.
5. Execute your task in the laboratory, and record the results / output in the
lab observation note book, and get certified by the concerned faculty.
6. All the students should be polite and cooperative with the laboratory staff, must
maintain the discipline and decency in the laboratory.
7. Computer labs are established with sophisticated and high end branded
systems, which should be utilized properly.
8. Students / Faculty must keep their mobile phones in SWITCHED OFF mode
during the lab sessions.Misuse of the equipment, misbehaviors with the staff and
systems etc., will attract severe punishment.
9. Students must take the permission of the faculty in case of any urgency to go out ;
if anybody found loitering outside the lab / class without permission during
working hours will be treated seriously and punished appropriately.
10. Students should LOG OFF/ SHUT DOWN the computer system before he/she
leaves the lab after completing the task (experiment) in all aspects. He/she must
ensure the system / seat is kept properly.
Head of the Department Principal

Data Warehousing and Mining Lab Department of CSE
COURSE NAME: DATA WAREHOUSING AND MINING LAB

COURSE CODE: A70595
COURSE OBJECTIVES:
1. Learn how to build a data warehouse and query it (using open source tools like
Pentaho Data Integration Tool, Pentaho Business Analytics).
2. Learn to perform data mining tasks using a data mining toolkit (such as open source
WEKA).
3. Understand the data sets and data preprocessing.
4. Demonstrate the working of algorithms for data mining tasks such association rule mining,
classification, clustering and regression.
5. Exercise the data mining techniques with varied input values for different parameters.
6. To obtain Practical Experience Working with all real data sets.
7. Emphasize hands-on experience working with all real data sets.
COURSE OUTCOMES:
1. Ability to understand the various kinds of tools.

2. Demonstrate the classification, clustering and etc. in large data sets.
3. Ability to add mining algorithms as a component to the exiting tools.
4. Ability to apply mining techniques for realistic data.
MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 P09 PO10 PO11
COURSE OUTCOMES
MRCET Page 1
• Ability to add mining algorithms as

a component to the exiting tools. √ √ √ √
• Ability to apply mining techniques
for realistic data.
MRCET Page 2
DATA WAREHOUSING AND MINING LAB- INDEX
S.No Experiment Name Page No
1 Unit-I Build Data Warehouse and Explore WEKA 03
Unit-II Perform data preprocessing tasks and Demonstrate

2 performing association rule mining on data sets 59
3 Unit-III Demonstrate performing classification on data sets 71
4 Unit-IV Demonstrate performing clustering on data sets

95
MRCET Page 3
5 Unit-V Demonstrate performing Regression on data sets

104
Task 1: Credit Risk Assessment. Sample Programs using

6 German Credit Data 116
7 Task 2: Sample Programs using Hospital Management System 137
8 Beyond the Syllabus -Simple Project on Data Preprocessing 139
MRCET Page 4
Unit-I Build Data Warehouse and Explore WEKA
A. Build Data Warehouse/Data Mart (using open source tools like Pentaho Data
Integration Tool, Pentaho Business Analytics; or other data warehouse tools like
Microsoft-SSIS,Informatica,Business Objects,etc.,)
A.(i) Identify source tables and populate sample data.
The data warehouse contains 4 tables:
1. Date dimension: contains every single date from 2006 to 2016.

2. Customer dimension: contains 100 customers. To be simple we’ll make it type 1 so we
don’t create a new row for each change.
3. Van dimension: contains 20 vans. To be simple we’ll make it type 1 so we don’t create a
new row for each change.
st
4. Hire fact table: contains 1000 hire transactions since 1 Jan 2011. It is a daily snapshot fact
table so that every day we insert 1000 rows into this fact table. So over time we can track
the changes of total bill, van charges, satnav income, etc.
Create the source tables and populate them
So now we are going to create the 3 tables in HireBase database: Customer, Van, and Hire. Then
we populate them.
First I’ll show you how it looks when it’s done:
MRCETr 3
Customer table:
Van table:
Hire table:
MRCET Page 4
And here is the script to create and populate them:
-- Create database
create database HireBase
go
use HireBase
go
-- Create customer table

if exists (select * from sys.tables where name = 'Customer')
drop table Customer
go
create table Customer

( CustomerId varchar(20) not null primary key,
CustomerName varchar(30), DateOfBirth date, Town varchar(50),
TelephoneNo varchar(30), DrivingLicenceNo varchar(30), Occupation varchar(30)
)
go
-- Populate Customer
truncate table Customer
go
declare @i int, @si varchar(10), @startdate date

set @i = 1
while @i <= 100
begin
set @si = right('0'+CONVERT(varchar(10), @i),2)
insert into Customer
( CustomerId, CustomerName, DateOfBirth, Town, TelephoneNo, DrivingLicenceNo,
Occupation)
values
( 'N'+@si, 'Customer'+@si, DATEADD(d,@i-1,'2000-01-01'), 'Town'+@si, 'Phone'+@si,
'Licence'+@si, 'Occupation'+@si)
set @i = @i + 1
end
go
select * from Customer
-- Create Van table

if exists (select * from sys.tables where name = 'Van')
drop table Van
go
MRCET page 5
create table Van

( RegNo varchar(10) not null primary key,
Make varchar(30), Model varchar(30), [Year] varchar(4),
Colour varchar(20), CC int, Class varchar(10)
)
go
-- Populate Van table

truncate table Van
go
declare @i int, @si varchar(10)

set @i = 1
while @i <= 20
begin
set @si = convert(varchar, @i)
insert into Van
( RegNo, Make, Model, [Year], Colour, CC, Class)
values
( 'Reg'+@si, 'Make'+@si, 'Model'+@si,
case @i%4 when 0 then 2008 when 1 then 2009 when 2 then 2010 when 3 then 2011 end,
case when @i%5<3 then 'White' else 'Black' end,
case @i%3 when 0 then 2000 when 1 then 2500 when 2 then 3000 end,
case @i%3 when 0 then 'Small' when 1 then 'Medium' when 2 then 'Large' end)
set @i = @i + 1
end
go
select * from Van
-- Create Hire table

if exists (select * from sys.tables where name = 'Hire')
drop table Hire
go
create table Hire

( HireId varchar(10) not null primary key,
HireDate date not null,
CustomerId varchar(20) not null,
RegNo varchar(10), NoOfDays int, VanHire money, SatNavHire
money, Insurance money, DamageWaiver money, TotalBill money
)
go
MRCET page 6
-- Populate Hire table

truncate table Hire
go
declare @i int, @si varchar(10), @DaysFrom1stJan int, @CustomerId int, @RegNo int, @mi int
set @i = 1
while @i <= 1000
begin
set @si = right('000'+convert(varchar(10), @i),4) -- string of i
set @DaysFrom1stJan = (@i-1)%200 --The Hire Date is derived from i modulo 200
set @CustomerId = (@i-1)%100+1 --The CustomerId is derived from i modulo 100
set @RegNo = (@i-1)%20+1 --The Van RegNo is derived from i modulo 20
set @mi = (@i-1)%3+1 --i modulo 3
insert into Hire (HireId, HireDate, CustomerId, RegNo, NoOfDays, VanHire, SatNavHire,
Insurance, DamageWaiver, TotalBill)
values ('H'+@si, DateAdd(d, @DaysFrom1stJan, '2011-01-01'),
left('N0'+CONVERT(varchar(10),@CustomerId),3), 'Reg'+CONVERT(varchar(10), @RegNo),
@mi, @mi*100, @mi*10, @mi*20, @mi*40, @mi*170)
set @i += 1
end
go
select * from Hire
Create the Data Warehouse
So now we are going to create the 3 dimension tables and 1 fact table in the data warehouse:
DimDate, DimCustomer, DimVan and FactHire. We are going to populate the 3 dimensions but
we’ll leave the fact table empty. The purpose of this article is to show how to populate the fact
table using SSIS.
First I’ll show you how it looks when it’s done:
MRCET Pa ge 7
Date Dimension:
Customer Dimension:
Van Dimension:
MRCET page
8
And then we do it. This is the script to create and populate those dim and fact tables:
-- Create the data warehouse

create database TopHireDW
go
use TopHireDW
go
-- Create Date Dimension

if exists (select * from sys.tables where name = 'DimDate')
drop table DimDate
go
create table DimDate

( DateKey int not null primary key,
[Year] varchar(7), [Month] varchar(7), [Date] date, DateString varchar(10))
go
-- Populate Date Dimension

truncate table DimDate
go
declare @i int, @Date date, @StartDate date, @EndDate date, @DateKey int,
@DateString varchar(10), @Year varchar(4),
@Month varchar(7), @Date1 varchar(20)
set @StartDate = '2006-01-01'
set @EndDate = '2016-12-31'
set @Date = @StartDate
insert into DimDate (DateKey, [Year], [Month], [Date], DateString)

values (0, 'Unknown', 'Unknown', '0001-01-01', 'Unknown') --The unknown row
while @Date <= @EndDate

begin
set @DateString = convert(varchar(10), @Date, 20)
set @DateKey = convert(int, replace(@DateString,'-',''))
set @Year = left(@DateString,4)
set @Month = left(@DateString, 7)
insert into DimDate (DateKey, [Year], [Month], [Date], DateString)
values (@DateKey, @Year, @Month, @Date, @DateString)
set @Date = dateadd(d, 1, @Date)
end
go
select * from DimDate

MRCET page 9
-- Create Customer dimension

if exists (select * from sys.tables where name = 'DimCustomer')
drop table DimCustomer
go
create table DimCustomer

( CustomerKey int not null identity(1,1) primary key,
CustomerId varchar(20) not null,
CustomerName varchar(30), DateOfBirth date, Town varchar(50),
TelephoneNo varchar(30), DrivingLicenceNo varchar(30), Occupation varchar(30)
)
go
insert into DimCustomer (CustomerId, CustomerName, DateOfBirth, Town, TelephoneNo,

DrivingLicenceNo, Occupation)
select * from HireBase.dbo.Customer
select * from DimCustomer
-- Create Van dimension

if exists (select * from sys.tables where name = 'DimVan')
drop table DimVan
go
create table DimVan

( VanKey int not null identity(1,1) primary key,
RegNo varchar(10) not null,
Make varchar(30), Model varchar(30), [Year] varchar(4),
Colour varchar(20), CC int, Class varchar(10)
)
go
insert into DimVan (RegNo, Make, Model, [Year], Colour, CC, Class)
select * from HireBase.dbo.Van
go
select * from DimVan
-- Create Hire fact table

if exists (select * from sys.tables where name = 'FactHire')
drop table FactHire
go
MRCET page 10
create table FactHire

( SnapshotDateKey int not null, --Daily periodic snapshot fact table
HireDateKey int not null, CustomerKey int not null, VanKey int not null, --Dimension Keys
HireId varchar(10) not null, --Degenerate Dimension
NoOfDays int, VanHire money, SatNavHire money,
Insurance money, DamageWaiver money, TotalBill money
)
go
select * from FactHire
A.(ii). Design multi-demesional data models namely Star, Snowflake and Fact
Constellation schemas for any one enterprise (ex. Banking,Insurance, Finance,
Healthcare, manufacturing, Automobiles,sales etc).
Ans: Schema
Definition
Multidimensional schema is defined using Data Mining Query Language (DMQL). The two
primitives, cube definition and dimension definition, can be used for defining the data warehouses
and data marts.
Star
Schema
• Each dimension in a star schema is represented with only one-dimension table.
• This dimension table contains the set of attributes.
• The following diagram shows the sales data of a company with respect to the four
dimensions, namely time, item, branch, and location.
• There is a fact table at the center. It contains the keys to each of four dimensions.
• The fact table also contains the attributes, namely dollars sold and units sold.
MRCET Page
1111
Snowflake Schema
• Some dimension tables in the Snowflake schema are normalized.
• The normalization splits up the data into additional tables.
• Unlike Star schema, the dimensions table in a snowflake schema is normalized. For
example, the item dimension table in star schema is normalized and split into two
dimension tables, namely item and supplier table.
• Now the item dimension table contains the attributes item_key, item_name, type, brand,
and supplier-key.
• The supplier key is linked to the supplier dimension table. The supplier dimension table
contains the attributes supplier_key and supplier_type.
MRCET Page
1212
Fact Constellation Schema
• A fact constellation has multiple fact tables. It is also known as galaxy schema.
• The following diagram shows two fact tables, namely sales and shipping.
• The sales fact table is same as that in the star schema.
• The shipping fact table has the five dimensions, namely item_key, time_key, shipper_key,
from_location, to_location.
• The shipping fact table also contains two measures, namely dollars sold and units sold.
• It is also possible to share dimension tables between fact tables. For example, time, item,
and location dimension tables are shared between the sales and shipping fact table.
MRCET Page
1313
A.(iii) Write ETL scripts and implement using data warehouse tools.
Ans:
ETL comes from Data Warehousing and stands for Extract-Transform-Load. ETL covers a process
of how the data are loaded from the source system to the data warehouse. Extraction–
transformation–loading (ETL) tools are pieces of software responsible for the extraction of data
from several sources, its cleansing, customization, reformatting, integration, and insertion into a
data warehouse.
Building the ETL process is potentially one of the biggest tasks of building a warehouse; it is
complex, time consuming, and consumes most of data warehouse project’s implementation efforts,
costs, and resources.
Building a data warehouse requires focusing closely on understanding three main
areas:
1. Source Area- The source area has standard models such as entity relationship
diagram.
2. Destination Area- The destination area has standard models such as star schema.
MRCET page14
3. Mapping Area- But the mapping area has not a standard model till now.
MRCET page15
Abbreviations
• ETL-extraction–transformation–loading
• DW-data warehouse
• DM- data mart
• OLAP- on-line analytical processing
• DS-data sources
• ODS- operational data store
• DSA- data staging area
• DBMS- database management system
• OLTP-on-line transaction processing
• CDC-change data capture
• SCD-slowly changing dimension
• FCME- first-class modeling elements
• EMD-entity mapping diagram
• DSA-data storage area
ETL Process:
Extract
The Extract step covers the data extraction from the source system and makes it accessible for
further processing. The main objective of the extract step is to retrieve all the required data from
the source system with as little resources as possible. The extract step should be designed in a way
that it does not negatively affect the source system in terms or performance, response time or any
kind of locking.
There are several ways to perform the extract:
• Update notification - if the source system is able to provide a notification that a record has been
changed and describe the change, this is the easiest way to get the data.
• Incremental extract - some systems may not be able to provide notification that an update has
occurred, but they are able to identify which records have been modified and provide an extract of
such records. During further ETL steps, the system needs to identify changes and propagate it
down. Note, that by using daily extract, we may not be able to handle deleted records properly.
• Full extract - some systems are not able to identify which data has been changed at all, so a full
extract is the only way one can get the data out of the system. The full extract requires keeping a
copy of the last extract in the same format in order to be able to identify changes. Full extract
handles deletions as well.
MRCET Page
1515
Transform
The transform step applies a set of rules to transform the data from the source to the target. This
includes converting any measured data to the same dimension (i.e. conformed dimension) using the
same units so that they can later be joined. The transformation step also requires joining data from
several sources, generating aggregates, generating surrogate keys, sorting, deriving new calculated
values, and applying advanced validation rules.
Load
During the load step, it is necessary to ensure that the load is performed correctly and with as little
resources as possible. The target of the Load process is often a database. In order to make the load
process efficient, it is helpful to disable any constraints and indexes before the load and enable
them back only after the load completes. The referential integrity needs to be maintained by ETL
tool to ensure consistency.
ETL method – nothin’ but SQL
ETL as scripts that can just be run on the database.These scripts must be re-runnable: they should
be able to be run without modification to pick up any changes in the legacy data, and automatically
work out how to merge the changes into the new schema.
In order to meet the requirements, my scripts must:
1. INSERT rows in the new tables based on any data in the source that hasn’t already been created in
the destination
2. UPDATE rows in the new tables based on any data in the source that has already been inserted in
the destination
3. DELETE rows in the new tables where the source data has been deleted
Now, instead of writing a whole lot of INSERT, UPDATE and DELETE statements, I thought
“surely MERGE would be both faster and better” – and in fact, that has turned out to be the case.
By writing all the transformations as MERGE statements, I’ve satisfied all the criteria, while
also making my code very easily modified, updated, fixed and rerun. If I discover a bug or a
change
in requirements, I simply change the way the column is transformed in the MERGE statement, and
re-run the statement. It then takes care of working out whether to insert, update or delete each row.
My next step was to design the architecture for my custom ETL solution. I went to the dba with the
following design, which was approved and created for me:
1. create two new schemas on the new 11g database: LEGACY and MIGRATE
2. take a snapshot of all data in the legacy database, and load it as tables in the LEGACY schema
3. grant read-only on all tables in LEGACY to MIGRATE
4. grant CRUD on all tables in the target schema to MIGRATE.
MRCET Page
1616
For example, in the legacy database we have a table:
LEGACY.BMS_PARTIES(
par_id NUMBER PRIMARY KEY,
par_domain VARCHAR2(10) NOT NULL,
par_first_name VARCHAR2(100) ,
par_last_name VARCHAR2(100),
par_dob DATE, par_business_name
VARCHAR2(250), created_by
VARCHAR2(30) NOT NULL, creation_date
DATE NOT NULL, last_updated_by
VARCHAR2(30), last_update_date DATE)
In the new model, we have a new table that represents the same kind of information:
NEW.TBMS_PARTY(
party_id NUMBER(9) PRIMARY KEY,
party_type_code VARCHAR2(10) NOT NULL,
first_name VARCHAR2(50),
surname VARCHAR2(100),
MRCET page 17
date_of_birth DATE, VARCHAR2(300),
business_name VARCHAR2(50) NOT NULL,
db_created_by DATE DEFAULT SYSDATE NOT NULL,
db_created_on VARCHAR2(50),
db_modified_by DATE,
db_modified_on
version_id NUMBER(12) DEFAULT 1 NOT NULL)
This was the simplest transformation you could possibly think of – the mapping from one to the
other is 1:1, and the columns almost mean the same thing.
The solution scripts start by creating an intermediary table:
MIGRATE.TBMS_PARTY(
old_par_id NUMBER PRIMARY KEY,
party_id NUMBER(9) NOT NULL,
party_type_code VARCHAR2(10) NOT NULL,
first_name VARCHAR2(50),
surname VARCHAR2(100),
date_of_birth DATE,
business_name VARCHAR2(300),
db_created_by VARCHAR2(50),
MRCET Page 18
db_created_on DATE,
db_modified_by VARCHAR2(50),
db_modified_on DATE,
deleted CHAR(1))
The second step is the E and T parts of “ETL”: I query the legacy table, transform the data right
there in the query, and insert it into the intermediary table. However, since I want to be able to re•
run this script as often as I want, I wrote this as a MERGE statement:
MERGE INTO MIGRATE.TBMS_PARTY dest
USING (
SELECT par_id AS old_par_id,
par_id AS party_id,
CASE par_domain
WHEN 'P' THEN 'PE' /*Person*/
WHEN 'O' THEN 'BU' /*Business*/
END AS party_type_code,
par_first_name AS first_name,
par_last_name AS surname,
par_dob AS date_of_birth,
par_business_name AS business_name,
MRCET page 19
created_by AS db_created_by,
creation_date AS db_created_on,
last_updated_by AS db_modified_by,
last_update_date AS db_modified_on
FROM LEGACY.BMS_PARTIES s
WHERE NOT EXISTS (
SELECT null
FROM MIGRATE.TBMS_PARTY d
WHERE d.old_par_id = s.par_id
AND (d.db_modified_on = s.last_update_date
OR (d.db_modified_on IS NULL
AND s.last_update_date IS NULL))
) src
ON (src.OLD_PAR_ID = dest.OLD_PAR_ID)
WHEN MATCHED THEN UPDATE SET
party_id = src.party_id ,
party_type_code = src.party_type_code ,
first_name = src.first_name ,
surname = src.surname ,
date_of_birth = src.date_of_birth ,
business_name = src.business_name ,
db_created_by = src.db_created_by ,
db_created_on = src.db_created_on ,
db_modified_by = src.db_modified_by ,
A.(iv) Perform Various OLAP operations such slice, dice, roll up, drill up and pivot.
Ans: OLAP OPERATIONS
Online Analytical Processing Server (OLAP) is based on the multidimensional data model. It
allows managers, and analysts to get an insight of the information through fast, consistent, and
interactive access to information.
OLAP operations in multidimensional data.
Here is the list of OLAP operations:
• Roll-up
• Drill-down
• Slice and dice
• Pivot (rotate)
Roll-up
Roll-up performs aggregation on a data cube in any of the following ways:
• By climbing up a concept hierarchy for a dimension

• By dimension reduction
The following diagram illustrates how roll-up works.
MRCET Page
2121
• Roll-up is performed by climbing up a concept hierarchy for the dimension location.
• Initially the concept hierarchy was "street < city < province < country".
• On rolling up, the data is aggregated by ascending the location hierarchy from the level of
city to the level of country.
• The data is grouped into cities rather than countries.
• When roll-up is performed, one or more dimensions from the data cube are removed.
Drill-down
Drill-down is the reverse operation of roll-up. It is performed by either of the following ways:
• By stepping down a concept hierarchy for a dimension

• By introducing a new dimension.
The following diagram illustrates how drill-down works:
MRCET Page
2222
• Drill-down is performed by stepping down a concept hierarchy for the dimension time.
• Initially the concept hierarchy was "day < month < quarter < year."
• On drilling down, the time dimension is descended from the level of quarter to the level of
month.
• When drill-down is performed, one or more dimensions from the data cube are added.
• It navigates the data from less detailed data to highly detailed data.
Slice
The slice operation selects one particular dimension from a given cube and provides a new sub-
cube. Consider the following diagram that shows how slice works.
MRCET Page
2323
• Here Slice is performed for the dimension "time" using the criterion time = "Q1".
• It will form a new sub-cube by selecting one or more dimensions.
Dice
Dice selects two or more dimensions from a given cube and provides a new sub-cube. Consider
the following diagram that shows the dice operation.
MRCET page 24
The dice operation on the cube based on the following selection criteria involves three
dimensions.
• (location = "Toronto" or "Vancouver")

• (time = "Q1" or "Q2")
• (item =" Mobile" or "Modem")
Pivot
The pivot operation is also known as rotation. It rotates the data axes in view in order to provide
an alternative presentation of data. Consider the following diagram that shows the pivot operation.
MRCET Page
2525
A. (v). Explore visualization features of the tool for analysis like identifying trends etc.
Ans:
Visualization Features:
WEKA’s visualization allows you to visualize a 2-D plot of the current working relation.
Visualization is very useful in practice, it helps to determine difficulty of the learning problem.
WEKA can visualize single attributes (1-d) and pairs of attributes (2-d), rotate 3-d visualizations
(Xgobi-style). WEKA has “Jitter” option to deal with nominal attributes and to detect “hidden”
data points.
• Access To Visualization From The Classifier, Cluster And Attribute Selection Panel Is
Available From A Popup Menu. Click The Right Mouse Button Over An Entry In The
Result List To Bring Up The Menu. You Will Be Presented With Options For Viewing Or
Saving The Text Output And --- Depending On The Scheme --- Further Options For
Visualizing Errors, Clusters, Trees Etc.
MRCET Page
2626
To open Visualization screen, click ‘Visualize’ tab.
Select a square that corresponds to the attributes you would like to visualize. For example, let’s
choose ‘outlook’ for X – axis and ‘play’ for Y – axis. Click anywhere inside the square that
corresponds to ‘play on the left and ‘outlook’ at the top
MRCET Page
2727
Changing the View:
In the visualization window, beneath the X-axis selector there is a drop-down list,
‘Colour’, for choosing the color scheme. This allows you to choose the color of points based on
the attribute selected. Below the plot area, there is a legend that describes what values the colors
correspond to. In your example, red represents ‘no’, while blue represents ‘yes’. For better
visibility you should change the color of label ‘yes’. Left-click on ‘yes’ in the ‘Class colour’
box and select lighter color from the color palette.
To the right of the plot area there are series of horizontal strips. Each strip represents an
attribute, and the dots within it show the distribution values of the attribute. You can choose
what axes are used in the main graph by clicking on these strips (left-click changes X-axis, right-
click changes Y-axis).
The software sets X - axis to ‘Outlook’ attribute and Y - axis to ‘Play’. The instances are spread
out in the plot area and concentration points are not visible. Keep sliding ‘Jitter’, a random
displacement given to all points in the plot, to the right, until you can spot concentration points.
The results are shown below. But on this screen we changed ‘Colour’ to temperature. Besides
‘outlook’ and ‘play’, this allows you to see the ‘temperature’ corresponding to the
‘outlook’. It will affect your result because if you see ‘outlook’ = ‘sunny’ and ‘play’ = ‘no’ to
explain the result, you need to see the ‘temperature’ – if it is too hot, you do not want to play.
Change ‘Colour’ to ‘windy’, you can see that if it is windy, you do not want to play as well.
Selecting Instances
Sometimes it is helpful to select a subset of the data using visualization tool. A special
case is the ‘UserClassifier’, which lets you to build your own classifier by interactively
selecting instances. Below the Y – axis there is a drop-down list that allows you to choose a
selection method. A group of points on the graph can be selected in four ways [2]:
MRCET Page
2828
1. Select Instance. Click on an individual data point. It brings up a window listing
attributes of the point. If more than one point will appear at the same location, more than
one set of attributes will be shown.
2. Rectangle. You can create a rectangle by dragging it around the point.
MRCET Page
2929
3. Polygon. You can select several points by building a free-form polygon. Left-click on the
graph to add vertices to the polygon and right-click to complete it.
4. Polyline. To distinguish the points on one side from the once on another, you can build a
polyline. Left-click on the graph to add vertices to the polyline and right-click to finish.
MRCET Page
300
B.Explore WEKA Data Mining/Machine Learning Toolkit
B.(i) Downloading and/or installation of WEKA data mining toolkit.
Ans: Install Steps for WEKA a Data Mining Tool
1. Download the software as your requirements from the below given link.
http://www.cs.waikato.ac.nz/ml/weka/downloading.html
2. The Java is mandatory for installation of WEKA so if you have already Java on your
machine then download only WEKA else download the software with JVM.
3. Then open the file location and double click on the file
4. Click Next
MRCET Page
3131
5. Click I Agree.
MRCET Page
3232
6. As your requirement do the necessary changes of settings and click Next. Full and
Associate files are the recommended settings.
7. Change to your desire installation location.
MRCET Page
3333
8. If you want a shortcut then check the box and click Install.
9. The Installation will start wait for a while it will finish within a minute.
MRCET Page
3434
10. After complete installation click on Next.
11. Hurray !!!!!!! That’s all click on the Finish and take a shovel and start Mining. Best of
Luck.
MRCET Page
3535
This is the GUI you get when started. You have 4 options Explorer, Experimenter,
KnowledgeFlow and Simple CLI.
B.(ii)Understand the features of WEKA tool kit such as Explorer, Knowledge flow interface,
Experimenter, command-line interface.
Ans: WEKA
Weka is created by researchers at the university WIKATO in New Zealand. University of

Waikato, Hamilton, New Zealand Alex Seewald (original Command-line primer) David Scuse
(original Experimenter tutorial)
• It is java based application.

• It is collection often source, Machine Learning Algorithm.
• The routines (functions) are implemented as classes and logically arranged in packages.
• It comes with an extensive GUI Interface.
• Weka routines can be used standalone via the command line interface.
The Graphical User Interface;-
The Weka GUI Chooser (class weka.gui.GUIChooser) provides a starting point for
launching Weka’s main GUI applications and supporting tools. If one prefers a MDI (“multiple
document interface”) appearance, then this is provided by an alternative launcher called “Main”
MRCET Page
3636
(class weka.gui.Main). The GUI Chooser consists of four buttons—one for each of the four major
Weka applications—and four menus.
The buttons can be used to start the following applications:
• Explorer An environment for exploring data with WEKA (the rest of this Documentation
deals with this application in more detail).
• Experimenter An environment for performing experiments and conducting statistical tests
between learning schemes.
• Knowledge Flow This environment supports essentially the same functions as the Explorer but
with a drag-and-drop interface. One advantage is that it supports incremental learning.
• SimpleCLI Provides a simple command-line interface that allows direct execution of WEKA
commands for operating systems that do not provide their own command line interface.
MRCET Page
3737
1. Explorer
The Graphical user interface
1.1 Section Tabs
At the very top of the window, just below the title bar, is a row of tabs. When the Explorer
is first started only the first tab is active; the others are grayed out. This is because it is
necessary to open (and potentially pre-process) a data set before starting to explore the data.
The tabs are as follows:
1. Preprocess. Choose and modify the data being acted on.

2. Classify. Train & test learning schemes that classify or perform regression
3. Cluster. Learn clusters for the data.
4. Associate. Learn association rules for the data.
5. Select attributes. Select the most relevant attributes in the data.
6. Visualize. View an interactive 2D plot of the data.
Once the tabs are active, clicking on them flicks between different screens, on which the
respective actions can be performed. The bottom area of the window (including the status box, the
log button, and the Weka bird) stays visible regardless of which section you are in. The Explorer
can be easily extended with custom tabs. The Wiki article “Adding tabs in the Explorer”
explains this in detail.
2.Weka Experimenter:-
The Weka Experiment Environment enables the user to create, run, modify, and analyze
experiments in a more convenient manner than is possible when processing the schemes
individually. For example, the user can create an experiment that runs several schemes against a
series of datasets and then analyze the results to determine if one of the schemes is (statistically)
better than the other schemes.
MRCET Page
3838
The Experiment Environment can be run from the command line using the Simple CLI. For
example, the following commands could be typed into the CLI to run the OneR scheme on the Iris
dataset using a basic train and test process. (Note that the commands would be typed on one line
into the CLI.) While commands can be typed directly into the CLI, this technique is not
particularly convenient and the experiments are not easy to modify. The Experimenter comes in
two flavors’, either with a simple interface that provides most of the functionality one needs for
experiments, or with an interface with full access to the Experimenter’s capabilities. You can
choose between those two with the Experiment Configuration Mode radio buttons:
• Simple
• Advanced
Both setups allow you to setup standard experiments, that are run locally on a single machine,
or remote experiments, which are distributed between several hosts. The distribution of
experiments cuts down the time the experiments will take until completion, but on the other hand
the setup takes more time. The next section covers the standard experiments (both, simple and
advanced), followed by the remote experiments and finally the analyzing of the results.
MRCET Page
3939
3. Knowledge Flow
Introduction
The Knowledge Flow provides an alternative to the Explorer as a graphical front end to
WEKA’s core algorithms.
The Knowledge Flow presents a data-flow inspired interface to WEKA. The user can select
WEKA components from a palette, place them on a layout canvas and connect them together in
order to form a knowledge flow for processing and analyzing data. At present, all of WEKA’s
classifiers, filters, clusterers, associators, loaders and savers are available in the Knowledge
Flow along with some extra tools.
The Knowledge Flow can handle data either incrementally or in batches (the Explorer
handles batch data only). Of course learning from data incrementally requires a classifier that can
MRCET Page
4040
be updated on an instance by instance basis. Currently in WEKA there are ten classifiers that can
handle data incrementally.
The Knowledge Flow offers the following features:
• Intuitive data flow style layout.

• Process data in batches or incrementally.
• Process multiple batches or streams in parallel (each separate flow executes in its own
thread) .
• Process multiple streams sequentially via a user-specified order of execution.
• Chain filters together.
• View models produced by classifiers for each fold in a cross validation.
• Visualize performance of incremental classifiers during processing (scrolling plots of
classification accuracy, RMS error, predictions etc.).
• Plugin “perspectives” that add major new functionality (e.g. 3D data visualization, time
series forecasting environment etc.).
4.Simple CLI
The Simple CLI provides full access to all Weka classes, i.e., classifiers, filters, clusterers,
etc., but without the hassle of the CLASSPATH (it facilitates the one, with which Weka was
started). It offers a simple Weka shell with separated command line and output.
MRCET Page
4141
Commands
The following commands are available in the Simple CLI:
• Java <classname> [<args>]
Invokes a java class with the given arguments (if any).
• Break
Stops the current thread, e.g., a running classifier, in a friendly manner kill stops the current
thread in an unfriendly fashion.
• Cls
Clears the output area
• Capabilities <classname> [<args>]
Lists the capabilities of the specified class, e.g., for a classifier with its.
• option:
Capabilities weka.classifiers.meta.Bagging -W weka.classifiers.trees.Id3
• exit
Exits the Simple CLI
• help [<command>]
Provides an overview of the available commands if without a command name as argument,

otherwise more help on the specified command
MRCET Page
4242
Invocation
In order to invoke a Weka class, one has only to prefix the class with ”java”. This
command tells the Simple CLI to load a class and execute it with any given parameters. E.g., the
J48 classifier can be invoked on the iris dataset with the following command:
java weka.classifiers.trees.J48 -t c:/temp/iris.arff
This results in the following output:
Command redirection
Starting with this version of Weka one can perform a basic

redirection: java weka.classifiers.trees.J48 -t test.arff > j48.txt
Note: the > must be preceded and followed by a space, otherwise it is not recognized as redirection,
but part of another parameter.
Command completion
Commands starting with java support completion for classnames and filenames via Tab
(Alt+BackSpace deletes parts of the command again). In case that there are several matches, Weka
lists all possible matches.
• Package Name Completion java weka.cl<Tab>
Results in the following output of possible matches of
package names: Possible matches:
weka.classifiers
weka.clusterers
• Classname completion
MRCET Page
4343
java weka.classifiers.meta.A<Tab> lists the following classes
Possible matches: weka.classifiers.meta.AdaBoostM1

weka.classifiers.meta.AdditiveRegression
weka.classifiers.meta.AttributeSelectedClassifier
• Filename Completion
In order for Weka to determine whether a the string under the cursor is a classname or a
filename, filenames need to be absolute (Unix/Linx: /some/path/file;Windows: C:\Some\Path\file)
or relative and starting with a dot (Unix/Linux:./some/other/path/file; Windows:
.\Some\Other\Path\file).
B.(iii)Navigate the options available in the WEKA(ex.select attributes panel,preprocess

panel,classify panel,cluster panel,associate panel and visualize)
Ans: Steps for identify options in WEKA
1. Open WEKA Tool.

2. Click on WEKA Explorer.
3. Click on Preprocessing tab button.
4. Click on open file button.
5. Choose WEKA folder in C drive.
6. Select and Click on data option button.
7. Choose iris data set and open file.
8. All tabs available in WEKA home page.
MRCET Page
4444
MRCET Page 45
B. (iv) Study the ARFF file format
Ans: ARFF File Format
An ARFF (= Attribute-Relation File Format) file is an ASCII text file that describes a list of
instances sharing a set of attributes.
ARFF files are not the only format one can load, but all files that can be converted with
Weka’s “core converters”. The following formats are currently supported:
• ARFF (+ compressed)
• C4.5
• CSV
• libsvm
• binary serialized instances
• XRFF (+ compressed)
Overview
ARFF files have two distinct sections. The first section is the Header information, which is
followed the Data information. The Header of the ARFF file contains the name of the relation, a
list of the attributes (the columns in the data), and their types.
An example header on the standard IRIS dataset looks like this:
1. Title: Iris Plants Database
2. Sources:
(a) Creator: R.A. Fisher

(b) Donor: Michael Marshall (MARSHALL%[email protected])
(c) Date: July, 1988
MRCET Page 46
@RELATION iris
@ATTRIBUTE sepal length NUMERIC
@ATTRIBUTE sepal width NUMERIC
@ATTRIBUTE petal length NUMERIC
@ATTRIBUTE petal width NUMERIC
@ATTRIBUTE class {Iris-setosa, Iris-versicolor, Iris-irginica} The Data of the ARFF file looks
like the following:
@DATA
5.1,3.5,1.4,0.2,Iris-setosa
4.9,3.0,1.4,0.2,Iris-setosa
4.7,3.2,1.3,0.2,Iris-setosa
4.6,3.1,1.5,0.2,Iris-setosa
5.0,3.6,1.4,0.2,Iris-setosa
5.4,3.9,1.7,0.4,Iris-setosa
4.6,3.4,1.4,0.3,Iris-setosa
5.0,3.4,1.5,0.2,Iris-setosa
4.4,2.9,1.4,0.2,Iris-setosa
4.9,3.1,1.5,0.1,Iris-setosa
Lines that begin with a % are comments.

The @RELATION, @ATTRIBUTE and @DATA declarations are case insensitive.
The ARFF Header Section
The ARFF Header section of the file contains the relation declaration and at•
tribute declarations.
The @relation Declaration
The relation name is defined as the first line in the ARFF file. The format is: @relation
<relation-name>
where <relation-name> is a string. The string must be quoted if the name includes spaces.
MRCET Page 47
The @attribute Declarations
Attribute declarations take the form of an ordered sequence of @attribute statements. Each
attribute in the data set has its own @attribute statement which uniquely defines the name
of that attribute and it’s data type. The order the attributes are declared indicates the
column position in the data section of the file. For example, if an attribute is the third one
declared then Weka expects that all that attributes values will be found in the third comma
delimited column.
The format for the @attribute statement is:
@attribute <attribute-name> <datatype>
where the <attribute-name> must start with an alphabetic character. If spaces are to be
included in the name then the entire name must be quoted.
The <datatype> can be any of the four types supported by Weka:
• numeric
• integer is treated as numeric
• real is treated as numeric
• <nominal-specification>
• string
• date [<date-format>]
• relational for multi-instance data (for future use)
where <nominal-specification> and <date-format> are defined below. The keywords numeric,
real, integer, string and date are case insensitive.
Numeric attributes
Numeric attributes can be real or integer numbers.
MRCET Page 48
Nominal attributes
Nominal values are defined by providing an <nominal-specification> listing the possible

values: <nominal-name1>, <nominal-name2>, <nominal-name3>,
For example, the class value of the Iris dataset can be defined as follows: @ATTRIBUTE
class {Iris-setosa,Iris-versicolor,Iris-virginica} Values that contain spaces must be quoted.
String attributes
String attributes allow us to create attributes containing arbitrary textual values. This is very
useful in text-mining applications, as we can create datasets with string attributes, then
write Weka Filters to manipulate strings (like String- ToWordVectorFilter). String
attributes are declared as follows:
@ATTRIBUTE LCC string
Date attributes
Date attribute declarations take the form: @attribute <name> date [<date-format>] where
<name> is the name for the attribute and <date-format> is an optional string specifying how
date values should be parsed and printed (this is the same format used by
SimpleDateFormat). The default format string accepts the ISO-8601 combined date and
time format: yyyy-MM-dd’T’HH:mm:ss. Dates must be specified in the data section as the
corresponding string representations of the date/time (see example below).
Relational attributes
Relational attribute declarations take the form: @attribute <name> relational

<further attribute definitions> @end <name>
For the multi-instance dataset MUSK1 the definition would look like this (”...” denotes an
omission):
@attribute molecule_name {MUSK-jf78,...,NON-MUSK-199} @attribute bag relational
@attribute f1 numeric
...
@attribute f166 numeric @end bag
@attribute class {0,1}
MRCET Page 49
The ARFF Data Section
The ARFF Data section of the file contains the data declaration line and the actual instance
lines.
The @data Declaration
The @data declaration is a single line denoting the start of the data segment in the file. The
format is:
@data
The instance data
Each instance is represented on a single line, with carriage returns denoting the end of the
instance. A percent sign (%) introduces a comment, which continues to the end of the line.
Attribute values for each instance are delimited by commas. They must appear in the order
that they were declared in the header section (i.e. the data corresponding to the nth
@attribute declaration is always the nth field of the attribute).
Missing values are represented by a single question mark, as in:
@data 4.4,?,1.5,?,Iris-setosa
Values of string and nominal attributes are case sensitive, and any that contain space or the
comment-delimiter character % must be quoted. (The code suggests that double-quotes are
acceptable and that a backslash will escape individual characters.)
MRCET Page
5050
An example follows:
Data Warehousing @relation
and Mining LabLCCvsLCSH @attribute LCC string @attribu
Department of CSEte LCSH
string
@data
MRCET Page
5151
AG5, ’Encyclopedias and dictionaries.;Twentieth

century.’ AS262, ’Science -- Soviet Union -- History.’
AE5, ’Encyclopedias and dictionaries.’
AS281, ’Astronomy, Assyro-Babylonian.;Moon -- Phases.’
AS281, ’Astronomy, Assyro-Babylonian.;Moon -- Tables.’
Dates must be specified in the data section using the string representation specified in the
attribute declaration.
For example:
@RELATION Timestamps
@ATTRIBUTE timestamp DATE "yyyy-MM-dd HH:mm:ss" @DATA
"2001-04-03 12:12:12"
"2001-05-03 12:59:55"
Relational data must be enclosed within double quotes ”. For example an instance of the
MUSK1 dataset (”...” denotes an omission):
MUSK-188,"42,...,30",1
B.(v) Explore the available data sets in WEKA.
Ans: Steps for identifying data sets in WEKA
1. Open WEKA Tool.

MRCET Page
5252
Sample Weka Data Sets

Below are some sample WEKA data sets, in arff format.
• contact-lens.arff
• cpu.arff
• cpu.with-vendor.arff
• diabetes.arff
• glass.arff
• ionospehre.arff
• iris.arff
• labor.arff
• ReutersCorn-train.arff
MRCET Page
5353
• ReutersCorn-test.arff
• ReutersGrain-train.arff
• ReutersGrain-test.arff
• segment-challenge.arff
• segment-test.arff
• soybean.arff
• supermarket.arff
• vote.arff
• weather.arff
• weather.nominal.arff
B. (vi) Load a data set (ex.Weather dataset,Iris dataset,etc.)
Ans: Steps for load the Weather data set.
1. Open WEKA Tool.

6. Choose Weather.arff file and Open the file.
Steps for load the Iris data set.
1. Open WEKA Tool.

6. Choose Iris.arff file and Open the file.
MRCET Page
5454
MRCET Page 54
B. (vii) Load each dataset and observe the following:
B. (vii.i) List attribute names and they types
Ans: Example dataset-Weather.arff
List out the attribute names:
1. outlook
2. temperature
3. humidity
4. windy
5. play
MRCET Page 55
B. (vii.ii) Number of records in each dataset.
Ans: @relation weather.symbolic
@attribute outlook {sunny, overcast, rainy}

@attribute temperature {hot, mild, cool}
@attribute humidity {high, normal}
@attribute windy {TRUE, FALSE}
@attribute play {yes, no}
@data
sunny,hot,high,FALSE,no
sunny,hot,high,TRUE,no
overcast,hot,high,FALSE,yes
rainy,mild,high,FALSE,yes
rainy,cool,normal,FALSE,yes
rainy,cool,normal,TRUE,no
overcast,cool,normal,TRUE,yes
sunny,mild,high,FALSE,no
sunny,cool,normal,FALSE,yes
rainy,mild,normal,FALSE,yes
sunny,mild,normal,TRUE,yes
overcast,mild,high,TRUE,yes
overcast,hot,normal,FALSE,yes
rainy,mild,high,TRUE,no
B. (vii.iii) Identify the class attribute (if any)
Ans: class attributes
1. sunny
2. overcast
3. rainy
MRCET page
5656
B. (vii.iv) Plot Histogram
Ans: Steps for identify the plot histogram
1. Open WEKA Tool.

3. Click on Visualize button.
4. Click on right click button.
5. Select and Click on polyline option button.
MRCET Page
5757
B. (vii.v) Determine the number of records for each class
Ans: @relation weather.symbolic

@data
sunny,hot,high,FALSE,no
sunny,hot,high,TRUE,no
overcast,hot,high,FALSE,yes
rainy,mild,high,FALSE,yes
rainy,cool,normal,FALSE,yes
rainy,cool,normal,TRUE,no
overcast,cool,normal,TRUE,yes
sunny,mild,high,FALSE,no
sunny,cool,normal,FALSE,yes
rainy,mild,normal,FALSE,yes
sunny,mild,normal,TRUE,yes
overcast,mild,high,TRUE,yes
overcast,hot,normal,FALSE,yes
rainy,mild,high,TRUE,no
B. (vii.vi) Visualize the data in various dimensions
Click on Visualize All button in WEKA Explorer.
MRCET Page
5858
Unit-II Perform data preprocessing tasks and Demonstrate performing

association rule mining on data sets
A. Explore various options in Weka for Preprocessing data and apply (like Discretization
Filters, Resample filter, etc.) n each dataset.
MRCET Page
5959
Ans:
Preprocess Tab
1. Loading Data
The first four buttons at the top of the preprocess section enable you to load data into
WEKA:
1. Open file.... Brings up a dialog box allowing you to browse for the data file on the local file
system.
2. Open URL.... Asks for a Uniform Resource Locator address for where the data is stored.
3. Open DB.... Reads data from a database. (Note that to make this work you might have to edit the
file in weka/experiment/DatabaseUtils.props.)
4. Generate.... Enables you to generate artificial data from a variety of Data Generators. Using the
Open file... button you can read files in a variety of formats: WEKA’s ARFF format, CSV
format, C4.5 format, or serialized Instances format. ARFF files typically have a .arff extension,
CSV files a .csv extension, C4.5 files a .data and .names extension, and serialized Instances objects
a .bsi extension.
MRCET Page
6060
Current Relation: Once some data has been loaded, the Preprocess panel shows a variety of
information. The Current relation box (the “current relation” is the currently loaded data,
which can be interpreted as a single relational table in database terminology) has three entries:
1. Relation. The name of the relation, as given in the file it was loaded from. Filters (described
below) modify the name of a relation.
2. Instances. The number of instances (data points/records) in the data.
3. Attributes. The number of attributes (features) in the data.
Working With Attributes
Below the Current relation box is a box titled Attributes. There are four buttons, and
beneath them is a list of the attributes in the current relation.
MRCET Page
6060
The list has three columns:
1. No.. A number that identifies the attribute in the order they are specified in the data file.
2. Selection tick boxes. These allow you select which attributes are present in the relation.
3. Name. The name of the attribute, as it was declared in the data file. When you click on different
rows in the list of attributes, the fields change in the box to the right titled Selected attribute.
This box displays the characteristics of the currently highlighted attribute in the list:
1. Name. The name of the attribute, the same as that given in the attribute list.
2. Type. The type of attribute, most commonly Nominal or Numeric.
3. Missing. The number (and percentage) of instances in the data for which this attribute is missing
(unspecified).
4. Distinct. The number of different values that the data contains for this attribute.
5. Unique. The number (and percentage) of instances in the data having a value for this attribute
that no other instances have.
Below these statistics is a list showing more information about the values stored in this
attribute, which differ depending on its type. If the attribute is nominal, the list consists of each
possible value for the attribute along with the number of instances that have that value. If the
attribute is numeric, the list gives four statistics describing the distribution of values in the data—
the minimum, maximum, mean and standard deviation. And below these statistics there is a
coloured histogram, colour-coded according to the attribute chosen as the Class using the box
above the histogram. (This box will bring up a drop-down list of available selections when
clicked.) Note that only nominal Class attributes will result in a colour-coding. Finally, after
pressing the Visualize All button, histograms for all the attributes in the data are shown in a
separate window.
Returning to the attribute list, to begin with all the tick boxes are unticked.
MRCET Page
6161
They can be toggled on/off by clicking on them individually. The four buttons above can
also be used to change the selection:
PREPROCESSING
1. All. All boxes are ticked.

2. None. All boxes are cleared (unticked).
3. Invert. Boxes that are ticked become unticked and vice versa.
4. Pattern. Enables the user to select attributes based on a Perl 5 Regular Expression. E.g., .* id
selects all attributes which name ends with id.
Once the desired attributes have been selected, they can be removed by clicking the Remove
button below the list of attributes. Note that this can be undone by clicking the Undo button, which
is located next to the Edit button in the top-right corner of the Preprocess panel.
Working with Filters:-
The preprocess section allows filters to be defined that transform the data in various
ways. The Filter box is used to set up the filters that are required. At the left of the Filter
box is a Choose button. By clicking this button it is possible to select one of the filters in
WEKA. Once a filter has been selected, its name and options are shown in the field next to
the Choose button. Clicking on this box with the left mouse button brings up a
GenericObjectEditor dialog box. A click with the right mouse button (or Alt+Shift+left
click) brings up a menu where you can choose, either to display the properties in a
GenericObjectEditor dialog box, or to copy the current setup string to the clipboard.
MRCET Page
6262
The GenericObjectEditor Dialog Box
The GenericObjectEditor dialog box lets you configure a filter. The same kind
of dialog box is used to configure other objects, such as classifiers and clusterers
(see below). The fields in the window reflect the available options.
Right-clicking (or Alt+Shift+Left-Click) on such a field will bring up a popup menu, listing the
following options:
1. Show properties... has the same effect as left-clicking on the field, i.e., a dialog appears
allowing you to alter the settings.
2. Copy configuration to clipboard copies the currently displayed configuration string to the
system’s clipboard and therefore can be used anywhere else in WEKA or in the console. This is
rather handy if you have to setup complicated, nested schemes.
3. Enter configuration... is the “receiving” end for configurations that got copied to the
clipboard earlier on. In this dialog you can enter a class name followed by options (if the class
supports these). This also allows you to transfer a filter setting from the Preprocess panel to a
Filtered Classifier used in the Classify panel.
MRCET Page
6363
Left-Clicking on any of these gives an opportunity to alter the filters settings. For example,
the setting may take a text string, in which case you type the string into the text field provided. Or
it may give a drop-down box listing several states to choose from. Or it may do something else,
depending on the information required. Information on the options is provided in a tool tip if you
let the mouse pointer hover of the corresponding field. More information on the filter and its
options can be obtained by clicking on the More button in the About panel at the top of the
GenericObjectEditor window.
Applying Filters
Once you have selected and configured a filter, you can apply it to the data by pressing the
Apply button at the right end of the Filter panel in the Preprocess panel. The Preprocess panel will
then show the transformed data. The change can be undone by pressing the Undo button. You can
also use the Edit...button to modify your data manually in a dataset editor. Finally, the Save...
button at the top right of the Preprocess panel saves the current version of the relation in file
formats that can represent the relation, allowing it to be kept for future use.
‹ Steps for run preprocessing tab in WEKA
1. Open WEKA Tool.

7. Choose labor data set and open file.
8. Choose filter button and select the Unsupervised-Discritize option and apply
Dataset labor.arff
MRCET Page
6464
The following screenshot shows the effect of discretization
MRCET Page
6565
B.Load each dataset into Weka and run Aprior algorithm with different support and
confidence values. Study the rules generated.
Ans:
Steps for run Aprior algorithm in WEKA
1. Open WEKA Tool.

7. Choose Weather data set and open file.
8. Click on Associate tab and Choose Aprior algorithm
9. Click on start button.
Output : === Run information ===
Scheme: weka.associations.Apriori -N 10 -T 0 -C 0.9 -D 0.05 -U 1.0 -M 0.1 -S -1.0 -c •

1
Relation: weather.symbolic
Instances: 14
Attributes: 5
outlook
temperature
humidity
windy
play
=== Associator model (full training set) ===
Apriori
=======
Minimum support: 0.15 (2 instances)

Minimum metric <confidence>: 0.9
Number of cycles performed: 17
MRCET Page
6666
Generated sets of large itemsets:
Size of set of large itemsets L(1): 12

Best rules found:
1. outlook=overcast 4 ==> play=yes 4 conf:(1)

2. temperature=cool 4 ==> humidity=normal 4 conf:(1)
3. humidity=normal windy=FALSE 4 ==> play=yes 4 conf:(1)
4. outlook=sunny play=no 3 ==> humidity=high 3 conf:(1)
5. outlook=sunny humidity=high 3 ==> play=no 3 conf:(1)
6. outlook=rainy play=yes 3 ==> windy=FALSE 3 conf:(1)
7. outlook=rainy windy=FALSE 3 ==> play=yes 3 conf:(1)
8. temperature=cool play=yes 3 ==> humidity=normal 3 conf:(1)
9. outlook=sunny temperature=hot 2 ==> humidity=high 2 conf:(1)
10. temperature=hot play=no 2 ==> outlook=sunny 2 conf:(1)
MRCET Page
6767
Association Rule:
An association rule has two parts, an antecedent (if) and a consequent (then). An antecedent is an
item found in the data. A consequent is an item that is found in combination with the antecedent.
Association rules are created by analyzing data for frequent if/then patterns and using the
criteriasupport and confidence to identify the most important relationships. Support is an indication
of how frequently the items appear in the database. Confidence indicates the number of times the
if/then statements have been found to be true.
In data mining, association rules are useful for analyzing and predicting customer behavior. They
play an important part in shopping basket data analysis, product clustering, catalog design and store
layout.
Support and Confidence values:
• Support count: The support count of an itemset X, denoted by X.count, in a data set T is the
number of transactions in T that contain X. Assume T has n transactions.
• Then,
MRCET Page
6868
(X ∪Y
support =
).count
n
(X ∪Y
confidence =
).count
X .count
support = support({A U C})
confidence = support({A U C})/support({A})
MRCET Page
6969
C.Apply different discretization filters on numerical attributes and run the Aprior
association rule algorithm. Study the rules generated. Derive interesting insights and observe
the effect of discretization in the rule generation process.
Ans: Steps for run Aprior algorithm in WEKA
1. Open WEKA Tool.

7. Choose Weather data set and open file.
8. Choose filter button and select the Unsupervised-Discritize option and apply
9. Click on Associate tab and Choose Aprior algorithm
MRCT Page
69
Output : === Run information ===
Scheme: weka.associations.Apriori -N 10 -T 0 -C 0.9 -D 0.05 -U 1.0 -M 0.1 -S -1.0 -c •

1
Relation: weather.symbolic
Instances: 14
Attributes: 5
outlook
temperature
humidity
windy
play
=== Associator model (full training set) ===
Apriori
=======
Minimum support: 0.15 (2 instances)
Minimum metric <confidence>: 0.9
Number of cycles performed: 17
Generated sets of large itemsets:

Best rules found:
1. outlook=overcast 4 ==> play=yes 4 conf:(1)

2. temperature=cool 4 ==> humidity=normal 4 conf:(1)
3. humidity=normal windy=FALSE 4 ==> play=yes 4 conf:(1)
4. outlook=sunny play=no 3 ==> humidity=high 3 conf:(1)
5. outlook=sunny humidity=high 3 ==> play=no 3 conf:(1)
6. outlook=rainy play=yes 3 ==> windy=FALSE 3 conf:(1)
7. outlook=rainy windy=FALSE 3 ==> play=yes 3 conf:(1)
MRCET Page
7070
Unit – III Demonstrate performing classification on data sets.
Classification Tab
Selecting a Classifier
At the top of the classify section is the Classifier box. This box has a text fieldthat gives the
name of the currently selected classifier, and its options. Clicking on the text box with the left
mouse button brings up a GenericObjectEditor dialog box, just the same as for filters, that you can
use to configure the options of the current classifier. With a right click (or Alt+Shift+left click) you
can once again copy the setup string to the clipboard or display the properties in a
GenericObjectEditor dialog box. The Choose button allows you to choose one of the classifiers that
are available in WEKA.
Test Options
The result of applying the chosen classifier will be tested according to the options that are
set by clicking in the Test options box. There are four test modes:
1. Use training set. The classifier is evaluated on how well it predicts the class of the instances it
was trained on.
2. Supplied test set. The classifier is evaluated on how well it predicts the class of a set of
instances loaded from a file. Clicking the Set... button brings up a dialog allowing you to choose
the file to test on.
3. Cross-validation. The classifier is evaluated by cross-validation, using the number of folds that
are entered in the Folds text field.
4. Percentage split. The classifier is evaluated on how well it predicts a certain percentage of the
data which is held out for testing. The amount of data held out depends on the value entered in the
% field.
Classifier Evaluation Options:
1. Output model. The classification model on the full training set is output so that it can be
viewed, visualized, etc. This option is selected by default.
MRCET Page
7171
2. Output per-class stats. The precision/recall and true/false statistics for each class are output.
This option is also selected by default.
3. Output entropy evaluation measures. Entropy evaluation measures are included in the output.
This option is not selected by default.
4. Output confusion matrix. The confusion matrix of the classifier’s predictions is included in
the output. This option is selected by default.
5. Store predictions for visualization. The classifier’s predictions are remembered so that they
can be visualized. This option is selected by default.
6. Output predictions. The predictions on the evaluation data are output.
Note that in the case of a cross-validation the instance numbers do not correspond to the location in
the data!
7. Output additional attributes. If additional attributes need to be output alongside the
predictions, e.g., an ID attribute for tracking misclassifications, then the index of this attribute can
be specified here. The usual Weka ranges are supported,“first” and “last” are therefore valid
indices as well (example: “first-3,6,8,12-last”).
8. Cost-sensitive evaluation. The errors is evaluated with respect to a cost matrix. The Set...
button allows you to specify the cost matrix used.
9. Random seed for xval / % Split. This specifies the random seed used when randomizing the
data before it is divided up for evaluation purposes.
10. Preserve order for % Split. This suppresses the randomization of the data before splitting into
train and test set.
11. Output source code. If the classifier can output the built model as Java source code, you can
specify the class name here. The code will be printed in the “Classifier output” area.
The Class Attribute

The classifiers in WEKA are designed to be trained to predict a single ‘class’
MRCET Page
7272
attribute, which is the target for prediction. Some classifiers can only learn nominal classes; others
can only learn numeric classes (regression problems) still others can learn both.
By default, the class is taken to be the last attribute in the data. If you want
to train a classifier to predict a different attribute, click on the box below the Test options box to
bring up a drop-down list of attributes to choose from.
Training a Classifier
Once the classifier, test options and class have all been set, the learning process is started by
clicking on the Start button. While the classifier is busy being trained, the little bird moves around.
You can stop the training process at any time by clicking on the Stop button. When training is
complete, several things happen. The Classifier output area to the right of the display is filled with
text describing the results of training and testing. A new entry appears in the Result list box. We
look at the result list below; but first we investigate the text that has been output.
A. Load each dataset into Weka and run id3, j48 classification algorithm, study the classifier
output. Compute entropy values, Kappa ststistic.
Ans:
‹ Steps for run ID3 and J48 Classification algorithms in WEKA
1. Open WEKA Tool.

8. Click on classify tab and Choose J48 algorithm and select use training set test option.
10. Click on classify tab and Choose ID3 algorithm and select use training set test option.
MRCET Page
7373
Output:
=== Run information ===
Scheme:weka.classifiers.trees.J48 -C 0.25 -M 2
Relation: iris
Instances: 150
Attributes: 5
sepallength
sepalwidth
petallength
petalwidth
class
Test mode:evaluate on training data
=== Classifier model (full training set) ===
J48 pruned tree

------------------
petalwidth <= 0.6: Iris-setosa (50.0)

petalwidth > 0.6
| petalwidth <= 1.7
| | petallength <= 4.9: Iris-versicolor (48.0/1.0)
| | petallength > 4.9
| | | petalwidth <= 1.5: Iris-virginica (3.0)
| | | petalwidth > 1.5: Iris-versicolor (3.0/1.0)
| petalwidth > 1.7: Iris-virginica (46.0/1.0)
Number of Leaves : 5
Size of the tree : 9
Time taken to build model: 0 seconds
=== Evaluation on training set ===

=== Summary ===
MRCET Page
7474
Correctly Classified Instances 147 98 %
Incorrectly Classified Instances 3 2 %
Kappa statistic 0.97
K&B Relative Info Score 14376.1925 %
K&B Information Score 227.8573 bits 1.519 bits/instance
Class complexity | order 0 237.7444 bits 1.585 bits/instance
Class complexity | scheme 16.7179 bits 0.1115 bits/instance
Complexity improvement (Sf) 221.0265 bits 1.4735 bits/instance
Mean absolute error 0.0233
Root mean squared error 0.108
Relative absolute error 5.2482 %
Root relative squared error 22.9089 %
Total Number of Instances 150
=== Detailed Accuracy By Class ===
TP Rate FP Rate Precision Recall F-Measure ROC Area Class

1 0 1 1 1 1 Iris-setosa
0.98 0.02 0.961 0.98 0.97 0.99 Iris-versicolor
0.96 0.01 0.98 0.96 0.97 0.99 Iris-virginica
Weighted Avg. 0.98 0.01 0.98 0.98 0.98 0.993
=== Confusion Matrix ===
a b c <-- classified as
50 0 0 | a = Iris-setosa
0 49 1 | b = Iris-versicolor
0 2 48 | c = Iris-virginica
MRCET Page
7575
The Classifier Output Text
The text in the Classifier output area has scroll bars allowing you to browse
the results. Clicking with the left mouse button into the text area, while holding Alt
and Shift, brings up a dialog that enables you to save the displayed output
in a variety of formats (currently, BMP, EPS, JPEG and PNG). Of course, you
can also resize the Explorer window to get a larger display area.
The output is
Split into several sections:
1. Run information. A list of information giving the learning scheme options, relation name,
instances, attributes and test mode that were involved in the process.
MRCET Page
7676
2. Classifier model (full training set). A textual representation of the classification model that was
produced on the full training data.
3. The results of the chosen test mode are broken down thus.
4. Summary. A list of statistics summarizing how accurately the classifier was able to predict the
true class of the instances under the chosen test mode.
5. Detailed Accuracy By Class. A more detailed per-class break down of the classifier’s
prediction accuracy.
6. Confusion Matrix. Shows how many instances have been assigned to each class. Elements show
the number of test examples whose actual class is the row and whose predicted class is the column.
7. Source code (optional). This section lists the Java source code if one
chose “Output source code” in the “More options” dialog.
B.Extract if-then rues from decision tree gentrated by classifier, Observe the confusion
matrix and derive Accuracy, F- measure, TPrate, FPrate , Precision and recall values. Apply
cross-validation strategy with various fold levels and compare the accuracy results.
Ans:
A decision tree is a structure that includes a root node, branches, and leaf nodes. Each internal
node denotes a test on an attribute, each branch denotes the outcome of a test, and each leaf node
holds a class label. The topmost node in the tree is the root node.
The following decision tree is for the concept buy_computer that indicates whether a customer at a
company is likely to buy a computer or not. Each internal node represents a test on an attribute.
Each leaf node represents a class.
MRCET Page
7777
The benefits of having a decision tree are as follows −
• It does not require any domain knowledge.

• It is easy to comprehend.
• The learning and classification steps of a decision tree are simple and fast.
IF-THEN Rules:
Rule-based classifier makes use of a set of IF-THEN rules for classification. We can express a
rule in the following from −
IF condition THEN conclusion

Let us consider a rule R1,
R1: IF age=youth AND student=yes

THEN buy_computer=yes
Points to remember −
• The IF part of the rule is called rule antecedent orprecondition.
• The THEN part of the rule is called rule consequent.
• The antecedent part the condition consist of one or more attribute tests and these tests are
logically ANDed.
• The consequent part consists of class prediction.
MRCET Page
7878
Note − We can also write rule R1 as follows:
R1: (age = youth) ^ (student = yes))(buys computer = yes)

If the condition holds true for a given tuple, then the antecedent is satisfied.
Rule
Extraction
Here we will learn how to build a rule-based classifier by extracting IF-THEN rules from a
decision tree.
Points to remember −
• One rule is created for each path from the root to the leaf node.
• To form a rule antecedent, each splitting criterion is logically ANDed.
• The leaf node holds the class prediction, forming the rule consequent.
Rule Induction Using Sequential Covering Algorithm

Sequential Covering Algorithm can be used to extract IF-THEN rules form the training data. We
do not require to generate a decision tree first. In this algorithm, each rule for a given class covers
many of the tuples of that class.
Some of the sequential Covering Algorithms are AQ, CN2, and RIPPER. As per the general
strategy the rules are learned one at a time. For each time rules are learned, a tuple covered by the
rule is removed and the process continues for the rest of the tuples. This is because the path to
each leaf in a decision tree corresponds to a rule.
Note − The Decision tree induction can be considered as learning a set of rules
simultaneously.
The Following is the sequential learning Algorithm where rules are learned for one class at a time.
When learning a rule from a class Ci, we want the rule to cover all the tuples from class C only
and no tuple form any other class.
Algorithm: Sequential Covering
Input:
D, a data set class-labeled tuples,
Att_vals, the set of all attributes and their possible values.
MRCET Page
7979
Output: A Set of IF-THEN rules.
Method:
Rule_set={ }; // initial set of rules learned is empty
for each class c do
repeat
Rule = Learn_One_Rule(D, Att_valls, c);
remove tuples covered by Rule form D;
until termination condition;
Rule_set=Rule_set+Rule; // add a new rule to rule-set

end for
return Rule_Set;
Rule Pruning
The rule is pruned is due to the following reason −
• The Assessment of quality is made on the original set of training data. The rule may
perform well on training data but less well on subsequent data. That's why the rule pruning
is required.
• The rule is pruned by removing conjunct. The rule R is pruned, if pruned version of R has
greater quality than what was assessed on an independent set of tuples.
FOIL is one of the simple and effective method for rule pruning. For a given rule R,
FOIL_Prune = pos - neg / pos + neg

where pos and neg is the number of positive tuples covered by R, respectively.
Note − This value will increase with the accuracy of R on the pruning set. Hence, if the
FOIL_Prune value is higher for the pruned version of R, then we prune R.
‹ Steps for run decision tree algorithms in WEKA
1. Open WEKA Tool.

MRCET Page
8080
8. Click on classify tab and Choose decision table algorithm and select cross-validation
folds value-10 test option.
Output:
Scheme:weka.classifiers.rules.DecisionTable -X 1 -S "weka.attributeSelection.BestFirst -D
1 -N 5"
Relation: iris
Instances: 150
Attributes: 5
sepallength
sepalwidth
petallength
petalwidth
class
Test mode:10-fold cross-validation
Decision Table:
Number of training instances: 150

Number of Rules : 3
Non matches covered by Majority class.
Best first.
Start set: no attributes
Search direction: forward
Stale search after 5 node expansions
Total number of subsets evaluated: 12
Merit of best subset found: 96
Evaluation (for feature selection): CV (leave one out)
Feature set: 4,5
MRCET Page
8181
Time taken to build model: 0.02 seconds
=== Stratified cross-validation ===

=== Summary ===
Correctly Classified Instances 139 92.6667 %

Incorrectly Classified Instances 11 7.3333 %

0.88 0.05 0.898 0.88 0.889 0.946 Iris-versicolor
0.9 0.06 0.882 0.9 0.891 0.947 Iris-virginica
Weighted Avg. 0.927 0.037 0.927 0.927 0.927 0.964
MRCET Page
8282
C.Load each dataset into Weka and perform Naïve-bayes classification and k-Nearest
Neighbor classification, Interpret the results obtained.
Ans:
‹ Steps for run Naïve-bayes and k-nearest neighbor Classification algorithms in WEKA
1. Open WEKA Tool.

8. Click on classify tab and Choose Naïve-bayes algorithm and select use training set test
option.
10. Click on classify tab and Choose k-nearest neighbor and select use training set test
option.
MRCET Page
8383
Output: Naïve Bayes
Scheme:weka.classifiers.bayes.NaiveBayes
Relation: iris
Instances: 150
Attributes: 5
sepallength
sepalwidth
petallength
petalwidth
class
Naive Bayes Classifier
Class
Attribute Iris-setosa Iris-versicolor Iris-virginica
(0.33) (0.33) (0.33)
===============================================================
sepallength
mean 4.9913 5.9379 6.5795
std. dev. 0.355 0.5042 0.6353
weight sum 50 50 50
precision 0.1059 0.1059 0.1059
sepalwidth
mean 3.4015 2.7687 2.9629
std. dev. 0.3925 0.3038 0.3088
weight sum 50 50 50
precision 0.1091 0.1091 0.1091
petallength
MRCET Page
8484
mean 1.4694 4.2452 5.5516
std. dev. 0.1782 0.4712 0.5529
weight sum 50 50 50
precision 0.1405 0.1405 0.1405
petalwidth
mean 0.2743 1.3097 2.0343
std. dev. 0.1096 0.1915 0.2646
weight sum 50 50 50
precision 0.1143 0.1143 0.1143
=== Summary ===


0.96 0.04 0.923 0.96 0.941 0.993 Iris-versicolor
0.92 0.02 0.958 0.92 0.939 0.993 Iris-virginica
Weighted Avg. 0.96 0.02 0.96 0.96 0.96 0.995
MRCET Page
8585
0 4 46 | c = Iris-virginica.
Output: KNN (IBK)
Scheme:weka.classifiers.lazy.IBk -K 1 -W 0 -A "weka.core.neighboursearch.LinearNNSearch -A
\"weka.core.EuclideanDistance -R first-last\""
Relation: iris
Instances: 150
Attributes: 5
sepallength
sepalwidth
petallength
MRCET Page
8686
petalwidth
class
IB1 instance-based classifier

using 1 nearest neighbour(s) for classification

=== Summary ===

Kappa statistic 1
MRCET Page
8787
1 0 1 1 1 1 Iris-versicolor
1 0 1 1 1 1 Iris-virginica
Weighted Avg. 1 0 1 1 1 1
MRCET Page
8888
D.Plot RoC Curves.
Ans: Steps for identify the plot RoC Curves.
1. Open WEKA Tool.

3. Click on Visualize button.
4. Click on right click button.
5. Select and Click on polyline option button.
E.Compare classification results of ID3,J48, Naïve-Bayes and k-NN classifiers for each
dataset , and reduce which classifier is performing best and poor for each dataset and justify.
Ans:
‹ Steps for run ID3 and J48 Classification algorithms in WEKA
1. Open WEKA Tool.

8. Click on classify tab and Choose J48 algorithm and select use training set test option.
MRCET Page 89
MRCET Page
9090
10. Click on classify tab and Choose ID3 algorithm and select use training set test option.
12. Click on classify tab and Choose Naïve-bayes algorithm and select use training set test
option.
14. Click on classify tab and Choose k-nearest neighbor and select use training set test
option.
J48:
Scheme:weka.classifiers.trees.J48 -C 0.25 -M 2
Relation: iris
Instances: 150
Attributes: 5
sepallength
sepalwidth
petallength
petalwidth
class

J48 pruned tree
------------------
petalwidth <= 0.6: Iris-setosa (50.0)
petalwidth > 0.6
| petalwidth <= 1.7
| | petallength <= 4.9: Iris-versicolor (48.0/1.0)
| | petallength > 4.9
| | | petalwidth <= 1.5: Iris-virginica (3.0)
| | | petalwidth > 1.5: Iris-versicolor (3.0/1.0)
| petalwidth > 1.7: Iris-virginica (46.0/1.0)
MRCET Page
9191

=== Summary ===


0.98 0.02 0.961 0.98 0.97 0.99 Iris-versicolor
0.96 0.01 0.98 0.96 0.97 0.99 Iris-virginica
Weighted Avg. 0.98 0.01 0.98 0.98 0.98 0.993
Naïve-bayes:
Scheme:weka.classifiers.bayes.NaiveBayes
Relation: iris
Instances: 150
Attributes: 5
sepallength
sepalwidth
petallength
petalwidth
class
Naive Bayes Classifier
Class
Attribute Iris-setosa Iris-versicolor Iris-virginica
(0.33) (0.33) (0.33)
===============================================================
sepallength
mean 4.9913 5.9379 6.5795
std. dev. 0.355 0.5042 0.6353
weight sum 50 50 50
precision 0.1059 0.1059 0.1059
sepalwidth
mean 3.4015 2.7687 2.9629
std. dev. 0.3925 0.3038 0.3088
weight sum 50 50 50
precision 0.1091 0.1091 0.1091
petallength
mean 1.4694 4.2452 5.5516
std. dev. 0.1782 0.4712 0.5529
weight sum 50 50 50
precision 0.1405 0.1405 0.1405
petalwidth
mean 0.2743 1.3097 2.0343
std. dev. 0.1096 0.1915 0.2646
weight sum 50 50 50
precision 0.1143 0.1143 0.1143

=== Summary ===

0.96 0.04 0.923 0.96 0.941 0.993 Iris-versicolor
0.92 0.02 0.958 0.92 0.939 0.993 Iris-virginica
Weighted Avg. 0.96 0.02 0.96 0.96 0.96 0.995

K-Nearest Neighbor (IBK):
Scheme:weka.classifiers.lazy.IBk -K 1 -W 0 -A "weka.core.neighboursearch.LinearNNSearch -A
\"weka.core.EuclideanDistance -R first-last\""
Relation: iris
Instances: 150
Attributes: 5
sepallength
sepalwidth
petallength
petalwidth
class

IB1 instance-based classifier
using 1 nearest neighbour(s) for classification

=== Summary ===

Kappa statistic 1

1 0 1 1 1 1 Iris-versicolor
1 0 1 1 1 1 Iris-virginica
Weighted Avg. 1 0 1 1 1 1
Unit – IV demonstrate performing clustering on data sets Clustering Tab
Selecting a Clusterer
By now you will be familiar with the process of selecting and configuring objects. Clicking
on the clustering scheme listed in the Clusterer box at the top of the
window brings up a GenericObjectEditor dialog with which to choose a new

clustering scheme.
Cluster Modes
The Cluster mode box is used to choose what to cluster and how to evaluate
the results. The first three options are the same as for classification: Use training set, Supplied test
set and Percentage split (Section 5.3.1)—except that now the data is assigned to clusters instead of
trying to predict a specific class. The fourth mode, Classes to clusters evaluation, compares how
well the chosen clusters match up with a pre-assigned class in the data. The drop-down box below
this option selects the class, just as in the Classify panel.
An additional option in the Cluster mode box, the Store clusters for visualization tick box,
determines whether or not it will be possible to visualize the clusters once training is complete.
When dealing with datasets that are so large that memory becomes a problem it may be helpful to
disable this option.
Ignoring Attributes
Often, some attributes in the data should be ignored when clustering. The Ignore attributes
button brings up a small window that allows you to select which attributes are ignored. Clicking on
an attribute in the window highlights it, holding down the SHIFT key selects a range
of consecutive attributes, and holding down CTRL toggles individual attributes on and off. To
cancel the selection, back out with the Cancel button. To activate it, click the Select button. The
next time clustering is invoked, the selected attributes are ignored.
Working with Filters

The Filtered Clusterer meta-clusterer offers the user the possibility to apply filters directly
before the clusterer is learned. This approach eliminates the manual application of a filter in the
Preprocess panel, since the data gets processed on the fly. Useful if one needs to try out different
filter setups.
Learning Clusters
The Cluster section, like the Classify section, has Start/Stop buttons, a result text area and a
result list. These all behave just like their classification counterparts. Right-clicking an entry in the
result list brings up a similar menu, except that it shows only two visualization options: Visualize
cluster assignments and Visualize tree. The latter is grayed out when it is not applicable.
A.Load each dataset into Weka and run simple k-means clustering algorithm with different
values of k(number of desired clusters). Study the clusters formed. Observe the sum of
squared errors and centroids, and derive insights.
Ans:
‹ Steps for run K-mean Clustering algorithms in WEKA
1. Open WEKA Tool.

8. Click on cluster tab and Choose k-mean and select use training set test option.
Output:
Scheme:weka.clusterers.SimpleKMeans -N 2 -A "weka.core.EuclideanDistance -R first-last" -I 500

-S 10
Relation: iris
Instances: 150
Attributes: 5
sepallength
sepalwidth
petallength
petalwidth
class
=== Model and evaluation on training set ===
kMeans
======
Number of iterations: 7
Within cluster sum of squared errors: 62.1436882815797
Missing values globally replaced with mean/mode
Cluster centroids:
Cluster#
Attribute Full Data 0 1
(150) (100) (50)
=================================================================
=
sepallength 5.8433 6.262 5.006
sepalwidth 3.054 2.872 3.418
petallength 3.7587 4.906 1.464
petalwidth 1.1987 1.676 0.244
class Iris-setosa Iris-versicolor Iris-setosa
Time taken to build model (full training data) : 0 seconds
=== Model and evaluation on training set ===
Clustered Instances
0 100 ( 67%)
1 50 ( 33%)
B.Explore other clustering techniques available in Weka.
Ans: Clustering Algorithms And Techniques in WEKA, They are

C.Explore visualization features of weka to visualize the clusters. Derive interesting insights
and explain.
Ans: Visualize Features
WEKA’s visualization allows you to visualize a 2-D plot of the current working relation.
Visualization is very useful in practice, it helps to determine difficulty of the learning problem.
WEKA can visualize single attributes (1-d) and pairs of attributes (2-d), rotate 3-d visualizations
(Xgobi-style). WEKA has “Jitter” option to deal with nominal attributes and to detect “hidden”
data points.
Access To Visualization From The Classifier, Cluster And Attribute Selection Panel Is Available
From A Popup Menu. Click The Right Mouse Button Over An Entry In The Result List To Bring
Up The Menu. You Will Be Presented With Options For Viewing Or Saving The Text Output And
--- Depending On The Scheme --- Further Options For Visualizing Errors, Clusters, Trees Etc.
To open Visualization screen, click ‘Visualize’ tab.

Select a square that corresponds to the attributes you would like to visualize. For example, let’s
choose ‘outlook’ for X – axis and ‘play’ for Y – axis. Click anywhere inside the square that
corresponds to ‘play o
Changing the View:
In the visualization window, beneath the X-axis selector there is a drop-down list,
‘Colour’, for choosing the color scheme. This allows you to choose the color of points based on
the attribute selected. Below the plot area, there is a legend that describes what values the colors
correspond to. In your example, red represents ‘no’, while blue represents ‘yes’. For better
visibility you should change the color of label ‘yes’. Left-click on ‘yes’ in the ‘Class colour’
box and select lighter color from the color palette.
n the left and ‘outlook’ at the top.
MRCET page10
010010
Selecting Instances
Sometimes it is helpful to select a subset of the data using visualization tool. A special
case is the ‘UserClassifier’, which lets you to build your own classifier by interactively
selecting instances. Below the Y – axis there is a drop-down list that allows you to choose a
selection method. A group of points on the graph can be selected in four ways [2]:
1. Select Instance. Click on an individual data point. It brings up a window listing
attributes of the point. If more than one point will appear at the same location, more than
one set of attributes will be shown.
2. Rectangle. You can create a rectangle by dragging it around the point.
MRCET Page
1011011
3. Polygon. You can select several points by building a free-form polygon. Left-click on
the graph to add vertices to the polygon and right-click to complete it.
MRCET Page
1021021
4. Polyline. To distinguish the points on one side from the once on another, you can
build a polyline. Left-click on the graph to add vertices to the polyline and right-click
to finish.
MRCET Page
1031031
Unit-V Demonstrate performing regression on data sets.
Regression:
Regression is a data mining function that predicts a number. Age, weight, distance, temperature,
income, or sales could all be predicted using regression techniques. For example, a regression
model could be used to predict children's height, given their age, weight, and other factors.
A regression task begins with a data set in which the target values are known. For example, a
regression model that predicts children's height could be developed based on observed data for
many children over a period of time. The data might track age, height, weight, developmental
milestones, family history, and so on. Height would be the target, the other attributes would be
the predictors, and the data for each child would constitute a case.
In the model build (training) process, a regression algorithm estimates the value of the target as a
function of the predictors for each case in the build data. These relationships between predictors
and target are summarized in a model, which can then be applied to a different data set in which
the target values are unknown.
Regression models are tested by computing various statistics that measure the difference
between the predicted values and the expected values. See "Testing a Regression Model".
Common Applications of Regression
Regression modeling has many applications in trend analysis, business planning, marketing,
financial forecasting, time series prediction, biomedical and drug response modeling, and
environmental modeling.
How Does Regression Work?
You do not need to understand the mathematics used in regression analysis to develop quality
regression models for data mining. However, it is helpful to understand a few basic concepts.
The goal of regression analysis is to determine the values of parameters for a function that cause
the function to best fit a set of data observations that you provide. The following equation
expresses these relationships in symbols. It shows that regression is the process of estimating the
value of a continuous target (y) as a function (F) of one or more predictors (x1 , x2 , ..., xn), a set
of parameters (θ1 , θ2 , ..., θn), and a measure of error (e).
MRCET Page
1041041
y = F(x,θ) + e
The process of training a regression model involves finding the best parameter values for the
function that minimize a measure of the error, for example, the sum of squared errors.
There are different families of regression functions and different ways of measuring the
error.
Linear Regression
The simplest form of regression to visualize is linear regression with a single predictor. A linear
regression technique can be used if the relationship between x and y can be approximated with a
straight line, as shown in Figure 4-1.
Figure 4-1 Linear Relationship Between x and y
Description of "Figure :Linear Relationship Between x and y"
In a linear regression scenario with a single predictor (y = θ2x + θ1), the regression parameters
(also called coefficients) are:
The slope of the line (θ2) — the angle between a data point and the regression line
and
The y intercept (θ1) — the point where x crosses the y axis (x = 0)
MRCET Page
1051051
Nonlinear Regression
Often the relationship between x and y cannot be approximated with a straight line. In this case,
a nonlinear regression technique may be used. Alternatively, the data could be preprocessed to
make the relationship linear.
In Figure 4-2, x and y have a nonlinear relationship. Oracle Data Mining supports nonlinear
regression via the gaussian kernel of SVM. (See "Kernel-Based Learning".)
Figure: Nonlinear Relationship Between x and y
Description of "Figure:Nonlinear Relationship Between x and y"
Multivariate Regression
Multivariate regression refers to regression with multiple predictors (x1 , x2 , ..., xn). For purposes
of illustration, Figure 4-1and Figure 4-2 show regression with a single predictor. Multivariate
regression is also referred to as multiple regression.
Regression Algorithms
Oracle Data Mining provides the following algorithms for regression:
MRCET Page
1061061
• Generalized Linear Models
Generalized Linear Models (GLM) is a popular statistical technique for linear modeling.
Oracle Data Mining implements GLM for regression and classification. See Chapter 12,
"Generalized Linear Models"
• Support Vector Machines
Support Vector Machines (SVM) is a powerful, state-of-the-art algorithm for linear and
nonlinear regression. Oracle Data Mining implements SVM for regression and other
mining functions. See Chapter 18, "Support Vector Machines"
Note:
Both GLM and SVM, as implemented by Oracle Data Mining, are particularly suited for mining
data that includes many predictors (wide data).
Testing a Regression Model
The Root Mean Squared Error and the Mean Absolute Error are statistics for evaluating the
overall quality of a regression model. Different statistics may also be available depending on the
regression methods used by the algorithm.
Root Mean Squared Error
The Root Mean Squared Error (RMSE) is the square root of the average squared distance of a
data point from the fitted line.Figure 4-3 shows the formula for the RMSE.
Figure 4-3 Root Mean Squared Error
Description of "Figure 4-3 Root Mean Squared Error"
This SQL expression calculates the RMSE.
SQRT(AVG((predicted_value - actual_value) * (predicted_value - actual_value)))
MRCET Page
1071071
Mean Absolute Error
The Mean Absolute Error (MAE) is the average of the absolute value of the residuals. The MAE
is very similar to the RMSE but is less sensitive to large errors. Figure 4-4 shows the formula for
the MAE.
Figure:Mean Absolute Error
A.Load each dataset into Weka and build Linear Regression model. Study the cluster
formed. Use training set option. Interpret the regression model and derive patterns and
conclusions from the regression results.
Ans:
‹ Steps for run Aprior algorithm in WEKA
1. Open WEKA Tool.

8. Click on Classify tab and Click the Choose button then expand the functions
branch.
9. Select the LinearRegression leaf ans select use training set test option.
Output:
Scheme: weka.classifiers.functions.LinearRegression -S 0 -R 1.0E-8
MRCET Page
1081081
Relation: labor-neg-data
Instances: 57
Attributes: 17
duration
wage-increase-first-year
wage-increase-second-year
wage-increase-third-year
cost-of-living-adjustment
working-hours
pension
standby-pay
shift-differential
education-allowance
statutory-holidays
vacation
longterm-disability-assistance
contribution-to-dental-plan
bereavement-assistance
contribution-to-health-plan
class
Test mode: 10-fold cross-validation
Linear Regression Model
duration =
MRCET Page
1091091
0.4689 * cost-of-living-adjustment=tc,tcf +
0.6523 * pension=none,empl_contr +
1.0321 * bereavement-assistance=yes +
0.3904 * contribution-to-health-plan=full +
0.2765
=== Cross-validation ===
=== Summary ===
Correlation coefficient 0.1967
Ignored Class Unknown Instances 1
MRCET Page 110

B.Use options cross-validation and percentage split and repeat running the Linear
Regression Model. Observe the results and derive meaningful results.

1. Open WEKA Tool.
branch.
9. Select the LinearRegression leaf and select test options cross-validation.
11. Select the LinearRegression leaf and select test options percentage split.
Output: cross-validation

Instances: 57
Attributes: 17
duration
working-hours
pension
standby-pay
shift-differential
education-allowance
statutory-holidays
MRCET Page 111
vacation
class
Test mode: 10-fold cross-validation
duration =
0.2765
=== Cross-validation ===

=== Summary ===

Ignored Class Unknown Instances 1
MRCET Page 112

Output: percentage split

Instances: 57
Attributes: 17
duration
working-hours
pension
standby-pay
shift-differential
education-allowance
statutory-holidays
vacation
MRCET Page 113
class
Test mode: split 66.0% train, remainder test

duration =
0.2765
=== Evaluation on test split ===
=== Summary ===
MRCET Page 114

C.Explore Simple linear regression techniques that only looks at one variable.

1. Open WEKA Tool.
branch.
9. Select the S i m p l e Linear Regression leaf and select test options
cross- validation.
MRCET Page 115

6. Sample Programs using German Credit Data.
Task 1: Credit Risk Assessment
Description: The business of banks is making loans. Assessing the credit worthiness of an
applicant is of crucial importance. You have to develop a system to help a loan officer
decide whether the credit of a customer is good. Or bad. A bank’s business rules
regarding loans must consider two opposing factors. On th one han, a bank wants to
make as many loans as possible.
Interest on these loans is the banks profit source. On the other hand, a bank can not afford
to make too many bad loans. Too many bad loans could lead to the collapse of the bank.
The bank’s loan policy must involved a compromise. Not too strict and not too lenient.
To do the assignment, you first and foremost need some knowledge about the world of credit.
You can acquire such knowledge in a number of ways.
1. Knowledge engineering: Find a loan officer who is willing to talk. Interview her and try
to represent her knowledge in a number of ways.
2. Books: Find some training manuals for loan officers or perhaps a suitable textbook on
finance. Translate this knowledge from text from to production rule form.
3. Common sense: Imagine yourself as a loan officer and make up reasonable rules which
can be used to judge the credit worthiness of a loan applicant.
4. Case histories: Find records of actual cases where competent loan officers correctly
judged when and not to. Approve a loan application.
The German Credit Data
Actual historical credit data is not always easy to come by because of confidentiality
rules. Here is one such data set. Consisting of 1000 actual cases collected in Germany.
In spite of the fact that the data is German, you should probably make use of it for this
assignment(Unless you really can consult a real loan officer!)
MRCET Page 116

There are 20 attributes used in judging a loan applicant( ie., 7 Numerical attributes and 13
Categoricl or Nominal attributes). The goal is the classify the applicant into one of two
categories. Good or Bad.
The total number of attributes present in German credit data are.
1. Checking_Status
2. Duration
3. Credit_history
4. Purpose
5. Credit_amout
6. Savings_status
7. Employment
8. Installment_Commitment
9. Personal_status
10. Other_parties
11. Residence_since
12. Property_Magnitude
13. Age
14. Other_payment_plans
15. Housing
16. Existing_credits
17. Job
18. Num_dependents
19. Own_telephone
20. Foreign_worker
21. Class
MRCET Page 117

Tasks(Turn in your answers to the following taks)
1. List all the categorical (or nominal) attributes and the real valued attributes
separately.
Ans) Steps for identifying categorical attributes
1. Double click on credit-g.arff file.

2. Select all categorical attributes.
3. Click on invert.
4. Then we get all real valued attributes selected
5. Click on remove
6. Click on visualize all.
Steps for identifying real valued attributes

2.Select all real valued attributes.
3.Click on invert.
4.Then we get all categorial attributes selected
5. Click on remove
6. Click on visualize all.
The following are the Categorical (or Nominal) attributes)
1. Checking_Status
2. Credit_history
3. Purpose
4. Savings_status
5. Employment
6. Personal_status
7. Other_parties
8. Property_Magnitude
9. Other_payment_plans
10. Housing
11. Job
MRCET Page 118

12. Own_telephone
13. Foreign_worker
The following are the Numerical attributes)
1. Duration
2. Credit_amout
3. Installment_Commitment
4. Residence_since
5. Age
6. Existing_credits
7. Num_dependents
2. What attributes do you think might be crucial in making the credit assessment? Come
up with some simple rules in plain English using your selected attributes.
Ans) The following are the attributes may be crucial in making the credit assessment.
1. Credit_amount
2. Age
3. Job
4. Savings_status
5. Existing_credits
6. Installment_commitment
7. Property_magnitude
3. One type of model that you can create is a Decision tree . train a Decision tree using
the complete data set as the training data. Report the model obtained after training.
Ans) Steps to model decision tree.

2. Consider all the 21 attributes for making decision tree.
3. Click on classify tab.
4. Click on choose button.
5. Expand tree folder and select J48
6. Click on use training set in test options.
8. Right click on result list and choose the visualize tree to get decision tree.
MRCET Page 119
We created a decision tree by using J48 Technique for the complete dataset as the training
data. The following model obtained after training.
Output:
Scheme: weka.classifiers.trees.J48 -C 0.25 -M 2

Relation: german_credit
Instances: 1000
Attributes: 21
Checking_status duration credit_history purpose credit_amount savings_status

employment installment_commitment personal_status other_parties residence_since
property_magnitude age other_payment_plans housing existing_credits job num_dependents
own_telephone foreign_worker class
Test mode: evaluate on training data
J48 pruned tree

------------------
=== Summary ===

MRCET Page
120120

Coverage of cases (0.95 level) 100 %
Mean rel. region size (0.95 level) 93.3 %

0.956 0.38 0.854 0.956 0.902 0.857 good
0.62 0.044 0.857 0.62 0.72 0.857 bad
WeightedAvg.0.855 0.279 0.855 0.855 0.847 0.857
a b <-- classified as 669

31 | a = good
114 186 | b = bad

4. Suppose you use your above model trained on the complete dataset, and classify credit
good/bad for each of the examples in the dataset. What % of examples can you classify
correctly?(This is also called testing on the training set) why do you think can not get
100% training accuracy?
Ans) Steps followed are:

5. Click on use training set in test options.
7. On right side we find confusion matrix
8. Note the correctly classified instances.
MRCET Page
121121
Output:
If we used our above model trained on the complete dataset and classified credit as good/bad for
each of the examples in that dataset. We can not get 100% training accuracy only 85.5% of
examples, we can classify correctly.
5. Is testing on the training set as you did above a good idea? Why or why not?
Ans)It is not good idea by using 100% training data set.
6. One approach for solving the problem encountered in the previous question is using
cross-validation? Describe what is cross validation briefly. Train a decision tree again
using cross validation and report your results. Does accuracy increase/decrease? Why?
Ans) steps followed are:

5. Click on cross validations in test options.
6. Select folds as 10
7. Click on start
8. Change the folds to 5
9. Again click on start
10. Change the folds with 2
11. Click on start.
12. Right click on blue bar under result list and go to visualize tree
Output:
Cross-Validation Definition: The classifier is evaluated by cross validation using the number of
folds that are entered in the folds text field.
In Classify Tab, Select cross-validation option and folds size is 2 then Press Start Button, next
time change as folds size is 5 then press start, and next time change as folds size is 10 then press
start.
i) Fold Size-10
Stratified cross-validation ===
=== Summary ===
MRCET Page
122122

Coverage of cases (0.95 level) 92.8 %

0.84 0.61 0.763 0.84 0.799 0.639 good
0.39 0.16 0.511 0.39 0.442 0.639 bad
Weighted Avg. 0.705 0.475 0.687 0.705 0.692 0.639
a b <-- classified as
588 112 | a = good
183 117 | b = bad
ii) Fold Size-5

=== Summary ===


Mean rel. region size (0.95 level) 93 %
MRCET Page
123123

0.851 0.543 0.785 0.851 0.817 0.685 good
0.457 0.149 0.568 0.457 0.506 0.685 bad
Weighted Avg. 0.733 0.425 0.72 0.733 0.724 0.685
596 104 | a = good
163 137 | b = bad
iii) Fold Size-2

=== Summary ===


0.891 0.677 0.755 0.891 0.817 0.662 good
0.323 0.109 0.561 0.323 0.41 0.662 bad
Weighted Avg. 0.721 0.506 0.696 0.721 0.695 0.662
MRCET Page
124124
624 76 | a = good
203 97 | b = bad
Note: With this observation, we have seen accuracy is increased when we have folds size is 5
and accuracy is decreased when we have 10 folds.
7. Check to see if the data shows a bias against “foreign workers” or “personal-status”.
One way to do this is to remove these attributes from the data set and see if the decision
tree created in those cases is significantly different from the full dataset case which you
have already done. Did removing these attributes have any significantly effect? Discuss.

5. Click on cross validations in test options.
6. Select folds as 10
7. Click on start
8. Click on visualization
9. Now click on preprocessor tab
th th
10. Select 9 and 20 attribute
11. Click on remove button
12. Goto classify tab
13. Choose J48 tree
14. Select cross validation with 10 folds
15. Click on start button
16. Right click on blue bar under the result list and go to visualize tree.
Output:
We use the Preprocess Tab in Weka GUI Explorer to remove an attribute “Foreign•
workers” & “Perosnal_status” one by one. In Classify Tab, Select Use Training set option
then
Press Start Button, If these attributes removed from the dataset, we can see change in the
accuracy compare to full data set when we removed.
MRCET Page
125125
i) If Foreign_worker is removed
Evaluation on training set ===
=== Summary ===
Relative absolute error 53.1347
% Root relative squared error 72.9074
% Coverage of cases (0.95 level) 100
% Mean rel. region size (0.95 level)91.9
% Total Number of Instances 1000
MRCET Page
126126

0.954 0.363 0.86 0.954 0.905 0.867 good
0.637 0.046 0.857 0.637 0.73 0.867 bad
Weighted Avg 0.859 0.268 0.859 0.8590.852 0.867
668 32 | a = good
109 191 | b = bad
i) If Personal_status is removed
Evaluation on training set ===
=== Summary ===

Coverage of cases (0.95 level) 100 %
MRCET Page
127127

0.954 0.34 0.868 0.954 0.909 0.868 good
0.66 0.046 0.861 0.66 0.747 0.868 bad
Weighted Avg. 0.866 0.252 0.866 0.866 0.86 0.868
668 32 | a = good 102
198 | b = bad
Note: With this observation we have seen, when “Foreign_worker “attribute is removed
from the
Dataset, the accuracy is decreased. So this attribute is important for

classification.
8. Another question might be, do you really need to input so many attributes to get good
results? May be only a few would do. For example, you could try just having attributes
2,3,5,7,10,17 and 21. Try out some combinations.(You had removed two attributes in
problem 7. Remember to reload the arff data file to get all the attributes initially before
you start selecting the ones you want.)

2. Select 2,3,5,7,10,17,21 and tick the check boxes.
3. Click on invert
4. Click on remove
5. Click on classify tab
6. Choose trace and then algorithm as J48
7. Select cross validation folds as 2
8. Click on start.
OUTPUT:
nd
We use the Preprocess Tab in Weka GUI Explorer to remove 2 attribute (Duration). In
Classify Tab, Select Use Training set option then Press Start Button, If these attributes removed
from the dataset, we can see change in the accuracy compare to full data set when we removed.

=== Summary ===

Confusion Matrix ===
647 53 | a = good
106 194 | b = bad
Remember to reload the previous removed attribute, press Undo option in Preprocess tab. We
use the Preprocess Tab in Weka GUI Explorer to remove 3rd attribute (Credit_history). In
from the dataset, we can see change in the accuracy compare to full data set when we
removed.

=== Summary ===

== Confusion Matrix ===
645 55 | a = good
106 194 | b = bad
th
use the Preprocess Tab in Weka GUI Explorer to remove 5 attribute (Credit_amount). In
=== Summary ===

= Confusion Matrix ===
675 25 | a = good
111 189 | b = bad
th
use the Preprocess Tab in Weka GUI Explorer to remove 7 attribute (Employment). In

=== Summary ===

670 30 | a = good
112 188 | b = bad
th
use the Preprocess Tab in Weka GUI Explorer to remove 10 attribute (Other_parties). In

=== Summary ===

Confusion Matrix ===

663 37 | a = good
118 182 | b = bad
th
use the Preprocess Tab in Weka GUI Explorer to remove 17 attribute (Job). In Classify Tab,
Select Use Training set option then Press Start Button, If these attributes removed from the
dataset, we can see change in the accuracy compare to full data set when we removed.

=== Summary ===

675 25 | a = good
116 184 | b = bad
st
use the Preprocess Tab in Weka GUI Explorer to remove 21 attribute (Class). In Classify Tab,
Select Use Training set option then Press Start Button, If these attributes removed from the
dataset, we can see change in the accuracy compare to full data set when we removed.

=== Summary ===

MRCET Page 130

963 0 | a = yes
37 0 | b = no
rd
Note: With this observation we have seen, when 3 attribute is removed from the Dataset, the
nd th
accuracy (83%) is decreased. So this attribute is important for classification. when 2 and 10
attributes are removed from the Dataset, the accuracy(84%) is same. So we can remove any one
th
among them. when 7th and 17 attributes are removed from the Dataset, the accuracy(85%) is
th st
same. So we can remove any one among them. If we remove 5 and 21 attributes the accuracy
is increased, so these attributes may not be needed for the classification.
9. Sometimes, The cost of rejecting an applicant who actually has good credit might be
higher than accepting an applicant who has bad credit. Instead of counting the
misclassification equally in both cases, give a higher cost to the first case ( say cost 5) and
lower cost to the second case. By using a cost matrix in weak. Train your decision tree and
report the Decision Tree and cross validation results. Are they significantly different from
results obtained in problem 6.

5. Click on start
6. Note down the accuracy values
7. Now click on credit arff file
8. Click on attributes 2,3,5,7,10,17,21
9. Click on invert
10. Click on classify tab
11. Choose J48 algorithm
12. Select Cross validation fold as 2
13. Click on start and note down the accuracy values.
14. Again make cross validation folds as 10 and note down the accuracy values.
15. Again make cross validation folds as 20 and note down the accuracy values.
MRCET Page 131

OUTPUT:
In Weka GUI Explorer, Select Classify Tab, In that Select Use Training set option . In Classify
Tab then press Choose button in that select J48 as Decision Tree Technique. In Classify Tab
then press More options button then we get classifier evaluation options window in that select
cost sensitive evaluation the press set option Button then we get Cost Matrix Editor. In that
change classes as 2 then press Resize button. Then we get 2X2 Cost matrix. In Cost Matrix (0,1)
location value change as 5, then we get modified cost matrix is as follows.
0.0 5.0
1.0 0.0
Then close the cost matrix editor, then press ok button. Then press start button.
=== Summary ===

669 31 | a = good
114 186 | b = bad
Note: With this observation we have seen that ,total 700 customers in that 669 classified as good
customers and 31 misclassified as bad customers. In total 300cusotmers, 186 classified as bad
customers and 114 misclassified as good customers.
10. Do you think it is a good idea to prefect simple decision trees instead of having long
complex decision tress? How does the complexity of a Decision Tree relate to the bias of the
model?
Ans)
steps followed are:-

1)click on credit arff file
2)Select all attributes
3)click on classify tab
4)click on choose and select J48 algorithm
5)select cross validation folds with 2
6)click on start
MRCET Page 132

7)write down the time complexity value
It is Good idea to prefer simple Decision trees, instead of having complex Decision tree.
11. You can make your Decision Trees simpler by pruning the nodes. One approach is to
use Reduced Error Pruning. Explain this idea briefly. Try reduced error pruning for
training your Decision Trees using cross validation and report the Decision Trees you
obtain? Also Report your accuracy using the pruned model Does your Accuracy increase?
Ans)
steps followed are:-

4)click on choose and select REP algorithm
5)select cross validation 2
6)click on start
7)Note down the results
We can make our decision tree simpler by pruning the nodes. For that In Weka GUI Explorer,
Select Classify Tab, In that Select Use Training set option . In Classify Tab then press Choose
button in that select J48 as Decision Tree Technique. Beside Choose Button Press on J48 –c 0.25
–M2 text we get Generic Object Editor. In that select Reduced Error pruning Property as
True then press ok. Then press start button.

=== Summary ===
662 38 | a = good
176 124 | b = bad
By using pruned model, the accuracy decreased. Therefore by pruning the nodes we can
make our decision tree simpler.
MRCET Page 133

12) How can you convert a Decision Tree into “if-then-else rules”. Make up your own small
Decision Tree consisting 2-3 levels and convert into a set of rules. There also exist different
classifiers that output the model in the form of rules. One such classifier in weka is rules.
PART, train this model and report the set of rules obtained. Sometimes just one attribute
can be good enough in making the decision, yes, just one ! Can you predict what attribute
that might be in this data set? OneR classifier uses a single attribute to make decisions(it
chooses the attribute based on minimum error).Report the rule obtained by training a one
R classifier. Rank the performance of j48,PART,oneR.
Ans)
Steps For Analyze Decision Tree:

4)click on choose and select J48 algorithm
6)click on start
7)note down the accuracy value
8) again goto choose tab and select PART
10)click on start
11)note down accuracy value
12)again goto choose tab and select One R
14)click on start
15)note down the accuracy value.
MRCET Page 134

Sample Decision Tree of 2-3 levles.
Converting Decision tree into a set of rules is as follows.
Rule1: If age = youth AND student=yes THEN buys_computer=yes

Rule2: If age = youth AND student=no THEN buys_computer=no
Rule3: If age = middle_aged THEN buys_computer=yes
Rule4: If age = senior AND credit_rating=excellent THEN buys_computer=yes

Rule5: If age = senior AND credit_rating=fair THEN
buys_computer=no
In Weka GUI Explorer, Select Classify Tab, In that Select Use Training set option .There also
exist different classifiers that output the model in the form of Rules. Such classifiers in weka are
“PART” and ”OneR” . Then go to Choose and select Rules in that select PART and press
start Button.
== Evaluation on training set ===

=== Summary ===
MRCET Page 135

653 47 | a = good
56 244 | b = bad
Then go to Choose and select Rules in that select OneR and press start Button.
== Evaluation on training set ===
=== Summary ===
642 58 | a = good
200 100 | b = bad
Then go to Choose and select Trees in that select J48 and press start Button.
=== Summary ===
669 31 | a = good
114 186 | b = bad
Note: With this observation we have seen the performance of classifier and Rank is as follows
1. PART
2. J48 3. OneR
MRCET Page 136

7.Task 2:Hospital Management System
Data warehouse consists dimension table and fact table.
REMEMBER the following
Dimension
The dimension object(dimension);
_name
_attributes(levels),with primary key
_hierarchies
One time dimension is must.
About levels and hierarchies
Dimensions objects(dimension) consists of set of levels and set of hierarchies defined over those
levels.the levels represent levels of aggregation.hierarchies describe-child relationships among a
set of levels.
For example .a typical calander dimension could contain five levels.two hierarchies can
be defined on these levels.
H1: YearL>QuarterL>MonthL>DayL
H2: YearL>WeekL>DayL
The hierarchies are describes from parent to child,so that year is the parent of Quarter,quarter
are parent of month,and so forth.
About Unique key constraints
When you create a definition for a hierarchy,warehouse builder creates an identifier key for
each level of the hierarchy and unique key constraint on the lowest level (base level)
Design a hospital management system data warehouse(TARGET) consists of dimensions

patient,medicine,supplier,time.where measure are ‘ NO UNITS’ ,UNIT PRICE.
Assume the relational database(SOURCE)table schemas as follows
TIME(day,month,year) PATIENT(patient_name,age,address,etc)
MRCET Page 137

MEDICINE(Medicine_brand_name,Drug_name,supplier,no_units,units_price,etc..,)
SUPPLIER:( Supplier_name,medicine_brand_name,address,etc..,)
If each dimension has 6 levels,decide the levels and hierarchies,assumes the level names
suitably.
Design the hospital management system data warehousing using all schemas.give the example
4-D cube with assumption names.
MRCET Page 138

8.Simple Project on Data Preprocessing
Data Preprocessing
Objective: Understanding the purpose of unsupervised attribute/instance filters for

preprocessing the input data.
Follow the steps mentioned below to configure and apply a

filter.
The preprocess section allows filters to be defined that transform the data in various ways.
The Filter box is used to set up filters that are required. At the left of the Filter box is a
Choose button. By clicking this button it is possible to select one of the filters in Weka. Once
a filter has been selected, its name and options are shown in the field next to the Choose
button. Clicking on this box brings up a GenericObjectEditor dialog box, which lets you
configure a filter. Once you are happy with the settings you have chosen, click OK to return
to the main Explorer window.
Now you can apply it to the data by pressing the Apply button at the right end of the Filter
panel. The Preprocess panel will then show the transformed data. The change can be undone
using the Undo button. Use the Edit button to view your transformed data in the dataset editor.
Try each of the following Unsupervised Attribute

Filters. (Choose -> weka -> filters -> unsupervised ->
attribute)
• Use ReplaceMissingValues to replace missing values in the given dataset.
• Use the filter Add to add the attribute Average.
• Use the filter AddExpression and add an attribute which is the average of attributes
M1 and M2. Name this attribute as AVG.
• Understand the purpose of the attribute filter Copy.
• Use the attribute filters Discretize and PKIDiscretize to discretize the M1 and
M2 attributes into five bins. (NOTE: Open the file afresh to apply the second filter
MRCET Page 139

since there would be no numeric attribute to dicretize after you have applied the first
filter.)
• Perform Normalize and Standardize on the dataset and identify the difference
between these operations.
• Use the attribute filter FirstOrder to convert the M1 and M2 attributes into a
single attribute representing the first differences between them.
• Add a nominal attribute Grade and use the filter MakeIndicator to convert the
attribute into a Boolean attribute.
• Try if you can accomplish the task in the previous step using the filter
MergeTwoValues.
• Try the following transformation functions and identify the purpose of each
• NumericTransform
• NominalToBinary
• NumericToBinary
• Remove
• RemoveType
• RemoveUseless
• ReplaceMissingValues
• SwapValues
Try the following Unsupervised Instance Filters.
(Choose -> weka -> filters -> unsupervised -> instance)
• Perform Randomize on the given dataset and try to correlate the resultant sequence
with the given one.
• Use RemoveRange filter to remove the last two instances.
• Use RemovePercent to remove 10 percent of the dataset.
• Apply the filter RemoveWithValues to a nominal and a numeric attribute
MRCET Page
1401401
LINUX PROGRAMMING
LABORATORY MANUAL
B.TECH
(IV YEAR – I SEM)
(2016-17)
Department of
Computer Science and Engineering
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY

Recognized under 2(f) and 12 (B) of UGC ACT 1956
Affiliated to JNTUH, Hyderabad, Approved by AICTE - Accredited by NBA & NAAC – ‘A’ Grade - ISO 9001:2008 Certified)
Maisammaguda, Dhulapally (Post Via. Hakimpet), Secunderabad – 500100, Telangana State, India
1
Department of Computer Science and Engineering
Vision
 To acknowledge quality education and instill high patterns of discipline
making the students technologically superior and ethically strong which
involves the improvement in the quality of life in human race.
Mission
 To achieve and impart holistic technical education using the best of
infrastructure, outstanding technical and teaching expertise to establish
the students into competent and confident engineers.
 Evolving the center of excellence through creative and innovative
teaching learning practices for promoting academic achievement to
produce internationally accepted competitive and world class
professionals.
2
PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
PEO1 – ANALYTICAL SKILLS
1. To facilitate the graduates with the ability to visualize, gather information, articulate,
analyze, solve complex problems, and make decisions. These are essential to
address the challenges of complex and computation intensive problems increasing
their productivity.
PEO2 – TECHNICAL SKILLS
2. To facilitate the graduates with the technical skills that prepare them for immediate
employment and pursue certification providing a deeper understanding of the
technology in advanced areas of computer science and related fields, thus
encouraging to pursue higher education and research based on their interest.
PEO3 – SOFT SKILLS
3. To facilitate the graduates with the soft skills that include fulfilling the mission,
setting goals, showing self-confidence by communicating effectively, having a
positive attitude, get involved in team-work, being a leader, managing their career
and their life.
PEO4 – PROFESSIONAL ETHICS
To facilitate the graduates with the knowledge of professional and ethical responsibilities by
paying attention to grooming, being conservative with style, following dress codes, safety
codes,and adapting themselves to technological advancements.
3
PROGRAM SPECIFIC OUTCOMES (PSOs)
After the completion of the course, B. Tech Computer Science and Engineering, the
graduates will have the following Program Specific Outcomes:
1. Fundamentals and critical knowledge of the Computer System:- Able to Understand

the working principles of the computer System and its components , Apply the
knowledge to build, asses, and analyze the software and hardware aspects of it .
2. The comprehensive and Applicative knowledge of Software Development:

Comprehensive skills of Programming Languages, Software process models,
methodologies, and able to plan, develop, test, analyze, and manage the software
and hardware intensive systems in heterogeneous platforms individually or working
in teams.
3. Applications of Computing Domain & Research: Able to use the professional,

managerial, interdisciplinary skill set, and domain specific tools in development
processes, identify the research gaps, and provide innovative solutions to them.
4
PROGRAM OUTCOMES (POs)
Engineering Graduates will be able to:
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering
problems.
2. Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
3. Design / development of solutions: Design solutions for complex engineering problems

and design system components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and

research methods including design of experiments, analysis and interpretation of data,
and synthesis of the information to provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
7. Environment and sustainability: Understand the impact of the professional engineering

solutions in societal and environmental contexts, and demonstrate the knowledge of, and
need for sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
9. Individual and team work: Function effectively as an individual, and as a member or

leader in diverse teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the

engineering community and with society at large, such as, being able to comprehend and
write effective reports and design documentation, make effective presentations, and give
and receive clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a
member and leader in a team, to manage projects and in multi disciplinary environments.
12. Life- long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.
5
Maisammaguda, Dhulapally Post, Via Hakimpet, Secunderabad – 500100
--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
------------
GENERAL LABORATORY INSTRUCTIONS
1. Students are advised to come to the laboratory at least 5 minutes before (to the
starting time), those who come after 5 minutes will not be allowed into the lab.
2. Plan your task properly much before to the commencement, come prepared to the lab
with the synopsis / program / experiment details.
3. Student should enter into the laboratory with:
a. Laboratory observation notes with all the details (Problem statement, Aim,
Algorithm, Procedure, Program, Expected Output, etc.,) filled in for the lab
session.
b. Laboratory Record updated up to the last session experiments and other
utensils (if any) needed in the lab.
c. Proper Dress code and Identity card.
4. Sign in the laboratory login register, write the TIME-IN, and occupy the computer
system allotted to you by the faculty.
5. Execute your task in the laboratory, and record the results / output in the lab
observation note book, and get certified by the concerned faculty.
6. All the students should be polite and cooperative with the laboratory staff, must
maintain the discipline and decency in the laboratory.
7. Computer labs are established with sophisticated and high end branded systems,
which should be utilized properly.
8. Students / Faculty must keep their mobile phones in SWITCHED OFF mode during
the lab sessions.Misuse of the equipment, misbehaviors with the staff and systems
etc., will attract severe punishment.
9. Students must take the permission of the faculty in case of any urgency to go out ; if
anybody found loitering outside the lab / class without permission during working
hours will be treated seriously and punished appropriately.
10. Students should LOG OFF/ SHUT DOWN the computer system before he/she leaves
the lab after completing the task (experiment) in all aspects. He/she must ensure the
system / seat is kept properly.
Head of the Department Principal
6
INDEX
S.No Program Page

no
1 Write a Shell Script that accepts a file name, starting and ending line numbers as arguments 10
and displays all lines between the given line numbers.
2 Write a shell script that deletes all lines containing the specified word in one or more files 12
supplied as arguments to it.
3 Write a shell script that displays a list of all files in the current directory to which the user 14
has read, write and execute permissions.
4 Write a shell script that receives any number of file names as arguments checks if every 15
argument supplied is a file or directory and reports accordingly. whenever the argument is a
file it reports no of linespresent in it
5 Write a shell script that accepts a list of file names as its arguments, counts and reports the 17
occurrence of each word that is present in the first argument file on other argument files.
6 Write a shell script to list all of the directory files in a directory 19
7 Write a shell script to find factorial of a given number. 21
8 write an awk script to count number of lines in a file that does not contain vowels 22
9 write an awk script to find the no of characters ,words and lines in a file 23
10 Write a C program that makes a copy of file using standard I/O and System Calls 25
11 Implement in c language the following Unix commands using system calls 26
a) cat b) ls c)mv
12 Write a C program that takes one or more file/directory names as command line input and 30
reports following information
A)File Type B)Number Of Links
c)Time of last Acces D) Read,write and execute permissions
13 Write a C program to emulate unix ls -l command-line 31
14 Write a C program to list every file in directory, its inode number and file name 32
15 Write a C program to demonstrate redirection of standard output to a file ex: ls>f1 33
16 Write a C program to create child process and allow parent process to display “parent” and 35
the child to display “child” on the screen
17 Write a C program to create zombie process 36
18 Write a C program to illustrate how an orphan process is created 38
19 Write a C program that illustrate how to execute two commands concurrently with a 39
command pipe Ex: ls –l|sort
20 Write a C program that illustrate communication between two unrelated process using 40
named pipes
21 Write a C Program in which a parent write a message to a pipe and child reads the message 42
22 Write a C program to create message queue with read and write permissions to write 3 43
messages to it with different priority numbers
23 Write a C program that receives a message from message queue and display them 48
24 Write a C program that illustrate the suspending and resuming process using signal 49
25 Write client server programs using c for interaction between server and client process using 50
Unix Domain sockets
26 Write client server programs using c for interaction between server and client process using 54
Internet Domain sockets
27 Write a C program that illustrates two processes communicating using Shared memory 57
7
Procedure to connect to LINUX
(Steps)
8
Procedure to connect to LINUX
Step 1:click on putty icon available on desk top. A window is opened
Step 2:fill in ip address of linux server and click open
Step 3: provide login and password (nothing is displayed on screen while typing
password)
Step 4:changethe default password at your first login
9
EXPERIMENT NO: 1 Date:
Aim: Write a Shell Script that accepts a file name, starting and ending line numbers as
arguments and displays all lines between the given line numbers.
ALGORITHM:
Step 1: Create a file with 5-6 lines of data

File can be created by vi sample.dat or cat sample.dat
Step 2:Now write a shell script with
vi 1.sh
step3:Check the no of arguments for shell script if
0 arguments then print no arguments else
if 1 argument then print 1 argument else if
2 arguments then print 2 arguments
else check for file is there or not(if file is not there print file does not exists)
1else sed -ne ''$2','$3' p' $1
sed is one of powerful filter(stream editor)
-e default option (script on command line)
-n suppresses automatic output
$2 first line number passed $3 2nd line number passed
p is a print command (prints current content to the pattern space).
$1 is name of file from which we are printing data between the line numbers.
Step 4:top
Script Name: 1sh

#!/bin/bash
if [ $# -lt 3 ]
then
echo "To execute you have to enter 3 arguments in command line in following
order..."
echo " File Name ,starting line number and ending line number..."
else
sed -n $2,$3p $1
fi
Commands used in the script:
Sed command:
stream editor for filtering and transforming text
1. Replacing or substituting string
Sed command is mostly used to replace the text in a file. The below simple sed
command replaces the word "unix" with "linux" in the file.
$sed 's/unix/linux/' file.txt
2. Replacing the nth occurrence of a pattern in a line

$sed 's/unix/linux/2' file.txt
nd
Replaces 2 occurrence
3.printing pines for a given range

$sed –n 1,5p hello.txt
Prints first 5 lines in the file hello.txt
nl command:
10
The nl utility in Linux is used to give number lines of a file on console.
Example:
$ nl sort.txt
1 UK
2 Australia
3 Newzealand
4 Brazil
5 America
Execution:
check how many lines of data in the input file
root@localhost sh]# cat hello.txt|nl

1 abc
2 def
3 ghi
4 abc
5 abc
6 cccc
Executing Shell script:

run1:
[root@localhost sh]# sh 1.sh abc1.txt 2 4
def
ghi
abc
compare with the data in the file and out put
Viva Questions
1.What is a shell script?

2.How to find current shell name
3.How to switch to another shell
4.How to execute shell Script
11
AIM: Write a shell Script that deletes all lines containing the specified word in one or more
files supplied as arguments to it.
ALGORITHM:
Step 1: Create a file with 5-6 lines of data

Create the 2 file f1 and f2 as vi s1and vi s2
Step2: Now write a shell script with
vi 2.sh
step3:Check the no of arguments for shell script
if 0 arguments then print no arguments
else pattern=$1(word will be stored in pattern)
for fname in $*
for every filename in given files
if it is a file if [ -f $fname ] then
print DELETING $pattern FROM $fname
sed '/'$pattern'/d' $fname
sed acts as filter if word is a file in any line that will be deleted
„/‟ is used to represent regular expressions
„/d‟ is a delete command in sed
else print file NOT FOUND
Script name: 2.sh
#!/bin/bash
if [ $# -lt 2 ]then
echo "Enter atlest two files as input in command line"
else
printf "enter a word to find:"
read word
for f in $*
do
printf "\n In File $f:\n"
sed /$word/d $f
done
fi
Execution:
run1:
check data in input files
[root@localhost sh]# cat abc1.txt
abc
def
ghi
abc
abc
cccc
abc
def
ghi
abc
abc
cccc
12
Executing shell script
[root@localhost sh]# sh 2.sh abc1.txt abc2.txt
enter a word to find:abc
In File abc1.txt:
def
ghi
cccc
In File abc2.txt:
def
ghi
cccc
Expected output:
Displays lines from files s1 s2 after deleting the word hi
Viva Questions
1.Explain various loops in shell script

2.Explain grep
3.Explain egep
4.Explain fgep
5. .Explain sed
13
Aim: Write a shell script that displays a list of all files in the current directory to which the user has
read, write and execute permissions.
ALGORITHM:
Step1: selects list of files from present working directory

Step 2:check for each file wither its is has read, write and execute permissions if true goto step 3
Step 3: print file
Step 4 :stop
Script name: 3.sh
#!/bin/bash
echo "List of Files which have Read, Write and Execute Permissions in Current Directory
are..."
for file in *
do
if [ -r $file -a -w $file -a -x $file ]
then
echo $file
fi
done
Execution:
$sh 3.sh
Expected output:
by executing above shell script you will get all files which has read ,write and execute
Permissions in current working directory
sample output
[root@localhost sh]# sh 3.sh
List of Files which have Read, Write and Execute Permissions in Current Directory are...
5.sh
a.out
Viva Questions:
1.Display all files in a directory
2.how to use chmod
3.How to change file permissions
14
Aim:-Write a shell script that receives any number of file names as arguments checks if
every argumentsupplied is a file or directory and reports accordingly. whenever the argument
is a file it reports no of linespresent in it
ALGORITHM:
step 1: if arguments are less than 1 print Enter atleast one input file name and gotostep
9
Step 2: selects list a file from list of arguments provided in command line
Step 3: check for whether it is directory if yes print is directory and goto step 9
step 4: check for whether it is a regular file if yes goto step 5 else goto step 8
Step 5: print given name is regular file
step 6: print No of lines in file
step 7: goto step
step 8: print not a file or a directory
step 9: stop
Script name: 4.sh

#!/bin/bash
if [ $# -lt 1 ]
then
echo "Enter atleast one input file name"
else
for i in $*
do
if [ -d $i ]
then
echo " given name is directory"
elif [ -f $i ]
then
echo " given name is file: $i"
echo " No of lines in file are : `wc -l $i`"
else
echo "given name is not a file or a directory"
fi
done
fi
Execution:
provide two file names as input one a regular file and other directory
for example abc1.txt a text file as first argument and japs a directory as second argument
Run1:
[root@localhost sh]# sh 4.sh abc1.txt japs
given name is file: abc1.txt
No of lines in file are : 7 abc1.txt
japs is directory
15
run 2:[root@localhost sh]# sh 4.sh abc1.txt abc2.txt
Viva Questions:
1. What is an internal command in Linux?

Internal commands are also called shell built-in commands. Example: cd,fg. Since these are
shell built-in, no process is created while executing these commands, and hence are
considered to be much faster.
2. x and y are two variables containing numbers? How to add these 2 numbers?
$ expr $x + $y
3. How to add a header record to a file in Linux?

$ sed -i '1i HEADER' file
4. How to find the list of files modified in the last 30 mins in Linux?
$ find . -mmin -30
5. How to find the list of files modified in the last 20 days?

$ find . -mtime -20
16
Aim:-Write a shell script that accepts a list of file names as its arguments, counts and reports
the occurrenceof each word that is present in the first argument file on other argument files.
ALGORITHM:
step1: Check the no of arguments for shell script

if 0 arguments then print no arguments
step2:else translate each word in the first file is to be on separate line
which will be stored in temp file
step3: for i in $*
for every filename in given files
step 4: translate each word in the file is to be on separate line
which will be stored in temp1 file
step5: count no of lines in temp file assign it to j
step6: initialize j=1
step 7: while i< j
extract the line that are common in both the file by using
head and tail commands
then apply the filter grep to count and print the lines
which are common to files
increment j
step 8: stop
Script name:5.sh
#!/bin/bash
echo "no of arguments $#"
if [ $# -le 2 ]
then
echo "Error : Invalid number of arguments."
exit
fi
str=`cat $1 | tr '\n' ' '`
for a in $str
do
echo "in file $a"
echo "Word = $a, Count = `grep -c "$a" $2`"
done
Execution and output: check data

in abc1.txt file [root@localhost
sh]# cat abc1.txt abc
def
ghi
abc
abc
cccc
check data in abc1.txt file
17
abc
def
ghi
abc
abc
cccc
executing script
[root@localhost sh]# sh 5.sh abc1.txt abc2.txt
Word = abc, Count = 3
Word = def, Count = 1
Word = ghi, Count = 1
Word = cccc, Count = 1
Viva Questions
1. What is Shell Scripting ?

Shell scripting, in Linux or Unix, is programming with the shell using which you can automate your
tasks. A shell is the command interpreter which is the interface between the User and the kernel. A
shell script allows you to submit a set of commands to the kernel in a batch. In addition, the shell
itself is very powerful with many properties on its own, be it for string manipulation or some basic
programming stuff.
2. The command "cat file" gives error message "--bash: cat: Command not found". Why?
It is because the PATH variable is corrupt or not set appropriately. And hence the error because the
cat command is not available in the directories present PATH variable.
3. How to find the length of a string in Linux?

$ x="welcome" $ echo ${#x} 7
4. What are the different timestamps associated with a file?

Modification time:- Refers to the time when the file is last modified.
Access time :- The time when the file is last accessed.
Changed time :- The time when the attributes of the file are last changed.
5. How to get the list of files alone in a directory in Linux?

$ ls -lrt | grep ^-
18
Aim:-Write a shell script to list all of the directory files in a directory.

Algorithm:
Step1: enter the name of the directory
Read dir
Step2: if it is a directory
Then list the files present in that directory
By using ls command with –p option to list all directory files in a given directory
Step 3: else enter the directory name
Step 4: stop
Script name: 6.sh

#!/bin/bash
echo " Enter dir name: "
read dir
if [ -d $dir ]
then
printf " Files in Directory $dir are...\n`ls $dir`"
else
echo " Dir does not exist"
fi
Execution and output:

Enter dir name:
japs
Files in Directory japs are...
abc1.txt
abc2.txt
ls-l.c
prg5
s1
Viva Questions
1. How to find the files modified exactly before 30minutes?

$ find . -mmin 30
2. A string contains a absolute path of a file. How to extract the filename alone from the
absolute path in Linux?
$ x="/home/guru/temp/f1.txt"
$ echo $x | sed 's^.*/^^'
3. How to find all the files created after a pre-defined date time, say after 10th April 10AM?
This can be achieved in 2 steps:

1. Create a dummy file with the time stamp, 10th April 10AM.
19
2. Find all the files created after this dummy file.
$ touch -t 1004101000 file

$ find . -newer file
4. How to print the contents of a file line by line in Linux?
$ while read line

do
echo $line
done < file
5. The word "Unix" is present in many .txt files which is present across many files and
also files present in sub directories. How to get the total count of the word "Unix" from all
the .txt files?
$ find . -name *.txt -exec grep -c Unix '{}' \; | awk '{x+=$0;}END{print x}'
20
Aim:-Write a shell script to find factorial of a given number.

ALGORITHM
Step 1: read any number to find factorial
Step 2: initialize fact=1 and i=1
Step 3: while i less than
do
fact=fact* i
i=i+1
done
step 4:print fact
step 5:stop.
Script Name:7.sh
#!/bin/bash
echo "Factorial Calculation Script...."
echo "Enter a number: "
read f
fact=1
factorial=1
while [ $fact -le $f ]
do
factorial=`expr $factorial \* $fact`
fact=`expr $fact + 1`
done
echo "Factorial of $f = $factorial"
Execution and Output:

Factorial Calculation Script....
Enter a number: 4
Factorial of 4 = 24
21
Aim:-write an awk script to count number of lines in a file that does not contain vowels
ALGORITHM
Step 1: create a file with 5-10 lines of data
Step 2: write an awk script by using grep command to filter the lines
that do not contain vowels
awk „ $0 ~/aeiou/ {print $0}‟ file1
step3: count=count+1
step4:print count
step5:stop
Awk script name:nm.awk
BEGIN{}
{
If($0 !~/[aeiou AEIOU]/)
wordcount+=NF
}
END
{
print "Number of Lines are", wordcount
}
input file for awk script:data.dat

bcdfghj
abcdfghj
bcdfghj
ebcdfghj
bcdfghj
ibcdfghj
bcdfghj
obcdfghj
bcdfghj
ubcdfghj
Executing the script:

[root@localhost awk]# awk -f nm.awk data.dat
bcdfghj
bcdfghj
bcdfghj
bcdfghj
bcdfghj
Number f lines are 5
22
Aim:-write an awk script to find the no of characters ,words and lines in a file
ALGORITHM
Step 1: create a file with 5 to10 lines of data
Step 2: write an awk script
find the length of file
store it in chrcnt
step3: count the no of fields (NF), store it in wordcount
step4: count the no of records (NR), store it in NR
step5: print chrcnt,NRwordcount
step6: stop
Awk script name:nc.awk
BEGIN{}
{
print len=length($0),"\t",$0
wordcount+=NF
chrcnt+=len
}
END {
print "total characters",chrcnt
print "Number of Lines are",NR
print "No of Words count:",wordcount
}
input data file name:data.dat

bcdfghj
abcdfghj
bcdfghj
ebcdfghj
bcdfghj
ibcdfghj
bcdfghj
obcdfghj
bcdfghj
ubcdfghj
Executing the script:

[root@localhost awk]# awk -f nc.awk data.dat
7 bcdfghj
8 abcdfghj
7 bcdfghj
8 ebcdfghj
7 bcdfghj
8 ibcdfghj
7 bcdfghj
8 obcdfghj
7 bcdfghj
8 ubcdfghj
total characters 75
23
Number of Lines are 10
No of Words count: 10
VIVA QUESTIONS:
1.How to find the last modified file or the newest file in a directory?
$ ls -lrt | grep ^- | awk 'END{print $NF}'
2.How to access the 10th command line argument in a shell script in Linux?
$1 for 1st argument, $2 for 2nd, etc... For 10th argument, ${10}, for 11th, ${11} and so on.
3. How to find the sum of all numbers in a file in Linux?

$ awk '{x+=$0}END{print x}' file
4. How to delete a file which has some hidden characters in the file name?
Since the rm command may not be able to delete it, the easiest way to delete a file with some hidden
characters in its name is to delete it with the find command using the inode number of the file.
$ ls –li
total 32
9962571 -rw-r--r-- 1 guru users 0 Apr 23 11:35
$ find . -inum 9962571 -exec rm '{}' \;
5.Using the grep command, how can you display or print the entire file contents?
$ grep '.*' file
6.What is the difference between a local variable and environment variable in Linux?
A local variable is the one in which the scope of the variable is only in the shell in which it is defined.
An environment variable has scope in all the shells invoked by the shell in which it is defined.
24
Aim: write a c program that simulates cp command (using system calls)

Description:
cp command is used to move or rename a file
syntax:
cp file1 file2
here data in file 1 is copied to file2
Algorithm:
step 1:read the file from keyboard if the file exists
step 2:write data into the file by means of cat command
step 3:if file not exists, create new file
step 4: copy data of file to another by means of cp command
if target file exists cp command overwrites or replaces with new file
step 5:display contents of copied file by cat command in terminal
Program file name:10.c

#include<fcntl.h>
#include<sys/stat.h>
#include<stdio.h>
#define BS 1024
int main(void)
{
int fd1,fd2;
int n;
char sf[12],df[12];
char buf[BS];
printf("Enter a source file name\n");
scanf("%s",sf);
printf("Enter dest file name\n");
scanf("%s",df);
fd1=open(sf,O_RDONLY);
fd2=open(df,O_WRONLY | O_CREAT | O_TRUNC,S_IRUSR | S_IWUSR );
printf("SOURCE FILE IS:%s\n",sf);
printf("DESTINATION FILE IS:%s\n",df);
while((n=read(fd1,buf,BS))>0)
write(fd2,buf,n);
close(fd1);
close(fd2);
printf("Copied sucessfully..\n");
}
Executing the program:

step 1:
create above program by using vi editor
[root@localhost lab]$ vi 10.c
step 2: compiling above program
[root@localhost lab]$ cc -o 10.c sample.c
-o creates an executable file 11a
step 3: use ls command to verify whether the file that is to be copies is existing in
present
25
Aim: implement in c language the following Unix commands using system calls
a)cat b)ls c)mv
a)AIM:-Write a c program to implement cat command using system calls

Description:
cat COMMAND: cat linux command concatenates files and print it on the
standard output.
SYNTAX:
cat [OPTIONS] [FILE]...
OPTIONS:
-A Show all.
-b Omits line numbers for blank space in the output.
-e A $ character will be printed at the end of each line prior to a new line.
-E Displays a $ (dollar sign) at the end of each line.
-n Line numbers for all the output lines.
-s If the output has multiple empty lines it replaces it with one empty line.
-T Displays the tab characters in the output.
-v Non-printing characters (with the exception of tabs, new-lines & form-feeds) are printed
visibly.
Operations With cat Command:
1. To Create a new file:
$cat > file1.txt

This command creates a new file file1.txt. After typing into the file press control+d (^d)
simultaneously to end the file.
2. To Append data into the file:

$cat >> file1.txt
To append data into the same file use append operator >> to write into the file, else the file will be
overwritten (i.e., all of its contents will be erased).
3. To display a file:
$cat file1.txt
This command displays the data in the file.
4. To concatenate several files and display:
$cat file1.txt file2.txt

The above cat command will concatenate the two files (file1.txt and file2.txt) and it will display the
output in the screen. Some times the output may not fit the monitor screen. In such situation you can
print those files in a new file or display the file using less command.
cat file1.txt file2.txt | less
5. To concatenate several files and to transfer the output to another file.

$cat file1.txt file2.txt > file3.txt
In the above example the output is redirected to new file file3.txt. The cat command will create new
file file3.txt and store the concatenated output into file3.txt.
Algorithm:
Step 1:Start
26
Step 2:read arguments from keyboard at command line
Step 3:if no of arguments are less than two print ENTER CORRECT ARGUMENTS
Else goto step 4
Step4:read the date from specified file and write it to destination file
Step 5 :stop
Program file name:11a.c
#include<stdio.h>
#include<sys/types.h>
#include<stdlib.h>
#include<fcntl.h>
int main(int argc,char *argv[])
{
int fd,n;
char buff[512];
if(argc!=2)
printf("ENTER CORRECT ARGUMENTS :");
if((fd=open(argv[1],4))<0)
{
printf("ERROR");
return 0;
}
while(n=read(fd,buff,sizeof(buff))>0)
write(1,buff,n);
}
b)AIM:-Write a c program to implement ls command using system calls

Description:
ls command is used to list the files present in a directory
Algorithm:
Step 1. Start.
Step 2. open directory using opendir( ) system call.
Step 3. read the directory using readdir( ) system call.
Step 4. print dp.name and dp.inode .
Step 5. repeat above step until end of directory.
Step 6: Stop.
Program name: 11b.c

#include<stdio.h>
#include<dirent.h>
void quit(char*,int);
int main(int argc,char **argv )
{
DIR *dirop;
struct dirent *dired;
if(argc!=2)
{
printf("Invalid number of arguments\n");
}
27
if((dirop=opendir(argv[1]))==NULL)
printf("Cannot open directory\n");
while((dired=readdir(dirop))!=NULL)
printf("%10d %s\n",dired>d_ino,dired>d_name);
closedir(dirop);
}
c)Aim :write a c program that simulates mv command (using system calls)

Description:
mv command is used to move or rename a file
synatax:
mv file1 file2
here file1 is renamed as file2
Algorithm:
Step 1: Start
Step 2: open an existed file and one new open file using open() system call
Step 3: read the contents from existed file using read( ) system call
Step 4:write these contents into new file using write system call using write( ) system
call
Step 5: repeat above 2 steps until eof
Step 6: close 2 file using fclose( ) system call
Step 7: delete existed file using using unlink( ) system
Step 8: Stop.
Program File name:11c.c
#include<stdio.h>
#include<string.h>
int main(int argc ,char *argv[])
{
int r,i;
char p[20],q[20];
if(argc<3)
printf("improper arguments\n file names required\n");
else
if( argc==3)
{
printf("\n%s\n",argv[1],argv[2]);
r=link(argv[1],argv[2]);
printf("%d\n",r);
unlink(argv[1]);
}
else
{
for(i=1;i<argc-1;i++)
{
strcpy(p,argv[argc-1]);
strcat(p,"/");
strcat(p,argv[i]);
28
printf("%s%s\n",argv[i],p);
link(argv[i],p);
unlink(argv[i]);
}
}
}
29
Aim:Write a C program that takes one or more file/directory names as
command line input and reports following information
A)File Type B)Number Of Links
c)Time of last Acces D) Read,write and execute permissions
Algorithm:
Step 1:start
Step 2:Declare struct stat a
Step 3:read arguments at command line
Step 4: set the status of the argument using stat(argv[i],&a);
Step 5:Check whether the given file is Directory file by using S_ISDIR(a.st_mode)
if it is a directory file print Directory file
Else
print is Regular file
Step6: print number of links
Step 7:print last time access
Step 8:Print Read,write and execute permissions
Step 9:stop
Program File name: 13.c

#include<stdio.h>
#include<time.h>
int main(int argc,char *argv[])
{
int i,j;
struct stat a;
for (i=1;i<argc;i++)
{
printf("%s : ",argv[i]);
stat(argv[i],&a);
if(S_ISDIR(a.st_mode))
{
printf("is a Directory file\n");
}
else
{
printf("is Regular file\n");
}
printf("******File Properties********\n");
printf("Inode Number:%d\n",a.st_ino);
printf("UID:%o\n",a.st_uid); printf("GID:
%o\n",a.st_gid);
printf("No of Links:%d\n",a.st_nlink);
printf("Last Access time:%s",asctime(localtime(&a.st_atime)));
printf("Permission flag:%o\n",a.st_mode%512);
printf("size in bytes:%d\n",a.st_size);
printf("Blocks Allocated:%d\n",a.st_blocks);
printf("Last modification time %s\n",ctime(&a.st_atime)); } }
30
EXPERIMENT NO: 13
Aim:Write a C program to emulate unix ls -l command-line
ALGORITHM :
Step 1: Include necessary header files for manipulating directory.

Step 2: Declare and initialize required objects.
Step 3: Read the directory name form the user.
Step 4: Open the directory using opendir() system call and report error if the directory
is
not available.
Step 5: Read the entry available in the directory.
Step 6: Display the directory entry ie., name of the file or sub directory.
Step 7: Repeat the step 6 and 7 until all the entries were read.
Step 8 :stop
#include<fcntl.h>
#include<stdio.h>
#include<dirent.h>
#include<unistd.h>
#include<sys/stat.h>main()
{
char dirname[10];
DIR *p;
struct dirent *d;
printf("Enter directory name ");
scanf("%s",dirname);
p=opendir(dirname);
if(p==NULL)
{
perror("Cannot find dir.");
exit(-1);
}
while(d=readdir(p))
printf("%s\n",d->d_name);
}
31
EXPERIMENT NO: 14
Aim:Write a C program to list every file in directory,its inode number and file name
Algorithm:
Step 1:Start
Step 2:Read Directory name
Step 3:open the directory
Step 4: print file name and Inode number of each file in the directory
Step 5:Stop
#include<fcntl.h>
#include<stdio.h>
#include<dirent.h>
int main(int argc,char*argv[])
{
DIR *dirop;
struct dirent *dired;
if(argc!=2)
{
printf("Invalid number of arguments\n");
}
else if((dirop=opendir(argv[1]))==NULL)
printf("Cannot open Directory\n");
else
{
printf("%10s %s \n","Inode","File Name");
while((dired=readdir(dirop))!=NULL)
printf("%10d %s\n ",dired->d_ino,dired->d_name);
closedir(dirop);
}
return 0;
}
32
Aim:Write a C program to demonstrate redirection of standard output to a file ex: ls>f1
Algorithm:
Step 1: create a file pointer
FILE *fd;
Step 2:open the pipe for reading the data of ls –l command
fd=popen("ls -l","r");
step 3: read the data from pipe and store it in line buffer
while((fgets(line,200,fd))!=NULL) print ("%s\n",line);
step 4: create a file
if((f1=creat("xx.txt",0644))<0)
print ERROR IN CREATING
step 5:read the data from line and store it to file
while((n=read(line,buff,sizeof(buff)))>0)
write(f1,line,n);
step 6:stop
Program file name :15.c
#include <string.h> /* String functions (strcat) */

#include <stdio.h> /* printf, etc. */
#include <stdlib.h> /* exit, etc. */
/* Define all the error messages */

char * error_msg[] = {
"\nUsage: ./15redir [<text-file>] [\"<string>\"]\n\n",
"\nCould not open the file for writing\n\n"
};
/* Prototype definition of function “print_error” */
void print_error(int msg_num, int exit_code);
int main(int argc, char * argv[])

{
FILE * file_to_write; /* Handle to file to be written */
char * name_of_file_to_be_written = "redir.txt";
char * text_to_be_written = "This text was redirected from standard output";
/* Check if correct number of arguments are supplied */

if ( argc > 3 )
print_error(0,2);
/* Check if first argument was supplied */
if ( argc == 2 )
{
name_of_file_to_be_written = argv[1];
}
/* Check if both arguments were supplied */

if ( argc == 3 )
{
33
name_of_file_to_be_written = argv[1];
text_to_be_written = argv[2];
}
/* Open the file in append mode */

if ( (file_to_write = fopen(name_of_file_to_be_written, "a+")) == NULL )
print_error(1,3);
/* Redirect standard output to the file */

dup2(fileno(file_to_write),fileno(stdout));
/* Write the text to standard output */

printf("%s\n",text_to_be_written);
return 1;
}
void print_error(int error_index, int exit_code)

{
fprintf(stderr, "%s", error_msg[error_index]);
exit(exit_code);
}
34
Aim:Write a C program to create child process and allow parent process to display “parent”
and the child to display “child” on the screen
Algorithm:
Step 1: start
Step2: call the fork() function to create a child process
fork function returns 2 values
step 3: which returns 0 to child process
step 4:which returns process id to the parent process
step 5:stop

#include<stdio.h>
#include<stdlib.h>
#include<unistd.h>
int main()
{
int pid,pid1,pid2;
pid=fork();
if(pid==-1)
{
printf("ERROR IN PROCESS CREATION \n");
exit(0);
}
if(pid!=0)
{
pid1=getpid();
printf("\n the parent process ID is %d", pid1);
}
else
{
pid2=getpid();
printf("\n the child process ID is %d\n", pid2);
}
}
Execution:
[root@dba ~]# cc -o 16 16.c

[root@dba ~]# ./16
the child process ID is 4485

the parent process ID is 4484
35
Aim:Write a C program to create zombie process
Algorithm:
Step 1:call fork function to create a child process
Step 2:if fork()>0
Then creation of Zombie
By applying sleep function for 10 seconds
Step 3: now terminate the child process
Step 4: exit status child process not reported to parent
Step 5: status any process which is zombie can known by
Applying ps(1) command
Step 6: stop

#include <stdio.h>
#include<stdlib.h>
int main()
{
int pid;
pid=fork();
if(pid == 0)
{
printf("Iam child my pid is %d\n",getpid());
printf("My parent pid is:%d\n",getppid());
exit(0);
}
else
{
printf("I am parent, my pid is %d\n",getpid());
sleep(100);
exit(0);
}
}
Execution:
To see zombie process, after running the program, open a new terminal Give this
command $ps -el|grep a.out
First terminal
Compilation:
[root@dba ~]# cc 17.c
Executing binary
[root@dba ~]# ./a.out
Iam child my pid is 4732
My parent pid is:4731
36
I am parent, my pid is 4731
Checking for zombie process. Z means zombie process

Second terminal
[root@dba ~]# ps -el|grep a.out
0 S 0 4731 4585 0 77 0 - 384 - pts/3 00:00:00 a.out
1 Z 0 4732 4731 0 77 0 - 0 exit pts/3 00:00:00 a.out <defunct>
37
Aim:-Write a C program to illustrate how an orphan process is created
Algorithm:
Step 1: call the fork function to create the child process
Step 2:if (pid==0)
Then print child id and parent id
else goto step 4
Step 3:Then sleep(10)
Print child id and parent id
Step 4: Print child id and parent id
Step 5:which gives the information of orphan process
Step 6:stop

#include <stdio.h>
#include<stdlib.h>
int main()
{
int pid;
printf("I am the original process with PID %d and PPID %d\n",getpid(),getppid());
pid=fork();
if(pid == 0)
{
printf("I am child, my pid is %d ",getpid());
printf("My Parent pid is:%d\n",getppid());
sleep(10);
printf("Now my pid is %d ",getpid());
printf("My parent pid is:%d\n",getppid());
exit(0);
}
else
{
sleep(10);
printf("I am parent, my pid is %d\n",getpid());
//printf("I am going to die\n");
}
printf("PID:%d terminates...\n",getpid());
}
Execution:
Compilation :
[root@dba ~]# cc -o 18 18-1.c
Executing Binary:
[root@dba ~]# ./18
I am the original process with PID 5960 and PPID 5778
I am child, my pid is 5961 My Parent pid is:5960
I am parent, my pid is 5960
PID:5960 terminates...
[root@dba ~]# Now my pid is 5961 My parent pid is:1
38
Aim:-Write a C program that illustrate how to execute two commands concurrently with a
command pipe Ex: ls –l|sort
Algorithm:
step 1:Start
step 2:call the fork function to create child process
Step 3 : if process id =0 goto step 4
else goto step 7
close writing option
Step 4:copy the old file descriptor
Step 5:exec the command ls –l(long listing files)
This process will be executed by child
Step 6: goto step 11
step 7:Close reading option
step 8: Copy old file descriptor
step 9:exec the command wc t count no of lines, words, characters
step 10: both commands concurrently executed by pipe
step 11:stop
program File name :19.c

#include<stdio.h>
#include<fcntl.h>
main()
{
int pfd[2],p;
pipe(pfd);
p=fork();
if(p==0)
{
close(pfd[0]);
close(1);
dup(pfd[1]);
execlp("ls","ls","-l",(char*)0);
}
else
{
close(pfd[1]);
close(0);
dup(pfd[0]); execlp("wc","wc",(char*)0);
}
}
39
Aim:- Write a C program that illustrate communication between two unrelated process using
named pipes
Algorithm for server :

step 1:Start
step 2:Create a first named pipe by using mkfifo system call
Pipe1=mkfifo(NP1,0666).
step 3:if mkfifo returns -1 then
print a message that error in creating the pipe.
step 4:Create a second named pipe by using mkfifo system call
Pipe2=mkfifo(NP2,0666).
step 5:if mkfifo returns -1 then
print a message that error in creating the pipe.
step 6:Open the first pipe for reading by open system call by setting
O_RDONLY Fd=open(NP1,O_RDONLY)
step 7: Open the second pipe for writing by open system call by setting
O_WRONLY Fd=open(NP2,O_WRONLY)
step 8:read the data from the first pipe by using read system call
numread=Read(fd,buf,MAX_BUF-SIZE) buf*numread+=‟\0‟
step 9:print the data that we have read from pipe
step 10:convert the data to the upper case.
step 11:write the converted string back to second pipe by write(fd,buf, strlen(buf))
step 12:stop.
Algorithm for client :
Step 1:start
Step 2:check whether the no of arguments specified were correct or not
Step 3:if no of arguments are less then print error message
Step 4:Open the first named pipe for writing by open system call by setting
O_WRONLY Fd=open(NP1,O_WRONLY)
Step 5: .Open the second named pipe for reading by open system call by setting
O_RDONLY Fd=open(NP2,O_RDONLY)
Step 6: write the data to the pipe by using write system call
write(fd,argv[1],strlen(argv[1]))
Step 7: read the data from the first pipe by using read system call
numread=Read(fd,buf,MAX_BUF_SIZE) buf*numread+=‟\0‟
Step 8: print the data that we have read from pipe
Step 9:stop
#include<stdio.h>
#include<stdlib.h>
#include<sys/types.h>
#include<string.h>
#include<fcntl.h>
40
void server(int,int);
void client(int,int);
int main()
{
int p1[2],p2[2],pid;
pipe(p1);
pipe(p2);
pid=fork();
if(pid==0)
{ close(p1[1]);
close(p2[0]);
server(p1[0],p2[1]);
return 0;
}
close(p1[0]);
close(p2[1]);
client(p1[1],p2[0]);
wait();
return 0;
}
void client(int wfd,int rfd)

{
int i,j,n;
char fname[2000];
char buff[2000];
printf("ENTER THE FILE NAME :");
scanf("%s",fname);
printf("CLIENT SENDING THE REQUEST.....PLEASE WAIT\n");
sleep(10);
write(wfd,fname,2000);
n=read(rfd,buff,2000);
buff[n]='\0';
printf("THE RESULTS OF CLIENTS ARE......\n");
write(1,buff,n);
}
void server(int rfd,int wfd)
{
int i,j,n; char fname[2000]; char
buff[2000];
n=read(rfd,fname,2000);
fname[n]='\0';
int fd=open(fname,O_RDONLY);
sleep(10);
if(fd<0)
write(wfd,"can't open",9);
else
n=read(fd,buff,2000);
write(wfd,buff,n);
}
41
42
Aim:Write a C program to create message queue with read and write permissions to write 3
messages to it with different priority numbers
Algorithm:
Step 1.Start
Step 2.Declare a message queue structure
typedef struct msgbuf {
long mtype;
char mtext[MSGSZ];
} message_buf;
Mtype =0 Retrieve the next message on the queue, regardless of its mtype.
Positive Get the next message with an mtype equal to the specified
msgtyp.
Negative Retrieve the first message on the queue whose mtype field is
less than or equal to the absolute value of the msgtyp argument.
Usually mtype is set to1 and mtext is the data this will be added to the queue.
Step 3.Create message queue and store result in msgflg
msgflg = IPC_CREAT | 0666
msgflg argument must be an octal integer with settings for the queue's
permissions and control flags.
Step 4. Get the message queue id for the "name" 1234, which was created by the
server
key = 1234
Step 5. if ((msqid = msgget(key, msgflg )) < 0)

Then print error
The msgget() function shall return the message queue identifier associated
with the argument key.
Step 6. otherwise
Print msgget succeeded: msqid
Step 7. Now we will send message of type 1 through message queue
message_buf sbuf sbuf.mtype=1
Step 8.mtext contains data to be send through message queue By using strcpy function
we we
will copy some message Into mtext
strcpy(sbuf.mtext, "Did you get this?")
Step 9. then find the length of text by using strlen function buf_length =
strlen(sbuf.mtext) + 1
Step 10.now we will send message to message to the message queue By using msgsnd
function
#include < sys/msg.h>
int msgsnd(int msqid, const void *msgp, size_t msgsz, int msgflg);
msgsnd(msqid, &sbuf, buf_length, IPC_NOWAIT)msqid: message queue id
&sbuf: pointer to user defined structure Buf_length :length of data
IPC_NOWAIT: returns error on wait
Step 11.if msgsnd <0 return error
Step 12.otherwise print message sent is sbuf.mext
13.stop
43
Programs
Header file: msg1.h
#define MAX_MSG_LEN 200 /* Maximum message length */

#define MSGQ_KEY 100 /* An arbirary key (name) for message queue */
#define BLOCKED 0 /* Flag value of 0 in 'msgsnd' indicates 'block possible */
#define NUM_MSGS 3 /* Number of messages in the queue */
struct struct_msg_datagram /* Structure to hold messages in the queue */

{
long mtype; /* Message type */
char mtext[MAX_MSG_LEN]; /* Message text */
};
void print_qstat(int qd, struct msqid_ds * qstat)

{
printf("PID = %d\n", getpid());
printf("Queue %d Status:\n----------------------\n", (int)qd); printf("# of
messages in queue = %d\n", (int)qstat->msg_qnum); printf("Queue owner's
effective user ID = %d\n", (int)qstat->msg_perm.uid);
printf("Queue owner's effective group ID = %d\n", (int)qstat->msg_perm.gid);
printf("Queue creator's effective user ID = %d\n", (int)qstat->msg_perm.cuid);
printf("Queue creator's effective group ID = %d\n", (int)qstat->msg_perm.cgid);
printf("Permissions = %o\n", (int)qstat->msg_perm.mode);
printf("Last sender's PID = %d\n", (int)qstat->msg_lspid);
printf("Last receiver's PID = %d\n", (int)qstat->msg_lrpid);
printf("Time of last send = %s", ctime(&qstat->msg_stime));
printf("Time of last receive = %s", ctime(&qstat->msg_rtime));
printf("Time of last change = %s\n", ctime(&qstat->msg_ctime));
}
Writer:writer21.c
#include <string.h> /* strcpy, strlen, etc. */
#include <time.h> /* ctime, etc. */
#include <sys/msg.h> /* msgget, msgsnd, msgrcv, MSGMAX, etc. */
#include <sys/types.h> /* Data type 'key_t' for 1st arg of 'msgget' */
#include <sys/ipc.h> /* 'struct ipc_perm' in 'struct msgid_ds' in 'msgctl' */
#include "21msgq1.h" /* User defined header file for message queues */

"\nUsage: ./21msgqwrite1\n\n",
"\nError while creating message queue with 'msgget'\n\n",
"\nError while sending message to queue with 'msgsnd'\n\n",
"\nError while retrieving status of queue with 'msgctl'\n\n"
};
44
/* Declare the prototype for function 'print_error' */
/* Declare the prototype for function 'print_qstat' */

void print_qstat(int qd, struct msqid_ds * qstat);

{
int i; /* A local counter */
int qd; /* Queue descriptor */
struct struct_msg_datagram msg_datagram; /* Holds msg type and msg text */
struct msqid_ds qstat; /* To retrieve queue status */
char * message[] = { /* Messages for the queue */
"Message 1, Linux is powerful",
"Message 2, These are System V standards of message queues",
"Message 3, Message queues is just 1 mechanism for IPC",
"Message 4, Other IPC mechanisms include semaphores",
"Message 5, Still other mechanism for IPC is shared memory",
"Message 6, Further more memory mapped I/O also allows IPC"
};
/* Check if server is run using correct syntax */

if ( argc != 1 )
print_error(0,2);
/* Try to get the queue descriptor */

if ( ( qd = msgget(MSGQ_KEY, IPC_CREAT | 0666) ) == -1 )
print_error(1,3);
/* Retrieve queue status */

if ( (msgctl(qd, IPC_STAT, &qstat)) == -1 )
print_error(3,5);
/* Display the initial status of queue */

printf("\nMessage queue created with ID %d\n\n", qd);
printf("Initial status of queue is as follows:\n");
print_qstat(qd, &qstat);
/* Write down the messages to the queue */

for ( i = 0; i < NUM_MSGS; i++ )
{
/* Prepare the message datagram */
msg_datagram.mtype = i+1;
sprintf(msg_datagram.mtext,"%s",message[i]);
printf("\nSending to queue %d the message:\n\t'%s'\n\n", qd, message[i]);
/* Send the message to queue */

if ( (msgsnd(qd, &msg_datagram, strlen(message[i])+1, BLOCKED)) == -1 )
print_error(2,4);
45
print_error(3,5);
/* Display the current status of queue */

printf("Current status of queue is as follows:\n");
}
return 0;
}
{
exit(exit_code);
}
Reader:reader21.c

#include <string.h> /* strcpy, strlen, etc. */
#include <time.h> /* ctime, etc. */
#include <sys/msg.h> /* msgget, msgsnd, msgrcv, MSGMAX, etc. */
#include <sys/types.h> /* Data type 'key_t' for 1st arg of 'msgget' */
#include <sys/ipc.h> /* 'struct ipc_perm' in 'struct msgid_ds' in 'msgctl' */
#include "21msgq1.h" /* User defined header file for message queues */

"\nUsage: ./22msgqread1\n\n",
"\nError while acquiring message queue with 'msgget'\n\n",
"\nError while receiving message from queue with 'msgsnd'\n\n",
"\nError while retrieving status of queue with 'msgctl'\n\n"
};
/* Declare the prototype for function 'print_error' */

/* Declare the prototype for function 'print_qstat' */

void print_qstat(int qd, struct msqid_ds * qstat);

{
int i; /* A local counter */
int qd; /* Queue descriptor */
struct struct_msg_datagram msg_datagram; /* Holds msg type and msg text */
struct msqid_ds qstat; /* To retrieve queue status */
char message[NUM_MSGS][MAX_MSG_LEN]; /* Messages for the queue */
int num_bytes_read; /* Actual num of bytes read from msg queue */
/* Check if server is run using correct syntax */

if ( argc != 1 )
46
print_error(0,2);
/* Try to get the queue descriptor */

if ( ( qd = msgget(MSGQ_KEY, 0) ) == -1 )
print_error(1,3);

print_error(3,5);
/* Display the initial status of queue */

printf("\nMessage queue acquired with ID %d\n\n", qd);
printf("Initial status of queue is as follows:\n");
/* Read the messages from the queue */

for ( i = 0; i < NUM_MSGS; i++ )
{
/* Retrieve a message datagram from queue */
if ( (num_bytes_read =
msgrcv(qd, &msg_datagram, MAX_MSG_LEN, i+1, IPC_NOWAIT |
MSG_NOERROR)
)
== -1
)
print_error(2,4);
/* Extract the message from datagram */

sprintf(message[i],"%s",msg_datagram.mtext);
printf("\nRetrieved from queue %d the message (%d bytes read):\n\t'%s'\n\n",

qd, num_bytes_read, message[i]);

print_error(3,5);
/* Display the current status of queue */
printf("Current status of queue is as follows:\n");
}
return 0;
}
{
exit(exit_code);
}
47
Aim:-Write a C program that receives a message from message queue and display them
Algorithm:
Step 1:Start
Step 2:Declare a message queue structure
typedef struct msgbuf {
long mtype;
char mtext[MSGSZ];
} message_buf;
Mtype =0 Retrieve the next message on the queue, regardless of its mtype.
PositiveGet the next message with an mtype equal to the specified
msgtyp.
Negative Retrieve the first message on the queue whose mtype field is
less than or equal to the absolute value of the msgtyp argument.
Usually mtype is set to1
mtext is the data this will be added to the queue.
Step 3:Get the message queue id for the "name" 1234, which was created by the server
key = 1234
Step 4 : if ((msqid = msgget(key, 0666< 0) Then print error
The msgget() function shall return the message queue identifier associated with the argument
key.
Step 5: Receive message from message queue by using msgrcv function
int msgrcv(int msqid, void *msgp, size_t msgsz, long msgtyp, int msgflg);
#include < sys/msg.h>
(msgrcv(msqid, &rbuf, MSGSZ, 1, 0)
msqid: message queue id
&sbuf: pointer to user defined structure MSGSZ: message size
Message type: 1
Message flag:The msgflg argument is a bit mask constructed by ORing together zero
or more of the following flags: IPC_NOWAIT or MSG_EXCEPT or
MSG_NOERROR
Step 6:if msgrcv <0 return error
Step 7:otherwise print message sent is sbuf.mext
Step 8:stop
48
Aim:-Write a C program that illustrate the suspending and resuming process using signal
Algorithm:
Step 1: call the signal function to generate the signal
Step 2:execution of process will be started
Step 3:call alarm function to suspend the execution of current process
Step 4:then it will execute the signal function
Step 5:again the process will be resumed
Step 6:stop
Program
#include<stdio.h>
int main()
{
int n;
if(signal(SIGALRM,sig_alarm)==SIG_ERR)
printf(‚Signal error‛);
alarm(5);
for(n=0;n<=15;n++)
printf(‚from for loop n=%d‛,n);
printf(‚main program terminated‛);
}
void sig_alarm(int signo)

{
printf(‚from sigalarm function‛);
}
49
Aim:-Write client server programs using c for interaction between server and client process
using Unix Domain sockets
Algorithm:-
Sample UNIX server
Step 1:define NAME "socket"
Step 2: sock = socket(AF_UNIX, SOCK_STREAM, 0);
Step 3:if (sock < 0) perror("opening stream socket"); exit(1);
step4: server.sun_family = AF_UNIX;
strcpy(server.sun_path, NAME);
if (bind(sock, (struct sockaddr *) &server, sizeof(struct sockaddr_un)))
{
perror("binding stream socket"); exit(1);
}
step 5: print ("Socket has name %s\n", server.sun_path);
listen(sock, 5);
step 6: for (;;)
{
msgsock = accept(sock, 0, 0);
if (msgsock == -1)
perror("accept");
else
do { bzero(buf, sizeof(buf));
if ((rval = read(msgsock, buf, 1024)) < 0)
perror("reading stream message");

else if (rval == 0)
else print ("-->%s\n", buf);
} while (rval > 0);
close(msgsock);
}
close(sock);
unlink(NAME);
}
Step 7:stop
Programs:
Server.c
#include <stdio.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <sys/types.h>
#include <unistd.h>
#include <string.h>
50
int connection_handler(int connection_fd)
{
int nbytes;
char buffer[256];
nbytes = read(connection_fd, buffer, 256);
buffer[nbytes] = 0;
printf("MESSAGE FROM CLIENT: %s\n", buffer);
nbytes = snprintf(buffer, 256, "hello from the server");
write(connection_fd, buffer, nbytes);
close(connection_fd);
return 0;
}
int main(void)
{
struct sockaddr_un address;
int socket_fd, connection_fd;
socklen_t address_length;
pid_t child;
socket_fd = socket(PF_UNIX, SOCK_STREAM, 0);
if(socket_fd < 0)
{
printf("socket() failed\n");
return 1;
}
unlink("./demo_socket");
/* start with a clean address structure */

memset(&address, 0, sizeof(struct sockaddr_un));
address.sun_family = AF_UNIX;
snprintf(address.sun_path, UNIX_PATH_MAX, "./demo_socket");
if(bind(socket_fd,
(struct sockaddr *) &address,
sizeof(struct sockaddr_un)) != 0)
{
printf("bind() failed\n");
return 1;
}
if(listen(socket_fd, 5) != 0)
{
printf("listen() failed\n");
51
return 1;
}
while((connection_fd = accept(socket_fd,
&address_length)) > -1)
{
child = fork();
if(child == 0)
{
/* now inside newly created connection handling process */
return connection_handler(connection_fd);
}
/* still inside server process */
close(connection_fd);
} close(socket_fd);
unlink("./demo_socket");
return 0;
}
Client.c
#include <stdio.h>
#include <sys/un.h>
#include <unistd.h>
#include <string.h>
int main(void)
{
struct sockaddr_un address;
int socket_fd, nbytes;
char buffer[256];
socket_fd = socket(PF_UNIX, SOCK_STREAM, 0);

if(socket_fd < 0)
{
printf("socket() failed\n");
return 1;
}
/* start with a clean address structure */
memset(&address, 0, sizeof(struct sockaddr_un));
address.sun_family = AF_UNIX;
snprintf(address.sun_path, UNIX_PATH_MAX, "./demo_socket");
52
if(connect(socket_fd,
sizeof(struct sockaddr_un)) != 0)
{
printf("connect() failed\n");
return 1;
}
nbytes = snprintf(buffer, 256, "hello from a client");
write(socket_fd, buffer, nbytes);
nbytes = read(socket_fd, buffer, 256);

buffer[nbytes] = 0;
printf("MESSAGE FROM SERVER: %s\n", buffer);
close(socket_fd);
return 0;
}
53
Aim:-Write client server programs using c for interaction between server and client process using
Internet Domain sockets
Programs
Server.c
#include <netinet/in.h>
#include <arpa/inet.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
#include <time.h>
int main(int argc, char *argv[])

{
int listenfd = 0, connfd = 0;
struct sockaddr_in serv_addr;
char sendBuff[1025];
time_t ticks;
listenfd = socket(AF_INET, SOCK_STREAM, 0);

memset(&serv_addr, '0', sizeof(serv_addr));
memset(sendBuff, '0', sizeof(sendBuff));
serv_addr.sin_family = AF_INET;
serv_addr.sin_addr.s_addr = htonl(INADDR_ANY);
serv_addr.sin_port = htons(5000);
bind(listenfd, (struct sockaddr*)&serv_addr, sizeof(serv_addr));
listen(listenfd, 10);
while(1)
{
connfd = accept(listenfd, (struct sockaddr*)NULL, NULL);
ticks = time(NULL);
snprintf(sendBuff, sizeof(sendBuff), "%.24s\r\n", ctime(&ticks));
54
write(connfd, sendBuff, strlen(sendBuff));
close(connfd);
sleep(1);
}
}
Client.c
#include <netinet/in.h>
#include <netdb.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <arpa/inet.h>
int main(int argc, char *argv[])

{
int sockfd = 0, n = 0;
char recvBuff[1024];
struct sockaddr_in serv_addr;
if(argc != 2)
{
printf("\n Usage: %s <ip of server> \n",argv[0]);
return 1;
}
memset(recvBuff, '0',sizeof(recvBuff));
if((sockfd = socket(AF_INET, SOCK_STREAM, 0)) < 0)
{
printf("\n Error : Could not create socket \n");
return 1;
}
memset(&serv_addr, '0', sizeof(serv_addr));
serv_addr.sin_family = AF_INET;
serv_addr.sin_port = htons(5000);
if(inet_pton(AF_INET, argv[1], &serv_addr.sin_addr)<=0)

{
55
printf("\n inet_pton error occured\n");
return 1;
}
if( connect(sockfd, (struct sockaddr *)&serv_addr, sizeof(serv_addr)) < 0)

{
printf("\n Error : Connect Failed \n");
return 1;
}
while ( (n = read(sockfd, recvBuff, sizeof(recvBuff)-1)) > 0)

{
recvBuff[n] = 0;
if(fputs(recvBuff, stdout) == EOF)
{
printf("\n Error : Fputs error\n");
}
}
if(n < 0)
{
printf("\n Read error \n");
}
return 0;
}
56
Aim:-Write a C program that illustrates two processes communicating using Shared
memory
Algorithm:-
step1.Start
step 2.Include header files required for the program are
#include <sys/ipc.h>
#include <sys/shm.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
step 3.Declare the variable which are required as
pid_t pid
int *shared /* pointer to the shm */
int shmid
step 4.Use shmget function to create shared memory
int shmget(key_t key, size_t size, int shmflg)
The shmget() function shall return the shared memory identifier associated with key
The argument key is equal to IPC_PRIVATE. so that the operating system selects the next
available key for a newly created shared block of memory. Size represents
size of shared memory block Shmflg shared memory permissions which are represented by
octal integer
shmid = shmget (IPC_PRIVATE, sizeof(int), IPC_CREAT | 0666);
print the shared memory id
step 5.if fork()==0 Then
begin
shared = shmat(shmid, (void *) 0, 0)
print the shared variable(shared) *shared=2
print *shared sleep(2)
print *shared
end
step 6.else
begin
shared = shmat(shmid, (void *) 0, 0)
print the shared variable(shared)
print *shared sleep(1) *shared=30
printf("Parent value=%d\n", *shared);
sleep(5)
shmctl(shmid, IPC_RMID, 0)
end
step 7.stop.
#include <sys/ipc.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
57
int main(void) {
pid_t pid;
int *shared; /* pointer to the shm */ int shmid;
shmid = shmget(IPC_PRIVATE, sizeof(int), IPC_CREAT | 0666); printf("Shared Memory
ID=%u",shmid);
if (fork() == 0) { /* Child */
/* Attach to shared memory and print the pointer */ shared = shmat(shmid, (void *) 0, 0);
printf("Child pointer %u\n", shared); *shared=1;
printf("Child value=%d\n", *shared); sleep(2);
printf("Child value=%d\n", *shared); } else { /* Parent */
/* Attach to shared memory and print the pointer */ shared = shmat(shmid, (void *) 0, 0);
printf("Parent pointer %u\n", shared); printf("Parent value=%d\n", *shared); sleep(1);
*shared=42;
printf("Parent value=%d\n", *shared); sleep(5);
shmctl(shmid, IPC_RMID, 0);
}
sampath@localhost ipc]$cc shared_mem.c

[sampath@localhost ipc]$ ./a.out
Shared Memory ID=65537Child pointer 3086680064 Child value=1
Shared Memory ID=65537Parent pointer 3086680064 Parent value=1
Parent value=42 Child value=42
1.define shared memory

2.what are file locking functions. 3.what are shared memory system calls.
4.define internet domain sockets
5.Difference between internet and unix domain sockets.
58

Laboratory Manual Data Warehousing and Mining Lab: Department of Computer Science and Engineering

Uploaded by

Copyright:

Available Formats

Laboratory Manual Data Warehousing and Mining Lab: Department of Computer Science and Engineering

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Laboratory Manual Data Warehousing and Mining Lab: Department of Computer Science and Engineering

Uploaded by

Copyright:

Available Formats

LABORATORY MANUAL

DATA WAREHOUSING AND MINING LAB

MALLA REDDY COLLEGE OF ENGINEERING &

PEO1 – ANALYTICAL SKILLS

1. To facilitate the graduates with the ability to visualize, gather information,

PEO2 – TECHNICAL SKILLS

PEO3 – SOFT SKILLS

PEO4 – PROFESSIONAL ETHICS

To facilitate the graduates with the knowledge of professional and

1. Fundamentals and critical knowledge of the Computer System:- Able

2. The comprehensive and Applicative knowledge of Software Development:

3. Applications of Computing Domain & Research: Able to use the

GENERAL L ABO RAT O RY INSTRUCT

Head of the Department Principal

COURSE NAME: DATA WAREHOUSING AND MINING LAB

1. Ability to understand the various kinds of tools.

MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES:

• Ability to add mining algorithms as

DATA WAREHOUSING AND MINING LAB- INDEX

S.No Experiment Name Page No

1 Unit-I Build Data Warehouse and Explore WEKA 03

Unit-II Perform data preprocessing tasks and Demonstrate

3 Unit-III Demonstrate performing classification on data sets 71

4 Unit-IV Demonstrate performing clustering on data sets

5 Unit-V Demonstrate performing Regression on data sets

Task 1: Credit Risk Assessment. Sample Programs using

7 Task 2: Sample Programs using Hospital Management System 137

8 Beyond the Syllabus -Simple Project on Data Preprocessing 139

Unit-I Build Data Warehouse and Explore WEKA

A.(i) Identify source tables and populate sample data.

The data warehouse contains 4 tables:

1. Date dimension: contains every single date from 2006 to 2016.

Create the source tables and populate them

First I’ll show you how it looks when it’s done:

And here is the script to create and populate them:

-- Create customer table

create table Customer

declare @i int, @si varchar(10), @startdate date

select * from Customer

-- Create Van table

create table Van

-- Populate Van table

declare @i int, @si varchar(10)

select * from Van

-- Create Hire table

create table Hire

-- Populate Hire table

select * from Hire

Create the Data Warehouse

First I’ll show you how it looks when it’s done:

-- Create the data warehouse

-- Create Date Dimension

create table DimDate

-- Populate Date Dimension

insert into DimDate (DateKey, [Year], [Month], [Date], DateString)

while @Date <= @EndDate

select * from DimDate

-- Create Customer dimension

create table DimCustomer

WHEN 'P' THEN 'PE' /Person/

WHEN 'O' THEN 'BU' /Business/