Monday, October 1, 2012

Star Pattern in C language


#include<stdio.h>
#include<conio.h>
void main()
{
int b=2,c=1,i,p,a;
clrscr();
for(i=0;i<3;i++)
{
for(a=0;a<b;a++)
{
printf(" ");
}//for spacing
for(p=0;p<c;p++)
{
printf(" *");
}//for printing
for(a=0;a<b;a++)
{
printf(" ");
}//for spacing
for(p=0;p<c;p++)
{
printf(" *");
}//for printing
for(a=0;a<b;a++)
{
printf(" ");
}//for spacing
printf("\n");
b--;
c++;

}//outer for loop
getch();
}//eofm

Wednesday, August 29, 2012

c program to reverse a number

#include <stdio.h>
 
main()
{
   int n, reverse = 0;
 
   printf("Enter a number to reverse\n");
   scanf("%d",&n);
 
   while (n != 0)
   {
      reverse = reverse * 10;
      reverse = reverse + n%10;
      n = n/10;
   }
 
   printf("Reverse of entered number is = %d\n", reverse);
 
   return 0;
}

Decimal to binary conversion

#include <stdio.h>
 
int main()
{
  int n, c, k;
 
  printf("Enter an integer in decimal number system\n");
  scanf("%d", &n);
 
  printf("%d in binary number system is:\n", n);
 
  for (c = 31; c >= 0; c--)
  {
    k = n >> c;
 
    if (k & 1)
      printf("1");
    else
      printf("0");
  }
 
  printf("\n");
 
  return 0;
}

Palindrome number program c

Palindrome number algorithm

1. Get the number from user.
2. Reverse it.
3. Compare it with the number entered by the user.
4. If both are same then print palindrome number
5. Else print not a palindrome number.
 -----------------------------------------------------------
#include<stdio.h>
 
main()
{
   int n, reverse = 0, temp;
 
   printf("Enter a number to check if it is a palindrome or not\n");
   scanf("%d",&n);
 
   temp = n;
 
   while( temp != 0 )
   {
      reverse = reverse * 10;
      reverse = reverse + temp%10;
      temp = temp/10;
   }
 
   if ( n == reverse )
      printf("%d is a palindrome number.\n", n);
   else
      printf("%d is not a palindrome number.\n", n);
 
   return 0;
}

c program to print pattern stars

 
#include<stdio.h>
 
main()
{
   int row, c, n, temp;
 
   printf("Enter the number of rows in pyramid of stars you wish to see ");
   scanf("%d",&n);
 
   temp = n;
 
   for ( row = 1 ; row <= n ; row++ )
   {
      for ( c = 1 ; c < temp ; c++ )
         printf(" ");
 
      temp--;
 
      for ( c = 1 ; c <= 2*row - 1 ; c++ )
         printf("*");
 
      printf("\n");
   }
 
   return 0;

Code for Armstrong number in c

#include<stdio.h>
int main(){
    int num,r,sum=0,temp;

    printf("Enter a number: ");
    scanf("%d",&num);

    temp=num;
    while(num!=0)
    {
         r=num%10;
         num=num/10;
         sum=sum+(r*r*r);
    }
    if(sum==temp)
         printf("%d is an Armstrong number",temp);
    else
         printf("%d is not an Armstrong number",temp);

    return 0;
}
---------------------------------------------------------------------------------------
Sample output:
Enter a number: 153
153 is an Armstrong number

Pascal triangle in c

   1
  1 1
 1 2 1
1 3 3 1 
---------------------------------------------------------------------
 
#include<stdio.h>
 
long factorial(int);
 
main()
{
   int i, n, c;
 
   printf("Enter the number of rows you wish to see in pascal
   triangle\n");
   scanf("%d",&n);
 
   for ( i = 0 ; i < n ; i++ )
   {
      for ( c = 0 ; c <= ( n - i - 2 ) ; c++ )
         printf(" ");
 
      for( c = 0 ; c <= i ; c++ )
         printf("%ld ",factorial(i)/(factorial(c)*factorial(i-c)));
 
      printf("\n");
   }
 
   return 0;
}
 
long factorial(int n)
{
   int c;
   long result = 1;
 
   for( c = 1 ; c <= n ; c++ )
         result = result*c;
 
   return ( result );
}

Thursday, July 26, 2012

Hash table demo (JAVA)


import  java.util.*;
import java.io.*;
class demo_hashtable
{   public static  void main(String args[]) throws IOException
    {   BufferedReader br = new BufferedReader( new InputStreamReader(System.in));
         int opt;
         String name;
         double per , maxp;
         Enumeration n;
         Hashtable HT = new Hashtable();
         do
         {  System.out.println("\n1. Add student ");
             System.out.println("2. Display students ");
             System.out.println("3. Search student ");
            System.out.println("4. Find Highest percentage ");
            System.out.println("5. Exit ");
           System.out.print("Enter your option :  ");
           opt = Integer.parseInt(br.readLine());
          switch(opt)
         {   case  1: System.out.print("Enter Name : ");
                           name = br.readLine();
                          System.out.print("Enter percentage : ");
                         per = Double.parseDouble(br.readLine());
                        HT.put(name , per);  
                         break;
           case  2:  System.out.println(HT);
                         break;
            case  3:  System.out.print("Enter Name : ");
                          name = br.readLine();
                          if(HT.containsKey(name))
                                System.out.println("Percentage : " + HT.get(name));
                          else
                              System.out.println(name + " not present in hashtable");
                          break;
            case  4:  n = HT.keys();
                          per = maxp =0.0;
                          name = "";
                       while(n.hasMoreElements())
                      { String str =(String)n.nextElement();
                            per = (Double) HT.get(str);
                            if( per > maxp)
                           {  maxp = per;
                                name = str;
                           }                        
                       }
                       System.out.println("Student : " + name +" Highest Percentage : "+maxp);
                        break;
          case  5 : System.exit(0);
                     
        default : System.out.println("Wrong Option");
       }//switch
    }while(opt != 5);
    }
}

Thursday, July 19, 2012

Search Engine Projects


When we talk about search engine, there are only few names which comes to our mind such as google,bing or yahoo.Even though, most of our searches happens to be on internet but there are other places such as hard disk, our personal mail folder or our word processor search, these searches are significant too.

There is scope for improvement in all types of search engine whether its desktop based or internet based. In this post I am providing you links of some open source search engines which can help you to understand this tool better.

OSS : An open source search engine and crawler based on best open source technologies: lucene, zkoss, tomcat, poi, tagsoup. A stable, high-performance piece of software. It is a modern search engine and a suite of high-powered full text search algorithms.

AASE(Anarchy Advantage Search Engine) is a search engine that reorders search results with base in the habits of its users. By measuring user activity on the search engine result page the search engine constantly improves the search results.

The Lemur Project develops search engines, browser toolbars, text analysis tools, and data resources that support research and development of information retrieval and text mining software, including the Indri search engine and ClueWeb09 dataset.

TSEP : A simple yet very powerful and fast PHP website search engine. TSEP is built to index your site so it can be searched later within seconds.

CLucene is a C++ port of Lucene: the high-performance, full-featured text search engine written in Java. CLucene is faster than lucene as it is written in C++.

Full text search engine - console tools and GUI frontends for users, program components and libraries for developers.

Project Ideas for TYBSc IT and TYBSc Computer Science Projects

Web-based Projects
Website for an educational consultant
Website for college admissions process
Website for an online Bookstore
Website for an online Consumer-durables supplier, with shopping cart
Website for a tourist organisation of a state/country
Website for a mobile device
Website for a college library
Website for an Investment Consultant
Website for a Tour Operator
Website for a public library, using barcode
Website for a public library, using RFID technology
Website for a restaurant which has home-delivery facility
Website for dating services
Website for matrimnoial services
Website for estate agent
Website for teaching SQL with facility for user to give a SQL command and get interactive response to his queries
Website for online ticket booking for cinema/theatre
Website for online yellow pages
Website for search/register online tutor
Website for launching new products
Website for e-friendship
Website for agricultural products distributor
Website for music library, with online purchase option
Website for fashion designer, with online purchase option
Website for multi-location pathology lab
Website for Internet Marketing Agency
Website for health services provider
Web-based Employee Management System
Web-based Employment Agency
Web-based Tendering System
Web-based system for hotel/resorts
Web-based Inventory Management System
GPRS-based Projects, e.g., location-based services
Web-based examination
Job/Resume post
Web-based Bilingual Dictionary
Automated Timetable and course management system
Multimedia Databases
Train Reservation Management System
State Bus Reservation System
Taxi fleet booking system with GPRS capability
Bloggng Site
Auction Portal

Software Applications

Some of these projects can also be done as web-based projects; these are marked with an * sign

Personal Investment Management System
Hospital Management System
College Employee Management System
Inventory Management System
* Sales Management System
* Banking Software
Payroll Management System
Software for a small/medium-sized Departmental Store
Software for a small/medium-sized Retail Store
Software for a Rental Business
Software for a Housing Society
Software for wholesaler dealing in mobile phones
* Software for Tax Advisor
* Software for Cricket Statistics Enthusiaist
* Software for an Investment Agent
* Software for a Book Publisher
* Software for Advertising Agency
* Software for a Frequent Traveller
* Software for a Research Scholar
Computerised Library (Barcode-enabled)
Computerised Library (RFID-enabled)
Intelligent Editor for a programming langugae
Medical Store Management System
* Bus Route Finder
College / School Timetable management system
Simulation of physical/chemical phenomenon
Simulating the working of a CPU
GIS-based Projects
GIS-based Community Information System
Online Examination System

Sunday, July 15, 2012

openings and scope for mca candidates in both the private as well as public sectors



There is good job opportunity and scope for mca candidates in both the private as well as public sectors . mca course is demand in foreign country also . after finishing your mca course you pursue for following jobs ,

1. Chief information officer
2. Computer system analyst
3. Computer scientists
4.Computer support service specialist
5.Software engineer
6.Software developer
7.Software publisher
8.System administrator
9.Information and system manger
10.Project leader
12.Consultant
13.Database administrator
14. Administrator
15. Testing
16. Team Leader
17. Designer
18. Technical Officer
19. Hardware
20. UNIX
21. Web Developer
22. Gaming and Animation
23. software analyst


The govt job for MCA . the govt jobs are given below-
1)BSNL
2)DRDO
3)ISRO
4)IOCL
5)RAILWAY
6)BARC
7)DEFENSE JOB
8)UPSC EXAM

Saturday, July 7, 2012

Top MCA Colleges in India


Welcome to Top MCA Colleges in India. This list of top MCA colleges in India 2012 is organized  from different  source like college news

 
- Pune University
- Jawaharlal Nehru University - New Delhi
- Hyderabad Central University
- National Institute of Technology (NIT), Trichy
- Birla Institute of Technology (BITS), Ranchi
- National Institute of Technology (NIT) - Surathkal
- PSG College of Technology - Coimbatore
- Bharathiar University -Coimbatore
- MN National Institute of Technology (NIT)-Allahabad
- Vellore Institute Of Technology-Vellore (Tamilnadu)
- Pondicherry Central University
- Banaras Hindu University - Varnasi
- National Institute of Technology (NIT) Calicut

Greet user in JSP (JAVA)


<html>
<body>
<%! String nm;%>
<% nm = request.getParameter("t1"); %>
<h1>HELLO , <%=nm%>
</body>
</html>

Your career after Programming Language



What is Programming Language?

A programming language is a set of grammatical rules and vocabulary to instruct a computer to perform the specific tasks. It is generally used to write computer programs such as Applications, utilities, servers, and systems programs. It can be used for two purposes:
  • To create programs that can control the behaviour of a machine
  • To express algorithms

Basically the description of a language is divided into two components:

  • Syntax (form)
  • Semantics (meaning)
Till date thousands of programming languages have been created and many more are yet to come. Most of the programming languages explain the basic of computing that is, as a sequence of commands, although some languages, such as those that support functional programming or logic programming, use alternative forms of description.
Programming languages are usually referred to as high-level languages, such as C+, C++, JAVA and many more are part of this group. Every language has a unique set of keywords and a special syntax for organizing program instructions.
The most commonly used programming languages are C, C++, VC++, Java, JavaScript, J2EE - Advanced Java, J2SE - Core Java, PHP, .NET, Adobe Flex, AJAX, EJB, Hibernate, Perl, ROR - Ruby On Rails, Shell Scripting, Spring, Struts ,Python.
However, programming languages are artificial languages designed to control computers and many man hours have been spent to develop modified versions of languages.

Eligibility:

In order to pursue this program, one has to be a graduate from a recognized university in computer science, mathematics, information system, or a related computer technology field.

Career Prospects:

After completing course in a programming language, you can start working as a Basic Programmer, Computer software engineer, web designers and developers, computer systems analyst or freelance as a consultant.

Tuesday, June 12, 2012

HARD DISK drive with 5 MB of storage.





This Picture was Taken in 1956.Thats a HARD DISK drive with 5 MB of storage. In September 1956, IBM launched the 305 RAMAC, the first 'SUPER' computer with a hard disk drive (HDD). The HDD weighed over a ton and stored 5 MB of data.
 

Tuesday, June 5, 2012

Best MCA colleges in Munbai (Selected)

Bankers algorithm (SYSPRO)


//  Program: Bankers algorithm

#include<stdio.h>
#include<conio.h>
#include<math.h>

int m,n;
int avl[20];
int max[20][20];
int need[20][20];
int allocat[20][20];
int finish[20];
int work[20];
int ssindex;
int safe_seq[20];
void find_need();
void get_data(int mat[20][20]);
void safety_algorithm(int p);
int chk_safe();
void resource_request();

void main()
{
      int flag=0;
      int r,p,i;
      clrscr();
      printf("\nHow many process u want:");
      scanf("%d",&n);
      printf("\n How many resources u want:");
      scanf("%d",&m);
      printf("\n Enter allocation matrix");
      get_data(allocat);
      printf("\nEnter max matrix");
      get_data(max);
      printf("\nenter available resources:");
      for(r=0;r<m;r++)
      scanf("%d",&avl[r]);
      find_need();
      for(r=0;r<m;r++)
      {
            work[r]=avl[r];
            finish[r]=0;
      }
      for(p=0;p<n;p++)
      {
            flag=0;
            for(r=0;r<m;r++)
            if(need[p][r]>work[r])
            {
                  flag=1;
                  break;
            }
            if(flag==0)
            {
                  safety_algorithm(p);
                  finish[p]=1;
                  safe_seq[ssindex]=p;
                  ssindex++;
            }
      }
      getch();
      printf("safe sequence is:");
      printf("<");
      for(i=0;i<ssindex;i++)
            printf("p%d ",safe_seq[i]);
            printf(">\n\n");
      if(chk_safe())
            printf("\nEntered sequence is safe:");
      else
            printf("\nEntered sequence is not safe:");
            getch();
            //printf("Enter process id for request:");
            //scanf("%d",&p);
            printf("\nEnter request for %d resources",m);
            //for(r=0;r<m;r++)
            //for(p=0;p<n;p++)
            for(r=0;r<m;r++)
                  scanf("%d",&max[p][r]);
                  resource_request();
}//main

void find_need()
{
      int p,r;
      for(p=0;p<n;p++)
      for(r=0;r<m;r++)
      need[r][p]=max[p][r]-allocat[p][r];
      //need=max_requirement-currnt_allocation
}

void get_data(int mat[20][20])
{
      int r,p;
      for(p=0;p<n;p++)
      for(r=0;r<m;r++)
      scanf("%d",&mat[p][r]);
}

void safety_algorithm(int p)
{
      int r=0;
      for(r=0;r<m;r++)
      work[r]=work[r]+allocat[p][r];
}

int chk_safe()
{
      int i;
      for(i=0;i<n;i++)
      if(finish[i]==0)
            return(0);
            return(1);
}

void resource_request()
{
      int r,p;
      for(r=0;r<m;r++)
      if(max[p][r]>need[r][p])
      {
            printf("\n Process has exceeded it's max limit");
            getch();
            exit(0);
      }//if
      for(r=0;r<m;r++)
      if(max[p][r]>avl[r])
      {
            printf("\n Resourses are not available pricess should wait");
            getch();
            exit(0);
      }//if
      for(r=0;r<m;r++)
      {
            avl[r]-=max[p][r];
            allocat[r][p]+=max[p][r];
            need[r][p]-=max[p][r];
      }//for
      if(chk_safe())
      {
            printf("\n Request can be imidiately granted");
            //printf_safe();
            getch();
      }
      else
      {
            printf("\n Request can not be granted");
            getch();
      }
}

/* OUTPUT:

How many process u want:5                                                      

How many resources u want:4

Enter allocation matrix:
0 6 3 2
0 0 1 2
1 0 0 0
1 3 5 4
0 0 1 4

Enter max matrix:
0 6 5 2
0 0 1 2
1 7 5 0
2 3 5 6
0 6 5 6

Enter available resources:3 14 12 12
safe sequence is:<p0 p1 p2 p3 p4 >

Entered sequence is safe:
Enter request for 4 resources 1 2 0 1
Process has exceeded it's max limit
*/