Author: Sanif S S
Site: theeduzone.blogspot.com
Email: sanifss@gmail.com
#include<stdio.h>
#include<conio.h>
void main(){ clrscr(); int m1[20][20],m2[20][20],s[20][20],i,j,m,n,p,q; printf("\nenter the order of the first matrix : "); scanf("%d %d",&m,&n); printf("\nenter the order of the second matrix : "); scanf("%d %d",&p,&q); if((m==p)&&(n==q)) { printf("\n\nenter the elements of first matrix : "); for(i=0;i for(j=0;j scanf("%d",&m1[i][j]); printf("\nenter the elements of second matrix : "); for(i=0;i
for(j=0;j scanf("%d",&m2[i][j]); printf("\n\nfirst matrix : \n"); for(i=0;i { for(j=0;j printf(" %d ",m1[i][j]); printf("\n"); } printf("\nsecond matrix : \n"); for(i=0;i
{ for(j=0;j printf("...
Custom Search
Monday, 28 November 2011
Friday, 25 November 2011
MG university btech Computer science and engineering s3 syllubus
S3 Computer Science Engineering
EN010301 B Engineering Mathematics II
2-2-0 (CS, IT) credits 4
MODULE 1
Mathematical logic (12 hours)
Basic concept of statement , logical connectives, Tautology and logical equivalence – Laws of algebra
of propositions – equivalence formulas – Tautological implications (proof not expected for the above
laws , formulas and implications). Theory of inference for statements – Predicate calculus –
quantifiers – valid formulas and equivalences – free and bound variables – inference theory of
predicate calculus
MODULE 2
Number theory and functions (12 hours)
Fundamental concepts – Divisibility – Prime numbers- relatively prime numbers – fundamental
theorem of arithmetic – g.c.d - Euclidean algorithm - properties of gcd (no proof) – l c m – Modular
Arithmetic – congruence – properties – congruence class modulo n – Fermat’s theorem – Euler’s
Totient functions - Euler’s theorem - Discrete logarithm
Function...
MG university b tech 1st year syllubus
Syllabus for combined Ist & IInd Sem
(Common for all branches)
EN010 101 ENGINEERING MATHEMATICS – I
Teaching Scheme Credits: 5
2 hour lecture and 1 hour tutorial per week
Objectives
· To impart mathematical background for studying engineering subjects.
MODULE I (18 hours) - MATRIX
Elementary transformation – echelon form – rank using elementary transformation by reducing in to echelon
form – solution of linear homogeneous and non – homogeneous equations using elementary transformation.
Linear dependence and independence of vectors – eigen values and eigen vectors – properties of eigen values
and eigen vectors(proof not expected) – Linear transformation – Orthogonal transformation –
Diagonalisation – Reduction of quadratic form into sum of squares using orthogonal transformation – Rank,
index, signature of quadratic form – nature of quadratic form
MODULE 2 (18 hours) - PARTIAL DIFFERENTIATION
Partial...
Q5)write a program to generate sine and cosine series?
Author: Sanif S S
Site: theeduzone.blogspot.com
Email: sanifss@gmail.com
#include<stdio.h>
#include<conio.h>
void main(){ clrscr(); float term,termc,sum=0,sumc=0,x,k=0,j=1; int n,c,i; printf("menu\n"); printf("1.sine series\n2.cosine series\n"); printf("enter your choice\n"); scanf("%d",&c); printf("enter the angle in degree\n"); scanf("%f",&x); printf("enter the number of terms\n"); scanf("%d",&n); x=((x*3.14)/180); switch(c) { case 1: term=x; for(i=1;i<=n;i++) { sum=sum+term; j=j+2; term=((term*(-1)*x*x)/(j*(j-1))); } printf("sum of the sine series=%f\n",sum); break; case 2: termc=1; for(i=1;i<=n;i++) ...
Q4)Write a program to generate fibonacci series
Author: Sanif S S
Site: theeduzone.blogspot.com
Email: sanifss@gmail.com
#include<stdio.h>
#include<conio.h>
void main(){ clrscr(); int n,i=1,f1=0,f2=1,f3; printf("enter a number\n"); scanf("%d",&n); printf("fibonacci series of%d numbers",n); while(i<=n) { printf("\n%d",f1); f3=f1+f2; f1=f2; f2=f3; i++; } getch()...
Q3)Write a program to check wheather the given number is amstrong or not
Author: Sanif S S
Site: theeduzone.blogspot.com
Email: sanifss@gmail.com
#include<stdio.h>
#include<conio.h>
void main(){ clrscr(); int n,c,t,s=0; printf("enter a number\n"); scanf("%d",&n); t=n; while(n>0) { c=n%10; s=s+(c*c*c); n=n/10; } if(s==t) { printf("the number is armstrong"); } else { printf("the number is not armstrong"); } getch()...
Q2)write a c programme to find solution for quadratic equation?
Author: Sanif S S
Site: theeduzone.blogspot.com
Email: sanifss@gmail.com
#include<stdio.h>
#include<conio.h>
#include<math.h>void main(){ clrscr(); int a,b,c; float d,r1,r2; printf("enter coefficients of equation\n"); scanf("%d %d %d",&a,&b,&c); if(a==0) { printf("not possible"); } else { d=((b*b)-(4*a*c)); if(d==0) { printf("roots are real and equal\n"); r1=((-b/(2*a))); printf("r1=r2=%f",r1); } if(d>0) { printf("roots are real and distinct\n"); r1=((-b+sqrt(d))/(2*a)); r2=((-b-sqrt(d))/(2*a)); printf("r1=%f \nr2=%f",r1,r2); } if(d<0) { printf("roots are imaginary\n"); d=-d; r1=((-b)/(2*a)); r2=((sqrt(d)/(2*a))); ...
Q1) write a program to impliment simple calculator?
Author: Sanif S S
Site: theeduzone.blogspot.com
Email: sanifss@gmail.com
#include<stdio.h>
#include<conio.h>
void main()
{
clrscr();
int a,b,c,m,ch,n;
printf("simple calculator\n");
do
{
printf("main menu");
printf("\n 1.addition \n 2.subtraction");
printf("\n 3.multiplication \n 4.division\n");
printf("enter your choice\n");
scanf("%d",&ch);
switch(ch)
{
case 1:
printf("enter 2 no\n");
scanf("%d %d",&a,&b);
c=a+b;
printf("sum=%d\n",c);
break;
case 2:
printf("enter 2 no\n");
scanf("%d %d",&a,&b);
c=a-b;
printf("difference=%d\n",c);
...
Subscribe to:
Posts (Atom)
LinkWithin
