BSC Compsci Practical 2023-24
BSC Compsci Practical 2023-24
The fairy tales we deserve the disney stories that enchant us today are drawn from ancient,
worldwide folk tradition. some folklorists believe that "cinderella" in its most basic form--
neglected youngest child is tested, found worthy, rewarded with mate--dates back to the old
stone age. cinderella folk versions of "cinderella" were related in hundreds of societies. in
these stories, the "test" for the unfortunate child is different. our familiar cinderella is
beautiful and has tiny feet. by contrast, the japanese cinderella gets her prince by writing a
prize-winning poem. other fairytales include:
In these stories, the "test" for the unfortunate child is different. our familiar cinderella is
beautiful and has tiny feet. By contrast, the japanese cinderella gets her prince by writing a prize-
winning poem.
8) Add a header to the document and write your name and surname.
December 2013-14
Surname Name Test Old RunRate Run’s
RESUME
M.Kashif Nihal
Dist.Amravati Pin:-444607
E-mail:[email protected]
PERSONAL DETAILS:-
Date of Birth:-5/9/1999
Contact No:-9022031346
Nationality:-Indian
Cast:-Open-
Language;-Marathi,Hindi,Urdu,English
Marriage Status:-Single
Educational Profile:-12th
Grandparents
Child 1 Child 2
6
5
4
Transport
3
Transport
2
Taxes
1
0
2012-13 2013-14 2014-15 2015-16
preliminary
investigation
System
System Analysis
Implementation
System System
Development Design
6
6. Create MS excel document to calculate the total and average area and
population of district.
2265.333 1332256
Average
8
Employee Name:
Designation
Month/ Year
Earning Deduction
Signature of Candidate
Date: / /
9
marks out of
obtained 600
percentage
588
98
10
OUTPUT:-
before swapping
x=10
y=20
after swapping
x=20
y=10
11
#include<stdio.h>
#include<conio.h>
void main()
{
int r;
float pi=3.14,area,ci;
clrscr();
printf(“enter radius of circle:”);
scanf("%d", &r);
area=pi*r*r;
printf(“area of circle=%f”,area);
ci=2*pi*r;
printf(“circumference of circle=%f”,ci);
getch();
}
OUTPUT:-
OUTPUT:-
......................................................................................................................................................
enter the value of n9
the given no. odd=9
13
OUTPUT:-
Enter the value of principle amount (p)
3000
Enter the value of rate (r) 5
Enter the value of period (n) 3
Simple interest=450.000000
Compound interest=472.875000
14
#include<stdio.h>
#include<conio.h>
void main()
{
int n,i=1,fact=1;
clrscr();
printf("enter any no.=>\n");
scanf("%d",&n); while(i<=n)
{
fact=fact*i;
i++;
}
printf("\nfactorial of a no.=%d",fact);
getch();
}
OUTPUT:-
factorial of a no.=120
15
#include<stdio.h>
#include<conio.h>
void main()
{
char ch;
clrscr();
printf("press any key=>");
ch=getchar();
if(isalpha(ch)>0)
printf("a character is alphabet");
elseif(isdigit(ch)>0)
printf("a character is digit");
else
printf("a character is any other special character");
getch();
}
OUTPUT:-
a character is alphabet
16
OUTPUT:-
enter two number : 4
8
enter your choice : 1
addition=32
17
OUTPUT:
OUTPUT:
1 2 3 4 5 6 7 8 9 10
10 20 30 40 50 60 70 80 90 100
19
18. WAP in C to find the largest element in one dimensional array and also
print its position.
#include<stdio.h>
#include<conio.h>
void main()
{
int a[10],i,max,pos,n;
clrscr();
printf(“how many numbers you want to input:)”;
scanf(“%d”,&n);
printf(“enter %d numbers\n”,n);
for(i=0;i<n;i++)
scanf(“%d”,&a[i]);
max=a[0];
for(i=0;i<n;i++)
{
if(max<a[i])
{
max=a[i];
pos=i;
}
}
printf(“\nbiggest no in array id %d”,max); printf(“\
nposition of biggest in array is %d”,pos+1); getch();
}
OUTPUT:
How many numbers you want to input: 5
Enter 5 Numbers
12
45
23
43
34