Online Information System Web Based Application

Online Information System of Khalid Associates” is a web based application, which is proposed to develop to coordinate and continue projects along with proper business and dealing with clients and provide information about the domain of the organization to the online users. So, basically Khalid Associates Online Information System will focus on the image of Khalid Associates (Pvt.). It is so cumbersome for the users to submit CV personally/online, Point out their comments online in discussion forum, Search company’s employees, stocks and other information related to company, so this project is proposed for the benefits of the users who have facility of Internet so that they can submit their CVs online. Users can be able to see the current job announcements. It also provides the discussion forums about different topics for the company members. It provides latest news about the company and products. All the important contents of the system will change dynamically.
This system provides two types of Common Graphical Interfaces (CGIs) for the Administrator, and the Online Users and employees respectively. Administrator is responsible for all the insertion, deletion, modifying and managing the database.

Download 
Share:

Online School System Project

It is a system which shows & helps you to collect most of the information about school services. This site is made by using APACHE Server which provides packages of multiple services including PHP & MYSQL.
It can be use by the public to view the list of students available and make admission of students, results and exam details. This system will help you to find the result & admission forms and details, also helps to check examination details and attendance record etc.
Online school system is a web database application that is constructed with HTML web pages.PHP programming & Apache web Server Database accessing so that people can make online interaction easily without going outside home.
In the recent years, like organizations, schools main purpose to provide the facility to the user to take advantage by the means of checking online results, taking online admissions and providing their services to users in a very easiest way.
For providing information and user oriented services to their users now organization/schools should put services on the internet to facilitate students and users. In this project we will try to learn how a typical record can be moved from manual system to the computerized system.
Download 
Share:

Wireless mobile WIMAX Project

WiMAX, meaning Worldwide Interoperability for Microwave Access, is a telecommunications technology that provides for the wireless transmission of data using a variety of transmission modes, from point-to-point links to full mobile cellular-type access. The technology provides up to 70 Mb/sec symmetric broadband speed without the need for cables. The technology is based on the IEEE 802.16 standard (also called Wireless MAN). The name "WiMAX" was created by the WiMAX Forum, which was formed in June 2001 to promote conformity and interoperability of the standard. The forum describes WiMAX as "a standards-based technology enabling the delivery of last mile wireless broadband access as an alternative to cable and DSL"[1] (and also to High Speed Packet Access)
ABSTRACT
Our project based on Mobile WiMAX secure Authentication and Authorization of MS from ASN. Our work can be divided into three main entities: Mobile station, ASN and CSN. When we entered into the Mobile WiMAX network then after scanning the frequencies Mobile station synchronize the up link frequency and then obtain CID of the BTS. Then Mobile Station send authentication and authorization request to the ASN. In ASN there is AAA proxy client which route the subscriber request to AAA server in CSN. In AAA server validate the user by checking subscriber’s digital certificate (X.509) with the help of policy function database. If the user is authenticated then it will be generated an encrypted master key by evaluating the crypto system followed by the MS. Then update the subscriber’s profile and then send to the AAA client then AAA client create a service flow authorization and then send ACK to Mobile Station. Then MS decrypt the encrypted master key with its private key.
Download
Share:

Mitigation of Ionospheric Scintillation Error in GPS

The tool is being created to produce certain graphs which help in understanding the scintillation in GPS communication.
The parameters being used are taken from the software by IEEA i.e. GISM v 5.1.GISM is a sole property of IEEA The output files produced by GISM are in tabular form and are created for every local time division. First we have to edit scintillation synthesis file, & remove all headers from it.
Name the edited file “syn.txt” and place it in the default directory.Now run the main.fig.
Click the buttons to generate appropriate graphs accordingly.
Download
Share:

Search Engine With Intelligent Web Spider

Search Engine is a tool designed to search information on the World Wide Web. The search results are usually presented in a list and are commonly called hits.The information may consist of web pages, images, information and other types of files. Some search engines also mine data available in databases or open directories. Unlike Web directories, which are maintained by human editors, search engines operate algorithmically or a mixture of algorithmic and human input.
1  Functional Requirements:
    The Functional Requirements of a Search Engine consists of the following four blocks:
A Web Crawler or Spider that follows HTML links in Web pages to gather documents.
An Indexer that indexes the documents crawled using some indexing rules and saves the indexed results for searching.
An Query Engine that performs the actual search and returns ranked results.
An Interface that allows users to interact with the query engine.
2. Project Scope:
This software project will cover the two major areas:

1  Database population ( with Spider/Crawler)

2  Web to search from database.

The responsibility of first module will be to move like a spider from one site to other, and to find the keywords of each webpage. These keywords will be found by separating them from a list of words like a, an, the, that, is, are, etc. And then the keywords will be stemmed out, by using Stemming Algorithm. Means the Management will be converted into Manage, Meetings into Meet and Cats into Cat etc. And these stemmed words will be stored in the database. While searching from site to site, this software will consider the privileges set for users on current site, means it will also examine the robots.txt (i.e. A file usually placed on restricted domains, and this file describes the privileges to use the content of that site), this software will also do the cycle handling while moving from site to site and will also counts number of times a certain web site is cited, means it will also do the statistical analysis. And on the basis of these analyzed statistics, the system will manage found keywords into manageable clusters/categories.
Second module will be web based and the responsibility of this module will be to search from the database maintained by the first module. It will search by taking value/input from user. And before search from database, this input will be stemmed by using the same Stemming algorithm of first module.

3  Significance of the project:

This project will be able to be used for these tasks:

1  To test for Bad links of web-pages in a site,Means if some one uploads his/her site having large number of pages, then it’s a headache for him/her to check the correctness of hierarchy of site. And this software will make ease for him/her to test the correctness of hierarchy and links by providing visual structure/view.
It can also help to test good (i.e. valid and having some target-page) or bad (i.e. invalid or without target-page) links in a web page.

2  To search for copyright violations.

   By using this spider, we will quickly map out all of the pages/links contained on a web site. Means if a site is pointing/linking to the content of some other copyrighted information/files, then this violation will be caught by watching the structure of that site. For example, we can check any site if it tries to point/link to the *.mp3 files placed at http://www.apnaymp3.com/ illegally.

There can be many other tasks, where this type of projects can be used.

4. Proposed methodology

Basically we will study different methodologies for this project and select the best one which gives best results. But at starting phase we will study and apply the following techniques/algorithms:

1  Stemming Algorithm to extract keywords from web pages.

2  Object oriented technique for development.

3  Making good indexing of fields in database, for fast searching.

During the project if any other algorithm other than that satisfies project requirements and our faculty supervisor then we’ll use that also. But the consideration will be made on the basis of its affects.

 

Download
Share:

C++ Programs and Algorithms

C++ is an object-oriented programming (OOP) language it was developed in 1980 at Bell Laboratories.it is an important version of c language it provides the facility of working with objects and classes, it is a powerful language, Java, is based on C++ but optimized for the distribution of program objects in a network such as the Internet. Java is somewhat simpler and easier to learn than C++ and has characteristics that give it other advantages over C++. However, both languages require a considerable amount of study.

Download C++ Programe in Below folders
Share:

DC Motor Using Matlab Project

DC motor is a basically a simple electric motor  uses both electric field as well as magnetic field to produce a torque that can run a motor. This conversion of energy is utilized for the generation of electricity. project “ DC Motor Using MATLAB Project ” designs a DC motor that is armature controlled. Hence here the armature coil is responsible of the magnitude of the current produced.
principle  operation used in motor is electromagnetism.  This force generated is proportional to the current flowing in the conductor and also on the strength of the external magnetic field.
This project the speed of  DC motor is controlled by the armature. There are many other methods that can be used to control the speed of the DC motor. There’s the voltage control method in which changes in voltage are made to control the speed of the motor. In the flux control method, the speed is controlled by making changes in the flux. Another method is rheostatic control in which the rheostat variations control the speed.
Click Here To Download Modeling of Armature Controlled DC Motor Using MATLAB Project Report 
 
Share:

Travel Agency Website using ASP.Net & SQL Server

The main aim of the Travel Agency Website using ASP.Net & SQL Server final year Computer Science & Engineering Student project was to develop a travelling related website for a popular Travel Agency. The Travel Agency company requires a online website that reach customers easily. The online web application website has to satisfy all types of customer needs without wasting time. This  Travel website was developed by ASP.Net & SQL Server database.
Click Here To Download Travel Agency Website using ASP.Net & SQL Server Project Report & Paper Presentation.
Share:

Robotic ARM Mechanical Robotics Projects

The project “ROBOTIC ARM Mechanical Robotics Projects” is used in place of a human hand to perform a set of functions. This robotic arm is programmable in nature and can be manipulated. The robotic arm is also referred to as anthropomorphic as it is very similar to that of a human hand. In the existing systems, humans do most of the tasks involved in the manufacturing processes. However by using a robotic arm, welding, drilling and thermal spraying etc can be achieved.In this project Robotic Arm, the necessary components of the structure like ICs, blocks and power supply are all assembled together on the PCB. The mechanical part of the robotic arm is designed using PVC pipes. This project’s proposed idea is to create real kits that can be used for demo purpose.
The main part of this project’s design is an AT89C51 micro controller which coordinates and controls the product’s actions. This micro controller is a high performance CMOS 8-bit microcomputer and has a flash memory of 4 kilobytes. It consumes low power and is erasable read only memory (PEROM). This specific micro controller in various types of embedded applications and is cost viable option.  An entire robot can be also made by utilizing the concept proposed her.
 Click Here To Download ROBOTIC ARM Mechanical Robotics Projects
Share:

AutoCad Mechanical Project

Air-conditioning and Air-conditioning System Design AutoCad Mechanical Project.
The goal of the Air-conditioning and Air-conditioning System Design AutoCad Mechanical Project is to design system of air-condition for building. The air conditioning system is designed to monitor the indoor environment such as temperature, relative humidity, air movement etc. in an economical method with Auto-CAD MEP.
 Heating ventilating and air-conditioning HVAC is to make the mechanical services which are consist of fire protection, plumbing, and escalators. Air-conditioning is the method of heating, cooling, ventilation, or disinfection which changes the air condition. The aim of an HVAC system offers an environment with energy of qualities like cost effective, efficient, healthy and comfortable indoor environment with indoor air quality.
 The conditioning system is based on two systems. They are central systems and decentralized systems. The difference among central and decentralized systems is critical based on architecture view.
 Generally, the conditioning systems are classified into four methods. They are all-air system, all-water system, air-water system, and unitary refrigerant based system. The HVAC system acts like thermal zones with major components present out of the zone. The central air conditioning systems includes three major parts. They are an air system, water system, and central plant.
The decentralized system acts like a single thermal zone with components present inside the zone. It is divided into individual systems and unitary systems. 
Click Here To Download Air-conditioning and Air-conditioning System Design AutoCad Mechanical Project

Share:

Binary search Tree C++

Binary search tree with all the three recursive and non recursive traversals
/*Binary search tree with all the Recursive and non Recursive 
traversals*/
/* By:- Aniket P. Kadu :- S.e computer :- M.E.S.C.O.E */

#include
#include
#include

class binarynode
{
 public:
   int data;
   binarynode *left;
   binarynode *right;
};

class binsrctree
{
 private:
   binarynode *root;
   void inorder_rec(binarynode *);
   void inorder_non_rec(binarynode *);
   void preorder_rec(binarynode *);
   void preorder_non_rec(binarynode *);
   void postorder_rec(binarynode *);
   void postorder_non_rec(binarynode *);
 public:
   binsrctree()
   {
    root=NULL;
   }
   void insert(int );
   void print_inorder_rec();
   void print_inorder_non_rec();
   void print_preorder_rec();
   void print_preorder_non_rec();
   void print_postorder_rec();
   void print_postorder_non_rec();
};

class stack
{
 int top;
 binarynode *stackel[20];
  public:
   stack()
   {
    top=-1;
   }
  void push(binarynode *);
  binarynode* pop();
  int empty()
  {
   if(top==-1)
   return(1);

   return(0);
  }
};

void stack::push(binarynode *node)
{
 stackel[++top]=node;
}

binarynode *stack::pop()
{
 return(stackel[top--]);
}

class stack_int
{
 int top;
 int stack_int[20];
  public:
   stack_int()
   {
    top=-1;
   }
  void push(int flag);
  int pop();
  int empty_int()
  {
   if(top==-1)
   return(1);

   return(0);
  }
};

void stack_int::push(int flag)
{
 stack_int[++top]=flag;
}

int stack_int::pop()
{
 return(stack_int[top--]);
}
/*---------------------------------------------------------------------*/
/* fUNCTION TO INSERT A NODE IN THE TREE */
/*---------------------------------------------------------------------*/
void binsrctree::insert(int val)
{
 binarynode *temp,*prev,*curr;
 temp=new binarynode;
 temp->data=val;
 temp->left=temp->right=NULL;

 if(root==NULL)
 {
  root=temp;
 }
 else
 {
   curr=root;
   while(curr!=NULL)
   {
    prev=curr;
    if(temp->datadata)
       curr=curr->left;
    else
       curr=curr->right;
   }
   if(temp->datadata)
      prev->left=temp;
   else
      prev->right=temp;
  }
}

/* ------------------------------------------------*/
/*INORDER RECURSIVE TRAVERSAL*/
/*-------------------------------------------------*/

void binsrctree::inorder_rec(binarynode *root)
{
  if(root!=NULL)
  {
   inorder_rec(root->left);
   cout<data<<"	";
   inorder_rec(root->right);
  }
}

/*--------------------------------------------------*/
/*INORDER NON RECURSIVE TRAVERSAL*/
/*--------------------------------------------------*/

void binsrctree::inorder_non_rec(binarynode *root)
{
 stack stk;
 binarynode *temp;
 if(root!=NULL)
 {
  temp=root;
  do
  {
   while(temp!=NULL)
   {
      stk.push(temp);
      temp=temp->left;
   }/*end while*/
   if(!stk.empty())
   {
      temp=stk.pop();
      cout<data<<"	";
      temp=temp->right;
   }/*end if*/
   else
    break;
  }while(1); /*end do while*/
 }/* end if */
 else
  cout<<"
Empty tree";

} /*end function */

/*--------------------------------------------------*/
/*PREORDER RECURSIVE TRAVERSAL */
/*---------------------------------------------------*/
void binsrctree::preorder_rec(binarynode *root)
{
 if(root!=NULL)
 {
   cout<data<<"	";
   preorder_rec(root->left);
   preorder_rec(root->right);
 }
}

/*--------------------------------------------------*/
/*PREORDER NON RECURSIVE TRAVERSAL */
/*---------------------------------------------------*/

void binsrctree::preorder_non_rec(binarynode *root)
{
 stack stk;
 binarynode *temp=root;

 stk.push(temp);

 while(!stk.empty())
 {
  temp=stk.pop();
  if(temp!=NULL)
  {
   cout<data<<"	";
   stk.push(temp->right);
   stk.push(temp->left);
  }
 }

}

/*--------------------------------------------------*/
/*POSTRDER RECURSIVE TRAVERSAL */
/*---------------------------------------------------*/

void binsrctree::postorder_rec(binarynode *root)
{
 if(root!=NULL)
 {
  postorder_rec(root->left);
  postorder_rec(root->right);
  cout<data<<"	";
 }
}

/*--------------------------------------------------*/
/*POSTORDER NON RECURSIVE TRAVERSAL */
/*---------------------------------------------------*/

void binsrctree::postorder_non_rec(binarynode *root)
{
 stack stk;
 stack_int stk1;
 int flag;
 binarynode *temp=root;

 do
 {
  if(temp!=NULL)
  {
   stk.push(temp);
   stk1.push(1);
   temp=temp->left;
  }
  else
  {
   if(stk.empty())
     break;
   temp=stk.pop();
   flag=stk1.pop();
     if(flag==2)
     {
      cout<data;
      temp=NULL;
     } /*end if */
     else
     {
      stk.push(temp);
      stk1.push(2);
      temp=temp->right;
     } /* end else */
  } /* end if */
 }while(1);/*end do while*/
}/*end function*/

/*--------------------------------------------------*/
/*FUNCTION TO PRINT INORDER RECURSIVE TRAVERSAL */
/*----------------------------------n_rec()
{
 cout<<"
";
 postorder_non_rec(root);
 cout<<"
";
}

/*--------------------------------------------------*/
/* MAIN FUNCTION */
/*---------------------------------------------------*/

void main()
{
 binsrctree BST;
 int ch,element;
 clrscr();

 do
 {
  cout<<"
1.Insert a node in binary tree";
  cout<<"
2.Recursive Inorder traversal";
  cout<<"
3.Non Recursive Inorder traversal";
  cout<<"
4.Recursive preorder traversal";
  cout<<"
5.Non recursive preorder traversal";
  cout<<"
6.Recursive postorder traversal";
  cout<<"
7.Non recursive postorder traversal";
  cout<<"
8.Exit";
  cout<<"
Enter your choice";
  cin>>ch;

  switch(ch)
  {
   case 1:
    cout<<"
Enter the element you wnat to insert";
    cin>>element;
    BST.insert(element);
    break;
   case 2:
    cout<<"
Recursive Inorder traversal
";
    BST.print_inorder_rec();
    break;
   case 3:
    cout<<"
NonRecursive Inorder traversal
";
    BST.print_inorder_non_rec();
    break;
   case 4:
    cout<<"
Recursive preorder traversal
";
    BST.print_preorder_rec();
    break;
   case 5:
    cout<<"
Non recursive preorder traversal
";
    BST.print_preorder_non_rec();
    break;
   case 6:
    cout<<"
Recursive postorder traversal";
    BST.print_postorder_rec();
    break;
   case 7:
    cout<<"
Non recursive postorder traversal
";
    BST.print_postorder_non_rec();
    break;
   case 8:
    exit(1);

  }
 }while(ch<8);
}

//not include below line on program//
Share:

Data Structures Scripts and C++ Code

/* Adelson Velseky Landis Tree */

# include 
# include 
# include 

struct node
{
   int element;
   node *left;
   node *right;
   int height;
};

typedef struct node *nodeptr;

class bstree
{

   public:
	void insert(int,nodeptr &);
	void del(int, nodeptr &);
	int deletemin(nodeptr &);
	void find(int,nodeptr &);
	nodeptr findmin(nodeptr);
	nodeptr findmax(nodeptr);
	void copy(nodeptr &,nodeptr &);
	void makeempty(nodeptr &);
	nodeptr nodecopy(nodeptr &);
	void preorder(nodeptr);
	void inorder(nodeptr);
	void postorder(nodeptr);
	int bsheight(nodeptr);
	nodeptr srl(nodeptr &);
	nodeptr drl(nodeptr &);
	nodeptr srr(nodeptr &);
	nodeptr drr(nodeptr &);
	int max(int,int);
	int nonodes(nodeptr);
};

//		Inserting a node
void bstree::insert(int x,nodeptr &p)
{
   if (p == NULL)
   {
	p = new node;
	p->element = x;
	p->left=NULL;
	p->right = NULL;
	p->height=0;
	if (p==NULL)
		cout<<"Out of Space";
   }
   else
   {
	if (xelement)
	{
	   insert(x,p->left);
	   if ((bsheight(p->left) - bsheight(p->right))==2)
	   {
	      if (x < p->left->element)
		p=srl(p);
	      else
		p = drl(p);
	   }
	}
	else if (x>p->element)
	{
	      insert(x,p->right);
	      if ((bsheight(p->right) - bsheight(p->left))==2)
	      {
		if (x > p->right->element)
			p=srr(p);
		else
			p = drr(p);
	     }
	}
	else
		cout<<"Element Exists";
	}
	int m,n,d;
	m=bsheight(p->left);
	n=bsheight(p->right);
	d=max(m,n);
	p->height = d + 1;

}

//		Finding the Smallest
nodeptr bstree::findmin(nodeptr p)
{
	if (p==NULL)
	{
	    cout<<"
Empty Tree
";
	    return p;
	}
	else
	{
	   while(p->left !=NULL)
		p=p->left;
	   return p;
	}
}

//		Finding the Largest
nodeptr bstree::findmax(nodeptr p)
{
	if (p==NULL)
	{
	   cout<<"
Empty Tree
";
	   return p;
	}
	else
	{
	   while(p->right !=NULL)
	       p=p->right;
	   return p;
	}
}

//		Finding an element
void bstree::find(int x,nodeptr &p)
{
	if (p==NULL)
	   cout<<"
Element not found
";
	else
	if (x < p->element)
	   find(x,p->left);
	else
	if (x>p->element)
	   find(x,p->right);
	else
	   cout<<"
Element found !
";

}

//		Copy a tree
void bstree::copy(nodeptr &p,nodeptr &p1)
{
	makeempty(p1);
	p1 = nodecopy(p);
}

//		Make a tree empty
void bstree::makeempty(nodeptr &p)
{
	nodeptr d;
	if (p != NULL)
	{
	   makeempty(p->left);
	   makeempty(p->right);
	   d=p;
	   free(d);
	   p=NULL;
	}
}

//		Copy the nodes
nodeptr bstree::nodecopy(nodeptr &p)
{
	nodeptr temp;
	if (p==NULL)
	   return p;
	else
	{
	   temp = new node;
	   temp->element = p->element;
	   temp->left = nodecopy(p->left);
	   temp->right = nodecopy(p->right);
	   return temp;
	}
}

//		Deleting a node
void bstree::del(int x,nodeptr &p)
{
	nodeptr d;
	if (p==NULL)
	   cout<<"Element not found 
";
	else if ( x < p->element)
	   del(x,p->left);
	else if (x > p->element)
	   del(x,p->right);
	else if ((p->left == NULL) && (p->right == NULL))
	{
	   d=p;
	   free(d);
	   p=NULL;
	   cout<<"
 Element deleted !
";
	}
	else if (p->left == NULL)
	{
	  d=p;
	  free(d);
	  p=p->right;
	  cout<<"
 Element deleted !
";
	}
	else if (p->right == NULL)
	{
	  d=p;
	  p=p->left;
	  free(d);
	  cout<<"
 Element deleted !
";
	}
	else
	  p->element = deletemin(p->right);
}

int bstree::deletemin(nodeptr &p)
{
	int c;
	cout<<"inside deltemin 
";
	if (p->left == NULL)
	{
	  c=p->element;
	  p=p->right;
	  return c;
	}
	else
	{
	  c=deletemin(p->left);
	  return c;
	}
}

void bstree::preorder(nodeptr p)
{
	if (p!=NULL)
	{
	  cout<element<<"-->";
	  preorder(p->left);
	  preorder(p->right);
	}
}

//		Inorder Printing
void bstree::inorder(nodeptr p)
{
	if (p!=NULL)
	{
	   inorder(p->left);
	   cout<element<<"-->";
	   inorder(p->right);
        }
}

//		PostOrder Printing
void bstree::postorder(nodeptr p)
{
        if (p!=NULL)
        {
	   postorder(p->left);
	   postorder(p->right);
	   cout<element<<"-->";
	}
}

int bstree::max(int value1, int value2)
{
	return ((value1 > value2) ? value1 : value2);
}

int bstree::bsheight(nodeptr p)
{
	int t;
	if (p == NULL)
		return -1;
	else
	{
		t = p->height;
		return t;
	}
}

nodeptr bstree:: srl(nodeptr &p1)
{
	nodeptr p2;
	p2 = p1->left;
	p1->left = p2->right;
	p2->right = p1;
	p1->height = max(bsheight(p1->left),bsheight(p1->right)) + 1;
	p2->height = max(bsheight(p2->left),p1->height) + 1;
	return p2;
}

nodeptr bstree:: srr(nodeptr &p1)
{
	nodeptr p2;
	p2 = p1->right;
	p1->right = p2->left;
	p2->left = p1;
	p1->height = max(bsheight(p1->left),bsheight(p1->right)) + 1;
	p2->height = max(p1->height,bsheight(p2->right)) + 1;
	return p2;
}


nodeptr bstree:: drl(nodeptr &p1)
{
	p1->left=srr(p1->left);
	return srl(p1);
}

nodeptr bstree::drr(nodeptr &p1)
{
	p1->right = srl(p1->right);
	return srr(p1);
}

int bstree::nonodes(nodeptr p)
{
	int count=0;
	if (p!=NULL)
	{
		nonodes(p->left);
		nonodes(p->right);
		count++;
	}
	return count;

}



int main()
{
	clrscr();
	nodeptr root,root1,min,max;//,flag;
	int a,choice,findele,delele,leftele,rightele,flag;
	char ch='y';
	bstree bst;
	//system("clear");
	root = NULL;
	root1=NULL;
	cout<<"
		AVL Tree
";
	cout<<"		========
";
	do
	{
		cout<<"
		1.Insertion
		2.FindMin
		";
		cout<<"3.FindMax
		4.Find
		5.Copy
		";
		cout<<"6.Delete
		7.Preorder
		8.Inorder
";
		cout<<"		9.Postorder
		10.height
";
		cout<<"
Enter the choice:
";
		cin>>choice;
		switch(choice)
		{
		case 1:
			cout<<"
New node's value ?
";
			cin>>a;
			bst.insert(a,root);
			break;
		case 2:
			if (root !=NULL)
			{
			min=bst.findmin(root);
			cout<<"
Min element :	"<element;
			}
			break;
		 case 3:
                        if (root !=NULL)
                        {
			max=bst.findmax(root);
			cout<<"
Max element :	"<element;
			}
			break;
		case 4:
			cout<<"
Search node : 
";
			cin>>findele;
			if (root != NULL)
				bst.find(findele,root);
			break;
		case 5:
			bst.copy(root,root1);
			bst.inorder(root1);
			break;
		case 6:
			cout<<"Delete Node ?
";
			cin>>delele;
			bst.del(delele,root);
			bst.inorder(root);
			break;

		case 7:
			cout<<"
 Preorder Printing... :
";
			bst.preorder(root);
			break;

		case 8:
                       cout<<"
 Inorder Printing.... :
";
                        bst.inorder(root);
                        break;

		case 9:
                        cout<<"
 Postorder Printing... :
";
                        bst.postorder(root);
                        break;
		case 10:
			cout<<"
 Height and Depth is 
";
			cout<>ch;
	}while(ch=='y');


	return 0;
}
/////// Not include below line on program///////
Share:

Student Projects Presentation Assignments

Project Download Last Year, Previous Year, Final Year Semester project files for MCA (Master of Computer Application), BCA (Bachelor of Computer Application), BSc. (Bachelor of Science), BE (Bachelor of Engineer), BTech (Bachelor of Technologies), BSC-CS (Bachelor of Computer Science), BSC-IT (Bachelor of Science in Information Technology), DIT (Diploma In Information Technology), BCom IS (Bachelor of Commerce in Information System), PGDCA (Post Graduate Diploma in Computer Application), MSc. CS (Master of Science in Computer Science), MCom IS (Master of Commerce in Information System), MBA IT ( Master of Business Administration Information Technology), BIT, ADIT,  ME, MTech, MBA IT/System, Diploma, Polytechnic Engineering , Computer Science...

A Study of Tea Plantation Operational Aspects in Relation to Operational Workforce .
The  following  is  a  dissertation  by  Niranjan  Wickremasinghe  which  he  submitted  in  January  2008  as  a  project  report  in  partial  fulfillment  of  the  requirements  for  his  Master  of  Business  Administration  degree  from  Sikkim  Manipal  University  in  India.  Niranjan  had  a  brief  tea  planting  career  from  1993  to  1998  and  is  now  the  Managing Director  of  Medicheks  Colombo  (Pvt)  Ltd,  which  provides  medical  investigations
for HACCP, ISO and other quality certificate purposes. We are indeed indebted to
Niranjan for submitting this work for the benefit of our readers
.  Click Here to Download File

Multiple Questions for CA ii
Multiple Questions for CA ii  Click Here to Download File

Presentation on Service tax
 HISTORICAL BACKGROUND
 APPLICABILITY
 WHO MUST OBTAIN REGISTRATION  & TIME LIMIT
 GENERAL EXEMPTION FROM SERVICE TAX (SEC.93)
 TAX IS CALCULATED ON THE VALUE
 WHO IS LIABLE FOR SERVICE  TAX?
 OTHER PROVISIONS RELATING TO SERVICE TAX
 Provisional Payment of Service tax
 Due  dates for payment of service tax
 DEFAULT & EXCESS PAYMENT OF SERVICE TAX
 When will return be filed?
 Other provisions relating to return
 Some important forms
 Penalty for late filing of return
Click Here to Download File

Electronic Commerce and the Internet
Electronic Commerce and the Internet
Click Here to Download File

 Accounting for the Growth of MNC-based Trade using a Structural Model of U.S. MNCs
U.S. foreign trade has grown much more rapidly than GDP in recent decades. But there is no consensus as to why. More than half of U.S. foreign trade consists of arms-length and intrafirm
trade activity by multinational corporations (MNCs). Thus, in order to better understand the growth of trade, it is important to understand the reasons for the rapid growth in MNC-based trade.This paper uses confidential BEA data on the activities of U.S. MNCs to shed light on this issue. Specifically, we estimate a simple structural model of the production and trade decisions of U.S. MNCs with affiliates in Canada, the largest trading partner of the U.S., using data from 1983-96.  We then use the model as a framework to decompose the growth in intrafirm and arms-length trade flows into components due to tariff reductions, changes in technology, changes in wages, and other factors.   We find that tariff reductions can account for a substantial part of the increase in armslength MNC-based trade. But our model attributes most of the growth of intra-firm trade to technical change, with tariff reductions playing only a secondary role. Simple descriptive statistics provide face validity for this result, since arms-length tradegrew much more rapidly in industries with the largest tariff reductions, while intra-firm trade grew rapidly even in industries where tariffs were negligible to begin with. 
Our work makes a number of other contributions: Our descriptive analysis of the BEA firm level data, which has rarely been made available for research, suggests that few MNCs fit into the neat vertical vs. horizontal dichotomy of the theoretical literature. Also, we find that MNC decisions to engage in intra-firm and arms-length trade are unrelated to tariff levels. The growth in MNC-based trade due to tariff reductions has been almost entirely on the intensive margin, among the subset of firms already engaged in such activities. 
Finally, the estimation of our model requires the development of a number of new econometric procedures. We present new recursive importance sampling algorithms that are the continuous and discrete/continuous analogues of the GHK method.  
Click Here to Download File

AIRTEL advertisements and their impact.
To   find out effectiveness   AIRTEL advertisements  & their impact   on   the viewers
Mobile penetration is currently exploding in India and Bharti Airtel has been riding the crest of the huge mobile industry wave that has been formed. Vast market opportunities have now opened up the playing field in Indian telecom market and also has made it much more competitive. In this type of competitive environment it will be interesting to find out how AIRTEL advertisements have helped it to retain its number 1 position. The objective of the study is to find out how the different advertisements of AIRTEL are impacting the viewers to use AIRTEL and what type of changes AIRTEL needs to make in near future to make its advertisements more efficient and effective.

Acknowledgment……………………………………………………………….2
Executive Summary………………………………………….………………...5
Introduction…………………………………………………………………….6
Literature Review………………………………………………………………8
Airtel products……………...………………………………………………....9
 Objective of Study…………………………………………………………….14
Research Methodology………………………………………………………..15
Data Analysis…………………………………………………………………16
Findings……………..………………………………………………………...27
Recommendations…………………………………………………………….28
Limitations of Study…………………………………………………………..29
Bibliography…………………………………………………………………..31
Questionnaire…………………………………………………………………32

Click Here to Download File

Research Proposal on Consumer Decision Analysis for Purchase of Fruit Drinks.
This project aims to find out the various factors influencing the consumer decision while making a purchase of a fruit drink in the age group of 19-30 in the city of Pune. Background talks about various factors that have led us to undertake this study and how and to whom this report will benefit. Objectives talks of types of data the research project will generate and how these data is relevant. A statement of value of information is also included in this section. Research approach gives a non technical description of the data collection method, measurement instrument, sample and analytical techniques.
The beverage market in India is worth 2074.67 Million INR. Though the major portion of the market is still  dominated by the carbonated soft drinks there is major shift  towards the Juice segment. There was a growth of 31.52% in the Juice segment from 2007 to 2008. As a result of this phenomenal growth, a lot of competition has entered the market. A number of new brands have flooded  the  market.  The competition  from Indian beverages  such as  Sugarcane Juice, Buttermilk, and Fresh Juices etc has also captured a sizeable share of the market.
Due to these changes in the beverage market there is a need to identify and evaluate the reasons for  the  shift  in  the  consumer purchasing  pattern.  This  study aims to  determine  the  factors influencing the consumer decision while buying fruit drinks in the age group 19-30 in the city of Pune.
I also need to study the factors that are now driving the consumer’s purchasing decision. Also, due to the increase in the competition there is a need to determine the awareness levels for the various  brands  amongst  the  consumers.  With  the  availability  of  a  number  of  channels  of distribution for the beverages in India,  I  will also try to identify the most preferred shopping channel of beverages for a consumer.
Click Here to Download File


Share:

Popular Posts

Pick project