KUVEMPU UNIVERSITY sem 6 Study Material Download
KUVEMPU UNIVERSITY sem 6 Study Material All Subjects 2010-2014
BSIT61-Download
Kuvempu University SEM 6 Practical Solutions
Kuvempu University SEM 6 Practical Solutions(By Ashish Kumar NIIT Ranchi admin@trickshackings.com , ashish@trickshackings.com , admin@softwarsmagic.com)
B.Sc(IT)
6th sem Practical question paper with answer...
Set-1
1. Write a program for frame sorting technique used in buffers.
Answer-
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
struct frame
{
int fslno;
char finfo[20];
};
struct frame arr[10]; int n; void sort()
{
int i,j,ex;
struct frame temp;
for(i=0;i<n;i++)
{
ex=0;
for(j=0;j<n-i-1;j++)
if(arr[j].fslno>arr[j+1].fslno)
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
ex++;
}
if(ex==0) break
}
}
void main()
{
int i;
clrscr();
printf(“\n Enter the number of frames \n”);
scanf(“%d”,&n);
for(i=0;i<n;i++)
{
arr[i].fslno=random(50);
printf(“\n Enter the frame contents for sequence number %d\n”,arr[i].fslno);
scanf(“%s”,arr[i].finfo);
}
sort();
printf(“\n The frames in sequence \n”);
for(i=0;i<n;i++)
printf(“\n %d\t%s \n”,arr[i].fslno,arr[i].finfo);
getch(); }
------------------
2. Write a program in C# using command line arguments to display a welcome message.
The message has to be supplied as input in the command line.
Answer-
using System;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
args = new string[1];
Console.Write(“Enter Message Here: “);
args[0] = Console.ReadLine();
Console.WriteLine(“\n” + args[0]);
Console.ReadLine();
}
}
}
------------------
Set -2
1. Write a program for distance vector algorithm to find suitable path for transmission.
Answer-
#include<stdio.h>
#define MAX 10 struct dist_vect
{
int dist[MAX];
int from[MAX];
};
int main()
{
int adj[MAX][MAX],n,i,j,hop[10][10]={{0}},k,count;
struct dist_vect arr[10];
printf(“Enter the number of nodes\n”);
scanf(“%d”,&n);
printf(“Enter adjecency matrix\n”);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
scanf(“%d”,&adj[i][j]);
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
arr[i].dist[j]=adj[i][j];
arr[i].from[j]=j;
}
}
count=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
for(k=0;k<n;k++)
{
if(arr[i].dist[j]>adj[i][k]+arr[k].dist[j])
{
arr[i].dist[j]=adj[i][k]+arr[k].dist[j];
arr[i].from[j]=k;
count++;
if(count==0)hop[i][j]=1;
else hop[i][j]=count+hop[k][j];
}
}
count=0;
}
}
for(i=0;i<n;i++)
{
printf(“State value of router under %d”,i+1);
printf(“\nNode\tvia node\tdistance\tnumber of hops\n”);
for(j=0;j<n;j++)
{
if(i==j)
printf(“\n%d\t%d\t%d\n”,j+1,arr[i].from[j]+1,arr[i].dist[j]);
else
printf(“\n%d\t%d\t\t%d\t\t%d\n”,j+1,arr[i].from[j]+1,arr[i].dist[j],hop[i][j]+1);
}
}
}
------------------
2. Write a program to demonstrate the usage of threads in C#.
Answer-
using System;
using System.Threading;
namespace ConsoleApplication4
{
class Program
{
static void Main()
{
Thread thread1 = new Thread(new ThreadStart(A));
Thread thread2 = new Thread(new ThreadStart(B));
thread1.Start();
thread2.Start();
thread1.Join();
thread2.Join();
}
static void A()
{
Thread.Sleep(100);
Console.WriteLine(‘A’);
}
static void B()
{
Thread.Sleep(1000);
Console.WriteLine(‘B’);
}
}
}
------------------
Set -3
1. Write a program for simple RSA/DES algorithm to encrypt and decrypt the data.
Answer-
#include<stdio.h>
#include<math.h>
double min(double x, double y)
{
return(x<y?x:y);
}
double max(double x,double y)
{
return(x>y?x:y);
}
double gcd(double x,double y)
{
if(x==y)
return(x);
else
return(gcd(min(x,y),max(x,y)-min(x,y)));
}
long double modexp(long double a,long double x,long double n)
{
long double r=1;
while(x>0)
{
if ((int)(fmodl(x,2))==1)
{
r=fmodl((r*a),n);
}
a=fmodl((a*a),n);
x/=2;
}
return(r);
}
int main()
{
long double p,q,phi,n,e,d,cp,cq,dp,dq,mp,mq,sp,sq,rp,rq,qInv,h;
long double ms,es,ds;
do
{
printf(“\n Enter prime numbers p and q:”);
scanf(” %Lf %Lf”,&p,&q);
}
while(p==q);
n=p*q;
phi=(p-1)*(q-1);
do
{
printf(“\n Enter prime value of e:”);
scanf(” %Lf”,&e);
}
while((gcd(e,phi)!=1)&&e>phi);
for(d=1;d<phi;++d)
{
if(fmod((e*d),phi)==1)
break;
}
printf(“\n D within main = %Lf”,d);
printf(“\n Enter the message:”);
scanf(” %Lf”,&ms);
es=modexp(ms,e,n);
ds=modexp(es,d,n);
printf(“\n Original Message : %Lf”,ms);
printf(“\n Encrypted Message : %Lf”,es);
printf(“\n Decrypted Message : %Lf\n”,ds);
return(0);
}
------------------
2. Using Try, Catch and Finally blocks write a program in C# to demonstrate error handling.
Answer-
using System;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
int i, j, divide = 0;
i = 10;
j = 0;
try
{
divide = i / j;
}
catch (DivideByZeroException)
{
divide = 0;
}
finally
{
Console.WriteLine(divide);
}
Console.ReadLine();
}
}
}
------------------
Set-4
1. Write a program for Spanning Tree Algorithm (PRIM) to find loop less path.
Answer-
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#define MAX 20
#define INFINITY 999
#include<conio.h>
enum boolean {FALSE,TRUE};
void prim(int c[][MAX],int t[MAX],int n);
int mincost=0;
int main()
{
int n,c[MAX][MAX],t[2*(MAX-1)];
int i,j;
clrscr();
printf(“\nTo find min path spanning tree”);
printf(“\nEnter no of nodes:”);
scanf(“%d”,&n);
printf(“\nEnter the cost adjacency matrix”);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf(“%d”,&c[i][j]);
prim(c,t,n);
for(i=0;i<2*(n-1);i+=2)
printf(“\n(%d %d)”,t[i]+1,t[i+1]+1);
printf(“\nmincost=%d”,mincost);
getch();
return 0;
}
//using prim’s algorithm for finding shortest path
void prim(int c[][MAX],int t[MAX],int n)
{
int i,j;
enum boolean v[MAX];
int k,s,min,v1,v2;
for(i=0;i<n;i++)
v[i]=FALSE;
v[0]=TRUE;
k=0;
t[k]=1;
s=0;
k++;
while(k<n)
{
min=INFINITY;
for(i=0;i<n;i++)
for(j=1;j<n;j++)
if(v[i]==TRUE && v[j]==FALSE && c[i][j]<min)
{
min=c[i][j];
v1=i;
v2=j;
}
mincost=mincost+min;
if(min==INFINITY)
{
printf(“graph disconnected”);
exit(0);
}
v[v2]=TRUE;
k++;
t[s++]=v1;
t[s++]=v2;
}
}
------------------
2. Write a program in C# to demonstrate operator overloading.
Answer-
using System;
namespace ConsoleApplication4
{
class Program
{
static void Main()
{
Widget w = new Widget();
w++;
Console.WriteLine(w._value);
w++;
Console.WriteLine(w._value);
Widget g = new Widget();
g++;
Console.WriteLine(g._value);
Widget t = w + g;
Console.WriteLine(t._value);
}
}
class Widget
{
public int _value;
public static Widget operator +(Widget a, Widget b)
{
Widget widget = new Widget();
widget._value = a._value + b._value;
return widget;
}
public static Widget operator ++(Widget w)
{
w._value++;
return w;
}
}
}
------------------
Set -5
1. Write a program in C# to sort the students list based on their names. The students list is stored in a string array.
Answer-
using System;
namespace ConsoleApplication4
{
class Program
{
static void Main(string[] args)
{
string[] students = { ”Vikash”, ”Bhushan”, ”Deepak”, ”Tapas”, ”Suresh”, ”Avinash” };
Array arr = students;
Array.Sort(arr);
foreach (string item in arr)
{
Console.WriteLine(item);
}
Console.ReadLine();
}
}
}
2. Write a C# Program to demonstrate use of Virtual and override Key words in C#.
using System;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
ChildClass cc = new ChildClass();
cc.Display();
Console.ReadLine();
}
}
class ParentClass
{
public virtual void Display()
{
Console.WriteLine(“Base Class”);
}
}
class ChildClass:ParentClass
{
public override void Display()
{
base.Display();
Console.WriteLine(“Derived Class”);
}
}
}
------------------
Set -6
1. Write a program in C# , create a class called rectangle which consists of members side_1, side_2 and displayArea(). Write another class square which inherits class rectangle. Take side of square as input and display the area of square on console.
Answer-
using System;
namespace ConsoleApplication4
{
class Program
{
static void Main(string[] args)
{
square sq = new square();
sq.displayArea();
Console.ReadLine();
}
}
class rectangle
{
public int side_1 = 10;
public int side_2 = 20;
public virtual void displayArea()
{
Console.WriteLine(“Area of Rectangle is: “ + side_1 * side_2);
}
}
class square:rectangle
{
public override void displayArea()
{
Console.WriteLine(“Area of Square is: “ + side_1 * side_1);
}
}
}
------------------
2. Write a program to multiply two matrices.
Answer-
#include<stdio.h>
int main(){
int a[5][5],b[5][5],c[5][5],i,j,k,sum=0,m,n,o,p;
printf(“\nEnter the row and column of first matrix”);
scanf(“%d %d”,&m,&n);
printf(“\nEnter the row and column of second matrix”);
scanf(“%d %d”,&o,&p);
if(n!=o){
printf(“Matrix mutiplication is not possible”);
printf(“\nColumn of first matrix must be same as row of second matrix”);
}
else{
printf(“\nEnter the First matrix->”);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf(“%d”,&a[i][j]);
printf(“\nEnter the Second matrix->”);
for(i=0;i<o;i++)
for(j=0;j<p;j++)
scanf(“%d”,&b[i][j]);
printf(“\nThe First matrix is\n”);
for(i=0;i<m;i++){
printf(“\n”);
for(j=0;j<n;j++){
printf(“%d\t”,a[i][j]);
}
}
printf(“\nThe Second matrix is\n”);
for(i=0;i<o;i++){
printf(“\n”);
for(j=0;j<p;j++){
printf(“%d\t”,b[i][j]);
}
}
for(i=0;i<m;i++)
for(j=0;j<p;j++)
c[i][j]=0;
for(i=0;i<m;i++){ //row of first matrix
for(j=0;j<p;j++){ //column of second matrix
sum=0;
for(k=0;k<n;k++)
sum=sum+a[i][k]*b[k][j];
c[i][j]=sum;
}
}
}
printf(“\nThe multiplication of two matrix is\n”);
for(i=0;i<m;i++){
printf(“\n”);
for(j=0;j<p;j++)
{
printf(“%d\t”,c[i][j]);
}
}
return 0;
}
------------------
Set -7
1. Write a C# program to demonstrate handling of server control programs.
Answer-
In order to create new ASP.NET Server Control, use File – New – Project from Visual Studio 2008 menu to open the New Project dialog box. From the Web project type, choose ASP.NET Server Control.
Code Behind File For ServerControl1.cs :-
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Linq;
using System.Text;
using System.Web;
using System.Web.UI;
using System.Web.UI.WebControls;
namespace FirstServerControl
{
[DefaultProperty("Text")]
[ToolboxData("<{0}:ServerControl1 runat=server></{0}:ServerControl1>")]
public class ServerControl1 : WebControl
{
[Bindable(true)]
[Category("Appearance")]
[DefaultValue("")]
[Localizable(true)]
public string Text
{
get
{
String s = (String)ViewState["Text"];
return ((s == null) ? ”[" + this.ID + "]“ : s);
}
set
{
ViewState["Text"] = value;
}
}
protected override void RenderContents(HtmlTextWriter output)
{
output.Write(Text);
}
}
}
------------------
2. Write a program to display a message “Welcome to ASP.NET” 8 times in increasing order of their font size using ASP.NET.
Answer-
<%@ Page language=”c#” Codebehind=”WebForm1.aspx.cs”
AutoEventWireup=”false” Inherits=”WebApplication9.WebForm1? %>
<!DOCTYPE HTML PUBLIC ”-//W3C//DTD HTML 4.0 Transitional//EN” >
<html>
<head>
<title>WebForm1</title>
<meta name=”GENERATOR” Content=”Microsoft Visual Studio .NET 7.1?>
<meta name=”CODE_LANGUAGE” Content=”C#”>
<meta name=vs_defaultClientScript content=”JavaScript”>
<meta name=vs_targetSchema
content=”http://schemas.microsoft.com/intellisense/ie5?>
</head>
<body MS_POSITIONING=”GridLayout”>
<form id=”Form2? method=”post” runat=”server”>
<%for(int i=0;i<8;i++){%>
<font size=”<%=i%>”>Welcome to ASP.NET CHANDU</font><br/></font>
<%}%>
</form>
</body>
</html>
1. Write a program for frame sorting technique used in buffers.
Answer-
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
struct frame
{
int fslno;
char finfo[20];
};
struct frame arr[10]; int n; void sort()
{
int i,j,ex;
struct frame temp;
for(i=0;i<n;i++)
{
ex=0;
for(j=0;j<n-i-1;j++)
if(arr[j].fslno>arr[j+1].fslno)
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
ex++;
}
if(ex==0) break
}
}
void main()
{
int i;
clrscr();
printf(“\n Enter the number of frames \n”);
scanf(“%d”,&n);
for(i=0;i<n;i++)
{
arr[i].fslno=random(50);
printf(“\n Enter the frame contents for sequence number %d\n”,arr[i].fslno);
scanf(“%s”,arr[i].finfo);
}
sort();
printf(“\n The frames in sequence \n”);
for(i=0;i<n;i++)
printf(“\n %d\t%s \n”,arr[i].fslno,arr[i].finfo);
getch(); }
------------------
2. Write a program in C# using command line arguments to display a welcome message.
The message has to be supplied as input in the command line.
Answer-
using System;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
args = new string[1];
Console.Write(“Enter Message Here: “);
args[0] = Console.ReadLine();
Console.WriteLine(“\n” + args[0]);
Console.ReadLine();
}
}
}
------------------
Set -2
1. Write a program for distance vector algorithm to find suitable path for transmission.
Answer-
#include<stdio.h>
#define MAX 10 struct dist_vect
{
int dist[MAX];
int from[MAX];
};
int main()
{
int adj[MAX][MAX],n,i,j,hop[10][10]={{0}},k,count;
struct dist_vect arr[10];
printf(“Enter the number of nodes\n”);
scanf(“%d”,&n);
printf(“Enter adjecency matrix\n”);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
scanf(“%d”,&adj[i][j]);
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
arr[i].dist[j]=adj[i][j];
arr[i].from[j]=j;
}
}
count=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
for(k=0;k<n;k++)
{
if(arr[i].dist[j]>adj[i][k]+arr[k].dist[j])
{
arr[i].dist[j]=adj[i][k]+arr[k].dist[j];
arr[i].from[j]=k;
count++;
if(count==0)hop[i][j]=1;
else hop[i][j]=count+hop[k][j];
}
}
count=0;
}
}
for(i=0;i<n;i++)
{
printf(“State value of router under %d”,i+1);
printf(“\nNode\tvia node\tdistance\tnumber of hops\n”);
for(j=0;j<n;j++)
{
if(i==j)
printf(“\n%d\t%d\t%d\n”,j+1,arr[i].from[j]+1,arr[i].dist[j]);
else
printf(“\n%d\t%d\t\t%d\t\t%d\n”,j+1,arr[i].from[j]+1,arr[i].dist[j],hop[i][j]+1);
}
}
}
------------------
2. Write a program to demonstrate the usage of threads in C#.
Answer-
using System;
using System.Threading;
namespace ConsoleApplication4
{
class Program
{
static void Main()
{
Thread thread1 = new Thread(new ThreadStart(A));
Thread thread2 = new Thread(new ThreadStart(B));
thread1.Start();
thread2.Start();
thread1.Join();
thread2.Join();
}
static void A()
{
Thread.Sleep(100);
Console.WriteLine(‘A’);
}
static void B()
{
Thread.Sleep(1000);
Console.WriteLine(‘B’);
}
}
}
------------------
Set -3
1. Write a program for simple RSA/DES algorithm to encrypt and decrypt the data.
Answer-
#include<stdio.h>
#include<math.h>
double min(double x, double y)
{
return(x<y?x:y);
}
double max(double x,double y)
{
return(x>y?x:y);
}
double gcd(double x,double y)
{
if(x==y)
return(x);
else
return(gcd(min(x,y),max(x,y)-min(x,y)));
}
long double modexp(long double a,long double x,long double n)
{
long double r=1;
while(x>0)
{
if ((int)(fmodl(x,2))==1)
{
r=fmodl((r*a),n);
}
a=fmodl((a*a),n);
x/=2;
}
return(r);
}
int main()
{
long double p,q,phi,n,e,d,cp,cq,dp,dq,mp,mq,sp,sq,rp,rq,qInv,h;
long double ms,es,ds;
do
{
printf(“\n Enter prime numbers p and q:”);
scanf(” %Lf %Lf”,&p,&q);
}
while(p==q);
n=p*q;
phi=(p-1)*(q-1);
do
{
printf(“\n Enter prime value of e:”);
scanf(” %Lf”,&e);
}
while((gcd(e,phi)!=1)&&e>phi);
for(d=1;d<phi;++d)
{
if(fmod((e*d),phi)==1)
break;
}
printf(“\n D within main = %Lf”,d);
printf(“\n Enter the message:”);
scanf(” %Lf”,&ms);
es=modexp(ms,e,n);
ds=modexp(es,d,n);
printf(“\n Original Message : %Lf”,ms);
printf(“\n Encrypted Message : %Lf”,es);
printf(“\n Decrypted Message : %Lf\n”,ds);
return(0);
}
------------------
2. Using Try, Catch and Finally blocks write a program in C# to demonstrate error handling.
Answer-
using System;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
int i, j, divide = 0;
i = 10;
j = 0;
try
{
divide = i / j;
}
catch (DivideByZeroException)
{
divide = 0;
}
finally
{
Console.WriteLine(divide);
}
Console.ReadLine();
}
}
}
------------------
Set-4
1. Write a program for Spanning Tree Algorithm (PRIM) to find loop less path.
Answer-
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#define MAX 20
#define INFINITY 999
#include<conio.h>
enum boolean {FALSE,TRUE};
void prim(int c[][MAX],int t[MAX],int n);
int mincost=0;
int main()
{
int n,c[MAX][MAX],t[2*(MAX-1)];
int i,j;
clrscr();
printf(“\nTo find min path spanning tree”);
printf(“\nEnter no of nodes:”);
scanf(“%d”,&n);
printf(“\nEnter the cost adjacency matrix”);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf(“%d”,&c[i][j]);
prim(c,t,n);
for(i=0;i<2*(n-1);i+=2)
printf(“\n(%d %d)”,t[i]+1,t[i+1]+1);
printf(“\nmincost=%d”,mincost);
getch();
return 0;
}
//using prim’s algorithm for finding shortest path
void prim(int c[][MAX],int t[MAX],int n)
{
int i,j;
enum boolean v[MAX];
int k,s,min,v1,v2;
for(i=0;i<n;i++)
v[i]=FALSE;
v[0]=TRUE;
k=0;
t[k]=1;
s=0;
k++;
while(k<n)
{
min=INFINITY;
for(i=0;i<n;i++)
for(j=1;j<n;j++)
if(v[i]==TRUE && v[j]==FALSE && c[i][j]<min)
{
min=c[i][j];
v1=i;
v2=j;
}
mincost=mincost+min;
if(min==INFINITY)
{
printf(“graph disconnected”);
exit(0);
}
v[v2]=TRUE;
k++;
t[s++]=v1;
t[s++]=v2;
}
}
------------------
2. Write a program in C# to demonstrate operator overloading.
Answer-
using System;
namespace ConsoleApplication4
{
class Program
{
static void Main()
{
Widget w = new Widget();
w++;
Console.WriteLine(w._value);
w++;
Console.WriteLine(w._value);
Widget g = new Widget();
g++;
Console.WriteLine(g._value);
Widget t = w + g;
Console.WriteLine(t._value);
}
}
class Widget
{
public int _value;
public static Widget operator +(Widget a, Widget b)
{
Widget widget = new Widget();
widget._value = a._value + b._value;
return widget;
}
public static Widget operator ++(Widget w)
{
w._value++;
return w;
}
}
}
------------------
Set -5
1. Write a program in C# to sort the students list based on their names. The students list is stored in a string array.
Answer-
using System;
namespace ConsoleApplication4
{
class Program
{
static void Main(string[] args)
{
string[] students = { ”Vikash”, ”Bhushan”, ”Deepak”, ”Tapas”, ”Suresh”, ”Avinash” };
Array arr = students;
Array.Sort(arr);
foreach (string item in arr)
{
Console.WriteLine(item);
}
Console.ReadLine();
}
}
}
2. Write a C# Program to demonstrate use of Virtual and override Key words in C#.
using System;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
ChildClass cc = new ChildClass();
cc.Display();
Console.ReadLine();
}
}
class ParentClass
{
public virtual void Display()
{
Console.WriteLine(“Base Class”);
}
}
class ChildClass:ParentClass
{
public override void Display()
{
base.Display();
Console.WriteLine(“Derived Class”);
}
}
}
------------------
Set -6
1. Write a program in C# , create a class called rectangle which consists of members side_1, side_2 and displayArea(). Write another class square which inherits class rectangle. Take side of square as input and display the area of square on console.
Answer-
using System;
namespace ConsoleApplication4
{
class Program
{
static void Main(string[] args)
{
square sq = new square();
sq.displayArea();
Console.ReadLine();
}
}
class rectangle
{
public int side_1 = 10;
public int side_2 = 20;
public virtual void displayArea()
{
Console.WriteLine(“Area of Rectangle is: “ + side_1 * side_2);
}
}
class square:rectangle
{
public override void displayArea()
{
Console.WriteLine(“Area of Square is: “ + side_1 * side_1);
}
}
}
------------------
2. Write a program to multiply two matrices.
Answer-
#include<stdio.h>
int main(){
int a[5][5],b[5][5],c[5][5],i,j,k,sum=0,m,n,o,p;
printf(“\nEnter the row and column of first matrix”);
scanf(“%d %d”,&m,&n);
printf(“\nEnter the row and column of second matrix”);
scanf(“%d %d”,&o,&p);
if(n!=o){
printf(“Matrix mutiplication is not possible”);
printf(“\nColumn of first matrix must be same as row of second matrix”);
}
else{
printf(“\nEnter the First matrix->”);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf(“%d”,&a[i][j]);
printf(“\nEnter the Second matrix->”);
for(i=0;i<o;i++)
for(j=0;j<p;j++)
scanf(“%d”,&b[i][j]);
printf(“\nThe First matrix is\n”);
for(i=0;i<m;i++){
printf(“\n”);
for(j=0;j<n;j++){
printf(“%d\t”,a[i][j]);
}
}
printf(“\nThe Second matrix is\n”);
for(i=0;i<o;i++){
printf(“\n”);
for(j=0;j<p;j++){
printf(“%d\t”,b[i][j]);
}
}
for(i=0;i<m;i++)
for(j=0;j<p;j++)
c[i][j]=0;
for(i=0;i<m;i++){ //row of first matrix
for(j=0;j<p;j++){ //column of second matrix
sum=0;
for(k=0;k<n;k++)
sum=sum+a[i][k]*b[k][j];
c[i][j]=sum;
}
}
}
printf(“\nThe multiplication of two matrix is\n”);
for(i=0;i<m;i++){
printf(“\n”);
for(j=0;j<p;j++)
{
printf(“%d\t”,c[i][j]);
}
}
return 0;
}
------------------
Set -7
1. Write a C# program to demonstrate handling of server control programs.
Answer-
In order to create new ASP.NET Server Control, use File – New – Project from Visual Studio 2008 menu to open the New Project dialog box. From the Web project type, choose ASP.NET Server Control.
Code Behind File For ServerControl1.cs :-
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Linq;
using System.Text;
using System.Web;
using System.Web.UI;
using System.Web.UI.WebControls;
namespace FirstServerControl
{
[DefaultProperty("Text")]
[ToolboxData("<{0}:ServerControl1 runat=server></{0}:ServerControl1>")]
public class ServerControl1 : WebControl
{
[Bindable(true)]
[Category("Appearance")]
[DefaultValue("")]
[Localizable(true)]
public string Text
{
get
{
String s = (String)ViewState["Text"];
return ((s == null) ? ”[" + this.ID + "]“ : s);
}
set
{
ViewState["Text"] = value;
}
}
protected override void RenderContents(HtmlTextWriter output)
{
output.Write(Text);
}
}
}
------------------
2. Write a program to display a message “Welcome to ASP.NET” 8 times in increasing order of their font size using ASP.NET.
Answer-
<%@ Page language=”c#” Codebehind=”WebForm1.aspx.cs”
AutoEventWireup=”false” Inherits=”WebApplication9.WebForm1? %>
<!DOCTYPE HTML PUBLIC ”-//W3C//DTD HTML 4.0 Transitional//EN” >
<html>
<head>
<title>WebForm1</title>
<meta name=”GENERATOR” Content=”Microsoft Visual Studio .NET 7.1?>
<meta name=”CODE_LANGUAGE” Content=”C#”>
<meta name=vs_defaultClientScript content=”JavaScript”>
<meta name=vs_targetSchema
content=”http://schemas.microsoft.com/intellisense/ie5?>
</head>
<body MS_POSITIONING=”GridLayout”>
<form id=”Form2? method=”post” runat=”server”>
<%for(int i=0;i<8;i++){%>
<font size=”<%=i%>”>Welcome to ASP.NET CHANDU</font><br/></font>
<%}%>
</form>
</body>
</html>
Kuvempu University 6th sem Assignment Download BSIT 61,62,63,64 TA TB
Kuvempu University 6th sem Assignment Solutions Download BSIT 61,62,63,64 TA TB
All in one Download
All Subjects
By Ashish Kumar Ranchi Center
ashish@trickshackings.com admin@trickshackings.com
Download Here
All in one Download
All Subjects
By Ashish Kumar Ranchi Center
ashish@trickshackings.com admin@trickshackings.com
Download Here
Kuvempu University Datesheet May June 2014
Date Sheet May June 2014 ku sem 5
28/5-BSit51
29/5-Bsit52
30/5-Bsit53
31/5-Bsit54
or Download Datesheet for all
KU 5TH SEM ASSIGNMENT - BSIT (TB) All Subjects
KU 5TH SEM ASSIGNMENT - BSIT (TB) All Subjects
kuvempu university 5th sem tb assignment
All In One Questions
Bsit 51 , Bsit 52 , Bsit 53 , Bsit 54
Download
Password- ashish
kuvempu university 5th sem tb assignmentAll In One Questions
Bsit 51 , Bsit 52 , Bsit 53 , Bsit 54
Download
Password- ashish
KU 5TH SEM ASSIGNMENT - BSIT (TB) - 51 (GRAPHICS & MULTIMEDIA)
KU 5TH SEM ASSIGNMENT - BSIT (TB) - 51 (GRAPHICS & MULTIMEDIA) (ASHISH KUMAR) RANCHI
Assignment: TB (Compulsory)
1. What is the need for computer graphics?Computers have become a powerful tool for the rapid and economical production of pictures. Computer Graphics remains one of the most exciting and rapidly growing fields. Old Chinese saying “ One picture is worth of thousand words” can be modified in this computer era into “ One picture is worth of many kilobytes of data”. It is natural to expect that graphical communication, which is an older and more popular method of exchanging information than verbal communication, will often be more convenient when computers are utilized for this purpose. This is true because one must represent objects in two-dimensional and three-dimensional spaces. Computer Graphics has revolutionized almost every computer-based application in science and technology.
2. What is graphics processor? Why it is needed?To provide visual interface, additional processing capability is to be provided to the existing CPU. The solution is to provide dedicated graphic processor. This helps in managing the screen faster with an equivalent software algorithm executed on the CPU and certain amount of parallelism can be achieved for completing the graphic command. Several manufacturers of personal computers use a proprietary graphic processor. For example, Intel 82786 is essentially a line drawing processor; Texas Instruments 43010 is a high performance general-purpose processor.
3. What is a pixel?
Pixel (picture element): Pixel may be defined as the smallest size object or color spot that can be displayed and addressed on a monitor. Any image that is displayed on the monitor is made up of thousands of such small pixels. The closely spaced pixels divide the image area into a compact and uniform two-dimensional grid of pixel lines and columns.
4. Why C language is popular for graphics programming?
Turbo C++ is for C++ and C programmers. It is also compatible with ANSI C standard and fully
supports Kernighan and Ritchie definitions. It includes C++ class libraries, mouse support, multiple overlapping windows, Multi file editor, hypertext help, far objects and error analysis. Turbo C++ comes with a complete set of graphics functions to facilitate preparation of charts and diagrams. It supports the same graphics adapters as turbo Pascal. The Graphics library consists of over 70 graphics functions ranging from high level support like facility to set view port, draw 3-D bar charts, draw polygons to bitoriented functions like get image and put image. The graphics library supports numerous objects, line styles and provides several text fonts to enable one to justify and orient text, horizontally and vertically. It may be noted that graphics functions use far pointers and it is not supported in the tiny memory model.
5. Define resolution.
Resolution: Image resolution refers as the pixel spacing i.e. the distance from one pixel to the next pixel. A typical PC monitor displays screen images with a resolution somewhere between 25 pixels per inch and 80 pixels per inch. Pixel is the smallest element of a displayed image, and dots (red, green and blue) are the smallest elements of a display surface (monitor screen). The dot pitch is the measure of screen resolution. The smaller the dot pitch, the higher the resolution, sharpness and detail of the image displayed.
6. Define aspect ratio.
Aspect ratio: The aspect ratio of the image is the ratio of the number of X pixels to the number of Y pixels. The standard aspect ratio PCs is 4:3, and some use 5:4. Monitors are calibrated to this standard so that when you draw a circle it appears to be a circle and not an ellipse.
7. Why refreshing is required in CRT?
When the electron beam strikes a dot of phosphor material, it glows for a fraction of a second and then fades. As brightness of the dots begins to reduce, the screen-image becomes unstable and gradually fades out. In order to maintain a stable image, the electron beam must sweep the entire surface of the screen and then return to redraw it number of times per second. This process is called refreshing the screen. If the electron beam takes too long to return and redraw a pixel, the pixel begins to fade results in flicker in the image. In order to avoid flicker the screen image must be redrawn sufficiently quickly that the eye cannot tell that refresh is going on. The refresh rate is the number of times per second that the screen is refreshed. Some monitor uses a technique called interlacing for refreshing every line of the screen. In the first pass, odd-numbered lines are refreshed, and in the second pass, even –numbered lines are refreshed. This allows the refresh rate to be doubled because only half the screen is redrawn at a time.
8. Name the different positioning devices.
The devices discussed so far, the mouse, the tablet, the joystick are called “positioning devices”. They are able to position the curser at any point on the screen. (We can operate at that point or the chain of points) Often, one needs devices that can “point” to a given position on the screen. This becomes essential when a diagram is already there on the screen, but some changes are to be made. So, instead of trying to know its coordinates, it is advisable to simply “point” to that portion of the picture and asks for changes. The simplest of such devices is the “light pen”. Its principle is extremely simple.
9. What are pointing devices?
A pointing device is an input interface (specifically a human interface device) that allows a user to input spatial (i.e., continuous and multi-dimensional) data to a computer. CAD systems and graphical user interfaces (GUI) allow the user to control and provide data to the computer using physical gestures — point, click, and drag — for example, by moving a hand-held mouse across the surface of the physical desktop and activating switches on the mouse. Movements of the pointing device are echoed on the screen by movements of the pointer (or cursor) and other visual changes.
10. What is multimedia?
The word ‘Multimedia’ seems to be everywhere nowadays. The word multimedia is a compound
of the Latin prefix ‘multi’ meaning many, and the Latin-derived work ‘media’, which is the plural
of the world medium. So multimedia simply means ‘using more than one kind of medium’.
Multimedia is the mixture of two or more media effects-Hypertext, Still Images, sound, Animation and Video to be interacted on a computer terminal.
11. What are sound cards?
Sound cards: The first sound blaster was an 8-bit card with 22 KHz sampling, besides being equipped with a number of drives and utilities. This became a king of model for the other sound cards. Next came the Sound Blaster Pro, again 8-bit sound but with a higher sampling rate of 44 KHz, which supports a wider frequency range. Then there was Yamaha OPL3 chipset with more voices. Another development was built-in CD ROM interface through which huge files could be played directly via the sound card.
12. What is sampling?
Sampling: Sampling is like breaking a sound into tiny piece and storing each piece as a small, digital sample of sound. The rate at which a sound is “Sampled” can affect its quality. The higher the sampling rate (the more pieces of sound that are stored) the better the quality of sound. Higher quality of sound will occupy a lot of space in hard disk because of more samples.
13. What is morphing?
Morphing: The best example would be the Kawasaki advertisement, where the motorbike changes into a cheetah, the muscle of MRF to a real muscle etc.. Morphing is making an image change into another by identifying key points so that the key point’s displacement, etc. are taken into consideration for the change.
14. What is rendering?
Rendering: The process of converting your designed objects with texturing and animation into an image or a series of images is called rendering. Here various parameters are available like resolution, colors type of render, etc.
15. What is warping?
Warping: Certain parts of the image could be marked for a change and made to change to different one. For examples, the eyes of the owl had to morph into the eyes of cat, the eyes can alone be marked and warped.
16. Why we use scanner?
Photographs, illustrations, and paintings continue to be made the old fashioned way, even by visual artists who are otherwise immersed in digital imaging technology. Traditional photographs, illustrations, and paintings are easily imported into computers through the use of a device called a scanner.
A Scanner “scans’” over an image such as photo, drawing, logo, etc, converting it into an image and it can be seen on the screen. Using a good paint programme, Image Editor we can do adding, removing colors, filtering, Masking color etc.
17. What is ganut in Photoshop?
17. What is ganut in Photoshop?
Write yourself...
18. What is a layer?
The concept of layering is similar to that of compositing as we make the different layers by keying out the uniform color and making it transparent so that layer beneath becomes visible. In case of future modifications we will be able to work with individual layers and need not work with the image as a whole.
19. What are editing tools? Why it is needed?
You can use the editing tools to draw on a layer, and you can copy and paste selections to a layer.
You can use the editing tools to draw on a layer, and you can copy and paste selections to a layer.
Many types of editing tools are:-
i).Eraser tool: The eraser tool changes pixels in the image as you drag through them. You can choose to change the color and transparency of the affected pixels, or to revert the affected area to its previously saved version.
ii).Smudge tool: The smudge tool simulates the actions of dragging a finger through wet paint. The tool picks up color from where the stroke begins and pushes it in the direction in which you drag.
20. What is file format?
File Format: When you create an image-either through scanning into your computer or drawing it from scratch on your monitor or captured through a camera, recorded voice or music from the two-in-one or recorded connecting a music instrument it must be saved to your disk. Otherwise it would become an ethereal artifact that could never again be seen or listened. Once the computer’s power is turned off, it’s gone forever unless it is saved. The method by which the software organizes the data in the saved file is called the file format.
KU 5TH SEM ASSIGNMENT - BSIT (TB) - 53 (DATA WAREHOUSING & DATA MINING)
KU 5TH SEM ASSIGNMENT - BSIT (TB) - 53 (DATA WAREHOUSING & DATA MINING) (Ashish kumar RANCHI)
PART - A
I. Note: Answer all the questions.
a) What is Normalization? What are the different forms of Normalization ?
The usual approach in normalization in database applications is to ensure that the data is divided into two or more tables, such that when the data in one of them is updated, it does not lead to anamolies of data (The student is advised to refer any book on data base management systems for details, if interested).
The idea is to ensure that when combined, the data available is consistent. However, in data warehousing, one may even tend to break the large table into several “denormalized” smaller tables. This may lead to lots of extra space being used. But it helps in an indirect way – It avoids the overheads of joining the data during queries.
b) Define Data warehouse. What are roles of education in a data warehousing delivery process?
Data Warehouse: In it’s simplest form, a data ware house is a collection of key pieces of information used to manage and direct the business for the most profitable outcome. It would decide the amount of inventory to be held, the no. of employees to be hired, the amount to be procured on loan etc.,.
The above definition may not be precise - but that is how data ware house systems are. There are different definitions given by different authors, but we have this idea in mind and proceed. It is a large collection of data and a set of process managers that use this data to make information available. The data can be meta data, facts, dimensions and aggregations. The process managers can be load managers, ware house managers or query managers. The information made available is such that they allow the end users to make informed decisions.
Roles of education in a data warehousing delivery process:-
This has two roles to play - one to make people, specially top level policy makers, comfortable with the concept. The second role is to aid the prototyping activity. To take care of the education concept, an initial (usually scaled down) prototype is created and people are encouraged to interact with it. This would help achieve both the activities listed above. The users became comfortable with the use of the system and the ware house developer becomes aware of the limitations of his prototype which can be improvised upon.
c) What is process managers? What are the different types of process managers?
Process Managers: These are responsible for the smooth flow, maintainance and upkeep of data into and out of the database.
The main types of process managers are:-
i). Load manager: to take case of source interaction, data transformation and data load.
ii). Ware house manger: to take care of data movement, meta data management and performance
monitoring.
iii). Query manager: to control query scheduling and monitoring.
We shall look into each of them briefly. Before that, we look at a schematic diagram that defines the boundaries of the three types of managers.
d) Give the architectures of data mining systems.
e) What are the guidelines for KDD environment ?
It is customary in the computer industry to formulate rules of thumb that help information technology (IT) specialists to apply new developments. In setting up a reliable data mining environment we may follow the guidelines so that KDD system may work in a manner we desire.
i). Support extremely large data sets
ii). Support hybrid learning
iii). Establish a data warehouse
iv). Introduce data cleaning facilities
v). Facilitate working with dynamic coding
vi). Integrate with decision support system
vii). Choose extendible architecture
viii). Support heterogeneous databases
ix). Introduce client/server architecture
x). Introduce cache optimization
PART - B
II. Answer any FIVE full questions.
1. a) With the help of a diagram explain architecture of data warehouse.
The architecture for a data ware is indicated below. Before we proceed further, we should be clear about the concept of architecture. It only gives the major items that make up a data ware house. The size and complexity of each of these items depend on the actual size of the ware house itself, the specific requirements of the ware house and the actual details of implementation.
Before looking into the details of each of the managers we could get a broad idea about their functionality by mapping the processes that we studied in the previous chapter to the managers. The extracting and loading processes are taken care of by the load manager. The processes of cleanup and transformation of data as also of back up and archiving are the duties of the ware house manage, while the query manager, as the name implies is to take case of query management.
b) Indicate the important function of a Load Manager, Warehouse Manager.
Important function of Load Manager:
i) To extract data from the source (s)
ii) To load the data into a temporary storage device
iii) To perform simple transformations to map it to the structures of the data ware house.
Important function of Warehouse Manager:
i) Analyze the data to confirm data consistency and data integrity .
ii) Transform and merge the source data from the temporary data storage into the ware house.
iii) Create indexes, cross references, partition views etc.,.
iv) Check for normalization’s.
v) Generate new aggregations, if needed.
vi) Update all existing aggregations
vii) Create backups of data.
viii) Archive the data that needs to be archived.
2. a) Differentiate between vertical partitioning and horizontal partitioning.
In horizontal partitioning, we simply the first few thousand entries in one partition, the second few thousand in the next and so on. This can be done by partitioning by time, where in all data pertaining to the first month / first year is put in the first partition, the second one in the second partition and so on. The other alternatives can be based on different sized dimensions, partitioning an other dimensions, petitioning on the size of the table and round robin partitions. Each of them have certain advantages as well as disadvantages.
In vertical partitioning, some columns are stored in one partition and certain other columns of the same row in a different partition. This can again be achieved either by normalization or row splitting. We will look into their relative trade offs.
b) What is schema? Distinguish between facts and dimensions.
A schema, by definition, is a logical arrangements of facts that facilitate ease of storage and retrieval, as described by the end users. The end user is not bothered about the overall arrangements of the data or the fields in it. For example, a sales executive, trying to project the sales of a particular item is only interested in the sales details of that item where as a tax practitioner looking at the same data will be interested only in the amounts received by the company and the profits made.
The star schema looks a good solution to the problem of ware housing. It simply states that one should identify the facts and store it in the read-only area and the dimensions surround the area. Whereas the dimensions are liable to change, the facts are not. But given a set of raw data from the sources, how does one identify the facts and the dimensions? It is not always easy, but the following steps can help in that direction.
i) Look for the fundamental transactions in the entire business process. These basic entities
are the facts.
ii) Find out the important dimensions that apply to each of these facts. They are the candidates
for dimension tables.
iii) Ensure that facts do not include those candidates that are actually dimensions, with a set of
facts attached to it.
iv) Ensure that dimensions do not include these candidates that are actually facts.
3. a) What is an event in data warehousing? List any five events.
An event is defined as a measurable, observable occurrence of a defined action. If this definition is quite vague, it is because it encompasses a very large set of operations. The event manager is a software that continuously monitors the system for the occurrence of the event and then take any action that is suitable (Note that the event is a “measurable and observable” occurrence). The action to be taken is also normally specific to the event.
A partial list of the common events that need to be monitored are as follows:
i). Running out of memory space.
ii). A process dying
iii). A process using excessing resource
iv). I/O errors
v). Hardware failure
b) What is summary table? Describe the aspects to be looked into while designing a summary table.
The main purpose of using summary tables is to cut down the time taken to execute a specific query.
The main methodology involves minimizing the volume of data being scanned each time the query is to be
answered. In other words, partial answers to the query are already made available. For example, in the
above cited example of mobile market, if one expects
i) the citizens above 18 years of age
ii) with salaries greater than 15,000 and
iii) with professions that involve traveling are the potential customers, then, every time the query is to be processed (may be every month or every quarter), one will have to look at the entire data base to compute these values and then combine them suitably to get the relevant answers. The other method is to prepare summary tables, which have the values pertaining toe ach of these sub-queries, before hand, and then combine them as and when the query is raised.
Summary table are designed by following the steps given below:
i) Decide the dimensions along which aggregation is to be done.
ii) Determine the aggregation of multiple facts.
iii) Aggregate multiple facts into the summary table.
iv) Determine the level of aggregation and the extent of embedding.
v) Design time into the table.
vi) Index the summary table.
4. a) List the significant issues in automatic cluster detection.
Most of the issues related to automatic cluster detection are connected to the kinds of questions we want to be answered in the data mining project, or data preparation for their successful application.
i). Distance measure
Most clustering techniques use for the distance measure the Euclidean distance formula (square root of the sum of the squares of distances along each attribute axes).
Non-numeric variables must be transformed and scaled before the clustering can take place. Depending
on this transformations, the categorical variables may dominate clustering results or they may be even
completely ignored.
ii). Choice of the right number of clusters
If the number of clusters k in the K-means method is not chosen so to match the natural structure of the data, the results will not be good. The proper way t alleviate this is to experiment with different values for k. In principle, the best k value will exhibit the smallest intra-cluster distances and largest inter-cluster distances.
iii). Cluster interpretation
Once the clusters are discovered they have to be interpreted in order to have some value for the data mining project.
b) Define data marting. List the reasons for data marting.
The data mart stores a subset of the data available in the ware house, so that one need not always have to scan through the entire content of the ware house. It is similar to a retail outlet. A data mart speeds up the queries, since the volume of data to be scanned is much less. It also helps to have tail or made processes for different access tools, imposing control strategies etc.,.
Following are the reasons for which data marts are created:
i) Since the volume of data scanned is small, they speed up the query processing.
ii) Data can be structured in a form suitable for a user access too
iii) Data can be segmented or partitioned so that they can be used on different platforms and also different control strategies become applicable.
5. a) Explain how to categorize data mining system.
There are many data mining systems available or being developed. Some are specialized systems dedicated to a given data source or are confined to limited data mining functionalities, other are more versatile and comprehensive. Data mining systems can be categorized according to various criteria among other classification are the following:
a) Classification according to the type of data source mined: this classification categorizes data mining systems according to the type of data handled such as spatial data, multimedia data, time-series data, text data, World Wide Web, etc.
b) Classification according to the data model drawn on: this classification categorizes data mining systems based on the data model involved such as relational database, object-oriented database, data warehouse, transactional, etc.
c) Classification according to the king of knowledge discovered: this classification categorizes data mining systems based on the kind of knowledge discovered or data mining functionalities, such as characterization, discrimination, association, classification, clustering, etc. Some systems tend to be comprehensive systems offering several data mining functionalities together.
d) Classification according to mining techniques used: Data mining systems employ and provide different techniques. This classification categorizes data mining systems according to the data analysis approach used such as machine learning, neural networks, genetic algorithms, statistics, visualization, database oriented or data warehouse-oriented, etc.
b) List and explain different kind of data that can be mined.
Different kind of data that can be mined are listed below:-
i). Flat files: Flat files are actually the most common data source for data mining algorithms, especially at the research level.
ii). Relational Databases: A relational database consists of a set of tables containing either values of entity attributes, or values of attributes from entity relationships.
iii). Data Warehouses: A data warehouse as a storehouse, is a repository of data collected from multiple data sources (often heterogeneous) and is intended to be used as a whole under the same unified schema.
iv). Multimedia Databases: Multimedia databases include video, images, audio and text media. They can be stored on extended object-relational or object-oriented databases, or simply on a file system.
v). Spatial Databases: Spatial databases are databases that in addition to usual data, store geographical information like maps, and global or regional positioning.
vi). Time-Series Databases: Time-series databases contain time related data such stock market data or logged activities. These databases usually have a continuous flow of new data coming in, which sometimes causes the need for a challenging real time analysis.
vii). World Wide Web: The World Wide Web is the most heterogeneous and dynamic repository available. A very large number of authors and publishers are continuously contributing to its growth and metamorphosis and a massive number of users are accessing its resources daily.
6. a) Give the syntax for task relevant data specification.
Syntax for tax-relevant data specification:-
The first step in defining a data mining task is the specification of the task-relevant data, that is, the data on which mining is to be performed. This involves specifying the database and tables or data warehouse containing the relevant data, conditions for selecting the relevant data, the relevant attributes or dimensions for exploration, and instructions regarding the ordering or grouping of the data retrieved. DMQL provides clauses for the clauses for the specification of such information, as follows:-
i). use database (database_name) or use data warehouse (data_warehouse_name): The use clause directs the mining task to the database or data warehouse specified.
ii). from (relation(s)/cube(s)) [where(condition)]: The from and where clauses respectively specify the database tables or data cubes involved, and the conditions defining the data to be retrieved.
iii). in relevance to (attribute_or_dimension_list): This clause lists the attributes or dimensions for exploration.
iv). order by (order_list): The order by clause specifies the sorting order of the task relevant data.
v). group by (grouping_list): the group by clause specifies criteria for grouping the data.
vi). having (conditions): The having cluase specifies the condition by which groups of data are considered relevant.
b) Explain the designing of GUI based on data mining query language.
A data mining query language provides necessary primitives that allow users to communicate with data mining systems. But novice users may find data mining query language difficult to use and the syntax difficult to remember. Instead , user may prefer to communicate with data mining systems through a graphical user interface (GUI). In relational database technology , SQL serves as a standard core language for relational systems , on top of which GUIs can easily be designed. Similarly, a data mining query language may serve as a core language for data mining system implementations, providing a basis for the development of GUI for effective data mining.
A data mining GUI may consist of the following functional components:-
a) Data collection and data mining query composition - This component allows the user to specify task-relevant data sets and to compose data mining queries. It is similar to GUIs used for the specification of relational queries.
b) Presentation of discovered patterns – This component allows the display of the discovered patterns in various forms, including tables, graphs, charts, curves and other visualization techniques.
c) Hierarchy specification and manipulation - This component allows for concept hierarchy specification , either manually by the user or automatically. In addition , this component should allow concept hierarchies to be modified by the user or adjusted automatically based on a given data set distribution.
d) Manipulation of data mining primitives – This component may allow the dynamic adjustment of data mining thresholds, as well as the selection, display and modification of concept hierarchies. It may also allow the modification of previous data mining queries or conditions.
e) Interactive multilevel mining – This component should allow roll-up or drill-down operations on discovered patterns.
f) Other miscellaneous information – This component may include on-line help manuals, indexed search , debugging and other interactive graphical facilities.
7. a) Explain how decision trees are useful in data mining.
Decision trees are powerful and popular tools for classification and prediction. The attractiveness of tree-based methods is due in large part to the fact that, it is simple and decision trees represent rules. Rules can readily be expressed so that we humans can understand them or in a database access language like SQL so that records falling into a particular category may be retrieved.
b) Identify an application and also explain the techniques that can be incorporated in solving the problem using data mining techniques.
Write yourself...
8. Write a short notes on :
i) Data Mining Querying Language
ii) Schedule Manager
iii) Data Formatting.
i) Data Mining Querying Language
A data mining language helps in effective knowledge discovery from the data mining systems. Designing
a comprehensive data mining language is challenging because data mining covers a wide spectrum of
tasks from data characterization to mining association rules, data classification and evolution analysis.
Each task has different requirements. The design of an effective data mining query language requires a
deep understanding of the power, limitation and underlying mechanism of the various kinds of data mining
tasks.
ii) Schedule manager
The scheduling is the key for successful warehouse management. Almost all operations in the ware
house need some type of scheduling. Every operating system will have it’s own scheduler and batch
control mechanism. But these schedulers may not be capable of fully meeting the requirements of a data
warehouse. Hence it is more desirable to have specially designed schedulers to manage the operations.
iii) Data formatting
Final data preparation step which represents syntactic modifications to the data that do not change its
meaning, but are required by the particular modelling tool chosen for the DM task. These include:
a). reordering of the attributes or records: some modelling tools require reordering of the attributes
(or records) in the dataset: putting target attribute at the beginning or at the end, randomizing
order of records (required by neural networks for example)
b). changes related to the constraints of modelling tools: removing commas or tabs, special
characters, trimming strings to maximum allowed number of characters, replacing special
characters with allowed set of special characters.
I. Note: Answer all the questions.
a) What is Normalization? What are the different forms of Normalization ?
The usual approach in normalization in database applications is to ensure that the data is divided into two or more tables, such that when the data in one of them is updated, it does not lead to anamolies of data (The student is advised to refer any book on data base management systems for details, if interested).
The idea is to ensure that when combined, the data available is consistent. However, in data warehousing, one may even tend to break the large table into several “denormalized” smaller tables. This may lead to lots of extra space being used. But it helps in an indirect way – It avoids the overheads of joining the data during queries.
b) Define Data warehouse. What are roles of education in a data warehousing delivery process?
Data Warehouse: In it’s simplest form, a data ware house is a collection of key pieces of information used to manage and direct the business for the most profitable outcome. It would decide the amount of inventory to be held, the no. of employees to be hired, the amount to be procured on loan etc.,.
The above definition may not be precise - but that is how data ware house systems are. There are different definitions given by different authors, but we have this idea in mind and proceed. It is a large collection of data and a set of process managers that use this data to make information available. The data can be meta data, facts, dimensions and aggregations. The process managers can be load managers, ware house managers or query managers. The information made available is such that they allow the end users to make informed decisions.
Roles of education in a data warehousing delivery process:-
This has two roles to play - one to make people, specially top level policy makers, comfortable with the concept. The second role is to aid the prototyping activity. To take care of the education concept, an initial (usually scaled down) prototype is created and people are encouraged to interact with it. This would help achieve both the activities listed above. The users became comfortable with the use of the system and the ware house developer becomes aware of the limitations of his prototype which can be improvised upon.
c) What is process managers? What are the different types of process managers?
Process Managers: These are responsible for the smooth flow, maintainance and upkeep of data into and out of the database.
The main types of process managers are:-
i). Load manager: to take case of source interaction, data transformation and data load.
ii). Ware house manger: to take care of data movement, meta data management and performance
monitoring.
iii). Query manager: to control query scheduling and monitoring.
We shall look into each of them briefly. Before that, we look at a schematic diagram that defines the boundaries of the three types of managers.
d) Give the architectures of data mining systems.
e) What are the guidelines for KDD environment ?
It is customary in the computer industry to formulate rules of thumb that help information technology (IT) specialists to apply new developments. In setting up a reliable data mining environment we may follow the guidelines so that KDD system may work in a manner we desire.
i). Support extremely large data sets
ii). Support hybrid learning
iii). Establish a data warehouse
iv). Introduce data cleaning facilities
v). Facilitate working with dynamic coding
vi). Integrate with decision support system
vii). Choose extendible architecture
viii). Support heterogeneous databases
ix). Introduce client/server architecture
x). Introduce cache optimization
PART - B
II. Answer any FIVE full questions.
1. a) With the help of a diagram explain architecture of data warehouse.
The architecture for a data ware is indicated below. Before we proceed further, we should be clear about the concept of architecture. It only gives the major items that make up a data ware house. The size and complexity of each of these items depend on the actual size of the ware house itself, the specific requirements of the ware house and the actual details of implementation.
b) Indicate the important function of a Load Manager, Warehouse Manager.
Important function of Load Manager:
i) To extract data from the source (s)
ii) To load the data into a temporary storage device
iii) To perform simple transformations to map it to the structures of the data ware house.
Important function of Warehouse Manager:
i) Analyze the data to confirm data consistency and data integrity .
ii) Transform and merge the source data from the temporary data storage into the ware house.
iii) Create indexes, cross references, partition views etc.,.
iv) Check for normalization’s.
v) Generate new aggregations, if needed.
vi) Update all existing aggregations
vii) Create backups of data.
viii) Archive the data that needs to be archived.
2. a) Differentiate between vertical partitioning and horizontal partitioning.
In horizontal partitioning, we simply the first few thousand entries in one partition, the second few thousand in the next and so on. This can be done by partitioning by time, where in all data pertaining to the first month / first year is put in the first partition, the second one in the second partition and so on. The other alternatives can be based on different sized dimensions, partitioning an other dimensions, petitioning on the size of the table and round robin partitions. Each of them have certain advantages as well as disadvantages.
In vertical partitioning, some columns are stored in one partition and certain other columns of the same row in a different partition. This can again be achieved either by normalization or row splitting. We will look into their relative trade offs.
b) What is schema? Distinguish between facts and dimensions.
A schema, by definition, is a logical arrangements of facts that facilitate ease of storage and retrieval, as described by the end users. The end user is not bothered about the overall arrangements of the data or the fields in it. For example, a sales executive, trying to project the sales of a particular item is only interested in the sales details of that item where as a tax practitioner looking at the same data will be interested only in the amounts received by the company and the profits made.
The star schema looks a good solution to the problem of ware housing. It simply states that one should identify the facts and store it in the read-only area and the dimensions surround the area. Whereas the dimensions are liable to change, the facts are not. But given a set of raw data from the sources, how does one identify the facts and the dimensions? It is not always easy, but the following steps can help in that direction.
i) Look for the fundamental transactions in the entire business process. These basic entities
are the facts.
ii) Find out the important dimensions that apply to each of these facts. They are the candidates
for dimension tables.
iii) Ensure that facts do not include those candidates that are actually dimensions, with a set of
facts attached to it.
iv) Ensure that dimensions do not include these candidates that are actually facts.
3. a) What is an event in data warehousing? List any five events.
An event is defined as a measurable, observable occurrence of a defined action. If this definition is quite vague, it is because it encompasses a very large set of operations. The event manager is a software that continuously monitors the system for the occurrence of the event and then take any action that is suitable (Note that the event is a “measurable and observable” occurrence). The action to be taken is also normally specific to the event.
A partial list of the common events that need to be monitored are as follows:
i). Running out of memory space.
ii). A process dying
iii). A process using excessing resource
iv). I/O errors
v). Hardware failure
b) What is summary table? Describe the aspects to be looked into while designing a summary table.
The main purpose of using summary tables is to cut down the time taken to execute a specific query.
The main methodology involves minimizing the volume of data being scanned each time the query is to be
answered. In other words, partial answers to the query are already made available. For example, in the
above cited example of mobile market, if one expects
i) the citizens above 18 years of age
ii) with salaries greater than 15,000 and
iii) with professions that involve traveling are the potential customers, then, every time the query is to be processed (may be every month or every quarter), one will have to look at the entire data base to compute these values and then combine them suitably to get the relevant answers. The other method is to prepare summary tables, which have the values pertaining toe ach of these sub-queries, before hand, and then combine them as and when the query is raised.
Summary table are designed by following the steps given below:
i) Decide the dimensions along which aggregation is to be done.
ii) Determine the aggregation of multiple facts.
iii) Aggregate multiple facts into the summary table.
iv) Determine the level of aggregation and the extent of embedding.
v) Design time into the table.
vi) Index the summary table.
4. a) List the significant issues in automatic cluster detection.
Most of the issues related to automatic cluster detection are connected to the kinds of questions we want to be answered in the data mining project, or data preparation for their successful application.
i). Distance measure
Most clustering techniques use for the distance measure the Euclidean distance formula (square root of the sum of the squares of distances along each attribute axes).
Non-numeric variables must be transformed and scaled before the clustering can take place. Depending
on this transformations, the categorical variables may dominate clustering results or they may be even
completely ignored.
ii). Choice of the right number of clusters
If the number of clusters k in the K-means method is not chosen so to match the natural structure of the data, the results will not be good. The proper way t alleviate this is to experiment with different values for k. In principle, the best k value will exhibit the smallest intra-cluster distances and largest inter-cluster distances.
iii). Cluster interpretation
Once the clusters are discovered they have to be interpreted in order to have some value for the data mining project.
b) Define data marting. List the reasons for data marting.
The data mart stores a subset of the data available in the ware house, so that one need not always have to scan through the entire content of the ware house. It is similar to a retail outlet. A data mart speeds up the queries, since the volume of data to be scanned is much less. It also helps to have tail or made processes for different access tools, imposing control strategies etc.,.
Following are the reasons for which data marts are created:
i) Since the volume of data scanned is small, they speed up the query processing.
ii) Data can be structured in a form suitable for a user access too
iii) Data can be segmented or partitioned so that they can be used on different platforms and also different control strategies become applicable.
5. a) Explain how to categorize data mining system.
There are many data mining systems available or being developed. Some are specialized systems dedicated to a given data source or are confined to limited data mining functionalities, other are more versatile and comprehensive. Data mining systems can be categorized according to various criteria among other classification are the following:
a) Classification according to the type of data source mined: this classification categorizes data mining systems according to the type of data handled such as spatial data, multimedia data, time-series data, text data, World Wide Web, etc.
b) Classification according to the data model drawn on: this classification categorizes data mining systems based on the data model involved such as relational database, object-oriented database, data warehouse, transactional, etc.
c) Classification according to the king of knowledge discovered: this classification categorizes data mining systems based on the kind of knowledge discovered or data mining functionalities, such as characterization, discrimination, association, classification, clustering, etc. Some systems tend to be comprehensive systems offering several data mining functionalities together.
d) Classification according to mining techniques used: Data mining systems employ and provide different techniques. This classification categorizes data mining systems according to the data analysis approach used such as machine learning, neural networks, genetic algorithms, statistics, visualization, database oriented or data warehouse-oriented, etc.
b) List and explain different kind of data that can be mined.
Different kind of data that can be mined are listed below:-
i). Flat files: Flat files are actually the most common data source for data mining algorithms, especially at the research level.
ii). Relational Databases: A relational database consists of a set of tables containing either values of entity attributes, or values of attributes from entity relationships.
iii). Data Warehouses: A data warehouse as a storehouse, is a repository of data collected from multiple data sources (often heterogeneous) and is intended to be used as a whole under the same unified schema.
iv). Multimedia Databases: Multimedia databases include video, images, audio and text media. They can be stored on extended object-relational or object-oriented databases, or simply on a file system.
v). Spatial Databases: Spatial databases are databases that in addition to usual data, store geographical information like maps, and global or regional positioning.
vi). Time-Series Databases: Time-series databases contain time related data such stock market data or logged activities. These databases usually have a continuous flow of new data coming in, which sometimes causes the need for a challenging real time analysis.
vii). World Wide Web: The World Wide Web is the most heterogeneous and dynamic repository available. A very large number of authors and publishers are continuously contributing to its growth and metamorphosis and a massive number of users are accessing its resources daily.
6. a) Give the syntax for task relevant data specification.
Syntax for tax-relevant data specification:-
The first step in defining a data mining task is the specification of the task-relevant data, that is, the data on which mining is to be performed. This involves specifying the database and tables or data warehouse containing the relevant data, conditions for selecting the relevant data, the relevant attributes or dimensions for exploration, and instructions regarding the ordering or grouping of the data retrieved. DMQL provides clauses for the clauses for the specification of such information, as follows:-
i). use database (database_name) or use data warehouse (data_warehouse_name): The use clause directs the mining task to the database or data warehouse specified.
ii). from (relation(s)/cube(s)) [where(condition)]: The from and where clauses respectively specify the database tables or data cubes involved, and the conditions defining the data to be retrieved.
iii). in relevance to (attribute_or_dimension_list): This clause lists the attributes or dimensions for exploration.
iv). order by (order_list): The order by clause specifies the sorting order of the task relevant data.
v). group by (grouping_list): the group by clause specifies criteria for grouping the data.
vi). having (conditions): The having cluase specifies the condition by which groups of data are considered relevant.
b) Explain the designing of GUI based on data mining query language.
A data mining query language provides necessary primitives that allow users to communicate with data mining systems. But novice users may find data mining query language difficult to use and the syntax difficult to remember. Instead , user may prefer to communicate with data mining systems through a graphical user interface (GUI). In relational database technology , SQL serves as a standard core language for relational systems , on top of which GUIs can easily be designed. Similarly, a data mining query language may serve as a core language for data mining system implementations, providing a basis for the development of GUI for effective data mining.
A data mining GUI may consist of the following functional components:-
a) Data collection and data mining query composition - This component allows the user to specify task-relevant data sets and to compose data mining queries. It is similar to GUIs used for the specification of relational queries.
b) Presentation of discovered patterns – This component allows the display of the discovered patterns in various forms, including tables, graphs, charts, curves and other visualization techniques.
c) Hierarchy specification and manipulation - This component allows for concept hierarchy specification , either manually by the user or automatically. In addition , this component should allow concept hierarchies to be modified by the user or adjusted automatically based on a given data set distribution.
d) Manipulation of data mining primitives – This component may allow the dynamic adjustment of data mining thresholds, as well as the selection, display and modification of concept hierarchies. It may also allow the modification of previous data mining queries or conditions.
e) Interactive multilevel mining – This component should allow roll-up or drill-down operations on discovered patterns.
f) Other miscellaneous information – This component may include on-line help manuals, indexed search , debugging and other interactive graphical facilities.
7. a) Explain how decision trees are useful in data mining.
Decision trees are powerful and popular tools for classification and prediction. The attractiveness of tree-based methods is due in large part to the fact that, it is simple and decision trees represent rules. Rules can readily be expressed so that we humans can understand them or in a database access language like SQL so that records falling into a particular category may be retrieved.
b) Identify an application and also explain the techniques that can be incorporated in solving the problem using data mining techniques.
Write yourself...
8. Write a short notes on :
i) Data Mining Querying Language
ii) Schedule Manager
iii) Data Formatting.
i) Data Mining Querying Language
A data mining language helps in effective knowledge discovery from the data mining systems. Designing
a comprehensive data mining language is challenging because data mining covers a wide spectrum of
tasks from data characterization to mining association rules, data classification and evolution analysis.
Each task has different requirements. The design of an effective data mining query language requires a
deep understanding of the power, limitation and underlying mechanism of the various kinds of data mining
tasks.
ii) Schedule manager
The scheduling is the key for successful warehouse management. Almost all operations in the ware
house need some type of scheduling. Every operating system will have it’s own scheduler and batch
control mechanism. But these schedulers may not be capable of fully meeting the requirements of a data
warehouse. Hence it is more desirable to have specially designed schedulers to manage the operations.
iii) Data formatting
Final data preparation step which represents syntactic modifications to the data that do not change its
meaning, but are required by the particular modelling tool chosen for the DM task. These include:
a). reordering of the attributes or records: some modelling tools require reordering of the attributes
(or records) in the dataset: putting target attribute at the beginning or at the end, randomizing
order of records (required by neural networks for example)
b). changes related to the constraints of modelling tools: removing commas or tabs, special
characters, trimming strings to maximum allowed number of characters, replacing special
characters with allowed set of special characters.
