Algoritmik tillar va dasturlash Fanidan bajargan topshiriqlar toplami. Mavzular

26-mavzu:Statik berilganlardan foydalanish. Statik metodlar bilan ishlash.

13. Ikki o’lchamli massiving eng katta va eng kichik qiymatlarini topuvchi rekursiv funksiya tuzing.

using System;

namespace Amaliyot

{

class mass

{
public static int[,] a = new int[3,3];

public static void print()

{
int max;
max = mass.a[0,0];
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
if (a[i, j] > max)
{
max = a[i, j];
}
Console.Write(a[i, j] + " ");
}
Console.WriteLine();
}
Console.WriteLine();
Console.WriteLine("Max: " + max);
Console.WriteLine();
}
}
class mass2
{
public static int[,] n = new int[3, 3];

public static void print()

{
int min;
min = mass2.n[0, 0];
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
if (n[i, j] < min)
{
min = n[i, j];
}
Console.Write(n[i, j] + " ");
}
Console.WriteLine();
}
Console.WriteLine();
Console.WriteLine("Min= " + min);
}
}
class Program
{
static void Main(string[] args)
{
Random a1 = new Random();
Random n1 = new Random();
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
mass.a[i, j] = a1.Next(1,50);
}
}
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
mass2.n[i, j] = n1.Next(1, 50);
}
}
mass.print();
mass2.print();

}
}
}

27-Mavzu:Nomlar fazosidan foydalanish.
13. Doira sinfini yarating. Unda kamida 5 ta maydon va ularni ekranga chiqaruvchi, qayta ishlovchi usullarni yarating.
using System;
using Doira;

namespace Amaliyot

{
class Program
{
static void Main(string[] args)
{
Doira1 Key1 = new Doira1();
Key1.Yuzi = 125;
Key1.radiusi = 25;
Key1.nomi = "Doira";
Key1.rangi = "qizil";
Key1.uzunligi = 150;
Key1.Print();
}
}
}
namespace Doira
{
class Doira1
{
public double Yuzi;
public int radiusi;
public string nomi;
public string rangi;
public double uzunligi;
public void Print()
{
Console.WriteLine("Yuzi: " + Yuzi);
Console.WriteLine("radiusi: " + radiusi);
Console.WriteLine("Nomi: " + nomi);
Console.WriteLine("Rangi: " + rangi);
Console.WriteLine("uzunligi: " + uzunligi);
}
}
}