BT 4

 // SPDX-License-Identifier: MIT

pragma solidity ^0.8.0;

contract StudentRegistry {

    // Structure to store student data

    struct Student {

        string name;

        uint256 age;

    }

    // Array to store multiple students

    Student[] private students;

 

    // Event to log Ether received

    event ReceivedEther(address indexed sender, uint256 value);

 

    // Receive function to accept Ether

    receive() external payable {

        emit ReceivedEther(msg.sender, msg.value);

    }

    // Fallback function

    fallback() external payable {

        emit ReceivedEther(msg.sender, msg.value);

    }

    // Function to add student data

    function addStudent(string memory name, uint256 age) public {

        students.push(Student(name, age));

    }

    // Function to get student by index

    function getStudent(uint256 index) public view returns (string memory, uint256) {

        require(index < students.length, "Student not found");

        return (students[index].name, students[index].age);

    }

    // Function to get total number of students

    function getStudentCount() public view returns (uint256) {

        return students.length;

    }

}

Comments

Post a Comment

Popular posts from this blog

DAA 1

CODE   # Iterative Fibonacci with step counter def fib_iterative(n):     steps = 0     if n == 0:         steps += 1         return 0, steps     elif n == 1:         steps += 1         return 1, steps          a, b = 0, 1     for i in range(2, n + 1):         steps += 1         a, b = b, a + b     return b, steps n = int(input("Enter n: ")) result, steps = fib_iterative(n) print(f"Fibonacci({n}) = {result}") print(f"Step count (iterative) = {steps}") # Recursive Fibonacci with step counter steps = 0  # global step counter def fib_recursive(n):     global steps     steps += 1  # count each call as a step     if n == 0:         return 0     elif n == 1:         return 1     else:     ...
Read more

DAA 4

CODE # 8-Queens Problem using Backtracking  N = 8 def printBoard(board):     for row in board:         print(row) def isSafe(board, row, col):     for i in range(row):         if board[i][col] == 1 or \            (col - (row - i) >= 0 and board[i][col - (row - i)] == 1) or \            (col + (row - i) < N and board[i][col + (row - i)] == 1):             return False     return True def solve(board, row):     if row == N:         print("\nFinal 8-Queens Matrix:")         printBoard(board)         return True     for col in range(N):         if isSafe(board, row, col):             board[row][col] = 1             if solve(board, row + 1):       ...
Read more