Welcome to PARADISE

Ex. No: 1 DISPLAY SIMPLE SDK WINDOW

AIM:
To write a program to display a simple SDK window.

ALGORITHM:

1. Open Microsoft VC++.
2. Select new from the file menu and click the project tab.
3. Select win32 application.
4. In the project name field type the name of the project.
5. Create a new workspace and select win32 and click empty project and then
Press finish button.
6. Select new from file menu, again click c++ source file
7. Type the program.

PROGRAM:

#include
LRESULT CALLBACK WndProc(HWND,UINT,WPARAM,LPARAM);
int WINAPI WinMain(HINSTANCE h,HINSTANCE hp,LPSTR lps,int in)
{
WNDCLASS wc;
HWND hw;
MSG ms;
wc.style=CS_HREDRAW/CS_VREDRAW;
wc.cbClsExtra=0;
wc.cbWndExtra=0;
wc.hbrBackground=(HBRUSH)GetStockObject(WHITE_BRUSH);
wc.hCursor=LoadCursor(NULL,IDC_ARROW);
wc.hIcon=LoadIcon(NULL,IDI_APPLICATION);
wc.hInstance=h;
wc.lpfnWndProc=WndProc;
wc.lpszClassName="Window";
wc.lpszMenuName=NULL;
RegisterClass(&wc);
hw=CreateWindow("Window","First Window",WS_OVERLAPPEDWINDOW,0,0,300,300,NULL,NULL,h,NULL);
ShowWindow(hw,in);
UpdateWindow(hw);
while(GetMessage(&ms,hw,0,0))
{
TranslateMessage(&ms);
DispatchMessage(&ms);
}

return ms.wParam;
}
LRESULT CALLBACK WndProc(HWND hw,UINT ms,WPARAM w,LPARAM l)
{
return DefWindowProc(hw,ms,w,l);
}

Ex. No: 2 KEYBOARD AND MOUSE EVENTS

AIM:
To write a program to display keyboard and mouse events.

ALGORITHM:

1. Open Microsoft VC++.
2. Select new from the file menu and click the project tab.
3. Select win32 application.
4. In the project name field type the name of the project.
5. Create a new workspace and select win32 and click empty project and then
Press finish button.
6. Select new from file menu, again click c++ source file
7. Type the program.

PROGRAM:

#include
LRESULT CALLBACK WndProc(HWND,UINT,WPARAM,LPARAM);
int WINAPI WinMain(HINSTANCE h,HINSTANCE hp,LPSTR lps,int in)
{
WNDCLASS wc;
HWND hw;
MSG ms;
wc.style=CS_HREDRAW|CS_VREDRAW;
wc.cbClsExtra=0;
wc.cbWndExtra=0;
wc.hbrBackground=(HBRUSH)GetStockObject(BLACK_BRUSH);
wc.hCursor=LoadCursor(NULL,IDC_ARROW);
wc.hIcon=LoadIcon(NULL,IDI_APPLICATION);
wc.hInstance=h;
wc.lpfnWndProc=WndProc;
wc.lpszClassName="Window";
wc.lpszMenuName=NULL;
RegisterClass(&wc);
hw=CreateWindow("window","MY FIRST WINDOW", WS_OVERLAPPEDWINDOW,
0,0,300,300,NULL,NULL,h,NULL);
ShowWindow(hw,in);
UpdateWindow(hw);
while(GetMessage(&ms,hw,0,0))
{
TranslateMessage(&ms);
DispatchMessage(&ms);
}
return ms.wParam;
}
LRESULT CALLBACK WndProc(HWND hw,UINT ms,WPARAM w,LPARAM l)
{
HDC hdc;
switch(ms)
{
case WM_LBUTTONDOWN:
hdc=GetDC(hw);
TextOut(hdc,10,10,TEXT("LEFT BUTTON PRESSED"),25);
ReleaseDC(hw,hdc);
return 0;
case WM_LBUTTONUP:
hdc=GetDC(hw);
TextOut(hdc,10,40,TEXT("LEFT BUTTON RELEASED"),25);
ReleaseDC(hw,hdc);
return 0;
case WM_RBUTTONDOWN:
hdc=GetDC(hw);
TextOut(hdc,10,70,TEXT("RIGHT BUTTON PRESSED"),25);
ReleaseDC(hw,hdc);
return 0;
case WM_RBUTTONUP:
hdc=GetDC(hw);
TextOut(hdc,10,100,TEXT("RIGHT BUTTON RELEASED"),25);
ReleaseDC(hw,hdc);
return 0;
case WM_KEYDOWN:
switch(w)
{
case VK_END:
MessageBox(hw,"YOU PRESSED END KEY","ERROR",MB_OK);
break;
case VK_HOME:
MessageBox(hw,"YOU PRESSED HOME KEY","ERROR",MB_OK);
break;
case VK_INSERT:
MessageBox(hw,"YOU PRESSED INSERT KEY","ERROR",MB_OK);
break;
case VK_DELETE:
MessageBox(hw,"YOU PRESSED DELETE KEY","ERROR",MB_OK);
break;
}
return 0;
case WM_DESTROY:
PostQuitMessage(0);
return 0;
}
return DefWindowProc(hw,ms,w,l);
}

Ex. No:3 BASIC DRAWING FUNCTIONS

AIM:
To write a program to display keyboard and mouse events.

ALGORITHM:

1. Open Microsoft VC++.
2. Select new from the file menu and click the project tab.
3. Select win32 application.
4. In the project name field type the name of the project.
5. Create a new workspace and select win32 and click empty project and then
Press finish button.
6. Select new from file menu, again click c++ source file
7. Type the program.

PROGRAM:

#include
LRESULT CALLBACK WndProc(HWND,UINT,WPARAM,LPARAM);
int WINAPI WinMain(HINSTANCE h,HINSTANCE hp,LPSTR lps,int in)
{
WNDCLASS wc;
HWND hw;
MSG ms;
wc.style=CS_HREDRAW|CS_VREDRAW;
wc.cbClsExtra=0;
wc.cbWndExtra=0;
wc.hbrBackground=(HBRUSH)GetStockObject(WHITE_BRUSH);
wc.hCursor=LoadCursor(NULL,IDC_ARROW);
wc.hIcon=LoadIcon(NULL,IDI_APPLICATION);
wc.hInstance=h;
wc.lpfnWndProc=WndProc;
wc.lpszClassName="Window";
wc.lpszMenuName=NULL;
RegisterClass(&wc);
hw=CreateWindow("window","FIRST WINDOW", WS_OVERLAPPEDWINDOW, 0, 0, 300, 300,NULL,NULL,h,NULL);
ShowWindow(hw,in);
UpdateWindow(hw);
while(GetMessage(&ms,NULL,0,0))
{
TranslateMessage(&ms);
DispatchMessage(&ms);
}
return ms.wParam;
}
LRESULT CALLBACK WndProc(HWND hw,UINT ms,WPARAM w,LPARAM l)
{
PAINTSTRUCT Ps;
HDC hdc;
static int x1,x2,y1,y2;
switch(ms)
{
case WM_SIZE:
x1=LOWORD(l);
x2=HIWORD(l);
return 0;
case WM_PAINT:
hdc=BeginPaint(hw,&Ps);
Rectangle(hdc,7*x1/8,7*x2/8,7*x1/8,7*x2/8);
MoveToEx(hdc,0,0,NULL);
LineTo(hdc,x1,x2);
MoveToEx(hdc,0,x2,NULL);
LineTo(hdc,x1,0);
Ellipse(hdc,x1/8,x2/8,7*x1/8,7*x2/8);
RoundRect(hdc,x1/4,x2/4,3*x1/4,3*x2/4,x1/4,x2/4);
EndPaint(hw,&Ps);
return 0;
case WM_LBUTTONDOWN:
x1=LOWORD(l);
x2=HIWORD(l);
hdc=GetDC(hw);
TextOut(hdc,x1,x2,"KCG College of Technology",25);
ReleaseDC(hw,hdc);
break;
}
return DefWindowProc(hw,ms,w,l);
}

Ex. No:4 DIALOG BASED APPLICATION USING SDK

AIM:
To write a program for a dialog base application using SDK.

ALGORITHM:

1. Open Microsoft VC++.
2. Select new from the file menu and click the project tab.
3. Select win32 application.
4. In the project name field type the name of the project.
5. Create a new workspace and type the program.
6. After typing, select resource from insert menu and select dialog box.
7. Construct the required box.
8. Choose the approximate class for application program.
9. Execute the program.

PROGRAM:

#include
#include"resource.h"
LRESULT CALLBACK DlgProc(HWND hw,UINT ms,WPARAM w,LPARAM
l);
INT APIENTRY WinMain(HINSTANCE h,HINSTANCE hp,LPSTR lps,int in)
{
DialogBox(h,MAKEINTRESOURCE(IDD_DIALOG1),NULL,(DLGPROC)DlgProc);
return 0;
}
LRESULT CALLBACK DlgProc(HWND hw,UINT ms,WPARAM w,LPARAM l)
{
static int inc;
static BOOL B;
switch(ms)
{
case WM_CREATE:
inc=0;
break;
case WM_CLOSE:
EndDialog(hw,0);
break;
case WM_INITDIALOG:
SetDlgItemInt(hw,IDC_EDIT1,0,TRUE);
SendMessage(GetDlgItem(hw,IDC_RONE),BM_SETCHECK,TRUE,0);
inc=1;
break;
case WM_COMMAND:
switch(LOWORD(w))
{
case IDOK:
EndDialog(hw,TRUE);
break;
case IDCANCEL:
EndDialog(hw,FALSE);
break;
case IDC_ADD:
ms=GetDlgItemInt(hw,IDC_EDIT1,&B,TRUE);
ms+=inc;
SetDlgItemInt(hw,IDC_EDIT1,ms,TRUE);
break;

case IDC_SUB:
ms=GetDlgItemInt(hw,IDC_EDIT1,&B,TRUE);
ms-=inc;
SetDlgItemInt(hw,IDC_EDIT1,ms,TRUE);
break;

case IDC_RONE:
inc=1;
break;
case IDC_RTWO:
inc=2;
break;
case IDC_RFOUR:
inc=4;
break;
case IDC_REIGHT:
inc=8;
break;
}
break;
}
return 0;
}

Ex. No:5 DIALOG BASED APPLICATION USING VC++

AIM:
To write a vc++ program to create a dialog based application.

ALGORITHM:

1. Select MFC AppWizard(exe).
2. Select dialog based application.
3. Accept all default settings.
4. Design the calculator.
5. Use dialog editor assign as

CONTROL ID

EDIT1 IDC_FIRST
EDIT2 IDC_SECOND
EDIT3 IDC_RESULT
RADIO BUTTON IDC_OPERATION
COMMAND BUTTON IDC_COMPUTE

6. Open dialog box properties.

CLICKS-STYLE TAB
SELECT-SYSTEM MENU
-MINIMIZE BOX
7. Use class wizard to add member variables and command handler (in view).
8. Add data member as follows:

CONTROL ID MEMBERVARIABLE TYPE
IDC_LEFT m_dfirst double
IDC_RIGHT m_dsecond double
IDC_RESULT m_dresult double
IDC_OPERATION m_noperator int

9. Use class wizard to add the message handler for IDC_COMPUTE
msg;accept Default function name oncomputer().
10. Write the following code for oncompute() function.

PROGRAM:

Write the following code for OnCompute function in the DialogBased MenuDlg.cpp file

void MENUDlg::OnCompute()
{
UpdateData(TRUE);
switch(m_nOperation)
{
case 0:
m_dResult=m_dFirst+m_dSecond;
break;
case 1:
m_dResult=m_dFirst-m_dSecond;
break;
case 2:
m_dResult=m_dFirst*m_dSecond;
break;
case 3:
if(m_dSecond!=0.0)
{
m_dResult=m_dFirst/m_dSecond;
}
{
MessageBox("Divide by zero");
m_dResult=0.0;
}
break;
}
UpdateData(FALSE);
}

Ex. No:6 SDI AND MDI APPLICATION

AIM:
To develop a SDI and MDI application using application wizard.

ALGORITHM:

SDI APPLICATION:

1. Chose new from VC++ file menu.
2. Select the MFC Appwizard(exe) and give project name.
3. Select single document and deselect the document view architecture.
4. Accept all the default settings and press finish.
5. Now the application wizard creates a new SDI project.
6.Add the code in view.cpp file.
7. Edit the onpain() function in childview.cpp and the code is given.
8. Build and run the application.

PROGRAM:
Single Document Interface

Open the file childView.cpp and edit the OnPaint() function

void CChildView::OnPaint()
{
CPaintDC dc(this);
dc.SelectStockObject(2);
dc.Rectangle(10,10,100,100);
dc.SelectStockObject(3);
dc.Ellipse(100,100,200,200);
dc.TextOut(250,250,"welcome to SDI application");
}

MDI APPLICATION:

1. Chose new from VC++ file menu.
2. Select the MFC Appwizard(exe) and give project name.
3. Select Multiple document and deselect the document view architecture.
4. Accept all the default settings.
5. Go to header file and click childview and add the given codes.
6. Edit childview.cpp in source file and add the given codes.
8. Build and run the application.

PROGRAM:
Multiple Document Interface

Add the private variables in CMDIView.h

private:
CRect m_rectEllipse;

Add the initialization code in MDIView.cpp file constructor.

Open the file ChildView.cpp and do the following changes in OnPaint()

Ex. No:7 MENUS AND KEYBOARD ACCELERATOR

AIM:
To develop menu and keyboard accelerator using application wizard.

ALGORITHM:

Step1- Run vc++ application wizard(exe) to create an SDI application and select the document view architecture and deselect the printing and print preview by accepting all the default settings and click finish to design the project.

Step 2 - Use the resource editor to edit the applications main menu

Step 3 - Click on the resource view tab in the workspace window and edit the IDR_MAINFRAME menu resource to add a separator and a clear document item to edit menu.

Step 4 - Fill the following command ids for the new menu items

Menu Caption Command id

Transfer &GetData From Document \t F2 ID_TRANSFER_GETDATA

Step 5 - Use the resource editor to add keyboard accelerator.

Step 6 - Open the IDR_MAINFRAME accelerator table and then use the insert key to add the items.
Accelerator ID Key
ID_TRANSFER_GETDATA VK_F2

Step 7 - Using class wizard select the CMenuViewClass in Class Name and then add the following member functions as shown below

Object ID Message Member function
ID_TRANSFER_GETDATA Command OnTransferGetData

Step 8 - Using class wizard select the Cmenudoc class and the following member functions
Object id Message Member fucntion
ID_EDIT_CLEAR COMMAND OnEditClear
ID_EDIT_CLEAR UPDATE_COMMAND_UI OnUpdateEditClear

Step 9 - Add a CString data member to the CMenuDoc class and edit the file MenuDoc.h

Step 10 - Edit the document class member functions in MenuDoc.cpp

Step 11 - Add a CRichEditCtrl datamember to the CMenuView class and edit the file MenuView.h

Step 12 - Select the classwizard from menu view to map the WM_CREATE and WM_SIZE messages in the CMenuView class.

Step13 - Edit OnCreate( ) Message handler

Step 14 - Edit OnSize( ) Message handler

Step 15 - Edit OnTransferGetdata( ) Message handler

Step 16 - Build and test the program.

PROGRAM:

Add a CString data member to the Cmenudoc class and edit the file MenuDoc.h

Public:
CString m_strWindowText;

Edit the document class member functions in MenuDoc.cpp

BOOL CMenuDoc::OnNewDocument()
{
m_strWindowText = "Copy Successful";
if (!CDocument::OnNewDocument())
return FALSE;
return TRUE;
}

Add a CrichEditCtrl datamember to the cmenuviewclass and edit the file MenuView.h

public:
CRichEditCtrl m_richEdit;

Edit OnCreate( ) Message handler

int CMenuView::OnCreate(LPCREATESTRUCT lpCreateStruct)
{
CRect rect(0,0,0,0);
m_richEdit.Create(ES_AUTOVSCROLL|ES_MULTILINE|ES_WANTRETURN|WS_CHILD|WS_VISIBLE|WS_VSCROLL,rect,this,1);
if (CView::OnCreate(lpCreateStruct) == -1)
return -1;
return 0;
}

Edit OnSize( ) Message handler

void CMenuView::OnSize(UINT nType, int cx, int cy)
{
CView::OnSize(nType, cx, cy);
CRect rect;
GetClientRect(rect);
m_richEdit.SetWindowPos(&wndTop,0,0,rect.right - rect.left,rect.bottom - rect.top,SWP_SHOWWINDOW);
}

Edit OnTransferGetdata( ) Message handler

void CMenuView::OnTransferGetdata()
{
CMenushriDoc* pDoc=GetDocument();
m_richEdit.SetWindowText(pDoc->m_strWindowText);
m_richEdit.SetModify(FALSE);
}

Ex. No:8 TOOLBAR

AIM:
To prepare a tool bar to perform drawing functions.

ALGORITHM:

1. Run vc++ application wizard(exe) to create an SDI application and select the
Document view architecture and deselect the printing and print preview by
Accepting all the default settings and click finish to design the project.

2. Use the resource editor to edit the applications main menu.
3. In resource view,double click on IDR_MAINFRAME under MENU and EDIT
The ID_MAINFRAME menu resource to create a menu.

MENU CAPTION COMMAND ID

Draw Circle ID_DRAW_CIRCLE
Draw Pattern ID_DRAW_PATTERN

4. Use the resource editor to update the application’s toolbar.
5. Edit the IDR_MAINFRAME toolbar resource to create a bitmap.
6. Assign the IDs as ID_DRAW_CIRCLE and ID_DRAW_PATTERN to the two
new buttons.
7. Use class wizard to add CToolBarsStatusView.h view class message handlers
for the following command and update command UI messages.

OBJECT ID MESSAGE MEMBER FUNCTION
ID_DRAW_CIRCLE COMMAND OnDrawCircle
ID_DRAW_CIRCLE UPDATE_COMMAND_UI OnUpdateDrawCircle
ID_DRAW_PATTERN COMMAND OnDrawPattern
ID_DRAW_PATTERN UPDATED_COMMAND_UI OnUpdateDrawPattern

8. Add three data members to the CToolBarStatusView Class and edit the file ToolBarStatusView.cpp.
9. Build and test the application.

PROGRAM:

Edit the ToolBarView.h file and
add the following three data members
private:
Crect m_rect;
BOOL m_bCircle;
BOOL m_Pattern;

Edit the ToolBarView.cpp file as follows.

CToolView::CToolView():m_rect(0,0,150,150)
{
m_bCircle=TRUE;
m_bPattern=FALSE;
}

Edit OnDraw() Function in ToolBarView.cpp file

CToolDoc* pDoc = GetDocument();
ASSERT_VALID(pDoc);
CBrush brush(HS_BDIAGONAL,5L);
if(m_bPattern)
{
pDC->SelectObject(&brush);
}
else
{
pDC->SelectStockObject(WHITE_BRUSH);
}
if(m_bCircle)
{
pDC->Ellipse(m_rect);
}
else
{
pDC->Rectangle(m_rect);
}
pDC->SelectStockObject(WHITE_BRUSH);

Edit OnDrawCircle() Function in ToolBarView.cpp file

void CToolView::OnDrawCircle()
{
// TODO: Add your command handler code here
m_bCircle=TRUE;
m_rect+=CPoint(25,25);
InvalidateRect(m_rect);
}

Edit OnUpdateDrawCircle() Function in ToolBarView.cpp file

void CToolView::OnUpdateDrawCircle(CCmdUI* pCmdUI)
{
// TODO: Add your command update UI handler code here
pCmdUI->Enable(!m_bCircle);
}

Edit OnDrawPattern() Function in ToolBarView.cpp file

void CToolView::OnDrawPattern()
{
// TODO: Add your command handler code here
m_bPattern ^=1;
}

Edit OnUpdateDrawPattern() Function in ToolBarView.cpp file

void CToolView::OnUpdateDrawPattern(CCmdUI* pCmdUI)
{
// TODO: Add your command update UI handler code here
pCmdUI->SetCheck(m_bPattern);

}

Edit OnDrawSquare() Function in ToolBarView.cpp file

void CToolView::OnDrawSquare()
{
// TODO: Add your command handler code here
m_bCircle=FALSE;
m_rect+=CPoint(25,25);
InvalidateRect(m_rect);
}

Edit OnUpdateDrawSquare() Function in ToolBarView.cpp file

void CToolView::OnUpdateDrawSquare(CCmdUI* pCmdUI)
{
// TODO: Add your command update UI handler code here
pCmdUI->Enable(m_bCircle);
}

Ex. No:9 DYNAMIC LINKING LIBRARY

AIM:
To create a server DLL with a function to display the string and to invoke that function from the client DLL.

ALGORITHM:

1. Run VC++ to create an MFC AppWizard(DLL) and type the project name.
2. Select regular DLL using shared MFC DLL and click finish.
3. Goto class view and right click the MyDLL class and choose new class.
4. Select class type to be generic class and type the class name as CMyclass then
click ok.
5. Then add member function to the CMyClass by right clicking the CMyClass and type the function type as double and function name as calc(double a,double b) and acces type as public.
6. Add the function definition in MyClass.cpp.
7. To call the dll function from external application we have to prefix the function with the signature in myclass.h-declspec(dllexport).
8.complete the code without executing.

DLL CLIENT(testdll.dsw):

1. Run vc++ application wizard(exe) to develop a dialog based application and click finish to develop the project.
2. The resource editor will be enabled on finishing the project and add now design the dialog box.
3. Add the Id for the edit control IDC_NAME and add the add the member variable as m_edit and type as CString by using the class wizard.
4. Use the class wizard to map the message OnOk function for IDOk in the testDlldlg.cpp.
5. Now edit the code no TestDlldlg.cpp.
6. Now add the entire path of MyDll server reader file in TeatDlldlg.
7. Create an object for CMyclass of Mydll in TestDlldlg.cpp as CMyclass.objmyclass.
8. click the project menu and select the settings and click on the link tab type the entire path of Mydll lib file in the object/library modules text box as C:\MyDll\debug\MyDll.lib.
9. Now copy the MyDll.dll in the MyDll debug folder in to the TestDll folder.
10. Now build the project and execute by giving your name on the editbox.press ok.so that the message box will be displayed.

PROGRAM:

Open the file MyClass.cpp and do the following changes in the function SayHello()

CString CMyClass::SayHello(CString StrName)
{
return "Hello"+StrName;
}

________________________________________________________________________

Open the file MyClass.h and do the following changes

public:

_declspec(dllexport)CString SayHello(CString StrName);
_declspec(dllexport)CMyClass();
_declspec(dllexport)virtual ~CMyClass();

_______________________________________________________________________

Open the file testdlldlg.cpp and do the following changes in OnOk() function.

void CTestDLLDlg::OnOK()
{
// TODO: Add extra validation here
UpdateData(TRUE);
CMyClass ObjMyClass;
CString Str = ObjMyClass.SayHello(m_edit);
AfxMessageBox(Str);
CDialog::OnOK();
}

Open the file testDlldlg.h file and include the following statement.

#include "c:\MyDLL\MyDLL\MyClass.h"

Click the project menu and select the settings option and click the link tab and type the path as

"C:\MyDLL\MyDLL\debug\MyDLL.lib" in the object library text box.

Now copy the mydll.dll in the MyDLL debug folder into the testdll folder.

Ex. No:10 ACTIVEX CONTROLS

AIM:
To install ActiveX controls in our program and to perform some operation.

ALGORITHM:

1. Run vc++ application wizard(exe) to create an SDI application and select the document view architecture and deselect the printing and print preview by accepting all the default settings.
2. Select the ActiveX controls in the AppWizard step3 dialog make sure ActiveX controls option is selected.
3. Choose add to project from VC++ project menu,then chosse the components and conrrols.
4. Choose registered ActiveX controls and choose calendar control 8.0.
5. Use the dialog editor to Create a new dialog resource .choose resource from insert menu and then choose dialog and create the dialog.
6. Change the ID of newly created dialog as IDD_ACTIVEXDIALOG Accept default then click ok and CANCEL with ID’s IDOK and IDCANCEL.Select new from file menu, again click c++ source file.
7. Modify the ID of all the controls in the dialog box.Add the ID of the controls in the dialog.

CONTROL ID
Calendar Control IDC_CALENDAR
Select date Button IDC_SELECTDATE
Edit Control IDC_DAY
Edit control IDC_MONTH
Edit Control IDC_YEAR
Next Week Button IDC_NEXTWEEK

8.Use class wizard to create the CActiveXDialog class for newly created Dialog box.Select the class wizard from view menu.
9. Click on the class wizard message maps tab an dthen add the following message handler functions.

OBJECT ID MESSAGE MEMBER FUNCTION
CActiveXDialog WM_INIDIALOG OnInitDialog(virtual function)
IDC_CALENDAR NextMonth(event) OnNewmonthCalendar
IDC_SELECTDATE BN_CLICKED OnSelectDate
IDC_NEXTWEEK BN_CLICKED Onnextweek
IDOK BN_CLICKED OnOk(virtual function)

10.Use class wizard to add datamembers to CActiveXDialog class.Add the data member in the CActiveDialog class by using class wizard.
11.Edit the ActiveXDialog .h and add the m_varvalue and m_back data members.
12.Initialize the m_BackColor value in Active in ActiveDialog.h.
13.Edit the message handling functions OnInitDialog,OnNewMonthCalendar,OnSelectDate,OnNextWeek and OnOk in ActiveDialog.cpp.
14.Add the message handler for the view class for displaying the dialog box on the view window when the user presses the left mouse button.Use class wizard to map the WM_LBUTTONDOWN message and then edit the handler function.
15.Edit the virtual function OnDraw function and include the header file #include”ActiveXDialog.h” in the file
AcitveXcontorlsView.cpp.
16.Build and run the project.

PROGRAM:

Edit the ActiveXDialog.h file and add the data members

// Dialog Data
//{{AFX_DATA(CactiveXDialog)
enum { IDD = IDD_ACTIVEXDIALOG };
Ccalendar m_calendar;
short m_sDay;
short m_sMonth;
short m_sYear;
//}}AFX_DATA
COleVariant m_varValue;
Unsigned long m_BackColor;

Initialize the m_BackColor value in ActiveXDialog.cpp file as,
CActiveXDialog::CActiveXDialog(CWnd* pParent /*=NULL*/)
:Cdialog(CActiveXDialog::IDD,pParent)
{
//{{AFX_DATA_INIT(CActiveXDialog)
m_sDay = 0;
m_sMonth = 0;
m_sYear = 0;
//}}AFX_DATA_INIT
m_BackColor = 0x8000000F;
}

Open the file CActiveXDialog.cpp file and do the following changes on OnInitDialog, OnNewMonthCalendar1, OnSelectDate, OnNextWeek, and OnOk as follows,

BOOL CActiveXDialog::OnInitDialog()
{
CDialog::OnInitDialog();
m_calendar.SetValue(m_varValue);
return TRUE;
}
void CActiveXDialog::OnNewMonthCalendar1()
{
AfxMessageBox(“EVENT:ActiveXDialog::OnNewMonthCalendar1”);
}
void CActiveXDialog::OnSelectDate()
{
CDataExchange dx(this,TRUE);
DDX_Text(&dx, IDC_DAY,m_sDay);
DDX_Text(&dx, IDC_month,m_sMonth);
DDX_Text(&dx, IDC_YEAR,m_sYear);
m_calendar.SetDay(m_sDay);
m_calendar.SetMonth(m_sMonth);
m_calendar.SetYear(m_sYear);
}
void CActiveXDialog::OnNextWeek()
{
m_calendar.NextWeek();
}
void CActiveXDialog::OnOk()
{
CDialog::OnOk();
m_varValue = m_calendar.GetValue();
}

Use class wizard to map WM_LBUTTONDOWN message and then edit the handler function OnLButtonDown which is as follows.
void CActiveXControlsView::OnLButtonDown(UINT nFlags, CPoint point)
{
CActiveXDialog dlg;
dlg.m_BackColor = RGB(255, 251, 240);
COleDateTime today = COleDateTime::GetCurrentTime();
dlg.m_varValue =OleDateTime(today.GetYear(),today.GetMonth(), today.GetDay(), 0, 0, 0);
if(dlg.DoModal() == IDOk)
{
COleDateTime date(dlg.m_varValue);
AfxMessageBox(date.Format(“%B %d, %Y”);
}
}

Open the ActiveXDialog.cpp file to include the following statements.
#include “ActiveXDialog.h”

Open ActiveXControlView.cpp and do thye following changes in OnDraw function.
void CActiveXControls View::OnDraw(CDC* pDC)
{
pDC->TextOut(0,0,”Press the left mouse here”);
}

Ex. No:11 DATABASE ACCESS THROUGH ODBC

AIM:
To create a database using MS Access the database from VC++ through ODBC database connectivity.

ALGORITHM:

1. Create the database namely purchase with the fields namely book name and cost using MS Access.
2. Run VC++ application wizard to create an SDI application.Accept all the default settings and select MFC AppWizard(exe) and type the project name and select the document view architecture.
3. In step of MFC Appwizard.Select database view with support and click the database button.
4. Then select ODBC and select MS Access database and click ok.
5. Then select the database from the directory where we have created the database and click ok.select the table.
6. Now click OK and then accept all the default settings of the project and click finish and the files developed.Select new from file menu, again click c++ source file
7. Once you click finish a dialog box will appear and design the dialog box as shown.
8.Then create member variables for two variables name and cost.

CONTROL ID TYPE MEMBER
IDC_EDIT1 CString m_text1
IDC_EDIT CString M_text2

9. Then create message handler function for the button and edit the code.
10. Build and run the program.

PROGRAM:

void CDatabaseView::OnButton1()
{
m_text1=m_pSet->m_StudentName;
UpdateData(false);
m_text2=m_pSet->m_RollNo;
UpdateData(false);
m_text4=m_pSet->m_Fee;
UpdateData(false);
}

Ex. No:12 IMPLEMENTATION OF COM

AIM:

To implement COM and to check its functionality using visual basic.

ALGORITHM:

1. Start VC++.
2. Select new from file menu and select Allcom AppWizard.accept all the default
Settings.Clicking Dll and then finish button.
3. Click class file, right click and then select new ATL object.
4. Then click simple object in ATL object wizard and click next.
5. Fill the ATL object wizard attributes and click ok.
6. Right click the project class workspace to add a method.
7. Fill the method name ‘add’ and attributes as [in]long a,[in]long
b,[out]long c and click ok.
8. Right click and write the following code for the function.
9. Save the project, compile the code without executing and the com is
new Created successfully.
10. Now test COM using Visual Basic and open VB6.0 and create a new standard
exe project.
11. Then create a new form and design a button.
12. Select references on the project menu. Browse and select COM project.
13. Open the COM project and select library file and activate COM type
library.
14. Write the following code for the command button.
15. Run the project.

PROGRAM:

STDMETHODIMP CTEST_ATL::add(long a, long b, long *c)
{
*c=a+b;
return S_OK;
}
private sub Command1_Click()
Dim a As KCG_ATL1Lib.TEST_ATL
Set a = New TEST_ATL
Dim x As Long
a.Add 20, 30, x
MsgBox (“20+30”= &x)
End Sub

COMPONENT BASED TECHNOLOGY (IT-1401)

2009-08-18T22:11:00.000-07:00

UNIT-I

TWO MARK QUESTIONS:

1. Define software component.
A software component is a system element offering a predefined serviceable to communicate with other components.
2. Specify the characteristics of object?
Object is a unit of instantiation, it has a unique identity. It may have state and this can be externally observable.
3. What is prototype object?
The object may be implicitly available in the form of an object that already exists. Such a preexisting object is called a prototype object.
4. What is factory object and methods?
Factory objects: It can be an object of its own. Factory methods: Methods on objects that return freshly created other objects are another variation.
COMPONENT BASED TECHNOLOGY (IT-1401)
Modules do not have a concept of instantiation whereas classes do. Modules can be used and always and have been used to package multiple entities.
6. Specify the non-technical aspects that are need in interfaces
A component have multiple interfaces, each representing a service that the component offers.
Redundant introductions of similar interfaces need to be minimized.
Requires a small number of widely accepted unique naming schemes.
7. Define callback.
Callbacks are a common feature in procedural libraries that has to handle asynchronous events.
8. What is component architecture?
Component architecture is the pivotal basis of any large-scale software technology and is of utmost importance for component based systems.
9. Specify some cornerstones of a component architecture.
Interaction between components and their environment is regulated.
The roles of components are defined.

10. Specify the roles of an architecture.

Architecture needs to create simultaneously the basis for independence and cooperation.
An Architecture defines overall invariants.
It needs to be based on the principal considerations of overall functionality
It prescribes proper frameworks for all involved mechanisms.
11. What is the use of conceptual level?
A component framework is a dedicated and focused architecture usually around a few key mechanisms and a fixed set of policies for mechanisms at the component level.
12. Define component framework.
A component framework is a dedicated and focused architecture usually around a few key mechanisms and a fixed set of policies for mechanisms at the component level.
13. What is a resource?
A resource is a frozen collection of typed items.
14. Define middleware.
Middleware is a name for the set of software that sits between various operating systems and a higher distributed programming platform.
15. Categorize the middleware.
Message oriented middleware(MOM).
Object oriented middleware(OOM).

16. What is generative programming?
Generative programming aims at transformations approach to the construction of software.
17. Specify the areas used in generative approaches.
Used to produce individual components.

Used to enhance composed systems.
18. Specify the criteria that is used to fulfill the software definition.

Multiple use
Non-context specific.
Composable with other component.
Encapsulated.
19. Specify the fundamental properties of component technology.
If a component fails to function it must not violate system-wide rules.
Software development processes that do not depending on testing
Performance of a component system is affected in non-trivial ways by the actual composition
Tool interfaces are standardized.

20. What is enhance composed systems and give example.
They need to be positioned in such a way that they do not interfere with the unit of deployment characteristic of components. Eg:JIT technique.

BIG QUESTIONS:

1.Explain the fundamental properties of component technology.

Technological feasibility

Technical problems

Integration and testing

Potential of software components

2. Explain briefly about component architecture.

Role of architecture

A Tiered component architecture

Components and middleware
3. Explain briefly about callbacks with example

Definition

Diagram

Explanation

Eg: Directory service
4. Write short notes on modules, interfaces.

Modules

Interfaces

5. Write short notes on objects and software components.

Software components.

Objects

UNIT II

TWO MARK QUESTIONS:

1. Define Java Bean.
Java Bean is a software component that has been designed to be reusable in a variety of different environment.
2. What are the aspects of the bean model?

Events

Properties

Introspection

Customization

Persistence
3. Give any 4 advantages of java bean?

A bean contain all the benefits of java “Write once,Run anywhere” paradigm

The configuration settings of a bean can be saved in persistence storage and restored at later time.

A bean may register to receive events from other objects.

Auxillary software provided to help a person configure a bean.
4. What is the use of application builder tool?
When working with java beans, most developers use an application builder tool, a utility that enables you to configure a ser of beans , connect them together and produce a working application.
5. What are the major capabilities of application builder tool?

A pallete is provided that lists all of the beans, as additional beans are developed or purchased , they can be added to the palette.

A worksheet is displayed that allows the designer to layout beans in a graphical user interface. A designer may drag and drop a bean from the palette to this worksheet.
6. What are Events?
Bean instances are potential sources or listener of specific types of events. An assembly tool can then connect listeners to sources.
7. What is multicast and unicast semantics?
Unicast semantics – At a time, one listener is active. Multicast semantics - All listeners are active at anytime.

8. Define property?
Property is a discrete named attribute of a bean that can affect its appearance or behaviour.
9.What are the different properties that a bean can define?

Simple

Indexed

Bound

Constrained

12. What is introspection and reflection?
Introspection is used to find out events mthods, properties, standard interface and classes. Reflection is a type of event listener. It is used to analyze software components or software.
13. Write syntax to create jar and manifest file.
For jar file: Jar cf XYZ.jar *. class *.gif For manifest file: Jar cfm XYZ.jar YXZ.mf *.class *.gif.
15. What is the use of manifest file?
Developers much provide a manifest file to indicate which of the components in a JAR file are java beans.
16. Advantageof reflection.

It allows a package (java.lang.reflect) store in class.
It is used to get information at runtime.
17. Which method is used for serializes and deserializes an object.
The method Externalizable is used for serializes and deserializes an object.
18. Specify the methods that are used in Externalizable interface.
Void read External (object input I stream) Throws IOException, classNotFoundException. Void write external(object output out stream)throws to Exception.
19. What is EJB?
EJB is a comprehensive technology that provides the infrastructure for building enterprise level server side distributed java components.
20. Differentiatebetween java bean and EJB.
Java bean approach to composition is connection-oriented programming where as EJB to composition is conventional model of object oriented composition.
21. Specify the varieties of bean.

Session

Stateful
Stateless
Entity
Message driven
22. What are the steps to create a simple bean?

Create subdirectory

Compile the source code

Create the manifest file.

Create jar file

Run
BIG QUESTIONS:
1.Explain the thread lifecycle.

New born state

Running state

Runnable state

Dead state
2. Explain the different properties that a bean can define.
Simple
Indexed
Bound

Constrained
3. Explain object serialization in detail.

Serializable

Externalizable

Object input/stream

Object output/stream

Example
4. What is EJB? Explain about EJB architecture.
Definition
Diagram
Varieties of bean
Entity relationship
5. Write a program to create a color bean by using event handling.
Program
6. Write briefly about distributed object models and RMI.
Definition
Explanation
Example

UNIT III

TWO MARK QUESTIONS:

1. Why we need CORBA?
It is used to solve one fundamental problem-“how can distributed object oriented systems implemented in different languages and running on different platforms?”
2. What are the essential parts of CORBA?

Invocation Interfaces

Object Request Broker

Object Adapters
3. What are the requirements need to work invocation interfaces and object adapters?

All object interfaces need to be described in a common language.

All languages used must have bindings to the common language.
4. What is the use ORB?
An ORB is capable of loading and starting an object servant which receiving invocation requests for an object of that servant.
5. What is responsible of object adapter?
An object adapter is responsible for which servant serves telling an ORB which new object.
6. Differentiate stubs and skeletons.
Sl.no

Stubs Skeletons
1. 2.
Called client side proxy objects. It forwards all invocations through the

ORB to the real target object.
Called server side stubs It directly invokes the target method.

7. Specify the features of SOM.

Meta programming

Binary compatibility
8. Specify any four services supporting enterprise distributed computing.

Naming and trader service.
Event and notification service
Object transaction service
Security service
9. Specify any four services supporting architecture using fine-grained objects?

Concurrency control service
Licensing service
Lifecycle service
Relationship service
Persistent state service
10. What is naming service?
It allows arbitrary names to be associated with an object. Names are unique within a naming context and naming contexts from a hierarchy.
11. What is push model?
In push model the event supplier calls a push method on the event channel, which reacts by calling the push method of all registered consumers.
12. What is pull model?
In pull model the consumers call the pull method of the event channel, effectively pooling the channel for events.
13. What is the life cycle service?
This service supports creation, copying, moving and deletion of objects and related group of objects.
14. What are the features of CCM components?
Ports that are classified into facets, receptacles, event sources and event sinks.
Primary keys, which are values that instances of entity components
Attributes and configuration
Home interfaces
15. What is facet?
A special of CCM components is the equivalent interface, which enables navigation between the different facts of a CCM component.
16. What is Receptacles?
Receptacles provide connect and disconnect operations and internally correspond to object references top other objects of appropriate type.
17. What is home interface?
The home interface is provided by a component, not its instances, and supports the creation of new instances.
18. What is the use of primary keys?
Primary keys which are values that instances of entity components provide to allow client identification of the instances.
19. What is attribute and configuration?
Configuration interfaces support initial configuration of new component instances. They are described as IDL attributes with set and get operations.
20. What is MDA?
The OMG architecture board introduced a new approach called model driven architecture for all forthcoming OMG specifications.

BIG QUESTIONS:

1. Explain briefly about the CORBA services
Services supporting enterprise distributed computing.
Services supporting architecture using fine-grained objects.
2. Explain the CORBA component model.
Portable object adapter
CCM components
CCM containers
3. Write short notes on SOM and MDA.
SOM

Meta programming
Binary compatibility
MDA
4. Explain briefly about IDL interface.
IDL interface
Modules
Data types
5. Explain briefly about CCM components.
Features
Diagram

UNIT-IV

TWO MARK QUESTIONS:

1. Define COM?
COM is binary standard, it specifies nothing about how a particular programming language may be bound to it. COM does not specify what a component or an object is.

3. Name and two interfaces that is used in COM?

Query interface

Iunknown interface
4. What is the use of Query interface method?
Query interface takes the name of an interface, checks if the current COM object supports it, and if so returns the corresponding interface reference.
5. What is the use of Iunknown interface?
The identity of the Iunknown interface can serve to identify the entire COM object with out requiring any specific functionality.
6. What are the methods supported by Iunknown interface?
Query Interface
AddRef
AddRelease
7.Specify the use of HRESULT type.
The type HRESULT is used by most COM interface methods to indicate success or failure to call. It may also indicate network failure.
Interface node OP1 OP2 OPn Component

8. What is AddRef and Release?
On creation of an object or node, the reference count is initialized to 1 before handling out a first reference. Each time a copy of a reference is created the count must be incremented (AddRef). Each time a reference is given up, the count must be decremented (Release).
9. Specify the two forms of object reuse.
Containment
Aggregation
10. What is containment?
Containment is a form of object reuse. It is just the simple object composition technique. One object holds an exclusive reference to another. Here the call is forwarded and handled by another object.
11. What is aggregation?
Aggregation is a form of object reuse. Here instead of forwarding requests, an inner object’s interface reference could be handed out directly to another object’s client.
12. When we use Aggregation?
Aggregation is only useful where the outer object does not wish to intercept calls to perform some filtering or additional processing.
13. Compare COM and DCOM.
DCOM transparently expands the concepts and services of COM. DCOM builds on the client-side proxy objects and the server side stub objects already present in COM.
14. What is outgoing interface?
An outgoing interface is an interface that a COM object would use if it were “connected” to an object that provides this interface.
15. Name the interface that is declared within outgoing interface.
IConnectionPointContainer
IConectionPoint
16. Specify the use of IConnectionPointContainer
? Using IConnectionPointContainer ,the various connection point objects of a connectable object can be found and enumerated.
17. Specify the use ofIConnectionPoint?
IConnectionPoint can be used to establish, enumerate and tear down connections.
18. How the connectable objects implement change propagation?
Connectable objects provide a uniform way to implement change propagation. As outgoing and incoming interfaces are matched, the propagation can take the form of regular method invocations instead of requiring the creation of event objects.
19. Specify the policies that are used to determine the shared assemblies in GAC.
Publisher policy
Application policy
Machine policy
20. What is Appdomains?
The CLR execution engine partitions a process into one or more AppDomains. An AppDomain isolates sets of object from all objects in other appdomain, but is more light weight and cheaper than operating systems.
21. What are contexts?
A context is a partition of an appdomain the member objects, objects of which share the propreties of their contexts.
22. What is reflection?
The CLI reflection support grants full access to the type structure of loaded assemblies including all attributes defined on these types.
23. What is remoting?
The CLI remoting support combines context and reflection infrastructure with flexible support for proxies, channels and messages provide building blocks for a wide variety of communication styles and patterns.

BIG QUESTIONS:

1. Explain the COM services in detail.
Dispatch interfaces
Connectable objects
2. Explain in detail the compound document and OLE.
OLE containers and services
Controls-ActiveXcontrols
3. Explain briefly about the .Net components.
Assemblies
Single application
Shared application
Policies
4. Write short notes on AppDomains, contexts, reflection,remoting
AppDomains
Loading
Unloading
Contexts
Context bound
Context Agile
Reflection
Remoting
5. Explain about dual interface and outgoing interfaces.
Dual interface
Idispatch method
DispID
Outgoing interface
IConnectionPointContainer
IConnectionPoint

UNIT V

TWO MARK QUESTIONS

1. What is component and connectors?
Architecture Description Language(ADL) typically distinguish components and Connectors .Components are mean to provide functionally while connectors focus on connectivity .
2. What is connection oriented approach?
A pure connection oriented approach, all components are restricted to only interact with other components if connected appropriately
3. What is the main difference between earley and later ADL?
Early ADL:were restricted to static connectivity . Later ADL:Added su
pport for dynamic connectivity and dynamic
reconfiguration.
4. What is the use of COM apartments and MTS?
COM apartments are used to separate objects by threading model . MTS contexs are used to separate objects by transational domain
5. What is the use of EJB container?
An EJB container allows a class to be attributed to request explicit transaction control
6. What is CLR context?
The CLR context infrastructure is probably the first mainstream attempt to provide a genuinely extensible infrastructure for contextual composition
7. What are the flavours in CLR objects?

Value types
Pass-by-value type
Pass-by-reference type
Context-bound type
8. What is context bound type?
Context bound types always reside inside a context that is equipped with Appropriate properties. All other objects reside outside of any context and so are context agile
9. What is black box component framework?
The black box component frame work is part of the black box component oriented rapid development tool and component oriented programming environment
10. Why we need black box?
Black box was designed to avoid a single language island syndrome by supporting the standard object model of the underlying platform, most prominently COM on windows platforms
11. Compare OOP and COP.
OOP: addresses the fundamental aspects of programming object oriented solutions COP: addresses the aspects of programming components
12. Specify the things that are required in component programming .
Polymorphism
Modular encapsulation
Late binding and loading
Safety
13. What is caller encapsulation ?
Is the area that benefits from language support is that of interfece definitions . When exposing an interface on a component boundary ,two different intensions may be Involved
14. Specify the two different intensions that are used in caller encapsulation
Component external code may need to invoke operations of the Exposed interface
Component internal code may need to invoke operations that implement the exposed interface
15. What are the problems of asynchrony?
Te natural form of event distribution is multicasting
Event object recipients are themselves free to post new events
The set of recipients could change while a multicast is in process
16. What is multithreading?
It is the concept of supporting multiple sequential activities concurrently over the same state space. The resulting increase in complexity over sequential programming is substantial.
17. What is the use of RAD?
Component development should use rapid application development methods to capture requirements quickly within a working component system
18. What are the two strategies used in component testing tool?
To avoid errors statically wherever possible
To make sure that components are deployed in such a way that faults leave logged traces
19. What is rule of thumb?
A rule of thumb is that most errors that can be caught using automated runtime debugging aids could be statically avoided , had a better language been chosen for the implementation.
20. What is software assembly?
Software assembly is different from hardware assembly in that it is not necessary to assemble individual instances repeatedly –the entire assembled product can instead be cloned

BIG QUESTIONS:

1. Explain briefly about component oriented programming
Problems of asynchrony
Multithreading
Leaning from circuit design
Nutshell classes
Language support
Caller encapsulation
2. Explain about component framework
Component framework verses connectors
Component framework verses metaprogramming
Component framework verses aspect-oriented programming
3. Explain about black box and OLE
Direct-to-COM
Black box components
OLE
4. Explain the tools that are used in components
Component design and implementation tools
Component testing tools
Component assembly tools
5. Explain briefly the cross development environment
Portos IDE
IDE with black box
Cross-development tools

E-COMMERCE (IT1007)

2009-08-17T21:20:00.000-07:00

EIGHT SEMESTER

UNIT-1

TWO MARKS QUESTIONS

1. What is e-commerce?
E-commerce is a modern business methodology that addresses the needs
of organization, merchants and consumers to cut costs while improving the
quality of goods and services and increasing the speed of service delivery.
2. What is i-way?
E-commerce is associated with the buying and selling of information,
products, and services via computer networks today and in the future via any one
of the myriad of networks that make up the information superhighway (i-way).
3. What is cross-media convergence?
Cross-media convergence refers to the integration of various industries—
entertainment, publication, and communication media—based on multimedia
content.
4. List some simple technological advances that drive the phenomenon of
convergence?
· Convergence of content
· Convergence of transmission
· Convergence of information access
5. List some components of multimedia?
Some components of multimedia are: text, audio, video, images,
animation, graphics, hologram, and numerical data.
6. What is message passing?
The client-server model allows the client to interact with the server
through a request –reply sequence governed by a paradigm known as message
passing.
7. List some challenges that each highway route provider faces?
· Telecom-based
· Cable-based
· Computer Network-based
· Wireless
8. List the functions of the supply-chain management?
· Supplier Management
· Inventory Management
· Distribution Management
· Channel Management
· Payment Management
· Financial Management
· Sales force productivity
9. What is a terminal equipment?
Customer Premises Equipment(CPE) or terminal equipment is a generic
term for privately owned communications equipment that is attached to the
network.
10. List some drawbacks of ADSL?
Asymmetric digital subscriber line has the following drawbacks: It cannot
handle live transmissions, and the picture it produces is not as clear as that
provided by a well-tuned cable hookup.
11. What is fast packet switching?
The bundles of data, known as packets move through a network at very
high speeds and this routing technique is known as fast packet switching.
12. List the 4 types of “last mile” connections?
The four types of last mile connections are: plain old telephone system
(POTS) wires, cable TV coaxial cable, electricity wires, and wireless.
13. What is HDT?
The digital video signals from all providers are combined on a video
distribution element known as host digital terminal (HDT).
14. Give two advantages of DBS?
Two advantages of Direct Broadcast satellite are:
· Availability
· Affordability
15. List the two types of DBS available?
· PrimeStar DBS service
· Direct Satellite Service
16. List some major issues that will play a crucial role in defining the i-way?
The major issues are: cost, subsidies, allocation of scarce resources,
regulation, universal access, privacy, and social issues.
17. What is a Network Access Point?
A NAP is a high speed network or switch to which a number of routers
can be connected for the purpose of traffic exchange and interoperation.
18. What is a routing arbiter?
A Routing Arbiter (RA) is an element that is introduced into the NAP
architecture. RA organization implements the concept of policy-based network
routing that enables routing of traffic between different network operators.
19. List the goals of Gigabit Network Research?
There are two goals:
· To advance the technology and understanding of requirements for high speed
networking.
· To explore the potential applications for such a network that are of importance
to business and society in general.
20. List some services of the internet?
Some services of the internet are:
· Individual to group communications
· Information Transfer and delivery services
· Information Databases
· Information Processing services
· Resource-sharing services

16-MARKS QUESTIONS

1. Explain E-commerce Framework? ¾Information Super-highway ¾Information and Multimedia Content ¾Technical Standards
2. Explain E-commerce and Media Convergence? ¾E-commerce, Convergence ¾Cross-Media ¾Technological Advances
3. Explain the anatomy of E-commerce applications? ¾Multimedia Content for e-commerce applications ¾Multimedia Storage servers & e-commerce applications ¾Information Delivery/ Transport and e-commerce applications ¾Consumer access devices
4. Explain the network infrastructure for e-commerce? ¾Market forces influencing the i-way ¾Network access equipment ¾The “Last Mile” ¾Global Information Distribution Networks ¾Public policy issues shaping the i-way
5. Explain the Internet as a Network Infrastructure? ¾Chronological history of the internet ¾NSFNET: Architecture and components ¾National Research and Education network ¾Globalization of the Academic Internet ¾Internet Governance and Applications
UNIT – II
1. What are the 3 types of electronic tokens?
· Cash or real-time
· Debit or prepaid
· Credit or postpaid
2. What are the properties of e-cash?
· E-cash must have a monetary value
· It must be interoperable
· It must be storable and retrievable
· It should not be easy to copy or tamper with while being exchanged
3. Write notes on electronic checks.
Electronic checks are another form of electronic tokens. They are designed
to accommodate the many individuals and entities that might prefer to pay on
credit or through some mechanism other than cash.
4. What are smart cards?
Smart cards are credit and debit cards and other card products enhanced
with microprocessors capable of holding more information than the traditional
magnetic stripe.
5. Mention the 2 types of smart cards.
· Relationship-based smart credit cards
· Electronic purses
6. What are the 3 basic categories of credit card payment on on-line networks?
· Payment using plain credit card details
· Payment using encrypted credit card details
· Payments using third-party verification
7. Mention some factors to be included for designing electronic payment
systems.
· Privacy
· Security
· Intuitive interface
· Database integration
· Brokers
· Pricing
· Standards
8. Define EDI.
Electronic Data Interchange (EDI) is the electronic transfer, from computer to
computer, commercial and administrative data using an agreed standard to
structure an EDI message.
9. Specify the 4 layers of EDI architecture.
· EDI semantic layer
· EDI standard layer
· EDI transport layer
· Physical layer
10. Mention the benefits for international trade.
· Reduced transaction expenditure
· Quicker movement of imported and exported goods
· Improved customer service through “track and trace” programs
· Faster customer clearance and reduced opportunities for corruption, a huge
problem in trade.
11. Give out the basic kit necessary for EDI implementation.
· Common EDI standards
· Translation software
· Trading partners
· Banks
· EDI value-added networks (VANs)
· Proprietary hardware and networking
12. What are the 2 major ED standards?
· ANSI X.12
· EDIFACT
13. Give the elements of an EDI message.
· Transaction set
· Data segments
· Data elements
14. Compare EDIFACT and X.12 Standards.
· Both are comprised of strings of data elements called segments.
· ANSI standards require each element to have a very specific name, such
as order date or invoice date. EDIFACT segments, in contrast, allow for
generic or multiuse elements, such as date.
15. Mention the layers of EDI software implementation.
· Business Application Layer
· Internal format conversion
· EDI Translator Layer
· EDI envelope for document messaging
16. Mention the 3 types of EDI access methods.
· Direct dial or modem to modem connection
· Limited third-party VANs
· Full-service third-party VANs
17. What are the factors involved in EDI implementation cost?
· The expected volume of electronic documents.
· Economics of the EDI translation software
· Implementation time
· Maintenance fees
· VAN charges
18. What are the 2 types of EDI envelopes used?
· X.435
· Internet EDI based on MIME
19. Define VAN.
A value-added network (VAN) is a communications network that typically
exchanges EDI messages among trading partners.
20. What are the factors that make the internet useful for EDI?
· Flat pricing
· Cheap access
· Common mail standards
· Security
1. Explain EDI Software Implementation.
· Diagram: How EDI works
· EDI Business application layer
· Diagram: The preparation process followed by the application s/w
· EDI Translator layer
· EDI Communications layer
2. Write notes on digital token-based electronic payment systems.
· E-cash & its properties
· E-cash in action
· Business issues
· Operational risk
· Legal issues
· E-checks with diagram
3. Explain the EDI applications in business.
· International trade and EDI
· Financial EDI
· Health care and insurance EDI
· Manufacturing/Retail procurement using EDI
· Business information, product design, and procurement
4. Define VAN. Explain it in detail.
· Definition
· VAN pricing structures
· VAN service providers
· VANs and the internet
5. Write notes on smart cards and electronic payment systems.
· Relationship-based smart cards
· Electronic purses and debit cards
· Smart card readers and smart phones
· Business issues and smart cards
UNIT-III
Part-A
1. What is mean by Marketing?
Marketing is a way of managing a business so that each important
business decision is made with full knowledge of the impact it will have on the
customer.
2. What are the assumptions of marketing?
The assumptions are (i) all company policies and activities should be
aimed at satisfying customer needs and (ii) profitable sales volume is better
company goal than maximum sales volume.
3. What is mean by Advertising?
Advertising is the process of reaching the customer using a broadcast or
direct mail campaign orchestrated to influence purchasing behavior.
4. What is mean Bundling?
Bundling is a classic marketing strategy in which two or more
complementary products and/or services are offered as a package at a discounted
price.
5. List out the bundling strategies. ¾Only components. ¾Only bundles. ¾Mixed strategy.
6. What are the two important information based products?
The two important information based products are: ¾Pricing. ¾Priority.
7. What are the two main types of micromarketing?
The two main types of micromarketing are: ¾Direct-relationship micromarketing. ¾Direct-order micromarketing.
8. What are the two different advertising paradigms in the on-line world?
The two different advertising paradigms in the on-line world are: ¾Active or Push-Based Advertising. ¾Passive or Pull-Based Advertising.
9. What are the two types of Push-based advertising?
The two types of Push-based advertising are: ¾Broadcast Model. ¾Junk Mail Model.
10. What are the disadvantages of television advertising?
The disadvantages of television advertising are: ¾High cost of production. ¾Limited exposure time. ¾Short air time. ¾Clutter of many other ads.
11. What are the types of Pull-based advertising?
The types of Pull-based advertising are: ¾Billboards. ¾Catalogs or yellow page directories. ¾Endorsements.
12. What is Billboard or World Wide Web Model?
Billboard model refers to information placed where it will come to the
attention of customers in the course of other activities and does not require active
search.
13. What are the advantages of Billboard Model?
The advantages of Billboard Model are: ¾Ability to completely cover a market. ¾Maintain high levels of viewing frequency.
14. List the four major classifications of Electronic publishing.
The four major classifications of Electronic publishing are: ¾On-line full text publishing. ¾CD-ROM publishing. ¾Collaboratories. ¾Video.
15. What are the two types of software agents function?
The two types of software agents function are: ¾Static ¾Mobile.
16. What are the properties of Mobile Software Agents?
The properties of Mobile Software Agents are: ¾Programming ¾Safety. ¾Resource usage. ¾Navigation ¾Privacy. ¾Communication.
17. What are the challenges for resource discovery of software agents?
The challenges for resource discovery of software agents are: ¾The scale of problem. ¾Need for cooperative brokerages. ¾Need for resource sharing.
18. What are the three camps of agent requests?
The three camps of agent requests are: ¾Synchronous communication-oriented remote procedure
call (RPC). ¾Asynchronous message-oriented agents. ¾Intermediaries or database middleware.
19. What are the ‘features of software agent?
The features of software agent are: ¾Owner ¾Author ¾Lifetime ¾Account ¾Goal ¾Subject description ¾Background
20. What are the three approaches of Agent Reasoning Capability?
The three approaches of Agent Reasoning Capability are: ¾Rule-based approach. ¾Knowledge-based approach. ¾Learning approach.
Part-B
1. What are the technological components of Education on-Demand?
¾On-line full text publishing. ¾CD-ROM publishing. ¾Collaboratories. ¾Video.
2. What are characteristics and properties of user agent? ¾Characteristics ¾Properties
3. Write notes on On-Line Advertising Paradigms. ¾Active or Push-Based Advertising ¾Passive or Pull-Based Advertising
4. Write briefly on computer-based education and training. ¾On-Line Education and Virtual Classrooms ¾Training On-Demand ¾Changing Roles Of Institutions
5. Write notes on digital copyrights and electronic commerce ¾Digital Copyright Basics ¾Digital Copyright Wording in On-Line Databases ¾Enforcing Digital Copyrights Using Technology
UNIT IV
2 Marks
1. What is operational picture?
Managers and workers need to obtain information regarding their own situation,
including the customers, suppliers, and other department in the areas of interest and, of
course, the disposition of a competitor through market intelligence. The totality of the
information relevant to manager can be referred to as the operational picture.
2. What are the challenges faced by a companies in handling data?
The challenges are:
i. To pull together the technology for amassing operational information
ii. To maximize the utility of existing information to managers
3. What were/was expected to help improve a company’s competitive position in the
1990s to manage information overload?
a. Decision Support Systems(DSS)
b. Management Support Systems(MSS)
c. Visual Information Access and Analysis(VIAA)
d. Data/Information Warehouses
e. Structured Document and Imaging Databases
f. Executive Information Systems(EIS)
g. Business Intelligence Systems(BIS)
h. On-line Analytical Processing(OLAP)
i. Multidimensional databases(MDD)
4. Write the three key decision support trends
1. Digital information infrastructure consisting of documents and data.
2. Better utilization of information in strategic and operational decision making,
which involves effective on-line information search and retrieval in a
distributed environment.
3. Architecture for implementing decisions through workflow automation and
business process integration.
5. What is an “infosphere”?
Millions of transactions and oceans of multimedia data will flow through the network
every day. This creates an “infosphere”.
6. What are the two types of on-line transactions?
Two types of on-line transactions are:
i. On-line transaction processing(OLTP)
ii. On-line analytic processing(OLAP)
7. What are the two activities related to navigating the infosphere?
Navigating the infosphere involves two related activities:
i. Information search, discovery, and retrieval
ii. Presentation or visualization of the retrieved information
8. List few document management schemes
i. Ad hoc documents
ii. Process-specific documents
iii. Knowledge-oriented documents
9. Give some examples for Ad-hoc documents.
i. Letters
ii. Financial reports
iii. Manuals
10. Write about Process-specific documents
Some of the process specific documents are invoices and purchase orders. They
are typically created, constructed, and distributed by support personnel. These are often
forms-based: context and appearance undergo virtually no alteration and context varies
only slightly according to well-articulated rules.
11. What are Knowledge-oriented documents?
Knowledge-oriented documents encompass documentation, catalogs of product
information, and design documents.
12. What are User models?
User models are interposed between the user interface and information sources to
filter the available information according to the needs of the task and the user. These
models can be customized.
13. List the types of digital documents
· Document imaging
· Structured documents
· Hypertext documents
· Active documents
14. What are the steps involved in document oriented processes?
· Document creation
· Document media conversion
· Document production and distribution
· Document storage and retrieval
15. Write notes on document imaging.
Document imaging emulates microfiche and microfilm. An imaging system
passes a paper document through a scanner that renders it digital and then stores the
digital data as a bit-mapped image of the document. Keywords are used for indexing and
retrieval of document.
16. Write brief notes on hypertext documents.
Hypertext is a way of making document based information more mobile.
Relationships between documents can be represented through hypermedia links.
17. Write notes on active document.
Active documents (or compound documents) represent what is known as
document-oriented computing. Active documents provide an interactive interface where
all documents, applications, and data related to a particular task are assembled, arranged,
and interlinked in such a manner that the user can focus on the task at hand and be
shielded from nontask-related issues like access, storage, data formats, location,
computing, or delivery mechanisms.
18. Name the activities involved in document-based work flows
· Document modeling
· Transformation
· Synthesizing
· Business modeling
19. List the advantages of structured documents.
· Allows document formatting
· Documents can be edited, linked to graphics, video, photo etc.
· Easy to search and query documents.
20. Name the types of data warehouses.
· Physical data warehouse
· Logical data warehouse
· Data library
· Decision support systems
21. List the elements in building data warehouse
· Back end: Accessing and organizing data easily from disparate
sources.
· Preparing data for analysis: Querying, searching, and governing
the data.
· Front end: Providing means for effective analysis of the
information.
22. What are the advantages of data warehouses?
· Users can manage and access large volumes of information in
one cohesive framework.
· Managers can distribute information on a variety of platforms.
· Enables faster access and decision making.
· Increases flexibility.
16 Marks
1. Explain in detail the dimensions of internal electronic commerce systems.
Infosphere- complexity of data-technological architecture for internal commerce(figure)-
key areas-user modeling interaction-Effective utilization of information-Types of On-line
transactions-Navigating the infosphere-Electronic Brokerages and Work Flow
Automation
2. What is a document library? Explain in detail about business can be promoted to
meet customer’s needs by improving document management support with an
example.
Definiions-Challenges in an organization-Corporate digital library as a core of document
management (figure)-Digital document management-issues and concerns.
3. Explain the types of digital documents.
· Document imaging
· Structured documents
· Hypertext documents
· Active documents
4. Explain the elements in building data warehouse
· Back end: Accessing and organizing data easily from disparate
sources.
· Preparing data for analysis: Querying, searching, and governing
the data.
· Front end: Providing means for effective analysis of the
information.
5. Explain the issues behind document infrastructure.
· Document constituencies
· Document-oriented processes
· Document-based work flows
UNIT-5
1. What is the compression method used in Multimedia?
· Sector-oriented disk Compression
· Backup or archive-oriented compression
· Graphics and video-oriented Compression
· Compression of data being transmitted over low-speed networks
2. What is the goal of data compression in action?
The goal of data compression is to make the size of the 100 –bit message
as close as possible to the 100 bits of underlying information.
3. What is the disadvantage of data compression?
The most obvious problem is the time to transfer that much data from
storage to the display. Nearly 30 Mb per second is enough to choke almost
any I/O port or data bus. Other problems include both storage and
processing.
4. What are the types of Compression Technique? Grief brief notes on them
Compression techniques can be divided into two major categories,
· Lossless Compression
· Lossy Compression
Lossless compression:
It means that a given set of data will undergo a loss of accuracy or
resolution after a cycle of compression and decompression.
Lossy Compression:
It produces compressed output that is exactly the same as the input.
5. Define Multiprocessing?
Multiprocessing is defined as the ability to support the concurrent
execution of several tasks on multiple processors. This implies that ability
to use more than one CPU for executing programs. The processors can be
tightly or loosely coupled.
6. Define multitasking?
Multitasking means that the server operating systems can run multiple
programs and give the illusion that they are running simultaneously by
switching control between them.
Two types of multitasking are used:
· Preemptive
· No preemptive
7. Define Multithreading?
Multithreading is a sophisticated and refers to the ability to support paths
of execution within a single address space. Older operating systems
achieve multitasking by creating multiple processes, which creates a great
deal of overhead.
8. Give brief notes about the types of storage technology?
Storage technology can be divided in to two types:
· Network-based (disk arrays)
· Desktop-based (CD-ROM)
Disk arrays:
Disk arrays store enormous of information and are becoming an important
storage technology for firewall servers and other electronic commerce
servers.
CD-ROM:
The preemptive desktop storage technology for electronic commerce
applications is CD-ROM.
9. What are the types of Desktop video conferencing?
There are three types of desktop video conferencing they are
· Plain Old Telephone lines(POTS)
· ISDN
· Internet
10. What is MBONE?
The MBONE is a virtual network that has been in existence since early
1992. The MBONE shares the same physical media as the internet. It uses
a network of routers is not for the faint of heart and is time consuming
because a lot of learning and fixing are involved.
11. Define SONET?
SONET, or Synchronous Optical NETwork, is a set of standards that
govern synchronous fiber optic data transmission at rates ranging from
51.8Mbps to 2.5Gbps.
12. How fast packet switching differs from the traditional circuit switching?
The fast packet switching differs from the traditional circuit switching in
the following three aspects
· Call set-up
· Traffic management
· Switching
13. Describe the benefits of Frame relay?
Frame relay has two benefits:
Speed:
It is no longer necessary to carryout error controls and corrections between
each node due to the improvements in transmission media.
Sharing costly bandwidth:
Frame relay allows users to share costly, high throughput channels over a
single access line, and it uses a “hubbing” approach to distribute traffic
over a wide area.
14. Describe the three functional levels in physical layer?
The physical layer can be divided into three functional levels:
· Transmission path
· Digital section
· Regenerator section
15. What are the four dimensions in mobile computing?
The four dimensions in mobile computing are,
· Wireless delivery technology and switching methods
· Mobile information access devices
· Mobile data internetworking standards and equipment
· Mobile computing based business applications
16. What are the categories of Radio based systems?
Radio based services can be grouped into two main categories:
· Land based
· Satellite based
17. What is palmtop?
Palmtop computers attempt to provide higher functionality and more
closely resemble what’s available in desktop computers. Palmtops called
personal organizers. It offer the combined functionality of a personal
organizer and communications terminal to provide access an applicationspecific
personal computer and communications terminal to provide
access to e-mail.
18. Specify the advantage of circuit-Switched Cellular transmission?
The advantage of circuit switched cellular transmission is that users should
be able to use a cellular modem as they would any modem. Because the
charge call is by the minute and also for set-up, cellular modems can be
more cost-effective when used to send large messages.
19. What is licensed broadband?
Licensed bandwidth allocation of 120 MHz in the 1850 MHz to 1990
MHz band represents a considerable amount of spectrum-by comparison,
the current cellular phone system, known as advanced mobile phone
system occupies only 50 MHz.
20. What is the application of unlicensed broadband?
These applications today are relegated to the industrial/scientific/medical
bands should make better use of the radio spectrum and allow for more
simultaneous users and better signal quality.
1. Explain about digital video and electronic commerce?
· Characteristics of Digital video
· Digital video compression/Decompression
· Types of Codecs ¾Hybrid ¾Software-based
· Three Hybrid standards ¾JPEG ¾MPEG I ¾MPEG II
2. Describe Desktop Video Processing?
Video on the desktop is a key element in turning a computer into a true
multimedia platform. However digital video isn’t what one would call a
“natural fit’ when it comes to desktop computers due to their inability to
process the compression and decompression of video satisfactorily.
· Desktop Video Hardware for playback and capture
· Video playback
· Video capture and Editing
· Desktop Video Application Software
· Apple’s Quick Time
· Microsoft’s video for Windows
3. Explain Desktop video conferencing? What are the types of Desktop video
Conferencing?
Desktop video conferencing is gaining momentum as a communications
tool. For many business users, face-to-face videoconferences are already a
common practice allowing distant colleagues to communicate without the
expense and inconvenience of traveling.
TYPES OF DESKTOP VIDEO CONFRENCING:
· Using POTS for video conferencing
· Using ISDN for video conferencing
· Using the internet for video conferencing ¾CU-SeeMe ¾MBONE
4. Describe the concept of Broadband background?
· Narrowband Versus Broadband Networks
· Integrated services Digital Network (ISDN)
· SONET and SDH
· BISDN Versus ATM
· Connectionless versus connection oriented networks
· Switching techniques ¾Call set-up ¾Traffic management ¾Switching
5. Explain about Asynchronous Transfer Mode (ATM)?
ATM is a high-speed, connection-oriented, cell based transmission scheme
that offers bandwidth on demand for voice, data and video telephony applications.
ATM networks are being created to switching technology voice, data and video
signals at multiples of 155 Mbps through multigigabit “hubbing devices”
Types of ATM traffic and switching:
· ATM Switching
· ATM cell structure
· ATM system Architecture
6. Give brief description about wireless delivery technology and switching
methods?
· Radio-Based Systems
· Cellular Communications ¾Increasing Capability and widespread coverage for cordless
telephones ¾Decreasing cell size (micro cells) and power levels for
hand-held and vehicular cellular radio. ¾Specialized wireless data systems
· Wireless packet data networks
· Satellite networks
· Very small aperture terminals (VSATs)
· Paging and satellite Networks
· Infrared or Light-Based Mobile computing
7. Explain Mobile information access devices?
· Portable computers
· Hybrid pen computers
· Personal Digital Assistants (PDAs)
· Digital Assistants
· Personal communicators
· Palmtops
· Cellular modems and PCMIA adapters

CS1301-DATABASE MANAGEMENT SYSTEMS

2009-08-17T20:58:00.001-07:00

TWO MARKS:
UNIT: 1
INTRODUCTION AND CONCEPTUAL MODELLING
1. Define database management system?
Database management system (DBMS) is a collection of interrelated data and a
set of programs to access those data.
2. List any eight applications of DBMS.
a) Banking
b) Airlines
c) Universities
d) Credit card transactions
e) Tele communication
f) Finance
g) Sales
h) Manufacturing
i) Human resources
3. What are the disadvantages of file processing system?
The disadvantages of file processing systems are
a) Data redundancy and inconsistency
b) Difficulty in accessing data
c) Data isolation
d) Integrity problems
e) Atomicity problems
f) Concurrent access anomalies
4. What are the advantages of using a DBMS?
The advantages of using a DBMS are
a) Controlling redundancy
b) Restricting unauthorized access
c) Providing multiple user interfaces
d) Enforcing integrity constraints.
e) Providing back up and recovery
5. Give the levels of data abstraction?
a) Physical level
b) logical level
c) view level
6. Define instance and schema?
Instance: Collection of data stored in the data base at a particular moment is
called an Instance of the database.
Schema: The overall design of the data base is called the data base schema.
7. Define the terms 1) physical schema 2) logical schema.
Physical schema: The physical schema describes the database design at the
physical level, which is the lowest level of abstraction describing how the data are
actually stored.
Logical schema: The logical schema describes the database design at the logical
level, which describes what data are stored in the database and what relationship exists
among the data.
8. What is conceptual schema?
The schemas at the view level are called subschemas that describe different views
of the database.
9. Define data model?
A data model is a collection of conceptual tools for describing data, data
relationships, data semantics and consistency constraints.
10. What is storage manager?
A storage manager is a program module that provides the interface between the
low level data stored in a database and the application programs and queries submitted to
the system.
11. What are the components of storage manager?
The storage manager components include
a) Authorization and integrity manager
b) Transaction manager
c) File manager
d) Buffer manager
12. What is the purpose of storage manager?
The storage manager is responsible for the following
a) Interaction with he file manager
b) Translation of DML commands in to low level file system commands
c) Storing, retrieving and updating data in the database
13. List the data structures implemented by the storage manager.
The storage manager implements the following data structure
a) Data files
b) Data dictionary
c) indices
14. What is a data dictionary?
A data dictionary is a data structure which stores meta data about the structure of
the database ie. the schema of the database.
15. What is an entity relationship model?
The entity relationship model is a collection of basic objects called entities and
relationship among those objects. An entity is a thing or object in the real world that is
distinguishable from other objects.
16. What are attributes? Give examples.
An entity is represented by a set of attributes. Attributes are descriptive properties
possessed by each member of an entity set.
Example: possible attributes of customer entity are customer name, customer id,
customer street, customer city.
17. What is relationship? Give examples
A relationship is an association among several entities.
Example: A depositor relationship associates a customer with each account that
he/she has.
18. Define the terms
i) Entity set
ii) Relationship set
Entity set: The set of all entities of the same type is termed as an entity set.
Relationship set: The set of all relationships of the same type is termed as a
relationship set.
19. Define single valued and multivalued attributes.
Single valued attributes: attributes with a single value for a particular entity are
called single valued attributes.
Multivalued attributes: Attributes with a set of value for a particular entity are
called multivalued attributes.
20. What are stored and derived attributes?
Stored attributes: The attributes stored in a data base are called stored attributes.
Derived attributes: The attributes that are derived from the stored attributes are
called derived attributes.
21. What are composite attributes?
Composite attributes can be divided in to sub parts.
22. Define null values.
In some cases a particular entity may not have an applicable value for an attribute
or if we do not know the value of an attribute for a particular entity. In these cases null
value is used.
23. Define the terms
i) Entity type
ii) Entity set
Entity type: An entity type defines a collection of entities that have the same
attributes.
Entity set: The set of all entities of the same type is termed as an entity set.
24. What is meant by the degree of relationship set?
The degree of relationship type is the number of participating entity types.
25. Define the terms
i) Key attribute
ii) Value set
Key attribute: An entity type usually has an attribute whose values are distinct
from each individual entity in the collection. Such an attribute is called a key attribute.
Value set: Each simple attribute of an entity type is associated with a value set
that specifies the set of values that may be assigned to that attribute for each individual
entity.
26. Define weak and strong entity sets?
Weak entity set: entity set that do not have key attribute of their own are called
weak entity sets.
Strong entity set: Entity set that has a primary key is termed a strong entity set.
27. What does the cardinality ratio specify?
Mapping cardinalities or cardinality ratios express the number of entities to which
another entity can be associated. Mapping cardinalities must be one of the
following:
• One to one
• One to many
• Many to one
• Many to many
28. Explain the two types of participation constraint.
• Total: The participation of an entity set E in a relationship set R is said to
be total if every entity in E participates in at least one relationship in R.
• Partial: if only some entities in E participate in relationships in R, the
participation of entity set E in relationship R is said to be partial.
29. Define the terms
i) DDL
ii) DML
DDL: Data base schema is specified by a set of definitions expressed by a special
language called a data definition language.
DML: A data manipulation language is a language that enables users to access or
manipulate data as organized by the appropriate data model.
30. Write short notes on relational model
The relational model uses a collection of tables to represent both data and the
relationships among those data. The relational model is an example of a record
based model.
31. Define tuple and attribute
• Attributes: column headers
• Tuple: Row
32. Define the term relation.
Relation is a subset of a Cartesian product of list domains.
33. Define tuple variable
Tuple variable is a variable whose domain is the set of all tuples.
34. Define the term Domain.
For each attribute there is a set of permitted values called the domain of that
attribute.
35. What is a candidate key?
Minimal super keys are called candidate keys.
36. What is a primary key?
Primary key is chosen by the database designer as the principal means of
identifying an entity in the entity set.
37. What is a super key?
A super key is a set of one or more attributes that collectively allows us to
identify uniquely an entity in the entity set.
38. Define- relational algebra.
The relational algebra is a procedural query language. It consists of a set of
operations that take one or two relation as input and produce a new relation as
output.
39. What is a SELECT operation?
The select operation selects tuples that satisfy a given predicate. We use the
lowercase letter s to denote selection.
40. What is a PROJECT operation?
The project operation is a unary operation that returns its argument relation with
certain attributes left out. Projection is denoted by pie (p).
41. Write short notes on tuple relational calculus.
The tuple relational calculation is anon procedural query language. It describes
the desired information with out giving a specific procedure for obtaining that
information.
A query or expression can be expressed in tuple relational calculus as
{t | P (t)}
which means the set of all tuples‘t’ such that predicate P is true for‘t’.
Notations used:
• t[A] ® the value of tuple ‘t’ on attribute, A
• t Î r ® tuple ‘t’ is in relation ‘r’
• $ ® there exists
Definition for ‘there exists’ ($):
$ t Î r(Q(t))
which means there exists a tuple ‘t’ in relation ‘r’
such that predicate Q(t) is true.
• " ® for all
Definition for ‘for all’ ("):
"t Î r(Q(t))
which means Q(t) is true for all tuples ‘t’ in relation
‘r’.
• ® Implication
Definition for Implication ():
PQ means if P is true then Q must be true.
42. Write short notes on domain relational calculus
The domain relational calculus uses domain variables that take on values from an
attribute domain rather than values for entire tuple.
43. Define query language?
A query is a statement requesting the retrieval of information. The portion of
DML that involves information retrieval is called a query language.
44. Write short notes on Schema diagram.
A database schema along with primary key and foreign key dependencies can be
depicted pictorially by schema diagram. Each relation appears as a box with
attributes listed inside it and the relation name above it.
45. What is foreign key?
A relation schema r1 derived from an ER schema may include among its
attributes the primary key of another relation schema r2.this attribute is called a foreign
key from r1 referencing r2.
UNIT: 2
RELATIONAL MODEL
1. What are the parts of SQL language?
The SQL language has several parts:
data - definitition language
Data manipulation language
View definition
Transaction control
Embedded SQL
Integrity
Authorization
2. What are the categories of SQL command?
SQL commands are divided in to the following categories:
1. data - definitition language
2. data manipulation language
3. Data Query language
4. data control language
5. data administration statements
6. transaction control statements
3. What are the three classes of SQL expression?
SQL expression consists of three clauses:
Select
From
where
4. Give the general form of SQL query?
Select A1, A2…………., An
From R1, R2……………, Rm
Where P
5. What is the use of rename operation?
Rename operation is used to rename both relations and a attributes.
It uses the as clause, taking the form:
Old-name as new-name
6. Define tuple variable?
Tuple variables are used for comparing two tuples in the same relation. The tuple
variables are defined in the from clause by way of the as clause.
7. List the string operations supported by SQL?
1) Pattern matching Operation
2) Concatenation
3) Extracting character strings
4) Converting between uppercase and lower case letters.
8. List the set operations of SQL?
1) Union
2) Intersect operation
3) The except operation
9. What is the use of Union and intersection operation?
Union: The result of this operation includes all tuples that are either in r1 or in r2
or in both r1 and r2.Duplicate tuples are automatically eliminated.
Intersection: The result of this relation includes all tuples that are in both r1 and
r2.
10. What are aggregate functions? And list the aggregate functions supported by
SQL?
Aggregate functions are functions that take a collection of values as input and
return a single value.
Aggregate functions supported by SQL are
Average: avg
Minimum: min
Maximum: max
Total: sum
Count: count
11. What is the use of group by clause?
Group by clause is used to apply aggregate functions to a set of tuples.The
attributes given in the group by clause are used to form groups.Tuples with the
same value on all attributes in the group by clause are placed in one group.
12. What is the use of sub queries?
A sub query is a select-from-where expression that is nested with in another
query. A common use of sub queries is to perform tests for set membership, make
setcomparisions, and determine set cardinality.
13. What is view in SQL? How is it defined?
Any relation that is not part of the logical model, but is made visible to a user as a
virtual relation is called a view.
We define view in SQL by using the create view command. The form of the
create view command is
Create view v as
14. What is the use of with clause in SQL?
The with clause provides a way of defining a temporary view whose definition is
available only to the query in which the with clause occurs.
15. List the table modification commands in SQL?
Deletion
Insertion
Updates
Update of a view
16. List out the statements associated with a database transaction?
Commit work
Rollback work
17. What is transaction?
Transaction is a unit of program execution that accesses and possibly updated
various data items.
18. List the SQL domain Types?
SQL supports the following domain types.
1) Char(n) 2) varchar(n) 3) int 4) numeric(p,d)
5) float(n) 6) date.
19. What is the use of integrity constraints?
Integrity constraints ensure that changes made to the database by authorized users
do not result in a loss of data consistency. Thus integrity constraints guard against
accidental damage to the database.
20. Mention the 2 forms of integrity constraints in ER model?
Key declarations
Form of a relationship
21. What is trigger?
Triggers are statements that are executed automatically by the system as the side
effect of a modification to the database.
22. What are domain constraints?
A domain is a set of values that may be assigned to an attribute .all values that
appear in a column of a relation must be taken from the same domain.
23. What are referential integrity constraints?
A value that appears in one relation for a given set of attributes also appears for a
certain set of attributes in another relation.
24. What is assertion? Mention the forms available.
An assertion is a predicate expressing a condition that we wish the database
always to satisfy.
Domain integrity constraints.
Referential integrity constraints
25. Give the syntax of assertion?
Create assertion check
26. What is the need for triggers?
Triggers are useful mechanisms for alerting humans or for starting certain tasks
automatically when certain conditions are met.
27. List the requirements needed to design a trigger.
The requirements are
Specifying when a trigger is to be executed.
Specify the actions to be taken when the trigger executes.
28. Give the forms of triggers?
The triggering event can be insert or delete.
For updated the trigger can specify columns.
The referencing old row as clause
The referencing new row as clause
The triggers can be initiated before the event or after the event.
29. What does database security refer to?
Database security refers to the protection from unauthorized access and malicious
destruction or alteration.
30. List some security violations (or) name any forms of malicious access.
Unauthorized reading of data
Unauthorized modification of data
Unauthorized destruction of data.
31. List the types of authorization.
Read authorization
Write authorization
Update authorization
Drop authorization
32. What is authorization graph?
Passing of authorization from one user to another can be represented by an
authorization graph.
33. List out various user authorization to modify the database schema.
Index authorization
Resource authorization
Alteration authorization
Drop authorization
34. What are audit trails?
An audit trail is a log of all changes to the database along with information such
as which user performed the change and when the change was performed.
35. Mention the various levels in security measures.
Database system
Operating system
Network
Physical
human
36. Name the various privileges in SQL?
Delete
Select
Insert
update
37. Mention the various user privileges.
All privileges directly granted to the user or role.
All privileges granted to roles that have been granted to the user or role.
38. Give the limitations of SQL authorization.
The code for checking authorization becomes intermixed with the rest of the
application code.
Implementing authorization through application code rather than specifying it
declaratively in SQL makes it hard to ensure the absence of loopholes.
39. Give some encryption techniques?
DES
AES
Public key encryption
40. What does authentication refer?
Authentication refers to the task of verifying the identity of a person.
41. List some authentication techniques.
Challenge response scheme
Digital signatures
Nonrepudiation
42. Define Boyce codd normal form
A relation schema R is in BCNF with respect to a set F of functional
dependencies if, for all functional dependencies in F
+
of the form. ->, where
43. List the disadvantages of relational database system
Repetition of data
Inability to represent certain information.
44. What is first normal form?
The domain of attribute must include only atomic (simple, indivisible) values.
45. What is meant by functional dependencies?
Consider a relation schema R and C R and C R. The functional dependency
holds on relational schema R if in any legal relation r(R), for all pairs of
tuples t1 and t2 in r such that t1 [] =t1 [], and also t1 [] =t2 [].
46. What are the uses of functional dependencies?
To test relations to see whether they are legal under a given set of functional
dependencies.
To specify constraints on the set of legal relations.
47. Explain trivial dependency?
Functional dependency of the form is trivial if C . Trivial functional
dependencies are satisfied by all the relations.
48. What are axioms?
Axioms or rules of inference provide a simpler technique for reasoning about
functional dependencies.
49. What is meant by computing the closure of a set of functional dependency?
The closure of F denoted by F+ is the set of functional dependencies logically
implied by F.
50. What is meant by normalization of data?
It is a process of analyzing the given relation schemas based on their Functional
Dependencies (FDs) and primary key to achieve the properties
Minimizing redundancy
Minimizing insertion, deletion and updating anomalies.
51. Define canonical cover?
A canonical cover Fc for F is a set of dependencies such that F logically implies
all dependencies in FC and Fc logically implies all dependencies in F. Fc must
have the following properties.
52. List the properties of canonical cover.
Fc must have the following properties.
No functional dependency in Fc contains an extraneous attribute.
Each left side of a functional dependency in Fc is unique.
53. Explain the desirable properties of decomposition.
Lossless-join decomposition
Dependency preservation
Repetition of information
54. What is 2NF?
A relation schema R is in 2NF if it is in 1NF and every non-prime attribute A in R
is fully functionally dependent on primary key.
UNIT: 3
DATA STORAGE AND QUERY PROCESSING
1. What is an index?
An index is a structure that helps to locate desired records of a relation quickly,
without examining all records
.
2. Define query optimization.
Query optimization refers to the process of finding the lowest –cost method of
evaluating a given query.
3. What are called jukebox systems?
Jukebox systems contain a few drives and numerous disks that can be loaded into
one of the drives automatically.
4. What are the types of storage devices?
Primary storage
Secondary storage
Tertiary storage
Volatile storage
Nonvolatile storage
5. What is called remapping of bad sectors?
If the controller detects that a sector is damaged when the disk is initially
formatted, or when an attempt is made to write the sector, it can logically map the sector
to a different physical location.
6. Define access time.
Access time is the time from when a read or write request is issued to when data
transfer begins.
7. Define seek time.
The time for repositioning the arm is called the seek time and it increases with the
distance that the arm is called the seek time.
8. Define average seek time.
The average seek time is the average of the seek times, measured over a sequence
of random requests.
9. Define rotational latency time.
The time spent waiting for the sector to be accessed to appear under the head is
called the rotational latency time.
10. Define average latency time.
The average latency time of the disk is one-half the time for a full rotation of the
disk.
11. What is meant by data-transfer rate?
The data-transfer rate is the rate at which data can be retrieved from or stored to
the disk.
12. What is meant by mean time to failure?
The mean time to failure is the amount of time that the system could run
continuously without failure.
13. What is a block and a block number?
A block is a contiguous sequence of sectors from a single track of one platter.
Each request specifies the address on the disk to be referenced. That address is in the
form of a block number.
14. What are called journaling file systems?
File systems that support log disks are called journaling file systems.
15. What is the use of RAID?
A variety of disk-organization techniques, collectively called redundant arrays of
independent disks are used to improve the performance and reliability.
16. What is called mirroring?
The simplest approach to introducing redundancy is to duplicate every disk. This
technique is called mirroring or shadowing.
17. What is called mean time to repair?
The mean time to failure is the time it takes to replace a failed disk and to restore
the data on it.
18. What is called bit-level striping?
Data striping consists of splitting the bits of each byte across multiple disks. This
is called bit-level striping.
19. What is called block-level striping?
Block level striping stripes blocks across multiple disks. It treats the array of disks
as a large disk, and gives blocks logical numbers.
20. What are the two main goals of parallelism?
Load –balance multiple small accesses, so that the throughput of such
accesses increases.
Parallelize large accesses so that the response time of large accesses is
reduced
.
21. What are the factors to be taken into account when choosing a RAID level?
o Monetary cost of extra disk storage requirements.
o Performance requirements in terms of number of I/O operations
o Performance when a disk has failed.
o Performances during rebuild.
22. What is meant by software and hardware RAID systems?
RAID can be implemented with no change at the hardware level, using only
software modification. Such RAID implementations are called software RAID systems
and the systems with special hardware support are called hardware RAID systems.
23. Define hot swapping?
Hot swapping permits the removal of faulty disks and replaces it by new ones
without turning power off. Hot swapping reduces the mean time to repair.
24. What are the ways in which the variable-length records arise in database
systems?
Storage of multiple record types in a file.
Record types that allow variable lengths for one or more fields.
Record types that allow repeating fields.
25. What is the use of a slotted-page structure and what is the information present
in the header?
The slotted-page structure is used for organizing records within a single block.
The header contains the following information.
The number of record entries in the header.
The end of free space
An array whose entries contain the location and size of each record.
26. What are the two types of blocks in the fixed –length representation? Define
them.
• Anchor block: Contains the first record of a chain.
• Overflow block: Contains the records other than those that are the first
record of a chain.
27. What is known as heap file organization?
In the heap file organization, any record can be placed anywhere in the file where
there is space for the record. There is no ordering of records. There is a single file for
each relation.
28. What is known as sequential file organization?
In the sequential file organization, the records are stored in sequential order,
according to the value of a “search key” of each record.
29. What is hashing file organization?
In the hashing file organization, a hash function is computed on some attribute of
each record. The result of the hash function specifies in which block of the file the record
should be placed.
30. What is known as clustering file organization?
In the clustering file organization, records of several different relations are stored
in the same file.
31. What are the types of indices?
Ordered indices
Hash indices
32. What are the techniques to be evaluated for both ordered indexing and hashing?
Access types
Access time
Insertion time
Deletion time
Space overhead
33. What is known as a search key?
An attribute or set of attributes used to look up records in a file is called a search
key.
34. What is a primary index?
A primary index is an index whose search key also defines the sequential order of
the file.
35. What are called index-sequential files?
The files that are ordered sequentially with a primary index on the search key, are
called index-sequential files.
36. What are the two types of indices?
Dense index
Sparse index
37. What are called multilevel indices?
Indices with two or more levels are called multilevel indices.
38. What is B-Tree?
A B-tree eliminates the redundant storage of search-key values .It allows search
key values to appear only once.
39. What is a B+-Tree index?
A B+-Tree index takes the form of a balanced tree in which every path from the
root of the root of the root of the tree to a leaf of the tree is of the same length.
40. What is a hash index?
A hash index organizes the search keys, with their associated pointers, into a hash
file structure.
41. What is called query processing?
Query processing refers to the range of activities involved in extracting data from
a database.
42. What are the steps involved in query processing?
The basic steps are:
parsing and translation
optimization
evaluation
43. What is called an evaluation primitive?
A relational algebra operation annotated with instructions on how to evaluate is
called an evaluation primitive.
44. What is called a query evaluation plan?
A sequence of primitive operations that can be used to evaluate ba query is a
query evaluation plan or a query execution plan.
45. What is called a query –execution engine?
The query execution engine takes a query evaluation plan, executes that plan, and
returns the answers to the query.
46. What are called as index scans?
Search algorithms that use an index are referred to as index scans.
47. What is called as external sorting?
Sorting of relations that do not fit into memory is called as external sorting.
48. What is called as recursive partitioning?
The system repeats the splitting of the input until each partition of the build input
fits in the memory. Such partitioning is called recursive partitioning.
49. What is called as an N-way merge?
The merge operation is a generalization of the two-way merge used by the
standard in-memory sort-merge algorithm. It merges N runs, so it is called an N-way
merge.
50. What is known as fudge factor?
The number of partitions is increased by a small value called the fudge factor,
which is usually 20 percent of the number of hash partitions computed.
UNIT: 4
TRANSACTION PROCESSING
1. What is transaction?
Collections of operations that form a single logical unit of work are called
transactions.
2. What are the two statements regarding transaction?
The two statements regarding transaction of the form:
Begin transaction
End transaction
3. What are the properties of transaction?
The properties of transactions are:
Atomicity
Consistency
Isolation
Durability
4. What is recovery management component?
Ensuring durability is the responsibility of a software component of the base
system called the recovery management component.
5. When is a transaction rolled back?
Any changes that the aborted transaction made to the database must be undone.
Once the changes caused by an aborted transaction have been undone, then the
transaction has been rolled back.
6. What are the states of transaction?
The states of transaction are
Active
Partially committed
Failed
Aborted
Committed
Terminated
7. What is a shadow copy scheme?
It is simple, but efficient, scheme called the shadow copy schemes. It is based on
making copies of the database called shadow copies that one transaction is active at a
time. The scheme also assumes that the database is simply a file on disk.
8. Give the reasons for allowing concurrency?
The reasons for allowing concurrency is if the transactions run serially, a short
transaction may have to wait for a preceding long transaction to complete, which can lead
to unpredictable delays in running a transaction.
So concurrent execution reduces the unpredictable delays in running transactions.
9. What is average response time?
The average response time is that the average time for a transaction to be
completed after it has been submitted.
10. What are the two types of serializability?
The two types of serializability is
Conflict serializability
View serializability
11. Define lock?
Lock is the most common used to implement the requirement is to allow a
transaction to access a data item only if it is currently holding a lock on that item.
12. What are the different modes of lock?
The modes of lock are:
Shared
Exclusive
13. Define deadlock?
Neither of the transaction can ever proceed with its normal execution. This
situation is called deadlock.
14. Define the phases of two phase locking protocol
Growing phase: a transaction may obtain locks but not release any lock.
Shrinking phase: a transaction may release locks but may not obtain any new
locks.
15. Define upgrade and downgrade?
It provides a mechanism for conversion from shared lock to exclusive lock is
known as upgrade.
It provides a mechanism for conversion from exclusive lock to shared lock is
known as downgrade.
16. What is a database graph?
The partial ordering implies that the set D may now be viewed as a directed
acyclic graph, called a database graph.
17. What are the two methods for dealing deadlock problem?
The two methods for dealing deadlock problem is deadlock detection and
deadlock recovery.
18. What is a recovery scheme?
An integral part of a database system is a recovery scheme that can restore the
database to the consistent state that existed before the failure.
19. What are the two types of errors?
The two types of errors are:
Logical error
System error
20. What are the storage types?
The storage types are:
Volatile storage
Nonvolatile storage
21. Define blocks?
The database system resides permanently on nonvolatile storage, and is
partitioned into fixed-length storage units called blocks.
22. What is meant by Physical blocks?
The input and output operations are done in block units. The blocks residing on
the disk are referred to as physical blocks.
23. What is meant by buffer blocks?
The blocks residing temporarily in main memory are referred to as buffer blocks.
24. What is meant by disk buffer?
The area of memory where blocks reside temporarily is called the disk buffer.
25. What is meant by log-based recovery?
The most widely used structures for recording database modifications is the log.
The log is a sequence of log records, recording all the update activities in the database.
There are several types of log records.
26. What are uncommitted modifications?
The immediate-modification technique allows database modifications to be output
to the database while the transaction is still in the active state. Data modifications written
by active transactions are called uncommitted modifications.
27. Define shadow paging.
An alternative to log-based crash recovery technique is shadow paging. This
technique needs fewer disk accesses than do the log-based methods.
28. Define page.
The database is partitioned into some number of fixed-length blocks, which are
referred to as pages.
29. Explain current page table and shadow page table.
The key idea behind the shadow paging technique is to maintain two page tables
during the life of the transaction: the current page table and the shadow page table. Both
the page tables are identical when the transaction starts. The current page table may be
changed when a transaction performs a write operation.
30. What are the drawbacks of shadow-paging technique?
• Commit Overhead
• Data fragmentation
• Garbage collection
30. Define garbage collection.
Garbage may be created also as a side effect of crashes. Periodically, it is
necessary to find all the garbage pages and to add them to the list of free pages. This
process is called garbage collection.
32. Differentiate strict two phase locking protocol and rigorous two phase locking
protocol.
In strict two phase locking protocol all exclusive mode locks taken by a
transaction is held until that transaction commits.
Rigorous two phase locking protocol requires that all locks be held until the
transaction commits.
33. How the time stamps are implemented
• Use the value of the system clock as the time stamp. That is a transaction’s
time stamp is equal to the value of the clock when the transaction enters the
system.
• Use a logical counter that is incremented after a new timestamp has been
assigned; that is the time stamp is equal to the value of the counter.
34. What are the time stamps associated with each data item?
• W-timestamp (Q) denotes the largest time stamp if any transaction that
executed WRITE (Q) successfully.
• R-timestamp (Q) denotes the largest time stamp if any transaction that
executed READ (Q) successfully.
UNIT: 5
CURRENT TRENDS
1. What is meant by object-oriented data model?
The object-oriented paradigm is based on encapsulation of data and code related
to an object in to a single unit, whose contents are not visible to the outside world.
2. What is the major advantage of object-oriented programming paradigm?
The ability to modify the definition of an object without affecting the rest of the
system is the major advantage of object-oriented programming paradigm.
3. What are the methods used in object-oriented programming paradigm?
*read-only
*update
4. What is the main difference between read-only and update methods?
A read-only method does not affect the values of a variable in an object, whereas
an update method may change the values of the variables.
5. What is the use of keyword ISA?
The use of keyword ISA is to indicate that a class is a specialization of another
class.
6. Differentiate sub-class and super-class?
The specialization of a class is called subclasses.eg: employee is a subclass of
person and teller is a subclass of employee.Conversely, employee is a super class
of teller, and person is a super class of employee.
7. What is substitutability?
Any method of a class-say A can equally well be invoked with any object
belonging to any subclasses B of A. This characteristic leads to code reuse, since
the messages, methods, and functions do not have to be written again for objects
of class B.
8. What is multiple inheritance?
Multiple inheritance permits a class to inherit variables and methods from
multiple super classes.
9. What is DAG?
The class-subclass relationship is represented by a directed acyclic graph.eg:
employees can be temporary or permanenet.we may create subclasses temporary
and permanenet, of the class employee.
10. What is disadvantage of multiple inheritance?
There is potential ambiguity if the same variable or method can be inherited from
more than one superclass.eg: student class may have a variable dept identifying a
student's department, and the teacher class may correspondingly have a variable
dept identifying a teacher's department.
11. What is object identity?
An object retains its identity even if some or all the values of variables or
definitions of methods change overtime.
12. What are the several forms of identity?
*Value
*Name
*Built-in
13. What is a value?
A data value is used for identity. This form of identity is used in relational
systems.eg: The primary key value of a tuple identifies the tuple.
14. What is a Name?
A user-supplied name is used for identity. This form of identity is used for files in
file systems. The user gives each file a name that uniquely identifies it, regardless
of its contents.
15What is a Built-in
A notation of identity is built-into the data model or programming language and
no user-supplied identifier is required. This form of identity is used in objectoriented
systems.
16 What is meant by object identifiers?
Object-oriented systems use an object identifier to identify objects. Object
identifiers are unique: that is each object has a single identifier, and no two
objects have the same identifier.
17. What are composite objects?
Objects that contain other objects are called complex objects or composite
objects.
18. What is object containment?
References between objects can be used to model different real-world concepts.
19. Why containment is important in oosystems?
Containment is an important concept in oosystems because it allows different
users to view data at different granularities.
20. Define object-relational systems?
Systems that provide object-oriented extensions to relational systems are called
object-relational systems.
21. How persistent programming languages differ from traditional programming
languages?
Database languages differ from traditional programming languages in that they directly
manipulate data that are persistent-that is, data that continue to exist even after the
program terminated. Relation in a database and tuples in a relation are examples of
persistent data. In contrast, the only persistent data that traditional programming
languages directly manipulate are files.
22. Define atomic domains?
A domain is atomic if elements of the domain are considered to be indivisible
units.
23. Define 1NF?
First normal form is one which requires that all attributes have atomic domains.
24. What is nested relational model?
The nested relational model is an extension of relational model in which domains
may be either atomic or relation valued.
25. List some instances of collection types?
*sets
*arrays
*multisets
26. How to create values of structured type?
Constructor functions are used to create values of structured types. A function
with the same name as a structured type is a constructor function for the structured type.
27. Write a query to define tables students and teachers as sub tables of people?
Create table students of student under people
Create table teachers of teacher under people
28. What is a homogeneous distributed database?
In homogeneous distributed databases, all sites have identical database
management system software, are aware of one another, and agree to cooperate in
processing user's requests.
29. What is a heterogeneous distributed database?
In a heterogeneous distributed database, different sites may use different schemas,
and different dbms s/w.The sites may not be aware of one another, and they may
provide only limited facilities for cooperation in transaction processing.
30. What are the two approaches to store relations in distributed database?
*Replication
*Fragmentation
31. What are the two different schemes for fragmenting a relation?
*horizontal
*vertical
32. What is horizontal fragmentation?
Horizontal fragmentation splits the relation by assuming each tuple of r to one or
more fragments.
33. What is vertical fragmentation?
Vertical fragmentation splits the relation by decomposing the scheme R of
relation r.
34. What are the various forms of data transparency?
*fragmentation transparency
*replication transparency
*location transparency
35. Define decision tree classifiers?
As the name suggests decision tree classifiers use a tree: each leaf node has an associated
class, and each internal node has a predicate associated with it.
16 MARK QUESTIONS
UNIT: 1
1. EXPLAIN ABOUT DATABASE SYSTEM STRUCTURE?
Storage manager
• Authorization and integrity manager
• Transaction manager
• File manager
• Buffer manager
Storage manager implements several data structure as a part of physical system
implementation
• Data function
• Data dictionary
• Indices
The query processor
• DDL interpreter
• DML
• Query evaluation engine
2. DESCRIBE RELATIONAL MODEL?
Structure of relational data base
Basic structure
Database schema
Keys
Schema diagram
Query languages
3. BRIEFLY EXPLAIN RELATIONAL ALGEBRA?
Fundamental operations
• Unary operations
• Binary operations
Select operations
branchname=’perryridge’ (loan)
The project operation
loannumber,amount (loan)
Composition of relational operations
• Relational algebra expressions
Union operations
r s
r and s must be a same arity.
They must have the same no of attributes.
The set difference operations
r-s produce a relation containing those tuples in r but not in s.
The Cartesian product operations
The rename operations
4. WHAT IS DATA MODELS? EXPLAIN IT DETAIL?
Entity relationship model
• Rectangles
• Ellipse
• Diamonds
• Lines
Relational model
Relational model use a collection of tables to represent both data and the
relationships among those data. Each table has a multiple columns and each columns has
unique name
Other data models
• Object oriented data model
• Object relational data model
• Network data model
• Hierarchical data model
5. BRIEFLY DESCRIBE RELATIONAL CALCULUS?WITH SOME
EXAMPLES?
The tuple relational calculus
A query in a tuple relational calculus is expressed as
{t| P(t)}
• Example Queries
• Formal definition
• Safety of expressions
• Expressive power of languages
The domain relational calculus
• Example Queries
• Formal definition
• Safety of expressions
• Expressive power of languages
UNIT-2
1. DESCRIBE INTEGRITY AND SECURITY?
• Domain constraint
Referential integrity
A value that appears in one relation for a given set of attributes also appear
for a certain set of attributes in another relation. This condition is called referential
integrity.
• Referential integrity and E-R models
• Database modification
• Referential integrity in SQL
2. WHAT IS AGGREGATE FUNCTION?BRIEFLY DESCRIBE IT?
Aggregate functions are functions that take a collection of values as input and
return a single value. SQL offers 5 built-in aggregate functions:
• Average: avg
• Minimum:min
• Maximum: max
• Total:sum
• Count:count
Average: avg
Select avg (balance)
From account
Where branch-name=’perryridge’
Count :count
select branch-name,count(distinct customer-name)
from depositior,account
where depositor.account-number=account.account-number
groupby branch-name
3. WHAT IS DATA DEFINITION LANGUAGE?EXPLAIN IT IN DETAIL?
The SQL DDL allows specification of not only a set of relations, but also
information after each relation, including
• The schema for each relation
• The domain of values associated with each attribute
• The integrity constraints
• The set of indices to be maintained for each relation
• The security and authorization information for each relation
• The physical storage structure of each relation on disk
Domain Types in SQL
Char(n),
varchar(n), int, small int, numeric(p,d), real, double, precision,
float(n), date, time, timestamp.
Schema Definition in SQL
• Primary key
• Check
4. EXPLAIN MECHANISM OF NESTED QUERIES?
SQL provides a mechanism for nesting subqueries.A subquery is a select from
where expression that is nested within another query. A common use of sub queries is to
perform tests for set membership, make set comparisons, and determine set cardinality.
• Set membership
(select customer-name
from depositor)
• Set comparison
select distinct T.branch-name
from branch as T,branch as S
where T.assets > S.assets and S.branch-city=’Brooklyn’
• Test for Empty Relations
Select customer-name
from borrower
where exits (select *
from depositor
where depositor.customername=
borrower.customer-name)
• Test for the Absence of Duplicate Tuples
5. WRITE SHORT NOTES ON MODIFICTION OF THE DATA BASE?
• Definition
delete from r
where P
• Insertion
insert into account
values (‘A-9732’,’perryridge’,1200)
• Updates
update account
set balance=balance*1.05
• Update of a view
• Transaction
UNIT-3
1. DESCRIBE FILE ORGANISATION?
A file is organized logically as a sequence of records. These records are mapped
onto disk blocks.
• Fixed-Length Records
type deposit=record
Accountnumber:char(10);
branch name:char(22);
balance: real;
end
• Variable length records
*storage of multiple record types in a file
* Record types that allow variable lengths for one or more fields
*Record types that allow repeating fields
Byte string Representation
Fixed length representation
• Reserved space
• List representation
2. DEFINE RAID? BRIEFLY EXPLAIN IT?
A variety of disk organization techniques, collectively called redundant arrays
of independent disks (RAID)
• Improvement of reliability via redundancy.
• Improvement in performance via parallelism
1. Bit level striping
2. Block level striping
RAID levels
• RAID level 0
• RAID level 1
• RAID level 2(memory style error correcting code)
• RAID level 3 (Bit interleaved parity organization)
• RAID level 4 (Block interleaved parity organization)
• RAID level 5 (Block interleaved distributed parity)
• RAID level 6 (P+Q redundancy)
3WRITE SHORT NOTES ON INDEX STRUCTURE OF FILES?
There are two basic kinds of indices
• Ordered indices
• Hash indices
Each technique must be evaluated on the basis of these factors:
• Access types
• Access time
• Insertion time
• Deletion time
• Space overhead
Ordered indices
Primary index
Dense and sparse indices
Multilevel index
Index update
Secondary indices
B+-Tree index files
B+-Tree index structure is the most widely used of several index structures
that maintain there efficiency despite insertion and deletion of data.
Structure of B+-Tree
Queries on B+-Tree
Update on B+-Tree
B+-Tree file organization
B-Tree index files
4. EXPLAIN HASH FILE ORGANIZATION?
Hash functions
• The distribution is uniform
Hash functions assign each bucket the same number of search –key
values from the set of all possible search-key values
• The distributed in random
In the average case each bucket will have nearly same no of
values assigned to it, regardless of the actual distribution of search-key
values
Handling of bucket overflows
• Insufficient buckets
• Skew
Open hashing
Under an alternative approach called open hashing
Close hashing
The form of hash structure that we have just described is something
referred to as close hashing.
Hash indices
5. WHAT IS MAGNETIC DISKS?EXPLAIN IT?
Magnetic disk provides the bulk of secondary storage of modern computer
system. The disk capacity is growing at over 50% per year. But the storage
requirements of large applications has also been growing very fast and in some case
every faster than the growth rate of disk capacities. A large data base may require 100
of disks.
• Physical characteristics of disk
Physical disks are relatively simple. Each disc platter has a flat circular shape
We can call magnetic disk as
• hard disk
• Floppy disk
The read write head store information on a sector magnetically as reversals of
the direction of magnetization of the magnetic material. There may be hundreds of
concentric tracks on a disc surface, containing thousands of sectors.
Unit 4
1. DESCRIBE LOG BASED RECOVERY
The most usably structure for recording data base modification is the LOG
the log is a sequence of log records recording all the update activities in the data base.
There are several types of log records. An update log records describes a single data base
write it has these fields
• Transaction identifier
• Data item identifier
• Old value
• New value
The various types log records as.
• < Ti start >. Transaction Ti has started
• < Ti , Tx v1,v2 > .Transaction Ti has performed a right on data item
• < Ti commit > Transaction Ti has committed
• < Ti about > Transaction Ti has aborted
Deferred data base modification
Immediate data base modification
Check point
Shadow paging
2. WHAT IS SERIALIZABILITY?EXPLAIN ITS TYPES?
The data base system must control concurrent
execution of transactions, to ensure that the data base state
remains consistent. There are different forms of schedule
equivalence they lead to the notions of
• Conflict serializability
• View serializability
Conflict serializability
We say that ii and I j conflict if they are operations by different
transaction on the same data item and at least one of these instruction is a write
operations
View serializability
The concept of view equivalence leads to the concept of View
serializability we say that a schedules S is view serializable if it is view equivalent to
a serial scheduler
3.WRITE SHORT NOTES ON TRANSACTION STATE?
A transaction may not always complete its execution successfully such a
transaction is termed aborted
A transaction must be in one of the following states
• Active
• Partially committed
• Failed
• Aborted
• Committed
4. BRIEFLY DESCRIBE CONCURRENCYEXECUTION?
• Lock – based protocols
• Locks
There are various modes in which a data item may be locked in
this section we restrict our attention to two modes
• Shared
• Exclusive
T1 : lock – x(B );
read(B);
B:=B-50;
write(B);
unlock(B);
Lock-x(A);
read(A);
A:=A+50;
write(A);
unlock(A).
5. EXPLAIN CONCURRENCY CONTROL?
Concurrency control
Oracles multiversion concurrency control differs from the
concurrency mechanism used by some other data base vendors. Read only queries are
given a read –consistent snapshot which is view if the data base as it existed at the
specific point in time, containing all update that we were committed by that point in time
and not containing any updates that were not committed at any point in time thus read
clock are not used in read only queries don’t interfere with other data base activity in
term of locking.
Managed stand by data base
To ensure high availability oracle provide a managed stand by data base
future A stand by data base is a copy of the regular data base ie in solved on the separate
system. If a catastrophic failure occur on the primary system, the stand by system is
activate and take over there by minimizing effect on failure on a availability. Oracle
keeps the stand by data base up to date by constantly applying archived redo logs that are
shipped from the primary data base the back up data base can be brought online in readonly
mode and used for reporting and decision support queries
UNIT 5
1. WRITE SHORT NOTES ON DATA WARE HOUSING?
Data ware housing applications requires the transformation of data from many
sources into a cohesive consistent step set of data configured appropriately for use in data
ware house operation.
• Distributed Transformation services
Data ware housing is an approach to manage data in which
heterogeneous data sources are migrated to a separate homogeneous
data base
• Online Analytical processing services
OLAP services provide server and client capabilities to create
and manage multidimensional OLAP data .
2. EXPLAIN NESTED RELATIONS?
Nested relations
The assumption of INF is a natural one in the bank examples we
have considered. However, not all applications are best modeled by INF relations.
The nested relational model is an extension of the relational model in which
domains may be either atomic or relation valued.
We illustrate nested relations by an example from a library. Suppose we store for
each book the following in formations
• Book title
• Set of authors
• Publishers
• Set of keywords
We can see that if we define a relation for the preceding information, several
domains will be monatomic
• Authors
• Keywords
• Publishers
Complex types
Collection and large object types
Create table books(
…
Keyword-set setoff(varchar(20))
…
)
Structure types
Creation of values of complex types
3. WHAT IS INHERITANCE? DESCRIBE IT IN DETAIL?
Inheritance
Inheritance can be at the levels of types, or at the level of tables We first
consider inheritance of types, then inheritance at the level of labels.
Type inheritance
Suppose that we have the following type definition for people
create type person
(name varchar(20)
address varchar(20))
Table inheritance
Create table people of person
The consistency requirements for sub tables are
1. Each tuple of the sub table can correspond to at most one tuple in each of its
immediate sub tables.
2. SQL:1999 has an additional constraint that all the tuples corresponding to each
other must be derived from one tuple .
Overlapping sub tables
4 WHAT ARE THE TYPES OF REFERENCE?EXPLAIN IT WITH SUITABLE
EXAMPLES?
Object oriented language provided the ability to refer the object attribute of
the type can be referred to the specified type. We can define the type dept with a field
name and a field head which is reference to the type person and a table dept of the type
dept as followed
Create type dept(
Name varchar(20),
Head ref(person)scope people
)
Create table dept of dept
The table definition must specify that the reverence is derived and must still
specify a self referential attribute name. When interesting a tuple for dept we can then use
Insert into dept
Values(‘CS’,’john’)
5. DESCRIBE QUERIES WITH COMPLEX TYPES?
The present extension of the SQL query language deal with the complex type
Let us start with the simple example:
Find the title and the name of the publisher of each book this query carries out the
task:
Select title, publisher.name
From books
• path expression
The reference are dereference in 1999 by the –> simple
Select head-> name, head->address
From dept
An expression such as” head->name” is called the path expression.
• Collection valued attributes
• Nesting and unnesting
The transformation of the nested relation in to a form with fewer
(or no) the relation –valued attribute value is called unnesting
The reverse process of transformation a INF relation into a
nested relation is called nesting.

Lab Manual

2009-08-13T21:00:00.000-07:00

KCG COLLEGE OF TECHNOLOGY
KARAPAKKAM, CHENNAI – 600 097

OPERATING SYSTEMS LABORATORY MANUAL
(FOR III B.TECH V SEM IT STUDENTS)

CS-1254 OPERATING SYSTEMS LAB

Developed by
R.N.Sharmila.Lect.,

DEPARTMENT OF INFORMATION TECHNOLOGY
AS PER THE ANNA UNIVERSITY SYLLABUS

LIST OF EXPERIMENTS

01 Study of Basic Linux commands

02 Shell programs

a) Greatest among Three numbers
b) Armstrong Number
c) Patterns
d) Expansions
e) Substitution
f) Student’s Grade System

03 CPU Scheduling

a) First Come First Serve
b) Shortest Job First
d) Priority Scheduling
e) Round Robin

04 Program using System call

a) fork ()
b) getpid() & getppid()
c) Wait ()
d)opendir(),readdir,closeddir()

05 Program using I/O System call open (), read () & write ()

06 Simulation of “ls and grep” commands

07 Producer-Consumer Problem

08 Deadlock Avoidance Memory Management Scheme

a) First fit
b) Best fit
c) Worst fit
09 Deadlock Avoidance

Ex.No.1 STUDY OF BASIC UNIX COMMANDS

AIM:

To study the basic UNIX commands for the following operations.
• Viewing the all working user
• Viewing the current user of the system
• Viewing the Date and Time
• Viewing the Calendar
• Displaying the given message
• Listing Files
• Checking the Current working directory
• Creating a directory
• Changing the Working directory
• Removing a directory
• Displaying and creating files
• Copying a file
• Deleting files
• Renaming files
• Counting number of words in a file
• Clear the screen
• Performing mathematical calculation

THEORY:
UNDERSTANDING THE UNIX COMMANDS:
In Windows operating system, you have to click on an icon to get a job done that is primarily GUI (Graphical User Interface) based. The UNIX system is heavily command based that is you have to type in a few characters to frame a command and then press the key for it to work. In UNIX system a minimum number of keystrokes achieve the maximum amount of work. That is why UNIX commands are seldom more than four characters long. All UNIX commands are single words like “ls, cat, who”.This commands are all in lowercase.
Viewing the all working user:
The UNIX system is multi-user system .In that network to see who are all currently in network, the “who” command is used to view the all working user, that is it else everyone who is currently logged in .Syntax of the “who” command is
$ who
The UNIX respond of “who” command is
[thrcse01@localhost thrcse01]$ who
root :0 Nov 4 02:11
root pts/1 Nov 4 02:20 (:0.0)
thrcse01 pts/2 Nov 4 02:25 (129.0.0.240)

There are three users of the system with their login names shown in the first column. The second column shows the devices names of their respective terminals.thrcse01 has the name pts/2 associated with his terminal, while thrcse01 terminal has the name pts/1.The third column shows the date and time of the logging in. The terminal names that you see in the who output are actually special files representing the devices. These files are available in /dev.For example, the file pts/1 can be found in the /dev directory.
Viewing the current user of the system:
The “who” command tells everyone who is currently logged in. To see who you are in network, so you should use it with two arguments “am” and “i” the “who am i” Command is used to view the current user of that particular system, that is it shows the user name and system’s name for the connection being used for that particular system, that is it shows the user name and system’s name for the connection being used for that system. Syntax of the “who am i” command is
$who am i
The UNIX respond of “who am i” command is
[thrcse01@localhost thrcse01]$ who am i
thrcse01 pts/2 Nov 4 02:25 (129.0.0.240)

Here current working user’s login names shown in the first column. The second column shows terminal of the device names of their respective terminals. The third column shows the date and time of logging in.
Viewing the Date and Time:
The UNIX system maintains an internal clock. This clock actually stores the number of seconds elapsed since january1, 1970 the “date” command shows the date and time to the nearest second. Syntax of the “date” command is
$ date
The UNIX respond of “date” command is
[thrcse01@localhost thrcse01]$ date
Fri Nov 4 02:28:47 IST 2005
Here day shown in the first column, month shown in the second column, date shown in the third column, time with nearest second shown in the fourth column.
Viewing the Calendar:
The “cal” command is used to view the present year calendar . Syntax of the “cal” command is $ cal
The UNIX respond of “cal” command is
[thrcse01@localhost thrcse01]$ cal
November 2005
Su Mo Tu We Th Fr Sa
1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30

Displaying the given message:
The “echo” command displays it arguments. We can use this command either quoted or unquoted. Syntax of the “echo” command is
$ echo

The UNIX respond of “echo” command is

[thrcse01@localhost thrcse01]$ echo hello
In the unquoted argument the multiple spaces reduce to single space. But in the quoted argument multiple spaces are displayed.
Listing Files :
The “ls” command is used to list out the names of the files available in the current working directory. The syntax of the “ls” command is
$ ls
The UNIX respond of “ls”command is

[thrcse01@localhost thrcse01]$ ls
alm file india

Here alm, file and India are the files of the current working directory.
Checking the Current working directory:
It is remarkable feature of the UNIX system that, like a file, user also occupies a certain slot in the files system. When you log in, you are placed in a specific directory of the file system. This directory is known as your current directory. You can move around from one directory to another, but at any point of the time, only one directory is current. The “ pwd” (present working directory)command is used to move our current working directory. The syntax of the “pwd” command is
$ pwd

The UNIX respond of “pwd”command is
[thrcse01@localhost thrcse01]$ pwd
/home/thrcse01
[thrcse01@localhost thrcse01]$

Here /home /thrcse01 is a path name, which is simply a sequence of directory names separated by slashes. pwd here tells you that you are placed in the directory “thrcse01”, which has the parent directory “home” and first slash represent the root directory.
Creating a directory:
Directories can be created with the “mkdir” (Make Directory) command. The command is followed by the names of the directories to be created. The syntax of the “mkdir” command is
$ mkdir
A directory “sugan” is created under the current directory like this.

[thrcse01@localhost thrcse01]$ mkdir sugan

Changing the Working directory:
You can move around in the file system by using the “cd” (change directory) command. It changes the current directory specified as the argument. The syntax of the “cd” command is
$ cd
The directory is changed from the current directory.

[thrcse01@localhost thrcse01]$ pwd
/home/thrcse01
[thrcse01@localhost thrcse01]$ cd sugan
[thrcse01@localhost sugan]$ pwd
/home/thrcse01/sugan
[thrcse01@localhost sugan]$

Removing a directory:
The “rmdir”(Remove directory) command removes directories. The command is followed by the names of the directories to be created. The syntax of the “rmdir” command is
$ rmdir
The directory “sugan” is removed from the current working directory like this
[thrcse01@localhost sugan]$ rmdir sugan

Displaying and creating files:
“cat” command is mainly used to display the contents of the file on the terminal.The syntax of the “cat” command is
$ cat
The UNIX respond of “cat”command is
[thrcse01@localhost sugan]$ cat alm
God is Great

The above output shows the alm file’s contents.
To create a file using “cat”:
“cat” is also useful for creating a file.Enter the command “cat” , followed by >(the right chevron) character and the file name for example
[thrcse01@localhost thrcse01]$ cat > file
hai
hello
good morning

When the command line is terminated after hitting the key, the prompt vanishes. Now waits to take input from the user. Enter the Data into the file, each line followed by .Finally, press to signify the end of input to the system. When this character is entered, the system understands that no further text input will be made. The file is written and the prompt returned.
Copying a file:
The “cp” (copy) command copies a file or a group of files .The syntax requires at least two file names to be specified in the command line. The syntax is
$ cp
The first file is copied to the second. The UNIX respond of “cp”command is
[thrcse01@localhost thrcse01]$ cp alm india
[thrcse01@localhost thrcse01]$ cat india
GOD IS GREAT
[thrcse01@localhost thrcse01]$ cat alm
GOD IS GREAT

Here “alm” file’s contents are copied to the “file” file.
Deleting files:
Files can be deleted with “rm”(remove).It can delete more than one file with single instruction. The syntax of “rm” command is
$ rm
The UNIX respond of “rm”command is
[thrcse01@localhost thrcse01]$ ls
alm file india sugan
[thrcse01@localhost thrcse01]$ rm india
[thrcse01@localhost thrcse01]$ ls
alm file sugan

Renaming files :
“mv”(move) command is used to renaming the file .It has to function renaming a file (ordirectory)and moving group of files to a different directory. Unlike “cp”command the “mv”command does not create a copy of the file, it merely renames it. The syntax requires at least two file names to be specified in the command line.
The syntax is
$ mv
thrcse01@localhost thrcse01]$ mv alm file[thrcse01@localhost thrcse01]$ cat file
GOD IS GREAT
[thrcse01@localhost thrcse01]$ cat alm
cat: alm: No such file or directory

Here entire command of “alm” file contents are moved to “alm1”file.Now “alm” file has no contents everything moved to the “alm1”.That is “alm”file is renamed to “alm1”.
Counting number of words in a file:
The “wc”(word count) command is used to count the number of lines, words and character in a file, for example
[thrcse01@localhost thrcse01]$ wc file
2 3 14 file

“wc” counts 2 lines, 3 words and 14 characters. The file name has also been shown in the fourth column. Here a line is any group of characters not containing a new line character. A word is a group of characters not containing a space, tab or new line. A character is the smallest unit of information and includes all spaces , tabs and new line.
Performing mathematical calculation:
The “bc” command is used to perform basic mathematical calculation.
The UNIX respond of “bc”command is
[thrcse01@localhost thrcse01]$ bc
bc 1.06
Copyright 1991-1994, 1997, 1998, 2000 Free Software Foundation, Inc.This is free software with ABSOLUTELY NO WARRANTY.
For details type `warranty'.
2*3
6
7+5-4*3
0
[thrcse01@localhost thrcse01]$

When you invoke “bc” without arguments, the input has to be keyed in , each line terminated by pressing . After you have finished your work , use for terminating the “bc” command.
Clear the screen:
The “clear” command is used to vanish the entire content in the command screen. That is whatever has been typed so far has vanished from our view and the cursor is positioned at the top-left corner of the screen.

SHELL PROGRAMMING
EX.NO: 2a) GREATEST AMONG THREE NUMBERS

AIM :

To write a shell program to find the greatest among three numbers using loops.

ALGORITHM:

1. Start
2. Read the three value a,b,c.
3. the value of a>b and a>c then print “a” is greater.
4. Else if b>c then print “b” is greater.
5. Else print “c” is greater.
6.Stop.

PROGRAM
echo "Enter the 3 number”
read a,b,c
If test $a –gt $b –a $a -gt $c
Then
echo "$a is greater"
elif test $b -gt $c
Then
echo "$b is greater"
else
echo "$c is greater"
fi

OUTPUT:
[it3@localhost it3]$sh ggr.sh
Enter the 3 number...
5
6
7
7 is greater.

EX.NO : 2b) ARMSTRONG NUMBER

AIM:

To write a shell program to check whether the given number is Armstrong or not.

ALGORITHM:

Step1: Enter the given number.
Step 2: Separate the digit using the formula q=`expr $n % 10`and r=`expr $n %10`.
Step 3: Calculate sum of cube of digits by the formula a=`expr $a + $r /* $r /* $r`.
Step 4: Compute the result with the given number.
Step 5: if found equal then display it as Armstrong number else display not Armstrong
number.

PROGRAM:

echo”enter the number”
read n
q=$n
a=0
while [ $q – gt 0 ]
do
r= `expr $q % 10 `
q= `expr $q / 10 `
a=`expr $a + $r /* $r /*$r `
done
if [ $a=$n ]
then
echo “the number $n is armstrong number”
else
echo“the number $n is not armstrong number”
fi

OUTPUT:
[it6@localhost pgm]$ sh arm.sh
Enter the number:
153
The number 153 is Armstrong number.

EX.NO : 2c) PATTERNS

AIM:
To write a shell program to print the records of the employee for the given conditions using patterns.
Pattern.sh
First name Last name Rate Hours
Senthil kumar 15 20
Kousik kumar 12 0
Kumar ganesh 13 21
Mohan Raj 0 10
Shanmuga Nathan 12 11
Guna sekhar 32 48
QUESTIONS
1. Print the records of employee who didn’t work last week.
2. Print the records employee whose rate>15.
3. Print the records of employee whose first name is Guna.
4. Print the hours of employee whose hours is 20-40.
5. Print the hours of employee whose rate is greater than 18.

ALGORITHM
1. Start
2. Read the records of the employee in the file.
3. Print the records of the employee for the given conditions using echo commands
4. Stop.
PROGRAM:
First name Last name Rate Hours
Senthil kumar 15 20
Kousik kumar 12 0
Kumara ganesh 13 21
Mohan Raj 0 10
Shanmuga Nathan 12 11
Guna sekhar 32 48

[it3@1local host it3]$ cat ah0011
Awk `$4==0{print $1 $2}’ah0011.sh
Awk `$3 > 15{print $1 $2 $4}’ah0011.sh
Awk `$1==”guna”{print $1 $2}’ah0011.sh
Awk `$3 > 25{print $1 $4}’ah0011.sh
Awk `$4 > 40{print $1 $2 $3 $4 }’ah0011.sh
OUTPUT
[it3@1local host it3]$ cat ah0011
Kaushikkumar
First name Last name Hours
Guna sekhar 48
First name Hours
Guna 48
Kumaraganesh
First name Last name Rate Hours
Guna sekhar 32 48

EX.NO : 2d) EXPANSIONS
AIM:
To write a shell program to implement variable expansion using command line argument to test the files in the directory.
ALGORITHM:
1. Start.
2. Open a file in vi editor.
3. Assign current directory to the variable.
4. Change directory to the assigned variable.
5. List all the files using ls command.
6. Stop.
PROGRAM:
a=$*
cd $a
ls
OUTPUT
00 aa it057 ree
01 aart it57pattern.sh sri
015 sshh it19 thy

EX.NO : 2e) SUBSTITUTION
AIM:
To write a shell program to count the number of words in a file using substitution.

ALGORITHM:

1.Start.
2.Open a file in vi editor.
3.Assign current directory to the variable.
4.Count the number of words,line,characters using echo and wc command.
5.Stop.

PROGRAM:

Echo”enter the file name”
Read a
Echo”wc of aa is”
Echo “$(wc $a)”

OUTPUT
[it3@localhost it3]$sh aa
Enter the file name
Coat
Wc of coat is
1 1 3 coat

EX.NO : 2f) STUDENT GRADE SYSTEM

AIM:
To write a program to compute the grade of the student using substitution.

ALGORITHM:
1. Start.
2. Open a file in vi editor.
3. read the student name and the subject name.
4. calculate the total and the average.
5. If the average is greater than 75,print first class.
6. If the average is greater than 35.print secound class.
7. Else print fail.
8. print student name along with the grade.
9. Stop.

PROGRAM:
Echo”enter the name of the student “
Read a
Echo”enter the 3 marks”
Read b
Read c
Read d
F=`expr $b + $c + $d`
G=`expr $F / 3`
If test $g –gt 75
Then
Echo”1st class”
Elif test $g –gt 50
Then
Echo”2nd class”
Else
Echo”fail”
Fi

OUTPUT
[it3@localhost it3]sh aa
Enter the name of the student
Hema
Enter the 3 marks
98
97
76
1st class

Ex.No:3a) CPU SCHEDULING: FIRST COME FIRST SERVE

AIM:

To write a C program to implement the CPU scheduling algorithm FIRST COME FIRST SERVE.

PROBLEM DESCRIPTION:

Cpu scheduler will decide which process should be given the CPU for its execution.For
this it uses different algorithm to choose among the process. One among that algorithm is FCFS
algorithm.In this algorithm the process which arrive first is given the cpu after finishing its
request only it will allow cpu to execute other process.

ALGORITHM:

Step 1: Create the number of process.
Step 2: Get the ID and Service time for each process.
Step 3: Initially, Waiting time of first process is zero and Total time for the first process is the starting time of that process.
Step 4: Calculate the Total time and Processing time for the remaining processes.
Step 5: Waiting time of one process is the Total time of the previous process.
Step 6: Total time of process is calculated by adding Waiting time and Service time.
Step 7: Total waiting time is calculated by adding the waiting time for lack process.
Step 8: Total turn around time is calculated by adding all total time of each process.
Step 9:Calculate Average waiting time by dividing the total waiting time by total number of process.
Step 10: Calculate Average turn around time by dividing the total time by the number of process.
Step 11: Display the result.

PROGRAM CODING:

#include
int main()
{
int n,b[10],t=0,i,w=0,r=0,a=0;
float avg,avg1;
printf("\nEnter number of processes:");
scanf("%d",&n);
printf("\nEnter the burst times : \n");
for(i=1;i<=n;i++)
scanf("%d",&b[i]);
printf("\n Gantt chart ");
for(i=1;i<=n;i++)
printf("P%d\t",i);
printf("\n\nProcess BurstTime WaitingTime TurnaroundTime\n");
for(i=1;i<=n;i++)
{
t=t+w;
r=r+b[i];
printf("P%d\t\t%d\t\t%d\t\t%d\t\t\n",i,b[i],w,r);
w=w+b[i];
a=a+r;
}
avg=(float)t/n;
avg1=(float)a/n;
printf("\n Average WaitingTime is %f",avg);
printf("\n Average TurnaroundTime is %f\n",avg1);
return(0);
}

OUTPUT:
[cse6@localhost Pgm]$ cc prog9a.c -o prog9a.out
[cse6@localhost Pgm]$ ./prog9a.out
Enter number of processes : 3
Enter the burst times :
24
5
3
Gantt chart P1 P2 P3
Process BurstTime WaitingTime TurnaroundTime
P1 24 0 24
P2 5 24 29
P3 3 29 32
Average WaitingTime is 17.666666
Average TurnaroundTime is 28.333334
[cse6@localhost Pgm]$

Ex.No:3b) CPU SCHEDULING: SHORTEST JOB FIRST

AIM:

To write a C program to implement the CPU scheduling algorithm for Shortest job first.

PROBLEM DESCRIPTION:

Cpu scheduler will decide which process should be given the CPU for its execution. For
this it uses different algorithm to choose among the process. One among that algorithm is SJF algorithm.In this algorithm the process which has less service time given the cpu after finishing its request only it will allow cpu to execute next other process.

ALGORITHM:

Step 1: Get the number of process.
Step 2: Get the id and service time for each process.
Step 3: Initially the waiting time of first short process as 0 and total time of first short is
process the service time of that process.
Step 4: Calculate the total time and waiting time of remaining process.
Step 5: Waiting time of one process is the total time of the previous process.
Step 6: Total time of process is calculated by adding the waiting time and service time of
each process.
Step 7: Total waiting time calculated by adding the waiting time of each process.
Step 8: Total turn around time calculated by adding all total time of each process.
Step 9: Calculate average waiting time by dividing the total waiting time by total
number of process.
Step 10: Calculate average turn around time by dividing the total waiting time by total
number of process.
Step 11: Display the result.

PROGRAM CODING:
#include
int main()
{
int n,w[100],tot[100],i,j,awt,atot;
float avwt,avtot;
struct
{
int p,bt;
}
sjf[10],temp;
printf("Enter the number of Processes:");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
printf("Enter the Burst time for Process%d : ",i);
scanf("%d",&sjf[i].bt);
sjf[i].p=i;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(sjf[j].bt>sjf[i].bt)
{
temp=sjf[i];
sjf[i]=sjf[j];
sjf[j]=temp;
}
w[1]=0;
tot[1]=sjf[1].bt;
for(i=2;i<=n;i++)
tot[i]=tot[i-1]+sjf[i].bt;
awt=0;
atot=0;
for(i=1;i<=n;i++)
{
w[i]=tot[i]-sjf[i].bt;
awt+=w[i];
atot+=tot[i];
}
avwt=(float)awt/n;
avtot=(float)atot/n;
printf("\n\nProcessId\tWaiting time\t TurnaroundTime");
for(i=1;i<=n;i++)
printf("\n\t%d\t\t%d\t\t%d",sjf[i].p,w[i],tot[i]);
printf("\n\nTotal Waiting Time :%d",awt);
printf("\n\nTotal Turnaround Time :%d",atot);
printf("\n\nAverage Waiting Time :%.2f",avwt);
printf("\n\nAverage Turnaround Time :%.2f",avtot);
}

OUTPUT:

[cse6@localhost Pgm]$ cc prog9b.c
[cse6@localhost Pgm]$ ./a.out
Enter the number of Processes:3
Enter the Burst time for Process1 : 24
Enter the Burst time for Process2 : 5
Enter the Burst time for Process3 : 3
ProcessId Waiting time TurnaroundTime
3 0 3
2 3 8
1 8 32
Total Waiting Time :11
Total Turnaround Time :43
Average Waiting Time :3.67
Average Turnaround Time :14.33
[cse6@localhost Pgm]$

Ex.No:3c) CPU SCHEDULING: PRIORITY SCHEDULING

AIM:

To write a C program to implement the CPU scheduling algorithm for Priority.

PROBLEM DESCRIPTION:

Cpu scheduler will decide which process should be given the CPU for its execution. For this it uses different algorithm to choose among the process. One among that algorithm is Priority algorithm.In this algorithm the processes will be given the priorities. The process which is having the highest priority is allocated the cpu first.After finishing the request the cpu is allocated to the next highest priority and so on.

ALGORITHM:

Step 1: Get the number of process
Step 2: Get the id and service time for each process.
Step 3: Initially the waiting time of first short process as 0 and total time of first short is
process the service time of that process.
Step 4: Calculate the total time and waiting time of remaining process.
Step 5: Waiting time of one process is the total time of the previous process.
Step 6: Total time of process is calculated by adding the waiting time and service time of
each process.
Step 7: Total waiting time calculated by adding the waiting time of each process.
Step 8: Total turn around time calculated by adding all total time of each process.
Step 9: Calculate average waiting time by dividing the total waiting time by total
number of process.
Step 10: Calculate average turn around time by dividing the total waiting time by total
number of process.
Step 11: Display the result.

PROGRAM CODING:
#include
int main()
{
int n,temp=0,w[20],b[20],
p[20], t2[20],j,t1,d[20],i,
te=0,b1[20],t3=0;
float t,r;
w[1]=0;
printf("\nEnter no. of processes:");
scanf("%d",&n);
printf("\nEnter the burst times : ");
for(i=1;i<=n;i++)
{
rintf("P%d : ",i);
scanf("%d",&b[i]);
d[i]=i;
}
printf("Enter the priorities:");
for(i=1;i<=n;i++)
{
printf("P%d : ",i);
scanf("%d",&p[i]);
}
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(p[i]{
temp=p[i];
t1=d[i];
te=b[i];
p[i]=p[j];
d[i]=d[j];
b[i]=b[j];
p[j]=temp;
d[j]=t1;
b[j]=te;
}
printf("\nGantt Chart : ");
for(i=1;i<=n;i++)
printf("P%d\t",d[i]);
printf("\nProcess \t Priority\tBurst Time\t Waiting Time\t Turnaround Time");
for(i=1;i<=n;i++)
{
t=d[i];
w[i+1]=w[i]+b[i];
t2[i]=b[i]+w[i];
t3+=t2[i];
printf("\nP%d\t\t%d\t\t%d\t\t%d\t\t%d",d[i],p[i],b[i],w[i],t2[i]);
}
temp=0;
for(i=1;i<=n;i++)
temp+=w[i];
t=(float)temp/n;
r=(float)t3/n;
printf("\nAverage Waiting time : %.2f",t);
printf("\nAverage Turnaround time : %.2f",r);
}

OUTPUT:
[cse6@localhost Pgm]$ cc prog10a.c
[cse6@localhost Pgm]$ ./a.out
Enter the no. of processes : 3
Enter the burst times
P1 : 24
P2 : 5
P3 : 3
Enter the priorities
P1 : 2
P2 : 1
P3 : 3
Gantt Chart : P2 P1 P3
ProcessID Priority BurstTime WaitingTime TurnaroundTime
P2 1 5 0 5
P1 2 24 5 29
P3 3 3 29 32

Average Waiting Time : 11.33
Average Turnaround Time : 22.00
[cse6@localhost Pgm]$

EX.NO : 3d) CPU SCHEDULING: ROUND ROBIN SCHEDULING

AIM :

To simulate the round robin program.

PROBLEM DESCRIPTION:

CPU scheduler will decide which process should be given the CPU for its execution .For
this it use different algorithm to choose among the process .one among that algorithm is Round robin algorithm.In this algorithm we are assigning some time slice .The process is allocated according to the time slice ,if the process service time is less than the time slice then process itself will release the CPU voluntarily .The scheduler will then proceed to the next process in the ready queue .If the CPU burst of the currently running process is longer than time quantum ,the timer will go off and will cause an interrupt to the operating system .A context switch will be executed and the process will be put at the tail of the ready queue.

ALGORITHM:

Step 1: Initialize all the structure elements
Step 2: Receive inputs from the user to fill process id,burst time and arrival time.
Step 3: Calculate the waiting time for all the process id.
i) The waiting time for first instance of a process is calculated as:
a[i].waittime=count + a[i].arrivt
ii) The waiting time for the rest of the instances of the process is calculated as:
a) If the time quantum is greater than the remaining burst time then waiting time is calculated as: a[i].waittime=count + tq
b) Else if the time quantum is greater than the remaining burst time then waiting time is calculated as: a[i].waittime=count - remaining burst time
Step 4: Calculate the average waiting time and average turnaround time
Step 5: Print the results of the step 4.

PROGRAM CODING:

#include
void main()
{
int i,tbt=0,nop,ts=0,flag[20], rem[20];
int from,wt[20],tt[20],b[20], twt=0,ttt=0;
int dur;
float awt,att;
clrscr();
printf("Enter no. of Processes: ");
scanf("%d",&nop);
printf("Enter the time slice: ");
scanf("%d",&ts);
printf("Enter the Burst times..\n");
for(i=0;i{
wt[i]=tt[i]=0;
printf("P%d\t: ",i+1);
scanf("%d",&b[i]);
rem[i]=b[i];
tbt+=b[i];
flag[i]=0;
}
from=0;
i=0;
printf("\n\t Gantt Chart");
printf("\n ProcessID\tFrom Time\tTo Time\n");
while(from{
if(!flag[i])
{
if(rem[i]<=ts)
{
dur=rem[i];
flag[i]=1;
tt[i]=dur+from;
wt[i]=tt[i]-b[i];
}
else
dur=ts;
printf("%7d%15d%15d\n",i+1, from,from+dur);
rem[i] -= dur;
from += dur;
}
i=(i+1)%nop;
}
for(i=0;i{
twt+=wt[i];
ttt+=tt[i];
}
printf("\n\n Process ID \t Waiting Time \t Turn Around Time");
for(i=0;i{
printf("\n\t%d\t\t%d\t\t%d",i+1,wt[i],tt[i]);
}
awt=(float)twt/(float)nop;
att=(float)ttt/(float)nop;
printf("\nTotal Waiting Time:%d",twt);
printf("\nTotal Turn Around Time:%d",ttt);
printf("\nAverage Waiting Time:%.2f",awt);
printf("\nAverage Turn Around Time:%.2f\n",att);
getch();
}

OUTPUT:
Enter no. of Processes: 3
Enter the time slice: 3
Enter the Burst times..
P1 : 24
P2 : 5
P3 : 3

ProcessID From Time To Time
1 0 3
2 3 6
3 6 9
1 9 12
2 12 14
1 14 17
1 17 20
1 20 23
1 23 26
1 26 29
1 29 32

Process ID Waiting Time Turn Around Time
1 8 32
2 9 14
3 6 9

Total Waiting Time:23
Total Turn Around Time:55
Average Waiting Time:7.67
Average Turn Around Time:18.33

Ex.No:4a) PROGRAM USING SYSTEM CALL FORK ()

AIM :

To execute programs based on system calls of UNIX operating system.

FORK():

Fork creates a child process that differs from the parent process only in its PID and PPID.

On success,the PID of the child process is returned in the parents tread of execution and

ALGORITHM :

Step 1 : Declare the variable pid.
Step 2 : Get the pid value using system call fork().
Step 3 : If pid value is less than zero then print as “Fork failed”.
Step 4 : else if pid value is equal to zero include the new process in the system’s file
using execlp function.
Step 5 : else if pid is greater than zero then it is the parent process then make it to wait
till the child completes.
Step 6 : Then print “Child complete”.

PROGRAM CODING :

#include
main(int argc,char *arg[])
{
int pid;
pid=fork();
if(pid<0)
{

fprintf(strerr,"fork failed");
exit(-1);
}
else if(pid==0)
{
execlp("bin\1s","7s",NULL);
}
else
{
wait(NULL);
printf("Child Complete");
exit(0);
}
}

OUTPUT:

[cse6@localhost Pgm]$ cc prog4a.c
[cse6@localhost Pgm]$ ./a.out
Child Complete

Ex.No.4b) PROGRAM USING SYSTEM CALL
getpid() & getppid()

AIM :

To write the program to implement the system call getpid() and getppid().

ALGORITHM :

Step 1 : Declare the variables pid , parent pid , child id and grand child id.
Step 2 : Get the chid id value using system call fork().
Step 3 : If child id value is less than zero then print as “error at fork() child”.
Step 4 : If child id !=0 then using getpid() system call get the process id.
Step 5 : Print “I am parent” and print the process id.
Step 6 : Get the grand child id value using system call fork().
Step 7 : If grand child id value is less than zero then print as “error at fork() grand
child”.
Step 8 : If grand child id !=0 then using getpid system call get the process id.
Step 9 : Assign the value of pid to my pid.
Step 10 : Print “I am child” and print the value of my pid.
Step 11 : Get my parent pid value using system call getppid().
Step 12 : Print “My parent’s process id” and its value.
Step 13 : Else print “I am the grand child”.
Step 14 : Get the grand child’s process id using getpid() and print it as “my process id”.
Step 15 : Get the grand child’s parent process id using getppid() and print it as “my
parent’s process id”.

PROGRAM CODING:
int my_pid;
int my_parent_pid;
main()
{
int child_id;
if((child_id=fork())==-1)
{
perror("error at fork() child");
exit(0);
}
if(child_id!=0)
{
my_pid=getpid();
printf("i am a parent \n");
printf("my process ID is:%d\n",my_pid);
exit(0);
}
else
{
int grand_child_id;
if((grand_child_id=fork())==-1)
{
perror("Error at Fork() grandchild");
exit(0);
}
if(grand_child_id!=0)
{
my_pid=getpid();
printf("i am child \n");
printf("my process ID is %d\n",my_pid);
my_parent_pid=getppid();
printf("my parents process ID is %d\n",my_parent_pid);
exit(0);
}
else
{
printf("i am the grand child \n");
my_pid=getpid();
printf("my process ID is %d\n",my_pid);
my_parent_pid=getppid();
printf("my parents process ID is %d\n",my_parent_pid);
exit(0);
}
}
}

OUTPUT:
[cse6@localhost Pgm]$ cc prog4b.c -o prog4b.out
[cse6@localhost Pgm]$ ./prog4b.out
i am the grand child
my process ID is 10297
my parents process ID is 10296
i am child
my process ID is 10296
my parents process ID is 10295
i am a parent
my process ID is:10295
[cse6@localhost Pgm]$

Ex.No.4c) PROGRAM USING SYSTEM CALL WAIT()

AIM :

To execute programs based on system call wait () of UNIX operating system.

WAIT():

Wait, waitpid is used to wait for process termination.

The wait function suspends execution of the current process until a child has exits or until a signal is delivered where action is to termin ate the current process of to call a signal handling function.

1->which means to wait for any child process,this is the same behaviour which wait exhibits.
0->which means to wait for any child process groupid is equal to that of the calling process.

PROGRAM :
#include
#include< sys/wait.h>
Main()
{
Int i=0,pid;
Printf(“ready to fork()\n\n”);
Pid=fork();
If(!pid)
{
Printf(“child starts…\n”);
For(i=0;i<100;i++)
Printf(“%d/t”,i);
Printf(“parent ends”\n”);
}
}
Ex.No.4d) PROGRAM USING SYSTEM CALL
opendir (), readdir() & closeddir()

AIM :

To execute programs based on system call opendir(),readdir(),closedir() of UNIX operating system.

OPENDIR():

The directory is opened using the opendir() function and the pointer returned by this function and is assigned to dirname.

READDIR()

The directory is read using the readdir().

CLOSEDDIR():

This function is used to close the directory closedir().

PROGRAM CODING:
#include
#include
#include
Main(int argc,char *argv[])
{
DIR *dirname;
Struct dirent *rdir;
Dirname=opendir(argv[1]);
While(rdir=readdir(dirname))
{
If(strcmp(rdir=readdir->d_name,argv[2]==0)
{
Closedir(dirname);
Printf(“found entry %s\t\n”,argv[2]);
Exit(0);
}
}
Printf(“could not find entry %s written %s\n”,argv[2],argv[1]);
Closedir(dirname);
}

OUTPUT
[cse6@localhost PGM]$ cc 011f7.c
[cse6@localhost PGM]$ ./a.out 011fork fork
Found entry fork

Ex.No.5) PROGRAM USING I/O SYSTEM CALL
open (), read() & write()

AIM :

To write the program to implement the system call open(),read() and write().

ALGORITHM :

Step 1 : Declare the structure elements.
Step 2 : Create a temporary file named temp1.
Step 3 : Open the file named “test” in a write mode.
Step 4 : Enter the strings for the file.
Step 5 : Write those strings in the file named “test”.
Step 6 : Create a temporary file named temp2.
Step 7 : Open the file named “test” in a read mode.
Step 8 : Read those strings present in the file “test” and save it in temp2.
Step 9 : Print the strings which are read.

PROGRAM CODING:
#include
struct
{
int i;
char c[15];
}temp1,temp2;
char *pc;
int temp_size;
main()
{
FILE *fp,*fopen();
pc=(char *)&temp1;
temp_size=sizeof(temp1);
fp=fopen("test","w");
printf("\nEnter a string : ");
scanf("%c%s",&temp1.i,&temp1.c);
fwrite(pc,temp_size,1,fp);
fclose(fp);
pc=(char *)&temp2;
temp_size=sizeof(temp2);
fp=fopen("test","r");
fread(pc,temp_size,1,fp);
printf("%c%s\n",temp2.i,temp2.c);
fclose(fp);
}
OUTPUT:
[cse6@localhost PGM]$ cc prog5.c -o prog5.out
[cse6@localhost PGM]$ ./prog5.out
Enter a string: Hello
Hello
[cse6@localhost PGM]$

Ex.No:6 SIMULATION OF UNIX COMMAND “LS & GREP”

AIM:

To write a C program to simulate the operation of “LS & GREP” command in Unix.

ALGORITHM :

SIMULATION OF LS COMMANDS:

Step 1 : Start.
Step 2 : Get the name of the directory using command line argument.
Step 3 : While directory is not empty, print the contents of the directory.
Step 4 : Stop.

PROGRAM CODING:
#include
#include
int main()
{
FILE *fp;
char w[20],w1[20],w2[20],str[20];
int fag=0;
fp=fopen(“it53abc.txt”,”r’);
printf("\n Enter the pattern: ");
scanf("%s",&str);
fscanf(fp,”%s%s%s”,w,w1,w2);
while(!feof(fp))
{
If(strcmp(str,w)==0)
{
Printf(“%s \t %s \t %s \t %s”,w,w1,w2);
Flag=1;
Break; }
If(strcmp(str,w)==0)
{
Printf(“%s \t %s \t %s \t %s”,w,w1,w2);
Flag=1;
Break; }
fscanf(fp,“%s%s%s%s”,w,w1,w2);
If(flag==0)
{
Printf(“Pattern not found”); } }
}

OUTPUT:

[cse6@localhost Pgm]$ cc ls53.c
[cse6@localhost Pgm]$ .a/.out sha
San
Sha
[cse6@localhost Pgm]$

SIMULATION OF GREP COMMANDS:

Step 1 : Start.
Step 2 : Get the name of the file where pattern is to be searched.
Step 3 : While end of file is not reached,search for the pattern.
Step 4 :If the pattern is found,print the entire sentence.
Step 5:Else print the pattern is not found.
Step 6: Stop.

PROGRAM CODING:
#include
#include
int main()
{
FILE *fp;
char w[20],w1[20],w2[20],str[20];
int fag=0;
fp=fopen(“it53abc.txt”,”r’);
printf("\nEnter the pattern: ");
scanf("%s",&str);
fscanf(fp,”%s%s%s”,w,w1,w2);
while(!feof(fp))
{
If(strcmp(str,w)==0)
{
Printf(“%s \t %s \t %s \t %s”,w,w1,w2);
Flag=1;
Break;
}
If(strcmp(str,w)==0)
{
Printf(“%s \t %s \t %s \t %s”,w,w1,w2);
Flag=1;
Break;
}
fscanf(fp, (“%s%s%s%s”,w,w1,w2);
If(flag==0)
{
Printf(“Pattern not found”);
}
}
}

OUTPUT:
[cse6@localhost Pgm]$ cc grep53.c
[cse6@localhost Pgm]$ .a/.out
Enter the pattern:how
How are u?
[cse6@localhost Pgm]$

Ex.No.7 PRODUCER CONSUMER PROBLEM

AIM:

To write a C program to implement the Producer & consumer Problem (Semaphore)

ALGORITHM:

Step 1: The Semaphore mutex, full & empty are initialized.
Step 2: In the case of producer process
i) Produce an item in to temporary variable.
ii) If there is empty space in the buffer check the mutex value for enter into the critical section.
iii) If the mutex value is 0, allow the producer to add value in the temporary variable to the buffer.
Step 3: In the case of consumer process
i) It should wait if the buffer is empty
ii) If there is any item in the buffer check for mutex value, if the mutex==0, remove item from buffer
iii) Signal the mutex value and reduce the empty value by 1.
iv) Consume the item.
Step 4: Print the result

PROGRAM CODING:
#include
#include
#include
#include
#include
#include
#define NUM_ELEM 10
#define SEM_EMPTY 0
#define SEM_FULL 1
main()
{
int rc,pid,semid,i,j;
int shmid,status;
char elem;
union semun
{
int val;
}mysemun;
struct sembuf waitempty={SEM_EMPTY,-1,SEM_UNDO};
struct sembuf signalempty={SEM_EMPTY,1,IPC_NOWAIT};
struct sembuf waitfull={SEM_FULL,-1,SEM_UNDO};
struct sembuf signalfull={SEM_FULL,1,IPC_NOWAIT};
struct shmid_ds myshmid_ds;
void *shmptr;
semid=semget(IPC_PRIVATE,2,0666|IPC_CREAT);
mysemun.val=NUM_ELEM;
semctl(semid,SEM_EMPTY,SETVAL,mysemun);
mysemun.val=0;
semctl(semid,SEM_FULL,SETVAL,mysemun);
shmid=shmget(IPC_PRIVATE,NUM_ELEM,0666|IPC_CREAT);
pid=fork();
if(pid==0)
{
shmptr=shmat(shmid,0,SHM_R);
for(i=0;i<10;i++)
{
//semop(semid,&signalempty,1);
sleep(1);
}
exit(0);
}
else
{
shmptr=shmat(shmid,0,SHM_W);
for(i=0;i<10;i++)
{
semop(semid,&waitempty,1);
elem='a'+i;
printf("Produced element %c\n",elem);
elem=*((char*)shmptr+(i%NUM_ELEM))=elem;
semop(semid,&signalfull,1);
sleep(2);
//semop(semd,&waitfull,1);
}
wait(&status);
shmctl(shmid,IPC_RMID,&myshmid_ds);
semctl(semid,SEM_EMPTY,IPC_RMID,mysemun);
exit(0);
}
}

OUTPUT:
[cse6@localhost Pgm]$ cc ex11.c -o ex11.out
[cse6@localhost Pgm]$ ./ex11.out
Produced element a
Consumed element a
Produced element b
Consumed element b
Produced element c
Consumed element c
Produced element d
Consumed element d
Produced element e
Consumed element e
Produced element f
Consumed element f
Produced element g
Consumed element g
Produced element h
Consumed element h

Ex.No. 7a) FIRST FIT ALGORITHM

AIM:

To write a C program to implement Memory Management concept using the technique
FirstFit Algoithm.

PROBLEM DESCRIPTION:

Inorder to dynamically allocate the memory we go for this technique First Fit Algorithm.In this first fit algorithm, the allocator keeps the list of free blocks and on receiving a request for memory ,scans along the list for the first block that is large enough to satisfy the request. If the chosen block is significantly larger than that requested ,then it is usually split,and the remainder added to the list as another free block. The first fit algorithm performs resonably well, as it ensures that allocations are quick. In recycling free blocks, there is a choice is to where to add the blocks to the free list, effectively in what order the free list is kept.

ALGORITHM:

The following are the steps to implement first fit algorithm.

Step 1: Get the number of free space available.
Step 2: Get the starting address of each freespace and how much space available.
Step 3: While getting the address and space we have to check whether there is
duplication,if there is a duplication then give the error message for duplication & get the address and space once again.
Step 4: Get the space for the process.
Step 5: Search the first memory location from the available list its size should be greater
than or equal to the process size an or equal to available space in fifo order.
Step 6: If there is no sufficient space output the error message.
Step 7: Display the process and its corresponding allocated memory space

PROGRAM CODING:
#include
int main()
{
int p[20],n,np,i,j,b[50];
printf("\nEnter the number of unallocated segments: ");
scanf("%d",&n);
printf("Enter the memory sizes: ");
for(i=0;iscanf("%d",&b[i]);
printf("Enter the number of processes : ");
scanf("%d",&np);
printf("Enter the Memory requirements of Processes.\n");
for(i=0;i{
printf("p%d: ",i+1);
scanf("%d",&p[i]);
}
printf("Process ID\t First Fit\n");
for(i=0;i{
for(j=0;jif(b[j]>=p[i])
{
printf("%d\t\t %d\n",i+1,b[j]);
b[j]=-1;
break;
}
if(j==n)
printf("%d\t\tNot enough memory\n",i+1);
}
return 0;
}

OUTPUT
[cse6@localhost CSE6]$cc prog12a.c
[cse6@localhost CSE6]$ ./a.out
Enter the number of unallocated segments: 3
Enter the memory sizes:
210
120
330
Enter the number of processes: 3
Enter the Memory requirements of Processes.
p1: 120
p2: 310
p3: 450
Process ID First Fit
1 210
2 330
3 Not enough memory

[cse6@localhost CSE6]$ cc prog12a.c
[cse6@localhost CSE6]$ ./a.out
Enter the number of unallocated segments: 3
Enter the memory sizes:
210
120
330
Enter the number of processes : 3
Enter the Memory requirements of Processes.
p1: 120
p2: 80
p3: 230
Process ID First Fit
1 210
2 120
3 330

[cse6@localhost CSE6]$ cc prog12a.c
[cse6@localhost CSE6]$ ./a.out

Ex.No:7b) BEST FIT ALGORITHMS

AIM:

To write a C program to implement Memory Management concept using the technique BestFit Algoithm.

PROBLEM DESCRIPTION:

Inorder to dynamically allocate the memory we go for this technique Best Fit Algorithm.In this algorithm ,a search is performed very much like firstfit ,except that it does not stop when a suitable block has been found.Instead ,the search continues to try all the blocks in the list.The block choosen is a closest to the desired size.This avoids unnecessarily fragmenting very large allocation spaces.

ALGORITHM:

Step 1: Get the number of free space available.
Step 2: Get the starting address of each free space and how much space available.
Step 3: While getting the address and space we have to check whether there is
duplication,if there is a duplication then give the error message for duplication
& get the address and space once again.
Step 4: Get the space for the process.
Step 5: Sort the available list in ascending order based on the space.
Step 6: Search the first memory location from the available list its size should be greater
than or equal to the process size an or equal to available space in FIFO order.
Step 7: If there is no sufficient space output the error message.
Step 8: Display the process and its corresponding allocated memory space.

PROGRAM CODING:
#include
int main()
{
int a,b[50],i,j,temp,p[50],n,m;
printf("\nEnter the no.of allocated space: ");
scanf("%d",&n);
printf("\nEnter the allocated Memory space: ");
for(i=0;iscanf("%d",&b[i]);
for(i=0;ifor(j=i+1;jif(b[i]>b[j])
{
temp=b[i];
b[i]=b[j];
b[j]=temp;
}
printf("\nEnter the Number of processes: ");
scanf("%d",&m);
for(i=0;i{
printf("Enter the memory space for the given process: ");
scanf("%d",&p[i]);
}
printf("Process ID\t Best fit\n");
for(i=0;i{
printf("p%d\t\t ",i+1);
for(j=0;j{
if(p[i]<=b[j])
{
printf("%d\n",b[j]);
b[j]=-1;
break;
}
}
if(j==n)
printf("Not Enough memory\n");
}
return 0;
}

OUTPUT:

[cse6@localhost Pgm]$ cc prog12b.c
[cse6@localhost Pgm]$ ./a.out
Enter the no.of allocated space: 3
Enter the allocated Memory space: 200
120
150
Enter the Number of processes: 3
Enter the memory space for the given process: 130
Enter the memory space for the given process: 210
Enter the memory space for the given process: 140
Process ID Best fit
p1 150
p2 Not Enough memory
p3 200

Ex. No. 7d) WORST FIT ALGORITHM

AIM:

To write a C program to implement Memory Management concept using the technique
Best Fit Algorithm.

PROBLEM DESCRIPTION:

Inorder to dynamically allocate the memory we go for this technique Worst Fit Algorithm.In this algorithm ,a search is performed very much like firstfit ,except that it does not stop when a biggest block has been found.Instead ,the search continues to try all the blocks in the list.The block choosen is the largest one to the desired size.

ALGORITHM:

Step 1: Get the number of free space available.
Step 2: Get the starting address of each free space and how much space available.
Step 3: While getting the address and space we have to check whether there is
duplication,if there is a duplication then give the error message for duplication & get the address and space once again.
Step 4: Get the space for the process.
Step 5: Sort the available list in descending order based on the space.
Step 6: Search the first memory location from the available list its size should be greater
than or equal to the process size an or equal to available space in FIFO order.
Step 7: If there is no sufficient space output the error message.
Step 8: Display the process and its corresponding allocated memory space.

PROGRAM CODING:
#include
int main()
{
int a,b[50],i,j,temp,p[50],n,m;
printf("\nEnter the no.of allocated space: ");
scanf("%d",&n);
printf("\nEnter the allocated Memory space: ");
for(i=0;iscanf("%d",&b[i]);
for(i=0;ifor(j=i+1;jif(b[i]{
temp=b[i];
b[i]=b[j];
b[j]=temp;
}
printf("\nEnter the Number of processes: ");
scanf("%d",&m);
for(i=0;i{
printf("Enter the memory space for the given process: ");
scanf("%d",&p[i]);
}
printf("Process ID\t Worst fit\n");
for(i=0;i{
printf("p%d\t\t ",i+1);
for(j=0;j{
if(p[i]<=b[j])
{
printf("%d\n",b[j]);
b[j]=-1;
break;
}
}
if(j==n)
printf("Not Enough memory\n");
}
return 0;
}

OUTPUT:
[cse6@localhost Pgm]$ cc prog12c.c -o prog12c.out
[cse6@localhost Pgm]$ ./prog12c.out
Enter the no.of allocated space: 3
Enter the allocated Memory space: 200
150
170
Enter the Number of processes: 3
Enter the memory space for the given process: 120
Enter the memory space for the given process: 160
Enter the memory space for the given process: 160
Process ID Worst fit
p1 200
p2 170
p3 Not Enough memory

Ex.No:9 DEADLOCK AVOIDANCE

AIM:

To implement the deadlock avoidance concept using banker’s algorithm.

ALGORITHM:

1.Start.
2.let work and finish to the vectors of length m,n respectively.Intialize wait->available
and finish[i]->false for i=1,2,…..n.
3. Initialize work->available find “i” such that
(i)finish[i]=false
(ii)need[i]=work
If no such “i” exists goto step5.
4.If condition is true then
Work=work allocation
Finish[i]=true,then go to5 and check the remaining values.
5.if finish[i]=true,for all “I”then system is said to be in safe state. therefore there is no
deadlock.
6.Stop.

POGRAMCODE:

#include
#include
Int compare(int need[],int work[],int numres)
{
Int i;
For(i=0;i{
If(need[i]>=work[i])

{
Return 0;
}
Return 1;
}
}
Main()
{
Int numproc,numers,i,j,k;
Int allocation[6][6],max[6][6],available[6][6],need[6][6],finish[6];
Int work[6];
Clrscr();
Printf(:\n bankers algorithm \n”);
Printf(“enter the number of process: ”);
Scanf(“%d”,&numproc);
Printf (“enter the number of resource :”);
Scanf(“%d”,&numres);
Printf(“\n\n enter the values:\n\n);
For(i=0;i{
Printf(“\n process %d “i++);
Printf(“\n enter the values for allocation:”);
For(j=0;jScanf(“%d”,&allocation[i][j]);
Printf(“\n enter the values for max:”);
For(j=0;jScanf(“%d”,&max[i][j]);
For(j=0;jNeed[i][j]=max[i][j]-allocation[i][j];
}
Printf(“\n the need matrix is\n”);
For(i=0;i{
Printf(“\n p%d\t”,i+1);
For(j=0;jPrintf(“%d\t”,need[i][j]);
}
Printf(“\n enter the values for available:”);
For(i=0;i{
Scanf(“%d”,&available[0][i]);
Work[i]=available[0][i];
}
Printf (“\n order of finishing\n”);
For (i=0; i{
For (j=0; j{
If((finish[j]==0)&&(compare(need[j],work,numers)==1))
{
For(k=0;kWork[k]=work[k]+allocation[j][k];
For(k=0;kAvailable[j][k]=work[k];
Printf(“\n p%d\t”,j+1);
Finish[j]=1;
}
}
}

Printf(“\n the available matrix is\n”);
For(i=0;i{
Printf(“\n p%d\t”,i+1);
For(j=0;j{
printff(“%d\t”,available[i][j]);
}
}
i-0;
For(k=0;k{
If(finish[k]==1
{
Printf(“\n\n process %d has finished \n”,k+1);
}
Else
{
Printf(“\n\n deadlock at process %d!!\n”,k+1);
}
}
Printf(“the system is in safe state:no deadlock:”);
Getch();
}

OUTPUT:
Bankers algorithm
Enter the number of process:5
Enter the number of resource :3
Enter the values:
Process 1
Enter the values for allocation:0
1
0
Enter the values for max:7
5
3
Process 2
Enter the allocation:2
0
0
Enter the values for max:3
2
2
Process 3
Enter the values for allocation:3
0
2
Enter the values for max:9
0
2
Process 4
Enter the allocation:2
1
1
Enter the values for max:2
2
2
Process 5
Enter the allocation:0
0
2
Enter the values for max:4
3
3
The need matrix is
P1 7 4 3
P2 1 2 2
P3 6 0 0
P4 0 1 1
P5 4 3 1
Enter the values for allocation:3
3
2
Ordering of finishing:
P2
P4
P5
P3
P1
The available matrix is:
P1 10 5 7
P2 5 3 2
P3 10 4 7
P4 7 4 3
P5 7 4 5

Process 1 has finished
Process 2 has finished
Process 3 has finished
Process 4 has finished
Process 5 has finished
The system is in safe state. No deadlock.

CA1004-DATA WAREHOUSING AND MINING

2009-08-06T03:39:00.000-07:00

DEPARTMENT OF INFORMATION TECHNOLOGY

TWO MARKS QUESTIONS
Unit I

1.Define Data mining.
It refers to extracting or “mining” knowledge from large amount of data. Data
mining is a process of discovering interesting knowledge from large amounts of data
stored either, in database, data warehouse, or other information repositories

2.Give some alternative terms for data mining.
Knowledge mining
Knowledge extraction
Data/pattern analysis.
Data Archaeology
Data dredging

3.What are the steps involved in KDD process.
Data cleaning
Data Mining
Pattern Evaluation
Knowledge Presentation
Data Integration
Data Selection
Data Transformation

4.What is the use of the knowledge base?
Knowledge base is domain knowledge that is used to guide search or evaluate the
interestingness of resulting pattern. Such knowledge can include concept hierarchies used
to organize attribute /attribute values in to different levels of abstraction.
Data Mining

7.Mention some of the data mining techniques.
Statistics
 Machine learning
 Decision Tree
 Hidden markov models
 Artificial Intelligence
Genetic Algorithm
Meta learning

8.Give few statistical techniques.
Point Estimation
 Data Summarization
Bayesian Techniques
 Testing Hypothesis
 Correlation
 Regression
9.What is meta learning.

Concept of combining the predictions made from multiple models of data
mining and analyzing those predictions to formulate a new and previously unknown
prediction.
Graphical User Interface
Pattern Evaluation
Database or Data warehouse
server
DB DW

10.Define Genetic algorithm.

Search algorithm.
 Enables us to locate optimal binary string by processing an initial
random population of binary strings by performing operations such as
artificial mutation , crossover and selection.

11.What is the purpose of Data mining Technique?
It provides a way to use various data mining tasks.

12.Define Predictive model.
It is used to predict the values of data by making use of known results from a different set of sample data.
13.Data mining tasks that are belongs to predictive model
Classification
 Regression
 Time series analysis

14.Define descriptive model
 It is used to determine the patterns and relationships in a sample data. Data mining tasks that belongs to descriptive model:
 Clustering
 Summarization
 Association rules
Sequence discovery

15. Define the term summarization

The summarization of a large chunk of data contained in a web page or a
document.
Summarization = caharcterization=generalization

16. List out the advanced database systems.
 Extended-relational databases
 Object-oriented databases
 Deductive databases
 Spatial databases
 Temporal databases
 Multimedia databases
 Active databases
 Scientific databases
 Knowledge databases

17. Define cluster analysis
Cluster analyses data objects without consulting a known class label. The class
labels are not present in the training data simply because they are not known to begin
with.

18.Classifications of Data mining systems.
Based on the kinds of databases mined:
According to model
Relational mining system
Transactional mining system
Object-oriented mining system
Object-Relational mining system
Data warehouse mining system
Types of Data
Spatial data mining system
Time series data mining system
Text data mining system
Multimedia data mining system
Based on kinds of Knowledge mined
According to functionalities
Characterization
Discrimination
Association
Classification
Clustering
Outlier analysis
Evolution analysis
According to levels of abstraction of the knowledge mined
Generalized knowledge (High level of abstraction)
Primitive-level knowledge (Raw data level)
According to mine data regularities versus mine data irregularities
Based on kinds of techniques utilized
According to user interaction
Autonomous systems
Interactive exploratory system
Query-driven systems
According to methods of data analysis
Database-oriented
Data warehouse-oriented
Machine learning
Statistics
Visualization
Pattern recognition
Neural networks
Based on applications adopted
Finance
Telecommunication
DNA
Stock markets
E-mail and so on

19.Describe challenges to data mining regarding data mining methodology and user
interaction issues.
Mining different kinds of knowledge in databases
Interactive mining of knowledge at multiple levels of abstraction
Incorporation of background knowledge
Data mining query languages and ad hoc data mining
Presentation and visualization of data mining results
Handling noisy or incomplete data
Pattern evaluation

20.Describe challenges to data mining regarding performance issues.

Efficiency and scalability of data mining algorithms
Parallel, distributed, and incremental mining algorithms

21.Describe issues relating to the diversity of database types.

Handling of relational and complex types of data
Mining information from heterogeneous databases and global information
systems
22.What is meant by pattern?

Pattern represents knowledge if it is easily understood by humans; valid on test
data with some degree of certainty; and potentially useful, novel,or validates a hunch
about which the used was curious. Measures of pattern interestingness, either objective or
subjective, can be used to guide the discovery process.

23.How is a data warehouse different from a database?

Data warehouse is a repository of multiple heterogeneous data sources, organized
under a unified schema at a single site in order to facilitate management decision-making.
Database consists of a collection of interrelated data.

UNIT II

1. Define Association Rule Mining.
Association rule mining searches for interesting relationships among items in
a given data set

2. When we can say the association rules are interesting?
Association rules are considered interesting if they satisfy both a minimum
support threshold and a minimum confidence threshold. Users or domain experts
can set such thresholds.

3. Explain Association rule in mathematical notations.
Let I-{i1,i2,…..,im} be a set of items
Let D, the task relevant data be a set of database transaction T is a set of
items
An association rule is an implication of the form A=>B where A C I, B C I,
and An B=. The rule A=>B contains in the transaction set D with support s,
where s is the percentage of transactions in D that contain AUB. The Rule A=> B
has confidence c in the transaction set D if c is the percentage of transactions in D
containing A that also contain B.

4. Define support and confidence in Association rule mining.
Support S is the percentage of transactions in D that contain AUB.
Confidence c is the percentage of transactions in D containing A that also contain
B.
Support ( A=>B)= P(AUB)
Confidence (A=>B)=P(B/A)

5. How are association rules mined from large databases?
I step: Find all frequent item sets:
II step: Generate strong association rules from frequent item sets
6. Describe the different classifications of Association rule mining.
Based on types of values handled in the Rule
i. Boolean association rule
ii. Quantitative association rule
Based on the dimensions of data involved
i. Single dimensional association rule
ii. Multidimensional association rule
Based on the levels of abstraction involved
i. Multilevel association rule
ii. Single level association rule
Based on various extensions
i. Correlation analysis
ii. Mining max patterns

7. What is the purpose of Apriori Algorithm?
Apriori algorithm is an influential algorithm for mining frequent item sets for
Boolean association rules. The name of the algorithm is based on the fact that the
algorithm uses prior knowledge of frequent item set properties.

8. Define anti-monotone property.
If a set cannot pass a test, all of its supersets will fail the same test as well.

9. How to generate association rules from frequent item sets?
Association rules can be generated as follows
For each frequent item set1, generate all non empty subsets of 1.
For every non empty subsets s of 1, output the rule “S=>(1-s)”if
Support count(1)
=min_conf,
Support_count(s)
Where min_conf is the minimum confidence threshold.

10. Give few techniques to improve the efficiency of Apriori algorithm.
Hash based technique
Transaction Reduction
Portioning
Sampling
Dynamic item counting

11. What are the things suffering the performance of Apriori candidate
generation technique.

Need to generate a huge number of candidate sets
Need to repeatedly scan the scan the database and check a large set of
candidates by pattern matching

12. Describe the method of generating frequent item sets without candidate
generation.
Frequent-pattern growth(or FP Growth) adopts divide-and-conquer
strategy.
Steps:
Compress the database representing frequent items into a frequent pattern tree
or FP tree
Divide the compressed database into a set of conditional database
Mine each conditional database separately

13. Define Iceberg query.
It computes an aggregate function over an attribute or set of attributes in
order to find aggregate values above some specified threshold.
Given relation R with attributes a1,a2,…..,an and b, and an aggregate function,
agg_f, an iceberg query is the form
Select R.a1,R.a2,…..R.an,agg_f(R,b)
From relation R
Group by R.a1,R.a2,….,R.an
Having agg_f(R.b)>=threshold

14. Mention few approaches to mining Multilevel Association Rules
Uniform minimum support for all levels(or uniform support)
Using reduced minimum support at lower levels(or reduced support)
Level-by-level independent
Level-cross filtering by single item
Level-cross filtering by k-item set

15. What are multidimensional association rules?
Association rules that involve two or more dimensions or predicates
Interdimension association rule: Multidimensional association rule with no
repeated predicate or dimension
Hybrid-dimension association rule: Multidimensional association rule with
multiple occurrences of some predicates or dimensions.

16. Define constraint-Based Association Mining.
Mining is performed under the guidance of various kinds of constraints
provided by the user.
The constraints include the following
Knowledge type constraints
Data constraints
Dimension/level constraints
Interestingness constraints
Rule constraints.
17. Define the concept of classification.
Two step process
A model is built describing a predefined set of data classes or concepts.
The model is constructed by analyzing database tuples described by
attributes.
The model is used for classification.

18. What is Decision tree?
A decision tree is a flow chart like tree structures, where each internal
node denotes a test on an attribute, each branch represents an outcome of the test,
and leaf nodes represent classes or class distributions. The top most in a tree is the
root node.

19. What is Attribute Selection Measure?
The information Gain measure is used to select the test attribute at each node
in the decision tree. Such a measure is referred to as an attribute selection measure
or a measure of the goodness of split.

20. Describe Tree pruning methods.
When a decision tree is built, many of the branches will reflect anomalies in
the training data due to noise or outlier. Tree pruning methods address this
problem of over fitting the data.
Approaches:
Pre pruning
Post pruning

21. Define Pre Pruning
A tree is pruned by halting its construction early. Upon halting, the node
becomes a leaf. The leaf may hold the most frequent class among the subset
samples.

22. Define Post Pruning.
Post pruning removes branches from a “Fully grown” tree. A tree node is
pruned by removing its branches.
Eg: Cost Complexity Algorithm

23. What is meant by Pattern?
Pattern represents the knowledge.

24. Define the concept of prediction.
Prediction can be viewed as the construction and use of a model to assess the
class of an unlabeled sample or to assess the value or value ranges of an attribute
that a given sample is likely to have.

Unit III

1.Define Clustering?
Clustering is a process of grouping the physical or conceptual data object into
clusters.

2. What do you mean by Cluster Analysis?
A cluster analysis is the process of analyzing the various clusters to organize the
different objects into meaningful and descriptive objects.

3. What are the fields in which clustering techniques are used?
Clustering is used in biology to develop new plants and animal
taxonomies.
Clustering is used in business to enable marketers to develop new
distinct groups of their customers and characterize the customer group on basis
of purchasing.
Clustering is used in the identification of groups of automobiles
Insurance policy customer.
Clustering is used in the identification of groups of house in a city on
the basis of house type, their cost and geographical location.
Clustering is used to classify the document on the web for information
discovery.

4.What are the requirements of cluster analysis?
The basic requirements of cluster analysis are
Dealing with different types of attributes.
Dealing with noisy data.
Constraints on clustering.
Dealing with arbitrary shapes.
High dimensionality
Ordering of input data
Interpretability and usability
Determining input parameter and
Scalability

5.What are the different types of data used for cluster analysis?
The different types of data used for cluster analysis are interval scaled, binary,
nominal, ordinal and ratio scaled data.

6. What are interval scaled variables?
Interval scaled variables are continuous measurements of linear scale.
For example, height and weight, weather temperature or coordinates for any cluster.
These measurements can be calculated using Euclidean distance or Minkowski distance.

7. Define Binary variables? And what are the two types of binary variables?
Binary variables are understood by two states 0 and 1, when state is 0, variable is
absent and when state is 1, variable is present. There are two types of binary variables,
symmetric and asymmetric binary variables. Symmetric variables are those variables that
have same state values and weights. Asymmetric variables are those variables that have
not same state values and weights.

8. Define nominal, ordinal and ratio scaled variables?
A nominal variable is a generalization of the binary variable. Nominal variable
has more than two states, For example, a nominal variable, color consists of four states,
red, green, yellow, or black. In Nominal variables the total number of states is N and it is
denoted by letters, symbols or integers.
An ordinal variable also has more than two states but all these states are ordered
in a meaningful sequence.
A ratio scaled variable makes positive measurements on a non-linear scale, such
as exponential scale, using the formula
AeBt or Ae-Bt
Where A and B are constants.

9. What do u mean by partitioning method?
In partitioning method a partitioning algorithm arranges all the objects into
various partitions, where the total number of partitions is less than the total number of
objects. Here each partition represents a cluster. The two types of partitioning method are
k-means and k-medoids.

10. Define CLARA and CLARANS?
Clustering in LARge Applications is called as CLARA. The efficiency of
CLARA depends upon the size of the representative data set. CLARA does not work
properly if any representative data set from the selected representative data sets does not
find best k-medoids.
To recover this drawback a new algorithm, Clustering Large Applications based
upon RANdomized search (CLARANS) is introduced. The CLARANS works like
CLARA, the only difference between CLARA and CLARANS is the clustering process
that is done after selecting the representative data sets.

11. What is Hierarchical method?
Hierarchical method groups all the objects into a tree of clusters that are arranged
in a hierarchical order. This method works on bottom-up or top-down approaches.

12. Differentiate Agglomerative and Divisive Hierarchical Clustering?
Agglomerative Hierarchical clustering method works on the bottom-up approach.
In Agglomerative hierarchical method, each object creates its own clusters. The single
Clusters are merged to make larger clusters and the process of merging continues until all
the singular clusters are merged into one big cluster that consists of all the objects.
Divisive Hierarchical clustering method works on the top-down approach. In this
method all the objects are arranged within a big singular cluster and the large cluster is
continuously divided into smaller clusters until each cluster has a single object.

13. What is CURE?
Clustering Using Representatives is called as CURE. The clustering algorithms
generally work on spherical and similar size clusters. CURE overcomes the problem of
spherical and similar size cluster and is more robust with respect to outliers.

14. Define Chameleon method?
Chameleon is another hierarchical clustering method that uses dynamic modeling.
Chameleon is introduced to recover the drawbacks of CURE method. In this method two
clusters are merged, if the interconnectivity between two clusters is greater than the
interconnectivity between the objects within a cluster.

15. Define Density based method?
Density based method deals with arbitrary shaped clusters. In density-based
method, clusters are formed on the basis of the region where the density of the objects is
high.

16. What is a DBSCAN?
Density Based Spatial Clustering of Application Noise is called as DBSCAN.
DBSCAN is a density based clustering method that converts the high-density objects
regions into clusters with arbitrary shapes and sizes. DBSCAN defines the cluster as a
maximal set of density connected points.

17. What do you mean by Grid Based Method?
In this method objects are represented by the multi resolution grid data structure.
All the objects are quantized into a finite number of cells and the collection of cells build
the grid structure of objects. The clustering operations are performed on that grid
structure. This method is widely used because its processing time is very fast and that is
independent of number of objects.

18. What is a STING?
Statistical Information Grid is called as STING; it is a grid based multi resolution
clustering method. In STING method, all the objects are contained into rectangular cells,
these cells are kept into various levels of resolutions and these levels are arranged in a
hierarchical structure.

19. Define Wave Cluster?
It is a grid based multi resolution clustering method. In this method all the objects
are represented by a multidimensional grid structure and a wavelet transformation is
applied for finding the dense region. Each grid cell contains the information of the group
of objects that map into a cell. A wavelet transformation is a process of signaling that
produces the signal of various frequency sub bands.

20. What is Model based method?
For optimizing a fit between a given data set and a mathematical model based
methods are used. This method uses an assumption that the data are distributed by
probability distributions. There are two basic approaches in this method that are
1. Statistical Approach
2. Neural Network Approach.

21. What is the use of Regression?
Regression can be used to solve the classification problems but it can also be used
for applications such as forecasting. Regression can be performed using many different
types of techniques; in actually regression takes a set of data and fits the data to a
formula.

22. What are the reasons for not using the linear regression model to estimate the output data?
There are many reasons for that, One is that the data do not fit a linear model, It is
possible however that the data generally do actually represent a linear model, but the
linear model generated is poor because noise or outliers exist in the data.
Noise is erroneous data and outliers are data values that are exceptions to the usual and
expected data.

23. What are the two approaches used by regression to perform classification?
Regression can be used to perform classification using the following approaches
1. Division: The data are divided into regions based on class.
2. Prediction: Formulas are generated to predict the output class value.

24. What do u mean by logistic regression?
Instead of fitting a data into a straight line logistic regression uses a logistic curve.
The formula for the univariate logistic curve is
P= e (C0+C1X1)
1+e (C0+C1X1)
The logistic curve gives a value between 0 and 1 so it can be interpreted as the
probability of class membership.

25. What is Time Series Analysis?
A time series is a set of attribute values over a period of time. Time Series
Analysis may be viewed as finding patterns in the data and predicting future values.

26. What are the various detected patterns?
Detected patterns may include:
•Trends : It may be viewed as systematic non-repetitive changes to the values over
time.
•Cycles : The observed behavior is cyclic.
•Seasonal : The detected patterns may be based on time of year or month or day.
•Outliers : To assist in pattern detection , techniques may be needed to remove or
reduce the impact of outliers.
27. What is Smoothing?
Smoothing is an approach that is used to remove the nonsystematic behaviors
found in time series. It usually takes the form of finding moving averages of attribute
values. It is used to filter out noise and outliers.

28. Give the formula for Pearson’s r
One standard formula to measure correlation is the correlation coefficient r,
sometimes called Pearson’s r. Given two time series, X and Y with means X’ and Y’,
each with n elements, the formula for r is
(xi – X’) (yi – Y’)
((xi – X’)2 (yi – Y’)2)1/2

29. What is Auto regression?
Auto regression is a method of predicting a future time series value by looking at
previous values. Given a time series X = (x1,x2,….xn) a future value, x n+1, can be found
using
x n+1 = + nx n + n-1x n-1 +……+ n+1
Here n+1 represents a random error, at time n+1.In addition, each element in the time
series can be viewed as a combination of a random error and a linear combination of
previous values.

UNIT-IV

1.Define data warehouse?
A data warehouse is a repository of multiple heterogeneous data sources
organized under a unified schema at a single site to facilitate management decision
making .
(or)
A data warehouse is a subject-oriented, time-variant and nonvolatile
collection of data in support of management’s decision-making process.

2.What are operational databases?
Organizations maintain large database that are updated by daily transactions are
called operational databases.

3.Define OLTP?
If an on-line operational database systems is used for efficient retrieval, efficient
storage and management of large amounts of data, then the system is said to be on-line
transaction processing.

4.Define OLAP?
Data warehouse systems serves users (or) knowledge workers in the role of data
analysis and decision-making. Such systems can organize and present data in various
formats. These systems are known as on-line analytical processing systems.

5.How a database design is represented in OLTP systems?
Entity-relation model

6. How a database design is represented in OLAP systems?
Star schema
Snowflake schema
Fact constellation schema

7.Write short notes on multidimensional data model?
Data warehouses and OLTP tools are based on a multidimensional data model.
This model is used for the design of corporate data warehouses and department data
marts. This model contains a Star schema, Snowflake schema and Fact constellation
schemas. The core of the multidimensional model is the data cube.

8.Define data cube?
It consists of a large set of facts (or) measures and a number of dimensions.

9.What are facts?
Facts are numerical measures. Facts can also be considered as quantities by which
we can analyze the relationship between dimensions.

10.What are dimensions?
Dimensions are the entities (or) perspectives with respect to an organization for
keeping records and are hierarchical in nature.

11.Define dimension table?
A dimension table is used for describing the dimension.
(e.g.) A dimension table for item may contain the attributes item_ name, brand and type.

12.Define fact table?
Fact table contains the name of facts (or) measures as well as keys to each of the related dimensional tables.

13.What are lattice of cuboids?
In data warehousing research literature, a cube can also be called as cuboids. For
different (or) set of dimensions, we can construct a lattice of cuboids, each showing the
data at different level. The lattice of cuboids is also referred to as data cube.

14.What is apex cuboid?
The 0-D cuboid which holds the highest level of summarization is called the apex
cuboid. The apex cuboid is typically denoted by all.

15.List out the components of star schema?
_ A large central table (fact table) containing the bulk of data with no
redundancy.
_ A set of smaller attendant tables (dimension tables), one for each
dimension.

16.What is snowflake schema?
The snowflake schema is a variant of the star schema model, where some
dimension tables are normalized thereby further splitting the tables in to additional tables.

17.List out the components of fact constellation schema?
This requires multiple fact tables to share dimension tables. This kind of schema
can be viewed as a collection of stars and hence it is known as galaxy schema (or) fact
constellation schema.

18.Point out the major difference between the star schema and the snowflake
schema?
The dimension table of the snowflake schema model may be kept in normalized
form to reduce redundancies. Such a table is easy to maintain and saves storage space.

19.Which is popular in the data warehouse design, star schema model (or)
snowflake schema model?
Star schema model, because the snowflake structure can reduce the effectiveness
and more joins will be needed to execute a query.

20.Define concept hierarchy?
A concept hierarchy defines a sequence of mappings from a set of low-level
concepts to higher-level concepts.

21.Define total order?
If the attributes of a dimension which forms a concept hierarchy such as
“streetCountry
Province or state
City
Street
Fig: Partial order for location

22.Define partial order?
If the attributes of a dimension which forms a lattice such as
“day<{month
23.Define schema hierarchy?
A concept hierarchy that is a total (or) partial order among attributes in a database
schema is called a schema hierarchy.

24.List out the OLAP operations in multidimensional data model?
_ Roll-up
_ Drill-down
_ Slice and dice
_ Pivot (or) rotate

25.What is roll-up operation?
The roll-up operation is also called drill-up operation which performs aggregation
on a data cube either by climbing up a concept hierarchy for a dimension (or) by
dimension reduction.

26.What is drill-down operation?
Drill-down is the reverse of roll-up operation. It navigates from less detailed data
to more detailed data. Drill-down operation can be taken place by stepping down a
concept hierarchy for a dimension.

27.What is slice operation?
The slice operation performs a selection on one dimension of the cube resulting in a sub cube.

28.What is dice operation?
The dice operation defines a sub cube by performing a selection on two (or) more dimensions.

29.What is pivot operation?
This is a visualization operation that rotates the data axes in an alternative
presentation of the data.

30.List out the views in the design of a data warehouse?
_ Top-down view
_ Data source view
_ Data warehouse view
_ Business query view

31.What are the methods for developing large software systems?
_ Waterfall method
_ Spiral method

32.How the operation is performed in waterfall method?
The waterfall method performs a structured and systematic analysis at each step
before proceeding to the next, which is like a waterfall falling from one step to the next.

33.How the operation is performed in spiral method?
The spiral method involves the rapid generation of increasingly functional
systems, with short intervals between successive releases. This is considered as a good
choice for the data warehouse development especially for data marts, because the turn
around time is short, modifications can be done quickly and new designs and
technologies can be adapted in a timely manner.

34.List out the steps of the data warehouse design process?
_ Choose a business process to model.
_ Choose the grain of the business process
_ Choose the dimensions that will apply to each fact table record.
_ Choose the measures that will populate each fact table record.

35.Define ROLAP?
The ROLAP model is an extended relational DBMS that maps operations on
multidimensional data to standard relational operations.

36.Define MOLAP?
The MOLAP model is a special purpose server that directly implements
multidimensional data and operations.

37.Define HOLAP?
The hybrid OLAP approach combines ROLAP and MOLAP technology,
benefiting from the greater scalability of ROLAP and the faster computation of
MOLAP,(i.e.) a HOLAP server may allow large volumes of detail data to be stored in a
relational database, while aggregations are kept in a separate MOLAP store.

38.What is enterprise warehouse?
An enterprise warehouse collects all the information’s about subjects spanning the
entire organization. It provides corporate-wide data integration, usually from one (or)
more operational systems (or) external information providers. It contains detailed data as
well as summarized data and can range in size from a few giga bytes to hundreds of giga
bytes, tera bytes (or) beyond. An enterprise data warehouse may be implemented on
traditional mainframes, UNIX super servers (or) parallel architecture platforms. It
requires business modeling and may take years to design and build.

39.What is data mart?
Data mart is a database that contains a subset of data present in a data warehouse.
Data marts are created to structure the data in a data warehouse according to issues such
as hardware platforms and access control strategies. We can divide a data warehouse into
data marts after the data warehouse has been created. Data marts are usually implemented
on low-cost departmental servers that are UNIX (or) windows/NT based. The
implementation cycle of the data mart is likely to be measured in weeks rather than
months (or) years.

40.What are dependent and independent data marts?
Dependent data marts are sourced directly from enterprise data warehouses.
Independent data marts are data captured from one (or) more operational systems (or)
external information providers (or) data generated locally with in particular department
(or) geographic area.

41.What is virtual warehouse?
A virtual warehouse is a set of views over operational databases. For efficient
query processing, only some of the possible summary views may be materialized. A
virtual warehouse is easy to build but requires excess capability on operational database
servers.

42.Define indexing?
Indexing is a technique, which is used for efficient data retrieval (or) accessing
data in a faster manner. When a table grows in volume, the indexes also increase in size
requiring more storage.
43.What are the types of indexing?
_ B-Tree indexing
_ Bit map indexing
_ Join indexing

44.Define metadata?
Metadata is used in data warehouse is used for describing data about data.
(i.e.) meta data are the data that define warehouse objects. Metadata are created for the
data names and definitions of the given warehouse.

45.Define VLDB?
Very Large Data Base. If a database whose size is greater than 100GB, then
the database is said to be very large database.

UNIT – V

1.What are the classifications of tools for data mining?
Commercial Tools
Public domain Tools
Research prototypes

2.What are commercial tools?
Commercial tools can be defined as the following products and usually are
associated with the consulting activity by the same company:
1. ‘Intelligent Miner’ from IBM
2. ‘SAS’ System from SAS Institute
3. ‘Thought’ from Right Information Systems. Etc

3. What are Public domain Tools?
Public domain Tools are largely freeware with just registration fees:
’Brute’ from University of Washington. ‘MC++’ from Stanford university, Stanford,
California.

4. What are Research prototypes?
Some of the research products may find their way into commercial
market: ‘DB Miner’ from Simon Fraser University, British Columbia, ‘Mining Kernel
System’ from University of Ulster, North Ireland.

5.What is the difference between generic single-task tools and generic multi-task
tools?
Generic single-task tools generally use neural networks or decision trees.
They cover only the data mining part and require extensive pre-processing and postprocessing
steps.
Generic multi-task tools offer modules for pre-processing and postprocessing
steps and also offer a broad selection of several popular data mining
algorithms as clustering.

6. What are the areas in which data warehouses are used in present and in future?
The potential subject areas in which data ware houses may be developed at
present and also in future are
1.Census data:
The registrar general and census commissioner of India decennially
compiles information of all individuals, villages, population groups, etc. This information
is wide ranging such as the individual slip. A compilation of information of individual
households, of which a database of 5%sample is maintained for analysis. A data
warehouse can be built from this database upon which OLAP techniques can be applied,
Data mining also can be performed for analysis and knowledge discovery

2.Prices of Essential Commodities
The ministry of food and civil supplies, Government of India complies
daily data for about 300 observation centers in the entire country on the prices of
essential commodities such as rice, edible oil etc, A data warehouse can be built
for this data and OLAP techniques can be applied for its analysis

7. What are the other areas for Data warehousing and data mining?
Agriculture
Rural development
Health
Planning
Education
Commerce and Trade

8. Specify some of the sectors in which data warehousing and data mining are used?
Tourism
Program Implementation
Revenue
Economic Affairs
Audit and Accounts

9. Describe the use of DBMiner.
Used to perform data mining functions, including characterization,
association, classification, prediction and clustering.

10. Applications of DBMiner.
The DBMiner system can be used as a general-purpose online analytical
mining system for both OLAP and data mining in relational database and
datawarehouses.
Used in medium to large relational databases with fast response time.

11. Give some data mining tools.
DBMiner
GeoMiner
Multimedia miner
WeblogMiner

12. Mention some of the application areas of data mining
DNA analysis
Financial data analysis
Retail Industry
Telecommunication industry
Market analysis
Banking industry
Health care analysis.

13. Differentiate data query and knowledge query
A data query finds concrete data stored in a database and corresponds to a
basic retrieval statement in a database system.
A knowledge query finds rules, patterns and other kinds of knowledge in a
database and corresponds to querying database knowledge including
deduction rules, integrity constraints, generalized rules, frequent patterns and
other regularities.

14.Differentiate direct query answering and intelligent query answering.
Direct query answering means that a query answers by returning exactly what
is being asked.
Intelligent query answering consists of analyzing the intent of query and
providing generalized, neighborhood, or associated information relevant to the
query.

15. Define visual data mining
Discovers implicit and useful knowledge from large data sets using data and/
or knowledge visualization techniques.
Integration of data visualization and data mining.

16. What does audio data mining mean?
Uses audio signals to indicate patterns of data or the features of data mining
results.
Patterns are transformed into sound and music.
To identify interesting or unusual patterns by listening pitches, rhythms, tune
and melody.
Steps involved in DNA analysis
Semantic integration of heterogeneous, distributed genome databases
Similarity search and comparison among DNA sequences
Association analysis: Identification of co-occuring gene sequences
Path analysis: Linking genes to different stages of disease development
Visualization tools and genetic data analysis

17.What are the factors involved while choosing data mining system?
Data types
System issues
Data sources
Data Mining functions and methodologies
Coupling data mining with database and/or data warehouse systems
Scalability
Visualization tools
Data mining query language and graphical user interface.

18. Define DMQL
Data Mining Query Language
It specifies clauses and syntaxes for performing different types of data mining
tasks for example data classification, data clustering and mining association
rules. Also it uses SQl-like syntaxes to mine databases.

19. Define text mining
Extraction of meaningful information from large amounts free format textual
data.
Useful in Artificial intelligence and pattern matching
Also known as text mining, knowledge discovery from text, or content
analysis.

20. What does web mining mean
Technique to process information available on web and search for useful data.
To discover web pages, text documents , multimedia files, images, and other
types of resources from web.
Used in several fields such as E-commerce, information filtering, fraud
detection and education and research.

21.Define spatial data mining.
Extracting undiscovered and implied spatial information.
Spatial data: Data that is associated with a location
Used in several fields such as geography, geology, medical imaging etc.

22. Explain multimedia data mining.
Mines large data bases.
Does not retrieve any specific information from multimedia databases
Derive new relationships , trends, and patterns from stored multimedia data
mining.
Used in medical diagnosis, stock markets ,Animation industry, Airline
industry, Traffic management systems, Surveillance systems etc.

16 MARKS QUESTIONS

UNIT-I

1. Explain the evolution of Database technology?
_ Data collection and Database creation
_ Database management systems
_ Advanced database systems
_ Data warehousing and Data Mining
_ Web-based Database systems
_ New generation of Integrated information systems

2.Explain the steps of knowledge discovery in databases?
_ Data cleaning
_ Data integration
_ Data selection
_ Data transformation
_ Data mining
_ Pattern evaluation
_ Knowledge presentation

3. Explain the architecture of data mining system?
_ Database, datawarehouse, or other information repository
_ Database or data warehouse server
_ Knowledge base
_ Data mining engine
_ Pattern evaluation module
_ Graphical user interface

4.Explain various tasks in data mining?
(Or)
Explain the taxonomy of data mining tasks?
_ Predictive modeling
Classification
Regression
Time series analysis
_ Descriptive modeling
Clustering
Summarization
Association rules
Sequence discovery

5.Explain various techniques in data mining?
_ Statistics (or) Statistical perspectives
_ Point estimation
Data summarization
Bayesian techniques
Hypothesis testing
Correlation
_ Regression
_ Machine learning
_ Decision trees
_ Hidden markov models
_ Artificial neural networks
_ Genetic algorithms
_ Meta learning

UNIT-II

6.Explain the issues regarding classification and prediction?
_ Preparing the data for classification and prediction
o Data cleaning
o Relevance analysis
o Data transformation
_ Comparing classification methods
o Predictive accuracy
o Speed
o Robustness
o Scalability
o Interpretability

7.Explain classification by Decision tree induction?
_ Decision tree induction
_ Attribute selection measure.
_ Tree pruning
_ Extracting classification rules from decision trees

8.Write short notes on patterns?
_ Pattern definition
_ Objective measures
_ Subjective measures
_ Can a data mining system generate all of the interesting
patterns?
_ Can a data mining system generate only interesting
patterns?
9.Explain mining single –dimensional Boolean associated rules from transactional
databases?
_ The apriori algorithm: Finding frequent itemsets using
candidate generation
_ Mining frequent item sets without candidate generation

10.Explain apriori algorithm?
_ Apriori property
_ Join steps
_ Prune step
_ Example
_ Algorithm

11.Explain how the efficiency of apriori is improved?
_ Hash-based technique (hashing item set counts)
_ Transaction reduction (reducing the number of transactions
scanned in future iteration)
_ Partitioning (Partitioning the data to find candidate item sets)
_ Sampling (mining on a subset of the given data)
_ Dynamic item set counting (adding candidate item sets at
different points during a scan)

12.Explain frequent item set without candidate without candidate generation?
_ Frequent patterns growth (or) FP-growth
_ Frequent pattern tree (or) FP-tree
_ Algorithm

13. Explain mining Multi-dimensional Boolean association rules from transaction
databases?
_ Multi-dimensional (or) Multilevel association rules
_ Approaches to mining Multilevel association rules
Using uniform minimum support for all levels
Using reduced minimum support at lower levels
o Level-by-level independent
o Level-cross filtering by single
o Level- cross filtering by k-item set
_ Checking for redundant Multilevel association rules

14.Explain constraint-based association mining?
_ Knowledge type constraints
_ Data constraints
_ Dimension/level constraints
_ Interestingness constraints
_ Rule constraints
_ Metarule-Guided mining of association of
association rules
_ Mining guided by additional rule constraints

Unit –III

15.Explain regression in predictive modeling?
_ Regression definition
_ Linear regression
_ Multiple regression
_ Non-linear regression
_ Other regression models
16.Explain statistical perspective in data mining?
_ Point estimation
_ Data summarization
_ Bayesian techniques
_ Hypothesis testing
_ Regression
_ Correlation
17. Explain Bayesian classification.
_ Bayesian theorem
_ Naïve Bayesian classification
_ Bayesian belief networks
_ Bayesian learning
18. Discuss the requirements of clustering in data mining.
_ Scalability
_ Ability to deal with different types of attributes
_ Discovery of clusters with arbitrary shape
_ Minimal requirements for domain knowledge to determine
input parameters
_ Ability to deal with noisy data
_ Insensitivity to the order of input records
_ High dimensionality
_ Interpretability and usability
_ Interval scaled variables
_ Binary variables
o Symmetric binary variables
o Asymmetric binary variables
_ Nominal variables
_ Ordinal variables
_ Ratio-scaled variables
20. Explain the partitioning method of clustering.
K-means clustering
K-medoids clustering
21. Explain Visualization in data mining.
Various forms of visualizing the discovered patterns
_ Rules
_ Table
_ Crosstab
_ Pie chart
_ Bar chart
_ Decision tree
_ Data cube
_ Histogram
_ Quantile plots
_ q-q plots
_ Scatter plots
_ Loess curves

UNIT IV

22. Discuss the components of data warehouse.
_ Subject-oriented
_ Integrated
_ Time-Variant
_ Non-volatile
23. List out the differences between OLTP and OLAP.
_ Users and system orientation
_ Data contents
_ Database design
_ View
_ Access patterns
24.Discuss the various schematic representations in multidimensional model.
_ Star schema
_ Snow flake schema
_ Fact constellation schema
25. Explain the OLAP operations I multidimensional model.
_ Roll-up
_ Drill-down
_ Slice and dice
_ Pivot or rotate
26. Explain the design and construction of a data warehouse.
_ Design of a data warehouse
Top-down view
Data source view
Data warehouse view
Business query view
_ Process of data warehouse design
27.Expalin the three-tier data warehouse architecture.
_ Warehouse database server(Bottom tier)
_ OLAP server(middle tier)
_ Client(top tier)
28. Explain indexing.
_ Definition
_ B-Tree indexing
_ Bit-map indexing
_ Join indexing
29.Write notes on metadata repository.
_ Definition
_ Structure of the data warehouse
_ Operational metadata
_ Algorithms used for summarization
_ Mapping from operational environment to data warehouse
_ Data related to system performance
_ Business metadata
30. Write short notes on VLDB.
_ Definition
_ Challenge related to database technologies
_ Issues in VLDB

UNIT V

31.Explain data mining applications for Biomedical and DNA data analysis.
_ Semantic integration of heterogeneous, distributed genome databases
_ Similarity search and comparison among DNA sequences
_ Association analysis.
_ Path analysis
_ Visualization tools and genetic data analysis.
32. Explain data mining applications fro financial data analysis.
_ Loan payment prediction and customer credit policy analysis.
_ Classification and clustering of customers fro targeted marketing.
_ Detection of money laundering and other financial crimes.
33. Explain data mining applications for retail industry.
_ Multidimensional analysis of sales, customers, products, time and region.
_ Analysis of the effectiveness of sales campaigns.
_ Customer retention-analysis of customer loyalty.
_ Purchase recommendation and cross-reference of items.
34. Explain data mining applications for Telecommunication industry.
_ Multidimensional analysis of telecommunication data.
_ Fraudulent pattern analysis and the identification of unusual patterns.
_ Multidimensional association and sequential pattern analysis
_ Use of visualization tools in telecommunication data analysis.
35. Explain DBMiner tool in data mining.
_ System architecture
_ Input and Output
_ Data mining tasks supported by the system
_ Support of task and method selection
_ Support of the KDD process
_ Main applications
_ Current status
36. Explain how data mining is used in health care analysis.
_ Health care data mining and its aims
_ Health care data mining technique
_ Segmenting patients into groups
_ Identifying patients into groups
_ Identifying patients with recurring health problems
_ Relation between disease and symptoms
_ Curbing the treatment costs
_ Predicting medical diagnosis
_ Medical research
_ Hospital administration
_ Applications of data mining in health care
_ Conclusion
37. Explain how data mining is used in banking industry.
_ Data collected by data mining in banking
_ Banking data mining tools
_ Mining customer data of bank
_ Mining for prediction and forecasting
_ Mining for fraud detection
_ Mining for cross selling bank services
_ Mining for identifying customer preferences
_ Applications of data mining in banking
_ Conclusion
38. Explain the types of data mining.
_ Audio data mining
_ Video data mining
_ Image data mining
_ Scientific and statistical data mining

Model exam questions:

2009-04-09T02:35:00.000-07:00

Visual Programming

Part A Questions

1. Explain in brief the windows MSG structure

2. List the styles for a push button child window control.

3. state the use of windows message and event handler.

4. Give the resource script file for a modal dialog box.

5. State some message and selection flags meant for a menu resource.

6. explain in brief the MFC serialization mechanism.

7. what is an Activex control

8. define OLE

9. state the MFC classes used for ODBC Database Programming

10. state the techniques used for playing audio files

Part B Questions

1.Explain in detail the GDI objects (1) Device Context (2) Brush (3) Pen

2. Write a Win32 program to draw different shapes using different colors and fill styles.

3. Explain the windows message map architecture in detail with a sample program

4. Describe in detail the microsoft foundation classes relating to user interfaces.

5. Explain the CListBox class and its member function in detail with an example program

6. State the use and explain the common dialog control in detail

7. Explain how modal and modeless dialog boxes.

8. Write notes on the rich edit control in detail

9. Explain how reading and writing is done in a SDI Document

10. What is DLL? Explain its types and advantages in detail. Write a program to create a user defined DLL

11. Develop an application to create a simple Active X control using MFC.

12. explain the Ole drag and drop mechanism in detail.

13. explain the multithreading concept in VC++.

14. Explain the use of WinInet API

15. develop a database application for maintaining student details

ERP MODEL QUESTION PAPER

2009-04-06T21:54:00.000-07:00

B.E./B.Tech.DEGREE EXAMINATION,APRIL/MAY 2008.

Eighth Semester

Information Technology

IT 1006 - ENTERPRISE RESOURCE PLANNING

(Regulation 2004)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A-(10x2=20 marks)

1. what are the benefits of OLAP?

2. What are the different phases of BPR?

3. List the functions of CRM.

4. What are the obstacles for implementing ERP systems?

5. What are the different modules of the ERP systems?

6. Explain Quality Control Modules and its function.

7. Explain the role and responsibilities of ERP vendors.

8. What are the major subsystems of plant maintenance module?

9. Define EAI.What are the uses of EAI?

10.What are the growth factors of E-Commerce?

PART B-(5x16=80 marks)

11. (a) Discuss why data warehouses are important and how they can be

integrated with ERP system? [16 marks]

Or

(b) Briefly explain the linkage between BRP,IT and ERP in detail. [16 marks]

12. (a) What are the golden rules for successful Project Management?

Explain in detail. [16 marks]

or

(b) (i) Explain the details of the contract with the package vendor. [8 marks]

(ii) Explain the details of the contract with the package consultants. [8 marks]

13. (a) Discuss each ERP implementation phases and briefly explain the

activities to be performed in each phase. [16 marks]

or

(b) Draw a diagram to describe ERP marketing process and including ERP

scales cycle. [16 marks]

14. (a) Draw the layered architecture of Sap R/3. Explain the different types of

Client server models which can be implemented in SAP?. [16 marks]

or

(b) Compare and contrast the ERP package Baan and IFS Avalon with

respect to functionality and preformance. [16 marks]

15. (a) How to improve the power of ERP using business intelligence?

Explain in detail [16 marks]

or

(b) Explain the importance of the integration of ERP with Internet

and WWW. [16 marks]

QUESTION BANK(FINAL YEAR)

2009-03-30T03:20:00.001-07:00

IT1006- Enterprise Resource Planning

Two marks questions

1. Define ERP?

2. What is the advantages of ERP?

3. What are the benefits of OLAP?

4. What are the different phases of BPR?

5. What is business module?

6. What is EFT & EDI?

7. What is data warehousing & Data mining?

8. List the phases of ERP?

9. What are the components of Data ware housing?

10. What are the advantages of data ware housing?

11. What is Meta data management?

12. List out the functions of CRM?

13. What are the obstacles of implementing ERP system?

14. What is gap analysis?

15. What are the four phases of ERP implementation?

16. Difference between vendors, consultants and users?

17. What are the major sub systems of manufacturing model?

18. What is quality management?

19. What is component tracking?

20. What is calibration tracking in plant maintenance?

21. Explain quality control module and its function?

22. Explain the role and responsibilities of ERP vendors?

23. Define EAI and uses of EAI?

24. Write some functions of R/3 system?

25. What is dynamic implementation management?

26. What are the modules of R/3 system/

27. What are the benefits of SAP?

28. What are the solution of people soft’s business management?

29. What is supply chain?

30. Write some difference business units in industry solution/

31. What is baan consulting?

32. What is QAP?
33. What is MFG/PRO/
34. What are the growth factors of E-Commerce?
35. What are the limitations of ERP system?
36. What are the two flavors of EIA?

Unit I:

1. Discuss why data ware house are important and how they can be integrated with ERP system?

2. Briefly explain the linkage BPR,IT & ERP in detail?

3. Explain difference phases of BPR?

4. Explain overview of ERP and BPR?

Unit II:

1. Golden rules for successful project management?

2. Details of contract with the package vendors?

4. Explain in detail about the contract with package consultants?

5. Write short notes on vendors, consultants and users?

Unit III:

1. ERP implementation phases and activities performed in each phase?

2. Diagram to describe ERP marketing process and including ERP sales cycle?

3. Explain the business modules in ERP package?

4. Explain in detail about HR?

5. Explain in detail about sales and distribution?

Unit IV:
1. Explain the layered architecture of SAP R/3.different types of client server models which can be implemented in SAP?
2. Explain in detail about Oracle Corporation?
3. Compare & contrast ERP package BAAN and IFS Avalon with respect to functionality and performance?

Unit V:

1. How to improve the power of ERP using business intelligence?
2. Implementation of integration of ERP with internet and WWW?\
3. Explain in detail about EIA?