Dsa Lab 1 by Syed
Dsa Lab 1 by Syed
Bahria University,
Karachi Campus
Submitted By:
Submitted To:
INDEX
SN DATE LAB LAB OBJECTIVE SIGN
O NO
Bahria University,
Karachi Campus
e. Determinant
f. Inverse
Submitted On:
____10/10/23_ __
LAB 1
TASK 1: Find all pair of elements whose sum is 25.
SOLUTION:
namespace ConsoleApp5
{
internal class Program
{
static void Main(string[] args)
{
Console.ReadLine();
}
}
}
OUTPUT:
TASK 2: Find the number of elements of A which are even, and the number of
elements of A which are odd.
SOLUTION:
namespace ConsoleApp5
{
internal class Program
{
static void Main(string[] args)
{
int[] A = { 46, 13, 6, 1, 56, 8, 2, 76 };
for (int i = 0; i < A.Length; i++)
{
if (A[i] % 2 == 0)
{
Console.WriteLine("Even value");
}
else
{ Console.WriteLine("Odd value"); }
}
}
}
}
OUTPUT:
}
OUTPUT:
2D ARRAYS
TASK 1: Write a program which input 2 matrix of user defined rows and columns
and perform following operation.
SOLUTION:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace ConsoleApp7
{
internal class Program
{
}
case 'm':
{
Determinant();
break;
}
case 'b':
{
Inverse();
break;
}
default:
{
Console.WriteLine("Invalid Input!");
break;
}
}
}
static void Display()
{
Console.WriteLine("\nFirst Matrix according to your given values:");
for (int i = 0; i < row1; i++)
{
for (int j = 0; j < col1; j++)
{
Console.Write(first[i, j] + "\t");
}
Console.WriteLine();
}
Console.WriteLine("\nSecond Matrix according to your given values:");
for (int i = 0; i < row2; i++)
{
for (int j = 0; j < col2; j++)
{
Console.Write(second[i, j] + "\t");
}
Console.WriteLine();
}
}
static void Add()
{
for (int i = 0; i < row1; i++)
{
for (int j = 0; j < col1; j++)
{
resultMul[i, j] = first[i, j] + second[i, j];
Console.Write(resultMul[i, j] + "\t");
}
Console.WriteLine();
}
}
static void Subtract()
{
for (int i = 0; i < row1; i++)
{
for (int j = 0; j < col1; j++)
{
resultMul[i, j] = first[i, j] - second[i, j];
Console.Write(resultMul[i, j] + "\t");
}
Console.WriteLine();
}
}
static void Multiply()
{
for (int i = 0; i < row1; i++)
{
for (int j = 0; j < col1; j++)
{
resultMul[i, j] = first[i, j] * second[i, j];
Console.Write(resultMul[i, j] + "\t");
}
Console.WriteLine();
}
}
static void Determinant()
{
Console.WriteLine("Only valid for 2x2 Matrix...");
int determinant1 = (first[0, 0] * first[1, 1]) - (first[0, 1] * first[1, 0]);
int determinant2 = (second[0, 0] * second[1, 1]) - (second[0, 1] * second[1, 0]);
Console.WriteLine("Determinant of first matrix is: " + determinant1);
Console.WriteLine("Determinant of second matrix is: " + determinant2);
}
static void Inverse()
{
double determinant1 = (first[0, 0] * first[1, 1]) - (first[0, 1] * first[1, 0]);
if (determinant1 == 0)
{
Console.WriteLine("Inverse of the matrix 1 is not possible because the determinant is singular");
}
else
{
double[,] inverse1 = new double[2, 2];
inverse1[0, 0] = first[1, 1] / determinant1;
inverse1[0, 1] = -first[0, 1] / determinant1;
inverse1[1, 0] = -first[1, 0] / determinant1;
inverse1[1, 1] = first[0, 0] / determinant1;
}
else
{
double[,] inverse2 = new double[2, 2];
inverse2[0, 0] = second[1, 1] / determinant2;
inverse2[0, 1] = -second[0, 1] / determinant2;
inverse2[1, 0] = -second[1, 0] / determinant2;
inverse2[1, 1] = second[0, 0] / determinant2;
}
OUTPUT:
int choice;
if (int.TryParse(Console.ReadLine(), out choice))
{
switch (choice)
{
case 1:
AddItem();
break;
case 2:
RemoveItem();
break;
case 3:
ListInventory();
break;
case 4:
CheckQuantity();
break;
case 5:
exit = true;
break;
default:
Console.WriteLine("Invalid choice. Please try again.");
break;
}
}
else
{
Console.WriteLine("Invalid input. Please enter a number.");
}
}
}
{
Console.Write("Enter the item name to remove: ");
string itemName = Console.ReadLine();
int index = Array.IndexOf(inventory, itemName);
if (index >= 0)
{
for (int i = index; i < itemCount - 1; i++)
{
inventory[i] = inventory[i + 1];
quantities[i] = quantities[i + 1];
}
itemCount--;
Console.WriteLine("Item removed from inventory.");
}
else
{
Console.WriteLine("Item not found in inventory.");
}
}
}
}
OUTPUT: