Recent projects

/* LAB 5: Measuring Memory Usage per Function Call Concept: - Use getrusage() to check memory usage. - Compare memory before and after calling functions. - Demonstrates stack vs heap memory impact. */ #include <stdio.h> #i

vector <- C (1, 2, 3); Class (v);

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void main(String[] args) { System.out.println("Hello world!"); } }

import numpy as np import matplotlib.pyplot as plt class LinearRegressionScratch: def __init__(self, learning_rate=0.01, n_iters=1000): self.lr = learning_rate self.n_iters = n_iters self.weights = None self.bias

import numpy as np from scipy.io import wavfile from scipy.signal import butter, lfilter # 1. 基本設定（サンプリングレートと時間） sample_rate = 44100 # CDクオリティの音質 duration = 10.0 # 音声の長さ（10秒間） t = np.linspace(0, duration, int(sample_rate * duration), endpoint

/* LAB 4: Spanning Tree using BFS Concept: - A spanning tree connects all nodes without cycles. - BFS is used to traverse the graph level-by-level. - Every time we visit a new node, we print the edge (parent -> child). */

import numpy as np from scipy.io import wavfile from scipy.signal import butter, lfilter # 1. 基本設定（サンプリングレートと時間） sample_rate = 44100 # CDクオリティの音質 duration = 10.0 # 音声の長さ（10秒間） t = np.linspace(0, duration, int(sample_rate * duration), endpoint

#include <stdio.h> #include <stdlib.h> #include <time.h> /* ========================================================== [랜덤 동물 카드 짝 맞추기 프로그램] 강아지, 고양이, 토끼 카드가 각각 2장씩 있습니다. 6장의 카드를 무작위로 섞은 후 두 개의 카드 번호를 선택합니다.

package day1; public class Sample102 { public static void main(String[] args) { // 数値の表示 System.out.print(123); System.out.println(456); // 文字列の表示 System.out.print("ABC");

% Generate AM Signal Am = 5; % Carrier amplitude Ac = 10; % Message amplitude fm = 100; % Message frequency (Hz) fc = 1000; % Carrier frequency (Hz) fs = 10000; % Sampling frequency (Hz) t = 0:1/fs:0.05;

#include <stdio.h> #include <stdlib.h> #include <time.h> int main(void) { srand(time(NULL)); // ==================================================

# ============================================ # Archivo: Ex12B_adivina_número_material_4 # Autor: Génesis Amaya # Fecha: 21/07/2026 # Curso: U3 - Python # Descripción: Juego para adivinar un número aleatorio. # =====================================

/* LAB 3: Heap Memory Demonstration Concept: - malloc() allocates memory from the heap. - Memory stays allocated until free() is called. - Useful for dynamic arrays and variable-sized data. */ #include <stdio.h> #include <

/* LAB 2: Stack Memory Demonstration Concept: - Local variables are stored in the stack. - Stack memory is reused every time a function is called. - The address of 'x' will be similar across calls. */ #include <stdio.h>

local Rayfield = loadstring(game:HttpGet('https://sirius.menu/rayfield'))() local Window = Rayfield:CreateWindow({ Name = "부대 테러 스크립트", Icon = 0, -- Icon in Topbar. Can use Lucide Icons (string) or Roblox Image (number). 0 to use no icon (def

/* LAB 1: Simulating OOP in C Concept: C has no classes, but we can mimic OOP using structs + function pointers. Features: - "Student" acts like a class - Fields: name, grade - Methods: printInfo(), updateGrade() */ #i

program kadai14_1 implicit none integer :: n character (len = 1) :: a = 'A', b = 'B', c = 'C' read *, n call hanoi(n, a, b, c) END program kadai14_1 recursive subroutine hanoi(i, x, y, z) impl

#include <stdio.h> int main() { printf("Hello world!\n"); return 0; }

program kadai14_1 implicit none integer :: n character (len = 1) :: a = 'A', b = 'B', c = 'C' read *, n call hanoi(n, a, b, c) END program kadai14_1 recursive subroutine hanoi(i, x, y, z) impl

#include<iostream> using namespace std; int main(){ int n,num; cin>>n; for(int i=0;i<n;i++){ for(int j=0;j<n-i-1;j++){ cout<<' '; } num=1;