CSE 101 CT-2

 #Only printing something , this kind of function '' void func(){ //code


}'



 Function://

return_type function_name(parameter_list) {

    // body of the function

    return value;  // if return_type is not void

}



int getFive() {

    return 5;

}   //// a type of func;



#Declaring global variable:

#include <stdio.h>


int score = 0; // 🌍 Global variable


void increaseScore() {

    score += 10;

}


void showScore() {

    printf("Score: %d\n", score);

}


int main() {

    increaseScore();

    increaseScore();

    showScore(); // Output: Score: 20

    return 0;

}


Problems:

#lcd, bcd;

#Fibonacci;

#Factor, true factor ;


/*Write down a function that will take a
number n as a parameter and return nth Fibonacci number. In your main
function take a number N as user input
and use this function, to show N-th
Fibonacci number.*/

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

 int check_prime(int n)
 {
    if(n<2){return 0;}
    else if (n==2){return 1;}
    else if(n%2==0){return 0;}
    else {
    int limit = sqrt(n);
    for(int i=3; i<=limit; i+=2)
    {
        if(n%i==0){return 0;}
   
    }
   return 1;
 }
}

int how_times(int a,int b)
{ int count =0;
    while(a>0)
    {
        if(a%b==0){count ++;}
        a=a/b;
    }
    return count;
}



void div_func(int a){

    for(int i=2; i<=a/2; i++)
    {
        if(a%i==0 && check_prime(i)){printf("%d(%d) ", i, how_times(a, i));}
    }
}

int main()
{

    div_func(28);
}


#smax logic in Array :


for(int i=0; i<n ;i++){
    if(arr[i]>max){ smax= max;max = arr[i]; }
   
else if(arr[i]>smax && arr[i]!=max){smax=arr[i];}
   
}




# distinct elements:

int k=0; int new_arr[100];
 for (int i = 0; i < n; i++) {
    int count = 0;
    for (int j = 0; j <i; j++) {
        if ( arr[i] == arr[j] && i!=j) {
            count=1;
            break;
        }
    }
    if (count == 0) {
        new_arr[k++] = arr[i];
    }
}
    for(int i=0; i<k; i++)
    {
        printf("%d ", new_arr[i]);
    }



# right side 

#include <stdio.h>
#include <stdlib.h>
int main()
{
    int n;
    scanf("%d", &n);
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &arr[i]);
    }//1 2 3 4 5   4 5 1 2 3

    int position;
    scanf("%d", &position);
    int temp[position];

    for (int i = 0; i < position; i++)
    {
        temp[i] = arr[n-position+i];
    }

    for (int i = n-position-1; i >= 0; i--)//2 1 0   432 2 1 0
    {
        arr[i+position] = arr[i];
    }

    for (int i = 0; i < position; i++)
    {
        arr[i]=temp[i];
    }

   for (int i = 0; i < n; i++)
    {
        printf("%d ", arr[i]);
    }

}


#binary search

int binarySearch(int arr[], int n, int target)
{
     int low=0; int high= n-1; int mid;
     while(low<=high)
     {mid= (low+high)/2;
        if(arr[mid]==target){
            return mid;
        }
        else if(target<arr[mid])
        high= mid-1;
        else low = mid+1;
     }  

     return 0;
}


Types of Func:

Type Description Example
✅ Function with arguments and return value Takes input, returns result int add(int a, int b)
✅ Function with arguments and no return value Takes input, just performs a task void printSum(int a, int b)
✅ Function without arguments but with return value No input, returns a result int getRandom()
✅ Function without arguments and no return value No input or output, just does something void greet()

Comments

Post a Comment

Popular posts from this blog

Phy 129 - WM, CT-03

  Statement : For position ( x x x ) and momentum ( p p p ), the uncertainty principle is: Δ x ⋅ Δ p ≥ ℏ 2 \Delta x \cdot \Delta p \geq \frac{\hbar}{2} Δ x ⋅ Δ p ≥ 2 ℏ ​ where Δ x \Delta x Δ x is the uncertainty in position, Δ p \Delta p Δ p is the uncertainty in momentum, and ℏ ≈ 1.05 × 1 0 − 34   J \cdotp s \hbar \approx 1.05 \times 10^{-34} \, \text{J·s} ℏ ≈ 1.05 × 1 0 − 34 J \cdotp s . Similarly, for energy ( E E E ) and time ( t t t ): Δ E ⋅ Δ t ≥ ℏ 2 \Delta E \cdot \Delta t \geq \frac{\hbar}{2} Δ E ⋅ Δ t ≥ 2 ℏ ​ . #Learning -2 p = γ m v p = \gamma m v p = γm v , where: m m m is the rest mass of the particle, v v v is the velocity of the particle, γ \gamma γ is the Lorentz factor, given by γ = 1 1 − v 2 c 2 \gamma = \frac{1}{\sqrt{1 - \frac{v^2}{c^2}}} ; A wave group: a wave group corresponds to a moving particle and is formed by the superposition of multiple harmonic waves with different frequencies, wave numbers, and amplitudes.\ Wave Function Ψ ( x ) \Psi(x)...
Read more
Copy of Jujutsu Kaisen 2D Game UI Design Request                                                                                                                                                                ...
Read more

Online 3 CSE 102; Array Resources.

 Problems and their solution: Practice Problems on “Array” (MOODLE) Problem 1: Floor, Ceil within an array              A[] = {96, 21, 58, 34, 46} Number Floor Ceil 15 -1 21 21 21 21 30 21 34 96 96 96 98 96 -1 Solution: Sort them, then find floor and ceil from the array. Use selection sort: void selectionSort(int arr[], int n) {     int i, j, minIndex, temp;     for (i = 0; i < n - 1; i++) {         minIndex = i;         // Find the index of the smallest element in the remaining array         for (j = i + 1; j < n; j++) {             if (arr[j] < arr[minIndex])                 minIndex = j;         }         // Swap the found minimum element with the first element         if (minIndex != i) {    ...
Read more