Scribd
Upload
38 views3 pages

Code for TIN Check and Sorting

The document contains multiple code snippets in C programming language, including functions for mathematical calculations, array manipulation, and Kirchhoff's laws for electrical circuits. It demonstrates reading input, processing arrays, and applying Kirchhoff's Current and Voltage Laws. The code also includes error handling and output formatting for user-friendly display.

Uploaded by

dqt0907
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
38 views3 pages

Code for TIN Check and Sorting

The document contains multiple code snippets in C programming language, including functions for mathematical calculations, array manipulation, and Kirchhoff's laws for electrical circuits. It demonstrates reading input, processing arrays, and applying Kirchhoff's Current and Voltage Laws. The code also includes error handling and output formatting for user-friendly display.

Uploaded by

dqt0907
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

#include<stdio.

h>
#include<math.h>
double f(double x){
if (x < 0) return cos(4.5*x*x) + 5*sin(x*x*x - 1); else if (x > 0) return log(x)/log(2) + sqrt(x*x + 5); else return 7;
void printSortArray(double a[], int m){
int i,j;
for (i = 0; i < m - 1; i++){
for (j = i + 1; j < m; j++){
if (a[i] > a[j]){
double temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
for (i = 0; i < m; i++)(
printf("%.4lf ", a(il);

int main(){
double X[250], Y[250], Z(250];
double sumZ = 0;
int m = 0; // m is the array length (Z)
int n;
scanf("%d", &n);
int i;
double k=-1.5;
for (i=0;i<204;i++){
X[i]=k;
k=k+0.5;
}
for (i = 0; i <204; i++){
Y[i] = f(X[i]);
if (Y[i] > n){
Z[m] = Y[i];
sumZ += Z[m];
m++;
}
}
printf("%.4lf\n", sumZ);
printSortArray(Z, m);
return 0;
}

6.2

#include <stdio.h> int main() { int N, k; float x; // Read the number of


elements in the array scanf("%d", &N); // Declare an array to hold the N
float numbers float arr[N + 1]; // We need an extra space for the new
element // Read the N float numbers into the array for (int i = 0; i < N; i+
+) { scanf("%f", &arr[i]); } // Read the position k and the value to insert x
scanf("%d %f", &k, &x); // Check if the position k is valid if (k < 1 || k > N
+ 1) { printf("Error\n"); return 0; } // Insert the element x at the correct
position if (k == N + 1) { arr[N] = x; // Insert at the end if k = N + 1 } else
{ // Shift the elements to the right to make space for the new element for
(int i = N; i >= k; i--) { arr[i] = arr[i - 1]; } arr[k - 1] = x; // Insert x at
position k (0-indexed in array) } // Print the updated array with rounded
values for (int i = 0; i < N + 1; i++) { printf("%.1f ", arr[i]); } printf("\n");
return 0; }
#include<stdio.h>;
int main (
int n;
double x, sum=1;
scanf("%d", &n);
scanf("%lf", 8x);
if(n<=0) printf("'Error");
else{
for(int i=1;i<=n;i++)
sum+=pow(x, i);
printf("%.4|f", sum);
return 0;

For node a:

I1+I2−I3=0

For node b:

I3−I4−I5=0

For node c:

I4+I5−I6=0

here you are

Great! Let's write Kirchhoff's equations for the given circuit.

Kirchhoff's Current Law (KCL)

For node aa:

I1+I2−I3=0I_1 + I_2 - I_3 = 0

For node bb:

I3−I4−I5=0I_3 - I_4 - I_5 = 0

For node cc:

I4+I5−I6=0I_4 + I_5 - I_6 = 0

Kirchhoff's Voltage Law (KVL)

For the loop containing R1R1, R2R2, and E1E1:

E1−I1R1−I2R2=0E1 - I_1R1 - I_2R2 = 0

For the loop containing R3R3, R4R4, and E2E2:

E2−I3R3−I4R4=0E2 - I_3R3 - I_4R4 = 0

For the loop containing R5R5, R6R6, and E5E5:


E5−I5R5−I6R6=0

E1−I1R1−I2R2=0E1

E2−I3R3−I4R4=0E2

E5−I5R5−I6R6=0

You might also like