1. Operator new constructs an object (calls constructor of object), malloc does not. Hence new invokes the constructor (and delete invokes the destructor)This is the most important difference.
2. operator new is an operator, malloc is a function.
3. operator new can be overloaded, malloc cannot be overloaded.
4. operator new throws an exception if there is not enough memory, malloc returns a NULL.
5. operator new[] requires you to specify the number of objects to allocate, malloc requires you to specify the total number of bytes to allocate.
6. operator new/new[] must be matched with operator delete/delete[] to deallocate memory, malloc() must be matched with free() to deallocate memory.

Syntax of new is:
p_var = new type name;
Where p_var is a previously declared pointer of type typename. And typename can be any basic data type.

Example:
int  *p;
p = new int;
It allocates memory space for an integer variable.

Syntax of malloc is:
p_var = (typename *)malloc(sizeof(typename));
Where p_var is a previously declared pointer of type typename. And typename can be any basic data type.

Example:
int *p;
p = (int *)malloc(sizeof(int));
This statement “allocates” or “reserves” a block of memory for an integer from the heap. Then it places the address of the reserved block into the pointer variable (p, in this case).

The post What is the difference between new and malloc? first appeared on Student Projects.

#include
#include
#include
#include

void main()
{
	char str[25],str1[100];
	clrscr();
	fflush(stdin);
	printf("enter the String");
	gets(str);

	int j=0;
	for(int i=0;i<=strlen(str);++)
	{
		switch(toupper(str[i]))
		{
		  case 'A':
		  str1[j++]='.';
		  str1[j]='.';
		  break;
		  
		  case 'b':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		  case 'c':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		  case 'D':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		  case 'E':
		  str1[j]='.';
		  break;

		  case 'F':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		  case 'G':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		  case 'H':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		   case 'I':
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'J':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'K':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'L':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		  break;

		case 'M':
		  str1[j++]='-';
		    str1[j]='-';
		    break;

		case 'N':
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'O':
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'P':
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'Q':
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'R':
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'S':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'T':
		  str1[j]='-';
		    break;
			
		case 'U':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'V':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case 'W':
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='-';
		    break;

		case 'X':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case 'y':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case 'Z':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case '0':
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='-';
		    break;
			
		case '1':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-'; 
		  str1[j]='-';
		    break;

		case '2':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case 'F':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case '3':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case '4':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '5':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='.';
		    break;

		case '6':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '7':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '8':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '9':
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case '.':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ',':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ':':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '?':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		/* case '\';
		  str1[j++]='.';
		  str1[j++]='.'; 
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break; */

		case '-':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ';':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case '(':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ')':
		  str1[j++]='.';
		  str1[j++]='.'; 
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case ']':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='-';
		    break;

		case '[':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j]='.';
		    break;

		case '}':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j]='-';
		    break;
			
		case '{':
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j++]='-';
		  str1[j++]='-';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '"':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '+':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '/':
		  str1[j++]='.';
		  str1[j++]='.';  
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '%':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '&':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '$':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '*':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '^':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '#':
		  str1[j++]='.';
		  str1[j++]='.';  
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '@':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='-';
		    break;

		case '=':
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j++]='.';
		  str1[j]='';
		    break;
		}
	    j++;
	}
	str1[j-1]='\0';
	puts(str1);
	getch();
 }

The post C program to Implement Morse code to text conversion and vice-versa. first appeared on Student Projects.

#include
#include
void main()
{
	int n,fact;
	int rec(int); clrscr();
	cout<<"Enter the number:->";
	cin>>n;
	fact=rec(n);
	cout<
The post C++ program to calculate the factorial of a number using recursion. first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/c-program-to-calculate-the-factorial-of-a-number-using-recursion/feed/
			20
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-for-syntax-analyzer/
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-for-syntax-analyzer/#comments
		
		
		Mon, 29 Mar 2010 16:54:13 +0000
				
		
		
		
		
		http://studentprojects.in/?p=1128

					C program for Syntax Analyzer #include #include #include #include void main() { int i,j,k=0,count,inc=0,n; char name[30],open[30],ch,chh,o[30]; char op[20]={'=','+','-','*','/','%','^','&','|'}; clrscr(); textcolor(3); cprintf("--Syntax Analyser--"); printf("\n"); printf("\n Enter Syntax"); printf("\n"); scanf("%s",name); n=strlen(name); for(i=0;i

The post C program for Syntax Analyzer first appeared on Student Projects.
]]>
										C program for Syntax Analyzer

#include
#include
#include
#include
void main()
 {
    int i,j,k=0,count,inc=0,n;
   char name[30],open[30],ch,chh,o[30];
   char op[20]={'=','+','-','*','/','%','^','&','|'};
   clrscr();
   textcolor(3);
   cprintf("--Syntax Analyser--");
   printf("\n");
   printf("\n Enter Syntax");
   printf("\n");
   scanf("%s",name);
   n=strlen(name);
   for(i=0;i
The post C program for Syntax Analyzer first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-for-syntax-analyzer/feed/
			7
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-for-priority-scheduling/
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-for-priority-scheduling/#comments
		
		
		Mon, 29 Mar 2010 16:43:12 +0000
				
		
		
		
		http://studentprojects.in/?p=1122

					C program for Priority Scheduling #include #include #include void main() { clrscr(); int x,n,p[10],pp[10],pt[10],w[10],t[10],awt,atat,i; printf("Enter the number of process : "); scanf("%d",&n); printf("\n Enter process : time priorities \n"); for(i=0;i

The post C program for Priority Scheduling first appeared on Student Projects.
]]>
										C program for Priority Scheduling

#include
#include
#include
void main()
 {
   clrscr();
   int x,n,p[10],pp[10],pt[10],w[10],t[10],awt,atat,i;
   printf("Enter the number of process : ");
   scanf("%d",&n);
   printf("\n Enter process : time priorities \n");
   for(i=0;i
The post C program for Priority Scheduling first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-program-for-priority-scheduling/feed/
			47
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-progrma-for-first-come-first-serve-algorithm/
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-progrma-for-first-come-first-serve-algorithm/#comments
		
		
		Mon, 29 Mar 2010 16:10:59 +0000
				
		
		
		
		
		
		http://studentprojects.in/?p=1113

					C progrma for First Come First Serve Algorithm #include #include #include void main() { clrscr(); int p[20],b[20],w[20],t[20],i,v,n,at; int wt=0; float tw,tr; printf("Enter the number of process : "); scanf("%d",&n); printf("enter CPU burst time : "); for(i=1;i

The post C progrma for First Come First Serve Algorithm first appeared on Student Projects.
]]>
										C progrma for First Come First Serve Algorithm

#include
#include
#include
void main()
{
      clrscr();
      int p[20],b[20],w[20],t[20],i,v,n,at;
      int wt=0;
      float tw,tr;
      printf("Enter the number of process : ");
      scanf("%d",&n);
      printf("enter CPU burst time : ");
      for(i=1;i<=n;i++)
       {
         scanf("%d",&b[i]);
         t[1]=b[1];
         w[1]=0;
         at=t[1];
         wt=w[1];
	for(i=2;i<=n;i++)
	{
	  t[i]=b[i]+t[i-1];
	  at=at+t[i];
	  w[i]=t[i-1];
	  wt=wt+w[i];
	 }
       }
      printf("process \t burst_time \t wait_time \t turn_around \t \n");
      for(i=1;i<=n;i++)
      {
         printf("%d \t\t %d \t\t %d \t\t %d",i,b[i],w[i],t[i]);
         printf("\n");
      }
      printf("\n average wait time");
      tw=wt/n;
      printf("%f",tw);
      printf("\n Average turn around time");
      tr=at/n;
      printf("%f",tr);
      getch();
}
The post C progrma for First Come First Serve Algorithm first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-advanced/c-progrma-for-first-come-first-serve-algorithm/feed/
			16
		
		
			
		
		
		https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-to-implement-the-prim%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-to-implement-the-prim%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/#comments
		
		
		Thu, 11 Mar 2010 16:53:26 +0000
				
		
		
		
		
		
		
		http://studentprojects.in/?p=1021

					/* Write C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree */ #include #include #include using namespace std; int cost[10][10],i,j,k,n,stk[10],top,v,visit[10],visited[10],u; main() { int m,c; cout n; cout m; cout >j>>c; cost[i][j]=c; } for(i=1;i

The post C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree first appeared on Student Projects.
]]>
										/* Write C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree */

#include
#include
#include
using namespace std;
int cost[10][10],i,j,k,n,stk[10],top,v,visit[10],visited[10],u;

main()
{
	int m,c;
	cout <<"enterno of vertices";
	cin >> n;
	cout <<"ente no of edges";
	cin >> m;
	cout <<"\nEDGES Cost\n";
	for(k=1;k<=m;k++)
	{
		cin >>i>>j>>c;
		cost[i][j]=c;
	}
	for(i=1;i<=n;i++)
	for(j=1;j<=n;j++)
		if(cost[i][j]==0)
		cost[i][j]=31999;

	cout <<"ORDER OF VISITED VERTICES";
	k=1;
	while(k=1;j--)
			if(cost[v][j]
OUTPUT
enterno of vertices7

ente no of edges9
EDGES Cost

1 6 10

6 5 25

5 4 22

4 3 12

3 2 16

2 7 14

5 7 24

4 7 18

1 2 28

ORDER OF VISITED VERTICES1 6 5 4 3 2
The post C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-to-implement-the-prim%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/feed/
			26
		
		
			
		
		
		https://studentprojects.in/software-development/java/java-programs/advanced/java-program-of-client-server-network-for-chatting-between-client-and-server/
					https://studentprojects.in/software-development/java/java-programs/advanced/java-program-of-client-server-network-for-chatting-between-client-and-server/#comments
		
		
		Sun, 04 Oct 2009 16:21:21 +0000
				
		
		
		
		
		
		
		http://studentprojects.in/?p=908

					BufferedReader cin=newBufferedReader(newInputStreamReader(sk.getInputStream()));

PrintStream cout=new PrintStream(sk.getOutputStream());

BufferedReader stdin=new BufferedReader(new InputStreamReader(System.in));

The post Java program of Client-Server network for Chatting between Client and Server first appeared on Student Projects.
]]>
										
import java.net.*;
import java.io.*;

public class  chatserver
{
	public static void main(String args[]) throws Exception
	{
		ServerSocket ss=new ServerSocket(2000);
		Socket sk=ss.accept();
		BufferedReader cin=newBufferedReader(newInputStreamReader(sk.getInputStream()));
		PrintStream cout=new PrintStream(sk.getOutputStream());
		BufferedReader stdin=new BufferedReader(new InputStreamReader(System.in));
		String s;
		while (  true )
		{
			s=cin.readLine();
  			if (s.equalsIgnoreCase("END"))
  			{
				cout.println("BYE");
    				break;
  			  }
			System. out.print("Client : "+s+"\n");
			System.out.print("Server : ");
			s=stdin.readLine();
			cout.println(s);
		}
		ss.close();
 		sk.close();
 		cin.close();
		cout.close();
 		stdin.close();
	}
}

public class  chatclient
{
	public static void main(String args[]) throws Exception
	{
		Socket sk=new Socket("192.168.0.19",2000);
		BufferedReader sin=new BufferedReader(new InputStreamReader(sk.getInputStream()));
		PrintStream sout=new PrintStream(sk.getOutputStream());
		BufferedReader stdin=new BufferedReader(new InputStreamReader(System.in));
		String s;
		while (  true )
		{
			System.out.print("Client : ");
			s=stdin.readLine();
			sout.println(s);
			s=sin.readLine();
			System.out.print("Server : "+s+"\n");
  			if ( s.equalsIgnoreCase("BYE") )
 			   break;
		}
		 sk.close();
		 sin.close();
		 sout.close();
 		stdin.close();
	}
}

Output:
Java chatclient
From Server :  Hi

From Client: Hi

From Server: Good morning

From Client: End

From Server:Bye
The post Java program of Client-Server network for Chatting between Client and Server first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/java/java-programs/advanced/java-program-of-client-server-network-for-chatting-between-client-and-server/feed/
			33
		
		
			
		
		
		https://studentprojects.in/software-development/java/java-programs/basic/java-program-that-checks-whether-the-given-string-is-palindrome-or-not/
					https://studentprojects.in/software-development/java/java-programs/basic/java-program-that-checks-whether-the-given-string-is-palindrome-or-not/#comments
		
		
		Fri, 02 Oct 2009 15:12:38 +0000
				
		
		
		
		
		
		http://studentprojects.in/?p=854

					StringBuffer s1=new StringBuffer(args[0]);

		StringBuffer s2=new StringBuffer(s1);

		s1.reverse();

		System.out.println(“Given String is:”+s2);

		System.out.println(“Reverse String is”+s1);

The post Java program that checks whether the given string is palindrome or not first appeared on Student Projects.
]]>
										class palindrome

{

	public static void main(String[] args)

	{

		StringBuffer s1=new StringBuffer(args[0]);

		StringBuffer s2=new StringBuffer(s1);

		s1.reverse();

		System.out.println(“Given String is:”+s2);

		System.out.println(“Reverse String is”+s1);

		if(String.valueOf(s1).compareTo(String.valueOf(s2))==0)

			System.out.println(“Palindrome”);

		else

			System.out.println(“Not Palindrome”);

	}

}

Output:
Java palindrome madam

Given String is:madam

Reverse String is madam

Palindrome
Java palindrome harish

Given String is:harish

Reverse String is hsirah

Not Palindrome
The post Java program that checks whether the given string is palindrome or not first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/java/java-programs/basic/java-program-that-checks-whether-the-given-string-is-palindrome-or-not/feed/
			27
		
		
			
		
		
		https://studentprojects.in/software-development/c-tutorials/c/graphics/c-graphics-program-for-analog-clock/
					https://studentprojects.in/software-development/c-tutorials/c/graphics/c-graphics-program-for-analog-clock/#comments
		
		
		Fri, 02 Oct 2009 12:51:49 +0000
				
		
		
		
		
		
		
		
		http://studentprojects.in/?p=843

					Time_Dig[0]=hour/10+48;

      Time_Dig[1]=hour%10+48;

      Time_Dig[2]=':';

      Time_Dig[3]=min/10+48;

      Time_Dig[4]=min%10+48;

      Time_Dig[5]=':';

      Time_Dig[6]=sec/10+48;

The post C graphics program for analog clock first appeared on Student Projects.
]]>
										
#include
#include
#include
#include
#include

#define arg_sec M_PI/30
#define arg_hour M_PI/6
#define arg_min M_PI/360
void main()
{
  int gd=DETECT,gm,sec=0,hour,min,x1=0,y1=0,x2=0,y2=0,x3=0,y3=0;
  char *k[12]={"1","2","3","4","5","6","7","8","9","10","11","12"};
  struct time t;
  initgraph(&gd,&gm,"");
  setcolor(YELLOW);
  circle(300,200,200);
  circle(300,200,180);
  setfillstyle(1,RED);
  floodfill(300,390,YELLOW);
  settextstyle(DEFAULT_FONT,0,2);
//----------------------Constants----------------------//

  int a,b;
  for(int i=1;i<13;i++)
    {
	a=160*cos(arg_hour*i-M_PI_2);
	b=160*sin(arg_hour*i-M_PI_2);
	outtextxy(a+300,b+200,k[i-1]);
    }

//----------------------Constants----------------------//
/*****************************************************
		 1-Good
		 2-Small
		 3-Watse
		 4-caligraphy
		 5-cursive
		 6-good
		 7-excellent
		 8-Good
		 9-Big
		 10-Double
 ****************************************************/
 int dig_sec;
 char Time_Dig[14];
  while(!kbhit())
   {
       settextstyle(7,0,4);
      outtextxy(264,100,"Satya");
      settextstyle(7,0,1);
      outtextxy(278,280,"Quartz");
      setcolor(BLACK);
      line(300,200,x1+300,y1+200);
      line(300,200,x2+300,y2+200);
      line(300,200,x3+300,y3+200);
      gettime(&t);
      if(sec!=t.ti_sec)
	{
	   sound(5000);
	   delay(1);
	   nosound();
	}
      hour=t.ti_hour;
      sec=t.ti_sec;
      min=t.ti_min;
      Time_Dig[0]=hour/10+48;
      Time_Dig[1]=hour%10+48;
      Time_Dig[2]=':';
      Time_Dig[3]=min/10+48;
      Time_Dig[4]=min%10+48;
      Time_Dig[5]=':';
      Time_Dig[6]=sec/10+48;
      Time_Dig[7]=sec%10+48;
      Time_Dig[8]='\0';
      outtextxy(270,250,"ÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛÛ");
      x1=150*cos(arg_sec*sec-M_PI_2)*0.98;
      y1=150*sin(arg_sec*sec-M_PI_2)*0.98;
      x2=150*cos(arg_sec*min-M_PI_2)*0.9;
      y2=150*sin(arg_sec*min-M_PI_2)*0.9;
      if(hour>12) hour-=12;
      x3=150*cos(arg_hour*hour-M_PI_2+arg_min*min)*0.6;
      y3=150*sin(arg_hour*hour-M_PI_2+arg_min*min)*0.6;
      setcolor(YELLOW);
      line(300,200,x1+300,y1+200);
      setcolor(CYAN);
      line(300,200,x2+300,y2+200);
      setcolor(WHITE);
      line(300,200,x3+300,y3+200);
      setcolor(YELLOW);
      outtextxy(270,250,Time_Dig);
      delay(50);

   }

  getch();
  closegraph();
  restorecrtmode();
}



Click here to download the source code.
The post C graphics program for analog clock first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/graphics/c-graphics-program-for-analog-clock/feed/
			6