PROGRAMMING LANGUAGE ARE MAINLY OF THREE TYPES. THEY ARE
1. Procedure Oriented
Ex: C
C program structure is divided into some procedure i.e some functions.
2. OBJECT ORIENTED
Ex: C++,JAVA
These are the languages that supports OOPS concepts
(Oops concepts- ENCAPSULATION, DATA ABSTRACTION,INHERITANCE,etc,.
3. OBject based
Ex: JAVA SCRIPT
These are the languages that supports all OOPS CONCEPTS except INHERITANCE.
/*SELECTION SORT (ASCENDING AND DESCENDING ORDER ORDER) */
#include<stdio.h>
void main()
{
int n,a[1000],i,j,t,m,l;
printf("enter the number of numbers that are to be sorted\n");
scanf("%d",&n);
printf(" enter the elements of the array\n"); for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
t=i;
for(j=i;j<n;j++)
if(a[t]>a[j])
{
t=j;
}
if(t!=i)
{
m=a[i];
a[i]=a[t];
a[t]=m;
}
}
printf("\n ASCENDING ORDER :\n"); for(i=0;i<n;i++)
printf(" %d ",a[i]);
printf("\n DESCENDING ORDER:\n"); for(i=n-1;i>=0;i--)
printf(" %d ",a[i]);
}
/*Check whether the given filled sudoku puzzle is correct or not */
#include<stdio.h>
#include<conio.h>
void main()
{
int a[9][9],sum1,sum2,flag=0,i,j; printf("Enter the elements of sudoku Row wise\n");
for(i=0;i<9;i++)
for(j=0;j<9;j++)
scanf("%d",&a[i][j]);
for(i=0;i<9;i++)
{
sum1=0;
sum2=0;
for(j=0;j<9;j++)
{
sum1+=a[i][j];
sum2+=a[j][i];
}
if(sum1!=45 || sum2!=45)
{
flag=1;
break;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
printf(" %d ",a[i][j]);
printf("\n\n");
}
if(flag==1)
printf("\n----THE PUZZLE IS WRONG---\n"); else
printf("\n----THE PUZZLE IS RIGHT---");
}
/*PROGRAM TO PRINT THE PASCAL TRIANGLE */
#include<stdio.h>
int ncr(int ,int );
int fact(int);
void main()
{
int n,i,j,k;
printf("enter number of rows \n");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(k=(n-i);k>0;k--)
printf(" ");
for(j=0;j<=i;j++)
{
printf("%d ",ncr(i,j));
}
printf("\n");
}
getch();
}
int ncr(int n,int r)
{
return (((fact(n))/(fact(n-r)*fact(r))));
}
int fact(int n)
{
if(n==0)
return 1;
else
return n*fact(n-1);
}
/*BUBBLE SORT (ASCENDING AND DESCENDING ORDER ORDER) */
#include<stdio.h>
void main()
{
int n,a[1000],i,j,t;
printf("enter the number of numbers that are to be sorted\n");
scanf("%d",&n);
printf(" enter the elements of the array\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for(j=0;j<n-1-i;j++)
if(a[j]>a[j+1])
{
t=a[j+1];
a[j+1]=a[j];
a[j]=t;
}
}
printf("\n ASCENDING ORDER :\n"); for(i=0;i<n;i++)
printf(" %d ",a[i]);
printf("\n DESCENDING ORDER:\n"); for(i=n-1;i>=0;i--)
printf(" %d ",a[i]);
}
/* write a program to print the maximum and minimum of three given numbers */
#include<stdio.h>
void main()
{
int a,b,c,min,max;
printf("enter any three numbers \n");
scanf("%d %d %d",&a,&b,&c);
min=((a<b)&&(a<c))?a:(b<c?b:c);
max=((a>b)&&(a>c))?a:(b>c?b:c);
printf("minimum: %d maximum: %d ",min,max);
getch();
}
/*Program to find the first and second largest number in the given array*/
#include<stdio.h>
void main()
{
int a[100];
int n,f=0,s=0,i;
printf("enter the number of elements in the array\n");
scanf("%d",&n);
printf(" \n enter the elements and press enter\n");
for(i=0;(i<n);i++)
{
scanf("%d",&a[i]);
if(a[i]>f)
{
s=f;
f=a[i];
}
if((a[i]>s)&&(a[i]<f))
s=a[i];
}
printf("%d is the first largest number \n",f); printf("%d is the second largest number \n",s);
}
#include<stdio.h>
void main()
{
int a[100];
int n,f,s,i;
printf("enter the number of elements in the array at least 2 \n");
scanf("%d",&n);
printf(" \n enter the elements and press enter\n");
for(i=0;(i<n);i++)
{
scanf("%d",&a[i]);
if(a[i]>f)
f=a[i];
else if(a[i]<s)
s=a[i];
}
printf("%d is the first largest number \n",f); printf("%d is the smallest number \n",s);
}
/*sample output is shown in the screen shot*/
LONGEST WORD THAT CAN BE WRITTEN WITHOUT ANY REPETITION OF LETTERS IN IT IS ?
COPYRIGHTABLE
Section1: Engineering Mathematics
Linear Algebra: Matrix Algebra, Systems of linear equations, Eigenvalues, Eigenvectors.
Calculus: Mean value theorems, Theorems of integral calculus, Evaluation of definite and improper integrals, Partial Derivatives, Maxima and minima, Multiple integrals, Fourier series, Vector identities, Directional derivatives, Line integral, Surface integral, Volume integral, Stokes’s theorem, Gauss’s theorem, Green’s theorem.
Differential equations: First order equations (linear and nonlinear), Higher order linear differential equations with constant coefficients, Method of variation of parameters, Cauchy’s equation, Euler’s equation, Initial and boundary value problems, Partial Differential Equations, Method of separation of variables.
Complex variables: Analytic functions, Cauchy’s integral theorem, Cauchy’s integral formula, Taylor series, Laurent series, Residue theorem, Solution integrals.
Probability and Statistics: Sampling theorems, Conditional probability, Mean, Median, Mode, Standard Deviation, Random variables, Discrete and Continuous distributions, Poisson distribution, Normal distribution, Binomial distribution, Correlation analysis, Regression analysis.
Numerical Methods: Solutions of nonlinear algebraic equations, Single and Multi‐step methods for differential equations.
Transform Theory: Fourier Transform, Laplace Transform, z‐Transform.
Electrical Engineering
Section 2: Electric Circuits
Network graph, KCL, KVL, Node and Mesh analysis, Transient response of dc and ac networks, Sinusoidal steady‐state analysis, Resonance, Passive filters, Ideal current and voltage sources, Thevenin’stheorem, Norton’s theorem, Superposition theorem, Maximum power transfer theorem, Two‐port networks, Three phase circuits, Power and power factor in ac circuits.
Section 3: Electromagnetic Fields
Coulomb's Law, Electric Field Intensity, Electric Flux Density, Gauss's Law, Divergence, Electric field and potential due to point, line, plane and spherical charge distributions, Effect of dielectric medium, Capacitance of simple configurations, Biot‐Savart’s law, Ampere’s law, Curl, Faraday’s law, Lorentz force, Inductance, Magnetomotive force, Reluctance, Magnetic circuits,Self and Mutual inductance of simple configurations.
Section 4: Signals and Systems
Representation of continuous and discrete‐time signals, Shifting and scaling operations, Linear Time Invariant and Causal systems, Fourier series representation of continuous periodic signals, Sampling theorem, Applications of Fourier Transform, Laplace Transform and z-Transform.
Section 5: Electrical Machines
Single phase transformer: equivalent circuit, phasor diagram, open circuit and short circuit tests, regulation and efficiency; Three phase transformers: connections, parallel operation; Auto‐transformer, Electromechanical energy conversion principles, DC machines: separately excited, series and shunt, motoring and generating mode of operation and their characteristics, starting and speed control of dc motors; Three phase induction motors: principle of operation, types, performance, torque-speed characteristics, no-load and blocked rotor tests, equivalent circuit, starting and speed control; Operating principle of single phase induction motors; Synchronous machines: cylindrical and salient pole machines, performance, regulation and parallel operation of generators, starting of synchronous motor, characteristics; Types of losses and efficiency calculations of electric machines.
Section 6: Power Systems
Power generation concepts, ac and dc transmission concepts, Models and performance of transmission lines and cables, Series and shunt compensation, Electric field distribution and insulators, Distribution systems, Per‐unit quantities, Bus admittance matrix, Gauss-Seidel and Newton-Raphson load flow methods, Voltage and Frequency control, Power factor correction,Symmetrical components, Symmetrical and unsymmetrical fault analysis, Principles of over‐current, differential and distance protection; Circuit breakers, System stability concepts, Equal area criterion.
Section 7: Control Systems
Mathematical modeling and representation of systems, Feedback principle, transfer function, Block diagrams and Signal flow graphs, Transient and Steady‐state analysis of linear time invariant systems, Routh-Hurwitz and Nyquist criteria, Bode plots, Root loci, Stability analysis, Lag, Lead and Lead‐Lag compensators; P, PI and PID controllers; State space model, State transition matrix.
Section 8: Electrical and Electronic Measurements
Bridges and Potentiometers, Measurement of voltage, current, power, energy and power factor; Instrument transformers, Digital voltmeters and multimeters, Phase, Time and Frequency measurement; Oscilloscopes, Error analysis.
Section 9: Analog and Digital Electronics
Characteristics of diodes, BJT, MOSFET; Simple diode circuits: clipping, clamping, rectifiers; Amplifiers: Biasing, Equivalent circuit and Frequency response; Oscillators and Feedback amplifiers; Operational amplifiers: Characteristics and applications; Simple active filters, VCOs and Timers, Combinational and Sequential logic circuits, Multiplexer, Demultiplexer, Schmitt trigger, Sample and hold circuits, A/D and D/A converters, 8085Microprocessor: Architecture, Programming and Interfacing.
Section 10: Power Electronics
Characteristics of semiconductor power devices: Diode, Thyristor, Triac, GTO, MOSFET, IGBT; DC to DC conversion: Buck, Boost and Buck -Boost converters; Single and three phase configuration of uncontrolled rectifiers, Line commutated thyristor based converters, Bidirectional ac to dc voltage source converters, Issues of line current harmonics, Power factor, Distortion factor of ac to dc converters, Single phase and three phase inverters, Sinusoidal pulse width modulation.