Write C programs that implement the following sorting methods to sort a given list of integers in ascending order: i) Insertion sort

#include< stdio.h >

main()
{

JNTU       JNTU Kakinada       B.TECH      

a) Write C programs that use both recursive and non-recursive functions :- i) To find the factorial of a given integer.

#include< stdio.h >
int recfactorial(int a);
int nonrecfactorial(int b);
int main()
{

JNTU       JNTU Kakinada       B.TECH      

Write C programs that implement stack (its operations) using Pointers

#include < stdio.h >
#include < stdlib.h >
int top = -1, size;

JNTU       JNTU Kakinada       B.TECH      

Write C programs that implement stack (its operations) using :- Arrays

#include< stdio.h >

#include< stdlib.h >
#define max 50

JNTU       JNTU Kakinada       B.TECH      

b) Write a C program to reverse the first n characters in a file.

*Write a C program to reverse the first n characters in a file.
(Note: The file name and n are specified on the command line.)*

JNTU       JNTU Anathapur       B.TECH      

a) Write a C program which copies one file to another.

* Write a C program which copies one file to another. *

JNTU       JNTU Anathapur       B.TECH      

a) The total distance travelled by vehicle in ‘t’ seconds is given by distance = ut+1/2at2 where ‘u’ and ‘a’ are the initial velocity (m/sec.) and acceleration (m/sec2). Write C program to find the distance travelled at regular intervals of time given the values of ‘u’ and ‘a’. The program should provide the flexibility to the user to select his own time intervals and repeat the calculations for different values of ‘u’ and ‘a’. b) Write a C program, which takes two integer operands and one operator form the user, performs the operation and then prints the result. (Consider the operators +,-,*, /, % and use Switch Statement)

a)


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

JNTU       JNTU Kakinada       B.TECH      

2. Write a program perform matrix multiplication between two matrices.

* Matrix Multiplication *

JNTU       JNTU Anathapur       B.TECH      

1. Write a program that uses the binary search algorithm to find out the position where the given key element exist in a user chosen array and print it as output

binary search..
#include< stdio.h >
int main()

JNTU       JNTU Anathapur       B.TECH      

2.Write a program to read and display values of an integer array. Allocate space dynamically for the array using the malloc().

#include< stdio.h >
#include< stdlib.h >
int main()
{
int *p_array;

JNTU       JNTU Anathapur       B.TECH      

Write C programs that implement Queue (its operations) using i) Arrays ii) Pointers

i) by using arrays

#include< stdio.h >
#define MAX 10
int queue[MAX],front=-1,rear=-1;

JNTU       JNTU Kakinada       B.TECH      

1.Write a program to read in an array of names and to sort them in alphabetical order. Use sort function that receives pointers to the functions strcmp, and swap, sort in turn should call these functions via the pointers.

#include< stdio.h >
#include< string.h >
void main()
{
char s[50][20], t[50];

JNTU       JNTU Anathapur       B.TECH      

Write a C program to find the sum of individual digits of a positive integer.

Program:
To find the sum of individual digits of a given number
#include< stdio.h >

JNTU       JNTU Anathapur       B.TECH      

Write C programs that implement Queue (its operations) using i) Arrays ii) Pointers

i) by using arrays

#include
#define MAX 10
int queue[MAX],front=-1,rear=-1;

JNTU       JNTU Kakinada       B.TECH      

Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by the user.

C program to generate all the prime numbers between 1 and n
#include< stdio.h >
main()

JNTU       JNTU Anathapur       B.TECH      

(b)Newton- Gregory forward interpolation

*(b)Newton- Gregory forward interpolation.*

JNTU       JNTU Kakinada       B.TECH      

Write C programs to implement (a) Lagrange interpolation and (b)Newton- Gregory forward interpolation.

* (a) Write C program to implement the Lagrange interpolation.*

JNTU       JNTU Kakinada       B.TECH      

Write an algorithm and draw a flowchart to generate the first n terms of the sequence. A Fibonacci sequence is defined as follows: the first and second terms in the sequence are 0 and 1. Subsequent terms are found by adding the preceding two terms in the sequence.

Algorithm:

step 1: start
step 2:declare the variables f1=0,f2=1,next,and n ,i

JNTU       JNTU Anathapur       B.TECH      

Write a c program for polynomial regression algorithm

* program to implement Polynomial regression *

JNTU       JNTU Kakinada       B.TECH      

Write a program to print the Pascal triangle for a given number?

#include < stdio.h > 
int factorial(int); 
int main()
{
int i, j, n;

JNTU       JNTU Anathapur       B.TECH