Top 10 Programming Language to learn in 2023

Are you a programming enthusiast looking to stay ahead of the curve in 2023? With the ever-evolving tech landscape, keeping up with the Best Programming Language to learn can be a daunting task. Fear not, as we have compiled a list of the top 10 Programming Languages that you should consider learning in 2023. Python: This versatile language continues to dominate in 2023, with its ease of use, readability, and a vast library of modules. JavaScript: As web development grows increasingly popular, JavaScript remains a crucial player, with its ability to create dynamic and interactive web pages. Java: This language has stood the test of time and remains a popular choice for enterprise software development. C++: A staple in the gaming and systems development industries, C++ offers exceptional performance and memory management. Swift: Apple's preferred language for iOS app development, Swift continues to grow in popularity with its simplicity and reliability. R: As data science and machin...
Post a Comment

C program to find value using secant method | C programming

C program to find value using secant method | C programming


#include<stdio.h>
#include <math.h>
#include<conio.h>
#define EST 0.05
#define F(x) x-exp(x)+2
int main()
{
int i = 1;
float x0,x1,a,b,c,d,f1,x2,f0,error;
printf("\nEnter the value of x0: ");
scanf("%f",&x0);
printf("\nEnter the value of x1: ");
scanf("%f",&x1);
printf("\n__________________________________________________________________\n");
printf("\niteration\tx0\t x1\t f0\t f1\t x2\t\terror");
printf("\n___________________________________________________________________\n");
f0=F(x0);
f1=F(x1);
x2=x1-((f1*(x1-x0))/(f1-f0));
printf("%f",x2);
error=fabs((x2-x1)/x2);
printf("\n %d \t %.2f\t %.2f\t %.2f \t %.3f \t %.3f \t %.3f", i, x0,x1,f0,f1,x2,error);
do{
i++;
x0=x1;
f0= f1;
x1=x2;

f0=F(x0);
f1=F(x1);
x2=x1-((f1*(x1-x0))/(f1-f0));
error=fabs((x2-x1)/x2);
printf("\n %d \t %.2f\t %.2f\t %.2f \t %.4f \t %.4f \t %.4f", i, x0,x1,f0,f1,x2,error);
}while(error>EST);
printf("\n__________________________________________________________\n");
printf("\n\nApp.root = %f",x2);
return 0;
}

Comments

Post a Comment

Subscribe Us and Thanks for visiting blog.

Popular posts from this blog

Array in C Programming | C Programming

Image
Array in C Array in C Programming The C language provides a capability that enables the user to define a set of ordered data items known as an array. Suppose we had a set of grades that we wished to read into the computer and suppose we wished to perform some operations on these grades, we will quickly realize that we cannot perform such an operation until each and every grade has been entered since it would be quite a tedious task to declare each and every student grade as a variable especially since there may be a very large number. In C we can define a variable called grade, which represents not a single value of grade but an entire set of grades. Each element of the set can then be referenced by means of a number called an index number or subscript. Declaration of arrays Like any other variable arrays must be declared before they are used. The general form of declaration is: type variable-name [50]; The type specifies the type of the elements that will be contained in the ar...
Read more

C program to Find Cartesian Product of Two Sets | C programming

Image
C program to find the Cartesian Product of two sets   Cartesian product  is a mathematical operation that returns a set (or  product set  or simply  product ) from multiple sets. That is, for sets  A  and  B , the Cartesian product  A  ×  B  is the set of all ordered pairs  ( a ,  b )  where  a  ∈  A  and  b  ∈  B . Products can be specified using set-builder notation, e.g. {\displaystyle A\times B=\{\,(a,b)\mid a\in A\ {\mbox{ and }}\ b\in B\,\}.}
Read more

Eliminating Epsilon transition (ε-Transitions) | Conversion of Epsilon-NFA to DFA | Conversion of Epsilon-NFA to NFA | Theory Of Computation (TOC)

Image
Theory Of Computation (TOC) | Eliminating  Epsilon Transition ( ε -Transitions) : Given any Epsilon NFA (ε-NFA) , we can find a DFA D that accepts the same language as E. The construction is close to the subset construction, as the states of D are subsets of the states of E. The only difference is that dealing with ε-transitions, which can be done by using ε-closure.
Read more