xxxxxxxxxx
#include <stdio.h>
int main()
{
char ch;
printf("Enter any character: ");
scanf("%c", &ch);
if((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z'))
{
printf("'%c' is alphabet.", ch);
}
else if(ch >= '0' && ch <= '9')
{
printf("'%c' is digit.", ch);
}
else
{
printf("'%c' is special character.", ch);
}
return 0;
}
xxxxxxxxxx
#include<bits/stdc++.h>
using namespace std;
int main()
int n,i,sum=0;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
for(i=0;i<n;i++)
{
int z= arr[n-i-1]-(i+1);
//cout<<z<<" ";
//cout<<abs(z);
sum=sum+abs(z);
}
cout<<sum;
return 0;
cout<<"swap(l,r);
}
xxxxxxxxxx
#include<stdio.h>
#define SIZE 5
void enQueue(int);
void deQueue();
void display();
int queue[10], front = -1, rear = -1;
void main() {
int value, choice;
while(1){
printf("\n\n***** MENU *****\n");
printf("1. Insertion\n2. Deletion\n3. Display\n4. Exit");
printf("\nEnter your choice: ");
scanf("%d",&choice);
switch(choice){
case 1: printf("Enter the value to be insert: ");
scanf("%d",&value);
enQueue(value);
break;
case 2: deQueue();
break;
case 3: display();
break;
case 4: exit(0);
default: printf("\nWrong selection!!! Try again!!!");
}
}}
void enQueue(int value){
if(rear == SIZE-1)
printf("\nQueue is Full!!! Insertion is not possible!!!");
else{
if(front == -1)
front = 0;
rear++;
queue[rear] = value;
printf("\nInsertion success!!!");
}}
xxxxxxxxxx
/**
Name : Md. Asaddozjaman
Id No : 212902042
**/
#include <stdio.h>
int RecursiveLS(int arr[], int value, int index, int size)
{
int pos = 0;
if(index >= size)
{
return 0;
}
else if (arr[index] == value)
{
pos = index + 1;
return pos;
}
else
{
return RecursiveLS(arr, value, index+1, size);
}
return pos;
}
int main()
{
int size, value, pos, m = 0, arr[100];
printf("\nEnter the size of array: ");
scanf("%d", & size);
for (int i = 0; i < size; i++)
{
printf("\nEnter your elements: \n");
scanf("%d", &arr[i]);
}
printf("Enter the element to search ");
scanf("%d", &value);
pos = RecursiveLS(arr, value, 0, size);
if (pos != 0)
{
printf("Element found: %d ", pos);
}
else
{
printf("Element not found...!");
}
return 0;
}
xxxxxxxxxx
/******************************************************************************
Md Shajid Hossain
ID:213902074
*******************************************************************************/
#include <stdio.h>
int main()
{
int n, FirstDigit, DigitsCount, LastDigit, a, b, SwapNum;
printf("\n Please Enter any Number that you wish : ");
scanf("%d", & n);
DigitsCount = log10(n);
FirstDigit = Number / pow(10, DigitsCount);
LastDigit = Number % 10;
a = FirstDigit * (pow(10, DigitsCount));
b = Number % a;
Number = b / 10;
SwapNum = LastDigit * (pow(10, DigitsCount)) + ( n * 10 + FirstDigit);
printf(" \n The Number after Swapping First Digit and Last Digit = %d", SwapNum);
return 0
}
xxxxxxxxxx
def search (list1,key):
for i in range (len(list1)):
if key == list1[i]:
print("key element is found")
break
else:
print("element is not found")
list1 = [34,87,65,98,9,56]
print(list1)
key=int(input("enter the key element:"))
search(list1,key)
xxxxxxxxxx
#include <stdio.h>
int main()
{int n;
int tot_square;
scanf("%d",&n);tot_square=(n*(n+1)/2)*(2*n+1)/3;
printf("%d",tot_square);
return 0;
}
xxxxxxxxxx
#include <stdio.h>
#include <conio.h>
int main()
{
int unit;
float amt, total_amt, sur_charge;
clrscr ();
printf("\n 1.For first 50 units Rs. 0.50/unit \n 2.For next 100 units Rs. 0.75/unit \n 3.For unit above 250 Rs. 1.50/unit");
printf("\n An additional surcharge of 20 percentage is added to the bill");
printf("\n\nEnter total units consumed: ");
scanf("%d", &unit);
if(unit <= 50)
{
amt = unit * 0.50;
}
else
if(unit <= 150)
{
amt = 25 + ((unit-50) * 0.75);
}
else
if(unit <= 250)
{
amt = 100 + ((unit-150) * 1.20);
}
else
{
amt = 220 + ((unit-250) * 1.50);
}
sur_charge = amt * 0.20;
total_amt = amt + sur_charge;
printf("Electricity Bill = Rs. %.2f", total_amt);
getch();
}
xxxxxxxxxx
template<class T>
//swap() will swap the given two nodes
Chain<T> &Chain<T>::Swap(int n1, int n2) {
ChainNode<T> *prevNode1 = NULL, *prevNode2 = NULL, *node1 = first, *node2 = first;
//Checks if list is empty
if (IsEmpty())
throw OutOfBounds();
//If n1 and n2 are equal, then list will remain the same
if (n1 == n2)
throw OutOfBounds();
//Search for node1
while (node1 != NULL && node1->data != n1) {
prevNode1 = node1;
node1 = node1->link;
}
//Search for node2
while (node2 != NULL && node2->data != n2) {
prevNode2 = node2;
node2 = node2->link;
}
if (node1 != NULL && node2 != NULL) {
//If previous node to node1 is not null then, it will point to node2
if (prevNode1 != NULL)
prevNode1->link = node2;
else
first = node2;
//If previous node to node2 is not null then, it will point to node1
if (prevNode2 != NULL)
prevNode2->link = node1;
else
first = node1;
//Swaps the next nodes of node1 and node2
ChainNode<T> *temp = node1->link;
node1->link = node2->link;
node2->link = temp;
} else {
cout << "Swapping is not possible" << endl;
}