├── JAVA Practise
├── manu.js
└── 1.java
├── 2022 New folder
├── patient.txt
├── 1.exe
├── New.exe
├── arr.exe
├── cc1.exe
├── menu.exe
├── p1.exe
├── sam0.exe
├── menu1.exe
├── Untitled1.exe
├── Untitled2.exe
├── HospitalManagement.exe
├── Hospital Management 2101020451 Mahendra Singh.docx
├── Hospital Management 2101020451 Mahendra Singh.rar
├── Untitled2.cpp
├── New.cpp
├── menu1.cpp
├── .vscode
│ ├── tasks.json
│ └── launch.json
├── arr.cpp
├── cc1.cpp
├── stack.cpp
├── sipl.cpp
├── menu.cpp
├── sam0.cpp
├── 1.c
├── Untitled1.cpp
└── HospitalManagement.c
├── 2101020451 CIT21075
├── fghjk.c
├── patient.txt
├── a.exe
├── CHECK.exe
├── DEV.exe
├── Mannu.exe
├── Table.exe
├── Var.exe
├── fghjk.exe
├── new.exe
├── wrong.exe
├── RESULT.exe
├── remeber.exe
├── Function.exe
├── Manu singh.exe
├── Untitled1.exe
├── tutorial.exe
├── practicsfile.exe
├── .vscode
│ ├── DELETEme.c
│ ├── tasks.json
│ └── launch.json
├── Mannu_project.exe
├── tempCodeRunnerFile.c
├── tutorial.c
├── RESULT.c
├── wrong.c
├── PYTHON.py
├── practicsfile.c
├── new.c
├── Table.c
├── remeber.c
├── Manu singh.cpp
├── IRON_MAN.py
├── Mannu_project.c
├── as.py
├── Function.c
├── Untitled1.cpp
├── Mannu.c
├── DEV.c
├── Var.c
└── CHECK.c
├── NEW
├── New Text Document.txt
├── New Text Document - Copy.txt
├── New Text Document - Copy (3).txt
├── New Text Document - Copy (4).txt
├── New Text Document - Copy (5).txt
├── New Text Document - Copy (6).txt
├── New Text Document - Copy (7).txt
├── Again.exe
├── P Queue.exe
├── P Queue.c
└── Again.c
├── Websites Practice
├── action.php
├── .vscode
│ └── settings.json
├── OIP.jpg
├── Itachi.jpg
├── img
│ ├── 927025.png
│ ├── favicon.ico
│ ├── favicon-16x16.png
│ └── favicon-32x32.png
├── Theatre Green Screen meme template - Audience cheering in theatre green screen meme template.mp4
├── Hackathon.html
├── computer.html
├── practice.css
├── index.css
├── Practice.html
├── new.html
├── index.html
├── WEBSITES.css
└── Websites.html
├── Mannu.exe
├── Web
├── .vscode
│ └── settings.json
├── OIP.jpg
├── MODI.jpg
├── OIP (1).jpg
├── OIP (2).jpg
├── download.jpg
├── facebook.png
├── logo_new.png
├── twitter.jpg
├── twitter.png
├── logo
│ ├── Subject.png
│ ├── letter-n.png
│ ├── linkedin.png
│ ├── sign-in.png
│ ├── twitter.png
│ ├── youtube.png
│ ├── pinterest.png
│ ├── INTER-removebg-preview.png
│ └── add-people-interface-symbol-of-black-person-close-up-with-plus-sign-in-small-circle.png
├── AICTE-removebg-preview.png
├── Screenshot 2022-03-15 191638.png
├── Divy.css
├── Hack.css
└── Trial.htm
├── n
├── DS.exe
├── tempCodeRunnerFile.exe
├── tempCodeRunnerFile.c
├── .vscode
│ ├── c_cpp_properties.json
│ ├── launch.json
│ └── settings.json
├── an.css
├── DS.c
├── Animation.html
├── choosing.py
└── mannu.py
├── 2nd Year
├── a.exe
├── DSLAB.exe
├── Fail.exe
├── Func.exe
├── Learn.exe
├── chef.class
├── Codechef.exe
├── .vscode
│ ├── c_cpp_properties.json
│ ├── settings.json
│ ├── launch.json
│ └── tasks.json
├── Codechef.c
├── Fail.c
├── Learn.c
├── chef.java
├── DSLAB.c
└── Func.c
├── Mannu.py
├── Mannu.cpp
├── .vscode
├── tasks.json
└── launch.json
├── Python
└── cc.py
├── Mannu.c
└── Python Pro
└── Matrix_Cal.py
/JAVA Practise/manu.js:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/2022 New folder/patient.txt:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/fghjk.c:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/NEW/New Text Document.txt:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/patient.txt:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/NEW/New Text Document - Copy.txt:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/NEW/New Text Document - Copy (3).txt:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/NEW/New Text Document - Copy (4).txt:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/NEW/New Text Document - Copy (5).txt:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/NEW/New Text Document - Copy (6).txt:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/NEW/New Text Document - Copy (7).txt:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/Websites Practice/action.php:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/Mannu.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Mannu.exe
--------------------------------------------------------------------------------
/Web/.vscode/settings.json:
--------------------------------------------------------------------------------
1 | {
2 | "liveServer.settings.port": 5502
3 | }
--------------------------------------------------------------------------------
/n/DS.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/n/DS.exe
--------------------------------------------------------------------------------
/Web/OIP.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/OIP.jpg
--------------------------------------------------------------------------------
/2nd Year/a.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2nd Year/a.exe
--------------------------------------------------------------------------------
/NEW/Again.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/NEW/Again.exe
--------------------------------------------------------------------------------
/Web/MODI.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/MODI.jpg
--------------------------------------------------------------------------------
/NEW/P Queue.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/NEW/P Queue.exe
--------------------------------------------------------------------------------
/Web/OIP (1).jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/OIP (1).jpg
--------------------------------------------------------------------------------
/Web/OIP (2).jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/OIP (2).jpg
--------------------------------------------------------------------------------
/Web/download.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/download.jpg
--------------------------------------------------------------------------------
/Web/facebook.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/facebook.png
--------------------------------------------------------------------------------
/Web/logo_new.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo_new.png
--------------------------------------------------------------------------------
/Web/twitter.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/twitter.jpg
--------------------------------------------------------------------------------
/Web/twitter.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/twitter.png
--------------------------------------------------------------------------------
/Websites Practice/.vscode/settings.json:
--------------------------------------------------------------------------------
1 | {
2 | "liveServer.settings.port": 5501
3 | }
--------------------------------------------------------------------------------
/2nd Year/DSLAB.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2nd Year/DSLAB.exe
--------------------------------------------------------------------------------
/2nd Year/Fail.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2nd Year/Fail.exe
--------------------------------------------------------------------------------
/2nd Year/Func.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2nd Year/Func.exe
--------------------------------------------------------------------------------
/2nd Year/Learn.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2nd Year/Learn.exe
--------------------------------------------------------------------------------
/2nd Year/chef.class:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2nd Year/chef.class
--------------------------------------------------------------------------------
/2022 New folder/1.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/1.exe
--------------------------------------------------------------------------------
/2nd Year/Codechef.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2nd Year/Codechef.exe
--------------------------------------------------------------------------------
/Web/logo/Subject.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo/Subject.png
--------------------------------------------------------------------------------
/Web/logo/letter-n.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo/letter-n.png
--------------------------------------------------------------------------------
/Web/logo/linkedin.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo/linkedin.png
--------------------------------------------------------------------------------
/Web/logo/sign-in.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo/sign-in.png
--------------------------------------------------------------------------------
/Web/logo/twitter.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo/twitter.png
--------------------------------------------------------------------------------
/Web/logo/youtube.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo/youtube.png
--------------------------------------------------------------------------------
/2022 New folder/New.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/New.exe
--------------------------------------------------------------------------------
/2022 New folder/arr.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/arr.exe
--------------------------------------------------------------------------------
/2022 New folder/cc1.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/cc1.exe
--------------------------------------------------------------------------------
/2022 New folder/menu.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/menu.exe
--------------------------------------------------------------------------------
/2022 New folder/p1.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/p1.exe
--------------------------------------------------------------------------------
/2022 New folder/sam0.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/sam0.exe
--------------------------------------------------------------------------------
/Web/logo/pinterest.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo/pinterest.png
--------------------------------------------------------------------------------
/n/tempCodeRunnerFile.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/n/tempCodeRunnerFile.exe
--------------------------------------------------------------------------------
/2022 New folder/menu1.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/menu1.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/a.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/a.exe
--------------------------------------------------------------------------------
/Websites Practice/OIP.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Websites Practice/OIP.jpg
--------------------------------------------------------------------------------
/2022 New folder/Untitled1.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/Untitled1.exe
--------------------------------------------------------------------------------
/2022 New folder/Untitled2.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/Untitled2.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/CHECK.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/CHECK.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/DEV.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/DEV.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/Mannu.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/Mannu.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/Table.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/Table.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/Var.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/Var.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/fghjk.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/fghjk.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/new.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/new.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/wrong.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/wrong.exe
--------------------------------------------------------------------------------
/Websites Practice/Itachi.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Websites Practice/Itachi.jpg
--------------------------------------------------------------------------------
/2101020451 CIT21075/RESULT.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/RESULT.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/remeber.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/remeber.exe
--------------------------------------------------------------------------------
/Web/AICTE-removebg-preview.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/AICTE-removebg-preview.png
--------------------------------------------------------------------------------
/2101020451 CIT21075/Function.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/Function.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/Manu singh.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/Manu singh.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/Untitled1.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/Untitled1.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/tutorial.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/tutorial.exe
--------------------------------------------------------------------------------
/Websites Practice/img/927025.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Websites Practice/img/927025.png
--------------------------------------------------------------------------------
/Websites Practice/img/favicon.ico:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Websites Practice/img/favicon.ico
--------------------------------------------------------------------------------
/2101020451 CIT21075/practicsfile.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/practicsfile.exe
--------------------------------------------------------------------------------
/Web/Screenshot 2022-03-15 191638.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/Screenshot 2022-03-15 191638.png
--------------------------------------------------------------------------------
/Web/logo/INTER-removebg-preview.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo/INTER-removebg-preview.png
--------------------------------------------------------------------------------
/2022 New folder/HospitalManagement.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/HospitalManagement.exe
--------------------------------------------------------------------------------
/2101020451 CIT21075/.vscode/DELETEme.c:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/.vscode/DELETEme.c
--------------------------------------------------------------------------------
/2101020451 CIT21075/Mannu_project.exe:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2101020451 CIT21075/Mannu_project.exe
--------------------------------------------------------------------------------
/Websites Practice/img/favicon-16x16.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Websites Practice/img/favicon-16x16.png
--------------------------------------------------------------------------------
/Websites Practice/img/favicon-32x32.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Websites Practice/img/favicon-32x32.png
--------------------------------------------------------------------------------
/JAVA Practise/1.java:
--------------------------------------------------------------------------------
1 | public class Main {
2 | public static void main(String[] args) {
3 | System.out.println("Hello");
4 | }
5 | }
--------------------------------------------------------------------------------
/2101020451 CIT21075/tempCodeRunnerFile.c:
--------------------------------------------------------------------------------
1 | #include
2 | // int fact(int x){
3 | // for(int i=1;i<=x;++i){
4 | // x*=i;
5 | // return x;
6 | // }
7 | // }
--------------------------------------------------------------------------------
/2022 New folder/Hospital Management 2101020451 Mahendra Singh.docx:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/Hospital Management 2101020451 Mahendra Singh.docx
--------------------------------------------------------------------------------
/2022 New folder/Hospital Management 2101020451 Mahendra Singh.rar:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/2022 New folder/Hospital Management 2101020451 Mahendra Singh.rar
--------------------------------------------------------------------------------
/Mannu.py:
--------------------------------------------------------------------------------
1 | from turtle import*
2 | color("red")
3 | begin_fill()
4 | pensize(3)
5 | left(50)
6 | forward(113)
7 | circle(50,200)
8 | right(140)
9 | circle(50,200)
10 | forward(133)
11 | end_fill()
--------------------------------------------------------------------------------
/Web/logo/add-people-interface-symbol-of-black-person-close-up-with-plus-sign-in-small-circle.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Web/logo/add-people-interface-symbol-of-black-person-close-up-with-plus-sign-in-small-circle.png
--------------------------------------------------------------------------------
/2022 New folder/Untitled2.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | using namespace std;
3 | int Polar(int x){
4 | if(x%2==0){
5 | cout<<" Even";
6 | }
7 | else{
8 | cout<<" ODD";
9 | }
10 | }
11 | int main(int num){
12 | cin>>num;
13 | Polar(num);
14 | return 0;
15 | }
16 |
--------------------------------------------------------------------------------
/Websites Practice/Theatre Green Screen meme template - Audience cheering in theatre green screen meme template.mp4:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/EliteMandy/Programs/HEAD/Websites Practice/Theatre Green Screen meme template - Audience cheering in theatre green screen meme template.mp4
--------------------------------------------------------------------------------
/2022 New folder/New.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | int add(int x, int y){
3 | int c = x+y;
4 | }
5 | int main(int a,int b){
6 | printf("Enter 1st no.: \n");
7 | scanf("%d%d",&a,&b);
8 | int z = add(a,b);
9 | printf("The sum is %d",z);
10 |
11 | return 0;
12 | }
13 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/tutorial.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main(){
3 | int i,x,y=1;
4 | printf("ENTER A NUMBER TO FIND FACTORIAL: \n");
5 | scanf("%d",&x);
6 | for(i=1; i<=x; i++){
7 | y*=i;
8 | }
9 | printf("The factorial of entered number is %d",y);
10 | return 0;
11 | }
--------------------------------------------------------------------------------
/2101020451 CIT21075/RESULT.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main(){
3 | int i,x,y=1;
4 | printf("ENTER A NUMBER TO FIND FACTORIAL: \n");
5 | scanf("%d",&x);
6 | for(i=1; i<=x; i++){
7 | y*=i;
8 | }
9 | printf("The factorial of entered number is %d",y);
10 | return 0;
11 | }
12 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/wrong.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main(){
3 | int number,i;
4 | printf("Enter the number to find the multiplication table: ");
5 | scanf("%d",&number);
6 | printf("The multiplication of number %d ",number);
7 | printf("\n");
8 | for (i = 1; i<=10 ; i++){
9 | printf("%d x %d = %d",number,i,number*i);
10 | printf("\n");
11 | }
12 | return 0;
13 | }
--------------------------------------------------------------------------------
/n/tempCodeRunnerFile.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main(){
3 | int r,c,arr[r][c];
4 | printf("Enter rows and coloumn: \n");
5 | scanf("%d%d",&r,&c);
6 | printf("Enter the Elements: ");
7 | for(int i=0;i
2 | // int main(){
3 | // int t,a,b,c,d;
4 | // scanf("%d",&t);
5 | // for(int i=0;ib && c>d){
9 | // printf("%d",a+c);
10 | // }
11 | // else if(a
20 | int main(){
21 |
22 | }
--------------------------------------------------------------------------------
/2101020451 CIT21075/PYTHON.py:
--------------------------------------------------------------------------------
1 | # print("Hello World");
2 | # x=int(input("Enter any Value: "))
3 | # y=int(input("Enter 2nd value: "))
4 | # # z=int(input("Enter 3rd value: "))
5 | # sum=x+y
6 | # sub=x-y
7 | # multiplication=x*y
8 | # print(sum)
9 | # print(sub)
10 | # print(multiplication)
11 |
12 | # x=int(input("Enter 1st Value"))
13 | # if(x<0):
14 | # print("The value is -ve")
15 | # else:
16 | # print("The value is +ve")
17 |
18 | from turtle import *
19 | forward(30)
20 | left(60)
21 | forward(30)
22 | begin_fill()
23 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/practicsfile.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main(){
3 | int num1,num2,num3,num4,num5;
4 | printf("Your 1st no.\n");
5 | scanf("%d",&num1);
6 | printf("Your 2nd no.\n");
7 | scanf("%d",&num2);
8 | printf("Your 3rd no.\n");
9 | scanf("%d",&num3);
10 | printf("Your 4th no.\n");
11 | scanf("%d",&num4);
12 | printf("Your 5th no.\n");
13 | scanf("%d",&num5);
14 |
15 | int sum = num1+num2+num3+num4+num5;
16 | int Average = (num1+num2+num3+num4+num5)/5;
17 |
18 | printf("The sum of 5 numbers is %d\n",sum);
19 | printf("The Average of 5 numbers is %d\n",Average);
20 |
21 |
22 | return 0;
23 | }
24 |
--------------------------------------------------------------------------------
/n/.vscode/launch.json:
--------------------------------------------------------------------------------
1 | {
2 | "version": "0.2.0",
3 | "configurations": [
4 | {
5 | "name": "C/C++ Runner: Debug Session",
6 | "type": "cppdbg",
7 | "request": "launch",
8 | "args": [],
9 | "stopAtEntry": false,
10 | "externalConsole": false,
11 | "cwd": "d:/VCODES/n",
12 | "program": "d:/VCODES/n/build/Debug/outDebug",
13 | "MIMode": "gdb",
14 | "miDebuggerPath": "gdb",
15 | "setupCommands": [
16 | {
17 | "description": "Enable pretty-printing for gdb",
18 | "text": "-enable-pretty-printing",
19 | "ignoreFailures": true
20 | }
21 | ]
22 | }
23 | ]
24 | }
--------------------------------------------------------------------------------
/2022 New folder/menu1.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | int main(){
3 | int pos,r;
4 | printf("Enter the no. of elemets: ");
5 | scanf("%d",&r);
6 | int arr[r];
7 | for(int i=0;ir || pos<=0){
18 | printf("Enter a Valid Position %d is no the one:: ......",pos);
19 | }
20 | else{
21 | for(int i=r;i>=pos;i--){
22 | arr[i]=arr[i+1];
23 | }
24 |
25 | for(int i=0;i
2 |
3 |
4 |
5 |
6 |
7 | Document
8 |
9 |
10 |
11 | GAMER ZONE !!
12 |
13 |
14 |
15 |
Good bye
16 |
17 | Hello
18 |
19 |
20 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/new.c:
--------------------------------------------------------------------------------
1 | /*#include
2 | int main(){
3 | char percent;
4 | printf("Enter your percent\n");
5 | scanf("%c",&percent);
6 | switch(percent){
7 | case 'A':
8 | printf("You have done great");
9 | break;
10 | case 'B':
11 | printf("You have good command in your chapters");
12 | break;
13 | case 'C':
14 | printf("It just satisfying for you");
15 | break;
16 | default:
17 | printf("Give exam again");
18 | break;
19 |
20 | }
21 | return 0;
22 | }*/
23 |
24 | /*#include
25 | int main(){
26 | int a,i;
27 | printf("Enter a no. to find table\n");
28 | scanf("%d",&a);
29 | for(i=1; i<=10; i++)
30 | printf("%d X %d = %d \n",a,i,a*i);
31 | return 0;
32 | }*/
33 |
--------------------------------------------------------------------------------
/Mannu.cpp:
--------------------------------------------------------------------------------
1 | //#include
2 | //using namespace std; int maxNum(int num 1, int num2);
3 | //int main(){
4 | // int a=10,b=20;
5 | // int ret;
6 | // ret=max(a,b);//20 Cout<<"max value is "<num2){
12 | // result=num1;
13 | // }
14 | // else {
15 | // result=num2;
16 | // }
17 | // return result;
18 | //}
19 | #include
20 | using namespace std;
21 | const float pi=3.14;
22 | float area(float n,float b,float h){
23 | float ar;
24 | ar=n*b*h;//0.5*4*5
25 | return ar;//10
26 | float area(float r);
27 | ar=pi*r*r;
28 | 3.14*12*12;
29 | return ar;//452.16
30 | }
31 | int main(){
32 | float area(float l,float b);
33 | float ar;
34 | ar=l*b;
35 | return ar;
36 | float b,h,r,l;
37 | float show; show=area(0.5,4,5);
38 | }
39 |
--------------------------------------------------------------------------------
/2nd Year/Fail.c:
--------------------------------------------------------------------------------
1 | // #include
2 | // int main(){
3 | // int r,c,arr[r][c];
4 | // printf("Enter the Rows and Coloumn: \n");
5 | // scanf("%d %d",&r,&c);
6 | // for(int i=0;i<=r;i++){
7 | // for(int j=0;j<=c;j++){
8 | // printf("arr[%d][%d] = ",i,j);
9 | // scanf("%d",arr[i][j]);
10 | // }
11 | // for(int i=0;i<=r;i++){
12 | // for(int j=0;j<=c;j++){
13 | // printf("%d",arr[i][j]);
14 | // }
15 | // }
16 |
17 | // }
18 | // return 0;
19 | // }
20 | #include
21 | int main(){
22 | int N,A,B,Q,t;
23 | scanf("%d",&t);
24 | for(int i=0;i=N && Z>=N*10){
29 | if(Z%A==0 && Z%B!=0){
30 | printf("%d",Z);
31 | a=-1;
32 | break;
33 | }
34 | else{
35 | printf("NO");
36 | }
37 | }
38 |
39 | }
40 | }
41 |
--------------------------------------------------------------------------------
/n/.vscode/settings.json:
--------------------------------------------------------------------------------
1 | {
2 | "C_Cpp_Runner.cCompilerPath": "gcc",
3 | "C_Cpp_Runner.cppCompilerPath": "g++",
4 | "C_Cpp_Runner.debuggerPath": "gdb",
5 | "C_Cpp_Runner.cStandard": "",
6 | "C_Cpp_Runner.cppStandard": "",
7 | "C_Cpp_Runner.msvcBatchPath": "",
8 | "C_Cpp_Runner.useMsvc": false,
9 | "C_Cpp_Runner.warnings": [
10 | "-Wall",
11 | "-Wextra",
12 | "-Wpedantic"
13 | ],
14 | "C_Cpp_Runner.enableWarnings": true,
15 | "C_Cpp_Runner.warningsAsError": false,
16 | "C_Cpp_Runner.compilerArgs": [],
17 | "C_Cpp_Runner.linkerArgs": [],
18 | "C_Cpp_Runner.includePaths": [],
19 | "C_Cpp_Runner.includeSearch": [
20 | "*",
21 | "**/*"
22 | ],
23 | "C_Cpp_Runner.excludeSearch": [
24 | "**/build",
25 | "**/build/**",
26 | "**/.*",
27 | "**/.*/**",
28 | "**/.vscode",
29 | "**/.vscode/**"
30 | ]
31 | }
--------------------------------------------------------------------------------
/.vscode/tasks.json:
--------------------------------------------------------------------------------
1 | {
2 | "tasks": [
3 | {
4 | "type": "cppbuild",
5 | "label": "C/C++: gcc.exe build active file",
6 | "command": "C:\\msys64\\mingw64\\bin\\gcc.exe",
7 | "args": [
8 | "-fdiagnostics-color=always",
9 | "-g",
10 | "${file}",
11 | "-o",
12 | "${fileDirname}\\${fileBasenameNoExtension}.exe"
13 | ],
14 | "options": {
15 | "cwd": "${fileDirname}"
16 | },
17 | "problemMatcher": [
18 | "$gcc"
19 | ],
20 | "group": {
21 | "kind": "build",
22 | "isDefault": true
23 | },
24 | "detail": "Task generated by Debugger."
25 | }
26 | ],
27 | "version": "2.0.0"
28 | }
--------------------------------------------------------------------------------
/2nd Year/.vscode/settings.json:
--------------------------------------------------------------------------------
1 | {
2 | "C_Cpp_Runner.cCompilerPath": "gcc",
3 | "C_Cpp_Runner.cppCompilerPath": "g++",
4 | "C_Cpp_Runner.debuggerPath": "gdb",
5 | "C_Cpp_Runner.cStandard": "",
6 | "C_Cpp_Runner.cppStandard": "",
7 | "C_Cpp_Runner.msvcBatchPath": "",
8 | "C_Cpp_Runner.useMsvc": false,
9 | "C_Cpp_Runner.warnings": [
10 | "-Wall",
11 | "-Wextra",
12 | "-Wpedantic"
13 | ],
14 | "C_Cpp_Runner.enableWarnings": true,
15 | "C_Cpp_Runner.warningsAsError": false,
16 | "C_Cpp_Runner.compilerArgs": [],
17 | "C_Cpp_Runner.linkerArgs": [],
18 | "C_Cpp_Runner.includePaths": [],
19 | "C_Cpp_Runner.includeSearch": [
20 | "*",
21 | "**/*"
22 | ],
23 | "C_Cpp_Runner.excludeSearch": [
24 | "**/build",
25 | "**/build/**",
26 | "**/.*",
27 | "**/.*/**",
28 | "**/.vscode",
29 | "**/.vscode/**"
30 | ]
31 | }
--------------------------------------------------------------------------------
/2022 New folder/.vscode/tasks.json:
--------------------------------------------------------------------------------
1 | {
2 | "tasks": [
3 | {
4 | "type": "cppbuild",
5 | "label": "C/C++: gcc.exe build active file",
6 | "command": "C:\\MinGW\\bin\\gcc.exe",
7 | "args": [
8 | "-fdiagnostics-color=always",
9 | "-g",
10 | "${file}",
11 | "-o",
12 | "${fileDirname}\\${fileBasenameNoExtension}.exe"
13 | ],
14 | "options": {
15 | "cwd": "${fileDirname}"
16 | },
17 | "problemMatcher": [
18 | "$gcc"
19 | ],
20 | "group": {
21 | "kind": "build",
22 | "isDefault": true
23 | },
24 | "detail": "Task generated by Debugger."
25 | }
26 | ],
27 | "version": "2.0.0"
28 | }
--------------------------------------------------------------------------------
/2101020451 CIT21075/.vscode/tasks.json:
--------------------------------------------------------------------------------
1 | {
2 | "tasks": [
3 | {
4 | "type": "cppbuild",
5 | "label": "C/C++: gcc.exe build active file",
6 | "command": "C:\\MinGW\\bin\\gcc.exe",
7 | "args": [
8 | "-fdiagnostics-color=always",
9 | "-g",
10 | "${file}",
11 | "-o",
12 | "${fileDirname}\\${fileBasenameNoExtension}.exe"
13 | ],
14 | "options": {
15 | "cwd": "${fileDirname}"
16 | },
17 | "problemMatcher": [
18 | "$gcc"
19 | ],
20 | "group": {
21 | "kind": "build",
22 | "isDefault": true
23 | },
24 | "detail": "Task generated by Debugger."
25 | }
26 | ],
27 | "version": "2.0.0"
28 | }
--------------------------------------------------------------------------------
/2nd Year/.vscode/launch.json:
--------------------------------------------------------------------------------
1 | {
2 | "version": "0.2.0",
3 | "configurations": [
4 | {
5 | "type": "java",
6 | "name": "Launch chef",
7 | "request": "launch",
8 | "mainClass": "chef",
9 | "projectName": "2nd Year_18e27e3b"
10 | },
11 | {
12 | "name": "C/C++ Runner: Debug Session",
13 | "type": "cppdbg",
14 | "request": "launch",
15 | "args": [],
16 | "stopAtEntry": false,
17 | "externalConsole": false,
18 | "cwd": "d:/VCODES/2nd Year",
19 | "program": "d:/VCODES/2nd Year/build/Debug/outDebug",
20 | "MIMode": "gdb",
21 | "miDebuggerPath": "gdb",
22 | "setupCommands": [
23 | {
24 | "description": "Enable pretty-printing for gdb",
25 | "text": "-enable-pretty-printing",
26 | "ignoreFailures": true
27 | }
28 | ]
29 | }
30 | ]
31 | }
--------------------------------------------------------------------------------
/Python/cc.py:
--------------------------------------------------------------------------------
1 | # Armstrong Numbers: .....
2 | # n=int(input("Enter any number.: "))
3 | # t=n
4 | # s=0
5 | # while(t>0):
6 | # digit=t%10
7 | # s = s+(digit*digit*digit)
8 | # t=t//10
9 | # if(s==n):
10 | # print(True)
11 | # else:
12 | # print(False)
13 | # Palindrome .....
14 | # S=input("Enter a String")
15 | # A=S[::-1]
16 | # if(S==A):
17 | # print("{} is the Palindrome".format(S))
18 | # print(S,"=",A)
19 | # else:
20 | # print("{} is not a Palindrome".format(S))
21 | # print(S,"!=",A)
22 |
23 | # USING FUNCTION
24 | def func1(y):
25 | while(y>0):
26 | r=y%10
27 | s=s+(r*r*r)
28 | y=y//10
29 | if y==s:
30 | print("It is a Armstrong Number..",s)
31 | return s
32 | else:
33 | print(s," is not a armstrong Number..")
34 | #MAIN
35 | n=int(input("Enter any Value: "))
36 | t=n
37 | s=0
38 | print(func1(t))
--------------------------------------------------------------------------------
/2nd Year/.vscode/tasks.json:
--------------------------------------------------------------------------------
1 | {
2 | "tasks": [
3 | {
4 | "type": "cppbuild",
5 | "label": "C/C++: gcc.exe build active file",
6 | "command": "C:/msys64/mingw64/bin/gcc.exe",
7 | "args": [
8 | "-fdiagnostics-color=always",
9 | "-g",
10 | "${file}",
11 | "-o",
12 | "${fileDirname}\\${fileBasenameNoExtension}.exe",
13 | ""
14 | ],
15 | "options": {
16 | "cwd": "C:/msys64/mingw64/bin"
17 | },
18 | "problemMatcher": [
19 | "$gcc"
20 | ],
21 | "group": {
22 | "kind": "build",
23 | "isDefault": true
24 | },
25 | "detail": "Task generated by Debugger."
26 | }
27 | ],
28 | "version": "2.0.0"
29 | }
--------------------------------------------------------------------------------
/2022 New folder/arr.cpp:
--------------------------------------------------------------------------------
1 | // ** Ascending Order ARRAY **
2 | #include
3 | void del(int);
4 | int main(){
5 | int n,arr[n],e,s,p=0,pos;
6 | printf("enter the size: \n");
7 | scanf("%d",&n);
8 | for(int i=0;iarr[a]){
18 | e = arr[i];
19 | arr[i] = arr[a];
20 | arr[a] = e;
21 | }
22 | }
23 | }
24 | printf("Enter element to search:-- ");
25 | scanf("%d",&s);
26 | for(int i=0;i<=n;i++){
27 | if(arr[i]==s){
28 | p=1;
29 | printf("%d",i);
30 | break;
31 | }
32 | }
33 | printf("Enter the position to be deleted: ");
34 | scanf("%d ",&pos);
35 | void del(int pos){
36 | }
37 | return 0;
38 | }
39 |
40 |
41 | // printf("\n");
42 | // for(int s=0;s
2 | int main() {
3 | int size;
4 | int values[size];
5 | printf("Enter the Size of an array: ");
6 | scanf("%d",&size);
7 | printf("Enter inputs: ");
8 | for(int i = 0; i < size; ++i) {
9 | scanf("%d", &values[i]);
10 | }
11 | printf("Displaying integers: ");
12 | for(int i = 0; i < size; ++i) {
13 | printf("%d ", values[i]);
14 | }
15 | return 0;
16 | }*/
17 | // #include
18 | // int main(){
19 | // int arr[5] = {-8,2,3,4,5};
20 | // int min=arr[0];
21 | // int min1;
22 | // for(int i = 0; i < 5;i++){
23 | // if(min>arr[i]){
24 | // min = arr[i];
25 | // }
26 |
27 | // }
28 | // printf("Smallest no. is %d", min);
29 | // return 0;
30 | // }
31 | #include
32 | int main(){
33 | int size;
34 | int arr[size];
35 | printf("Enter the Size: ");
36 | scanf("%d",&size);
37 | for(int i=0;i
2 |
3 |
4 |
5 |
6 |
7 | Document
8 |
9 |
10 | This is Laptop
11 | a computer that is portable and suitable for use while travelling.
12 |
13 | Laptop
14 | A laptop, laptop computer, or notebook computer is a small, portable personal computer (PC) with a screen and alphanumeric keyboard. These typically have a clam shell form factor with the screen mounted on the inside of the upper lid and the keyboard on the inside of the lower lid, although 2-in-1 PCs with a detachable keyboard are often marketed as laptops or as having a laptop mode. Laptops are folded shut for transportation, and thus are suitable for mobile use. Its name comes from lap
15 |
16 |
17 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/.vscode/launch.json:
--------------------------------------------------------------------------------
1 | {
2 | // Use IntelliSense to learn about possible attributes.
3 | // Hover to view descriptions of existing attributes.
4 | // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
5 | "version": "0.2.0",
6 | "configurations": [
7 | {
8 | "name": "gcc.exe - Build and debug active file",
9 | "type": "cppdbg",
10 | "request": "launch",
11 | "program": "${fileDirname}\\${fileBasenameNoExtension}.exe",
12 | "args": [],
13 | "stopAtEntry": false,
14 | "cwd": "${fileDirname}",
15 | "environment": [],
16 | "externalConsole": false,
17 | "MIMode": "gdb",
18 | "miDebuggerPath": "C:\\MinGW\\bin\\gdb.exe",
19 | "setupCommands": [
20 | {
21 | "description": "Enable pretty-printing for gdb",
22 | "text": "-enable-pretty-printing",
23 | "ignoreFailures": true
24 | }
25 | ],
26 | "preLaunchTask": "C/C++: gcc.exe build active file"
27 | }
28 | ]
29 | }
--------------------------------------------------------------------------------
/2022 New folder/cc1.cpp:
--------------------------------------------------------------------------------
1 | //#include
2 | //int main(){
3 | // int T,x;
4 | // scanf("%d",&T);
5 | // for(int i=0;i
14 | //int main()
15 | //{
16 | // int t;
17 | // scanf("%d",&t);
18 | // int a=0;
19 | // float n,x,y,aa,b,dd,pd;
20 | // float p,d;
21 | // while (a!=t)
22 | // {
23 | // scanf("%f%f%f%f%f",&n,&x,&y,&aa,&b);
24 | // pd=n/aa;
25 | // dd=n/b;
26 | //
27 | // p=x*pd;
28 | // d=y*dd;
29 | // if(p>d)
30 | // {
31 | // printf("DIESEL\n");
32 | // }
33 | // else if(d>p)
34 | // {
35 | // printf("PETROL\n");
36 | // }
37 | // else
38 | // {
39 | // printf("ANY\n");
40 | // }
41 | // a=a+1;
42 | // }
43 | //return 0;
44 | //}
45 |
46 | //#include
47 | //#include
48 | //int main(){
49 | // int t,x,y;
50 | // scanf("%d",&t);
51 | // for(int i=0;i
58 | #include
59 | int main(){
60 | int t,x,y;
61 | scanf("%d",&t);
62 | for(int i=0;i
2 | int main(){
3 | int number,i;
4 | printf("Enter the number to find the multiplication table: ");
5 | scanf("%d",&number);
6 | printf("The multiplication of number %d is ",number);
7 | printf("\n");
8 | for (i = 1; i<=120 ; i++){
9 | printf("%d x %d = %d",number,i,number*i);
10 | printf("\n");
11 | }
12 | return 0;
13 | }*/
14 |
15 | /*#include
16 | int main(){
17 | int number,M;
18 | printf("Enter Number For find Multiplication Table :");
19 | scanf("%d",&number);
20 | printf("The Multiplication Table of %d is :",number);
21 | for (M = 1; M<=999 ; M++){
22 | printf("%d x %d = %d ",number,M,number*M);
23 |
24 | }
25 | return 0;
26 | }*/
27 |
28 | /*#include
29 | int main(){
30 | char M;
31 | printf("Enter Any Character to find wheather it is Alphabet,Digit ,or Special Character");
32 | scanf("%c",&M);
33 | if(M>='a' && M<='z' || M>='A' && M<='Z')
34 | {
35 | printf("%c is an Alphabet",M);
36 | }
37 | else if(M>='0' && M<='9')
38 | {
39 | printf("%c is a Digit",M);
40 | }
41 | else
42 | {
43 | printf("%c is a special Character",M);
44 | }
45 | return 0;
46 | }*/
47 |
--------------------------------------------------------------------------------
/Websites Practice/practice.css:
--------------------------------------------------------------------------------
1 | body{
2 | background-image: url(/OIP.jpg);
3 | background-repeat: no-repeat;
4 | background-size:100% ;
5 | }
6 | h1{
7 | color: rgb(250, 241, 241);
8 | }
9 | table {
10 | font-family: arial, sans-serif;
11 | border-collapse: collapse;
12 | width: 100%;
13 | }
14 |
15 | td, th {
16 | border: 1px solid #010101;
17 | text-align: left;
18 | padding: 8px;
19 | }
20 |
21 | tr:nth-child(even) {
22 | background-color: #dddddd;
23 | }
24 | .flex-container00{
25 | margin-top:70px;
26 | background-color:rgb(162, 228, 38);
27 | color: rgb(80, 168, 105);
28 | border-radius: 3px;
29 | }
30 | .flex-container1{
31 | display: flex;
32 | justify-content: center;
33 | align-items: center;
34 | }
35 | .animated-background{
36 | background: linear-gradient(
37 | to right, #833ab4,
38 | #0111f6, rgb(241, 28, 28)
39 | );
40 | background-size: 400% 400%;
41 | animation: animate-background 10s infinite ease-in-out;
42 | }
43 | @keyframes animate-background{
44 | 0%{
45 | background-position: 0 50%;
46 | }
47 | 50%{
48 | background-position: 100% 50%
49 | }
50 | 100%{
51 | background-position:05 50%
52 | }
53 | }
--------------------------------------------------------------------------------
/NEW/P Queue.c:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #define max 5
4 | void enqueue();
5 | void dequeue();
6 | void display();
7 | int Q[max],front=-1,rear=-1,data;
8 | int main(){
9 | int choice;
10 | while(1){
11 | printf("\n1.Enqueue \n");
12 | printf("2.Dequeue\n");
13 | printf("3.Display\n");
14 | printf("Enter your Choice");
15 | scanf("%d",&choice);
16 | switch(choice){
17 | case 1:
18 | enqueue();
19 | break;
20 | case 2:
21 | dequeue();
22 | break;
23 | case 3:
24 | display();
25 | break;
26 | }
27 | }
28 | return 0;
29 | }
30 | void enqueue(){
31 | if(rear==max-1){
32 | printf("\nQueue is Overflow !\n\n");
33 | return;
34 | }
35 | else{
36 | if(front==-1){
37 | front=0;
38 | }
39 | printf("Enter data to insert: \n");
40 | scanf("%d",&data);
41 | rear++;
42 | Q[rear]=data;
43 | }
44 | }
45 | void dequeue(){
46 | if(front==-1 || front>rear){
47 | printf("\nQueue is Underflow !\n\n");
48 | }
49 | else{
50 | printf("\nDEQUEUED ITEM IS %d\n\n",Q[front]);
51 | data=Q[front];
52 | front++;
53 | }
54 | }
55 | void display(){
56 | if(front==-1){
57 | printf("\nNothing to show here !\n");
58 | return;
59 | }
60 | else{
61 | printf("The Elements are: \n");
62 | for(int i=front;i<=rear;i++){
63 | printf("%d\n",Q[i]);
64 | }
65 | }
66 | }
67 |
--------------------------------------------------------------------------------
/2022 New folder/.vscode/launch.json:
--------------------------------------------------------------------------------
1 | {
2 | // Use IntelliSense to learn about possible attributes.
3 | // Hover to view descriptions of existing attributes.
4 | // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
5 | "version": "0.2.0",
6 | "configurations": [
7 | {
8 | "name": "gcc.exe - Build and debug active file",
9 | "type": "cppdbg",
10 | "request": "launch",
11 | "program": "${fileDirname}\\${fileBasenameNoExtension}.exe",
12 | "args": [],
13 | "stopAtEntry": false,
14 | "cwd": "${fileDirname}",
15 | "environment": [],
16 | "externalConsole": false,
17 | "MIMode": "gdb",
18 | "miDebuggerPath": "C:\\MinGW\\bin\\gdb.exe",
19 | "setupCommands": [
20 | {
21 | "description": "Enable pretty-printing for gdb",
22 | "text": "-enable-pretty-printing",
23 | "ignoreFailures": true
24 | },
25 | {
26 | "description": "Set Disassembly Flavor to Intel",
27 | "text": "-gdb-set disassembly-flavor intel",
28 | "ignoreFailures": true
29 | }
30 | ],
31 | "preLaunchTask": "C/C++: gcc.exe build active file"
32 | }
33 | ]
34 | }
--------------------------------------------------------------------------------
/2101020451 CIT21075/remeber.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main(){
3 | float P,R,T;
4 | printf("Enter Principle\n");
5 | scanf("%f",&P);
6 | printf("Enter Rate\n");
7 | scanf("%f",&R);
8 | printf("Enter Time\n");
9 | scanf("%f",&T);
10 | float I = P*R*T;
11 | printf("Simple Interest is %f\n",I);
12 |
13 |
14 |
15 | return 0;
16 | }
17 |
18 |
19 |
20 |
21 | /*#include
22 | int main(){
23 | int num1,num2,num3,num4,num5;
24 | printf("Your 1st no.\n");
25 | scanf("%d",&num1);
26 | printf("Your 2nd no.\n");
27 | scanf("%d",&num2);
28 | printf("Your 3rd no.\n");
29 | scanf("%d",&num3);
30 | printf("Your 4th no.\n");
31 | scanf("%d",&num4);
32 | printf("Your 5th no.\n");
33 | scanf("%d",&num5);
34 |
35 | int sum = num1+num2+num3+num4+num5;
36 | int Average = (num1+num2+num3+num4+num5)/5;
37 |
38 | printf("The sum of 5 numbers is %d\n",sum);
39 | printf("The Average of 5 numbers is %d\n",Average);
40 |
41 |
42 | return 0;
43 | }*/
44 |
45 |
46 | #include
47 | int main() {
48 | int number, i;
49 | printf("Please enter any number to find multiplication table:");
50 | scanf("%d", &number);
51 | printf("Multiplication table for the given number %d ", number);
52 | printf("\n");
53 | for(i=1;i<=12;i++){
54 | printf("%d x %d = %d", number, i, number * i);
55 | printf("\n");
56 | }
57 |
58 | return 0;
59 | }
60 |
--------------------------------------------------------------------------------
/2022 New folder/stack.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #define MAX 5
4 | void push();
5 | void pop();
6 | void display();
7 | void peep();
8 | int STACK[MAX],top=-1,item;
9 | int main(){
10 | int choice;
11 | while(1){
12 |
13 | printf("\n1.Push\n");
14 | printf("\n2.Pop\n");
15 | printf("\n3.Display\n");
16 | printf("\n4.Peep\n");
17 | printf("\n5.Exit\n");
18 | printf("Enter your CHOICE:\n");
19 | scanf("%d",&choice);
20 | switch (choice) {
21 | case 1:
22 | push();
23 | break;
24 | case 2:
25 | pop();
26 | break;
27 | case 3:
28 | display();
29 | break;
30 | case 4:
31 | peep();
32 | break;
33 | case 5:
34 | exit(0);
35 | default:
36 | printf("Enter the Valid Choice !!!");
37 | break;
38 | }
39 | }
40 | return 0;
41 | }
42 | void push(){
43 | if(top==MAX-1){
44 | printf("\nSTACK OVERFLOW\n");
45 | return;
46 | }
47 | top+=1;
48 | STACK[top] = item;
49 | printf("\n PUSH SUCCESFULLY DONE\n");
50 | }
51 | void pop(){
52 | if(top==MAX-1){
53 | printf("Under Flow\n");
54 | return;
55 | }
56 | item = STACK[top];
57 | top-=1;
58 | printf("\n%d has been deleted succesfully!\n");
59 | }
60 | void display(int top1){
61 | while(top1!=-1){
62 | printf("%d\n",STACK[top1]);
63 | top1--; }
64 |
65 | }
66 | void peep(int top2){
67 | if(top2==-1){
68 | printf("\nNOTHING TO SHOW (EMPTY)");
69 | while(top2!=-1){
70 | printf("%d\n",STACK[top2]);
71 | }
72 | }
73 | }
74 |
--------------------------------------------------------------------------------
/.vscode/launch.json:
--------------------------------------------------------------------------------
1 | {
2 | // Use IntelliSense to learn about possible attributes.
3 | // Hover to view descriptions of existing attributes.
4 | // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
5 | "version": "0.2.0",
6 | "configurations": [
7 | {"name":"Python: Current File","type":"python","request":"launch","program":"${file}","console":"integratedTerminal","justMyCode":true},
8 | {
9 | "name": "C/C++: gcc.exe Build and debug active file",
10 | "type": "cppdbg",
11 | "request": "launch",
12 | "program": "${fileDirname}\\${fileBasenameNoExtension}.exe",
13 | "args": [],
14 | "stopAtEntry": false,
15 | "cwd": "${fileDirname}",
16 | "environment": [],
17 | "externalConsole": false,
18 | "MIMode": "gdb",
19 | "miDebuggerPath": "C:\\msys64\\mingw64\\bin\\gdb.exe",
20 | "setupCommands": [
21 | {
22 | "description": "Enable pretty-printing for gdb",
23 | "text": "-enable-pretty-printing",
24 | "ignoreFailures": true
25 | },
26 | {
27 | "description": "Set Disassembly Flavor to Intel",
28 | "text": "-gdb-set disassembly-flavor intel",
29 | "ignoreFailures": true
30 | }
31 | ],
32 | "preLaunchTask": "C/C++: gcc.exe build active file"
33 | }
34 | ]
35 | }
--------------------------------------------------------------------------------
/Websites Practice/index.css:
--------------------------------------------------------------------------------
1 | /*h1{
2 | background-color: brown;
3 | border-radius: 4px;
4 | text-align: center;
5 | }
6 | #nami{
7 | background-color: rgb(163, 243, 16);
8 | }
9 | #priya{
10 | background-color:rgb(179, 148, 91);
11 | }
12 | body{
13 | background-color:grey;
14 | }
15 | #a{
16 | background-color:rebeccapurple
17 | }
18 | h2{
19 | color: white;
20 | background-color:grey;
21 | text-align: center;
22 | border-radius: px;
23 | border-block-end-color: red;
24 | }
25 | div{
26 | background-color:lightgreen;
27 | }
28 | span{
29 | background-color:red;
30 | }
31 | */
32 | h1 {
33 | border: 1px solid black;
34 | margin-top: 10px;
35 | margin-bottom: 10px;
36 | margin-right: 91px;
37 | margin-left: 100px;
38 | background-color: lightblue;
39 | font-family: Impact, Haettenschweiler, 'Arial Narrow Bold', sans-serif;
40 |
41 | }
42 | select {
43 | background-color:red;
44 | font-family:'Franklin Gothic Medium', 'Arial Narrow', Arial, sans-serif;
45 | text-decoration:transparent;
46 | }
47 | label {
48 | background-color: gold;
49 | }
50 | input {
51 | border: 1px solid black;
52 | background-color: lightblue;
53 | text-align: center;
54 | font-family: 'Courier New', Courier, monospace;
55 | border-radius: 5px;
56 | }
57 | table {
58 | background-color: lightgreen;
59 | text-align: center;
60 | border-radius:5px;
61 | border: 2px solid blue
62 | }
63 | td, th {
64 | border: 1px solid #dddddd;
65 | text-align: left;
66 | padding: 8px;
67 | }
--------------------------------------------------------------------------------
/n/Animation.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 | Document
8 |
9 |
10 |
11 |
12 |
19 |
20 | Hello!!
21 | Hello!!
22 | Hello!!
23 |
30 |
31 | Hello!!
32 | Hello!!
33 | Hello!!
34 |
41 |
42 | Hello!!
43 | Hello!!
44 | Hello!!
45 |
52 |
53 | Hello!!
54 | Hello!!
55 | Hello!!
56 |
57 |
58 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/Manu singh.cpp:
--------------------------------------------------------------------------------
1 | //Program 1//
2 | /*#include
3 | int main()
4 | {
5 | printf("");
6 | return 0;
7 | }*/
8 | //Program 2//
9 | /*#include
10 | int main(){
11 | int x;
12 | x=123;
13 | printf("my age is %d years old",x);
14 | return 0;
15 | }*/
16 | //Program 3 //
17 | /*#include
18 | int main(){
19 | printf("my name is mannu \n");
20 | printf("and your phone number is 800xxxxxx7");
21 | }*/
22 | //Program 4//
23 | /*#include
24 | int main(){
25 | int x=19;
26 | int y=22;
27 | char name[] ="Mahendra Singh";
28 | char* grade ="A";
29 | printf("Your name is %s \n",name);
30 | printf("and your age is %d thats right\n",x);
31 | return 0;
32 | }*/
33 | //PROGRAM 5//
34 | /*#include
35 | int main(){
36 | char name[]="Mahendra singh";
37 | int x=21;
38 | char* grade="A";
39 | int age=19;
40 |
41 | printf("My name is %s\n",name);
42 | printf("and my age is %d years old\n",age);
43 | return 0;
44 | }*/
45 |
46 |
47 | /*#include
48 | int main(){
49 | int year;
50 | printf("The year is leap year or not\n");
51 | scanf("%d",&year);
52 | (year%4==0 && year%100!=0) ? (printf("The year is leap year")):(printf("Year is not leap year"));
53 | return 0;
54 | }*/
55 |
56 | /*#include
57 | int main(){
58 | char M;
59 | printf("Enter Any Character to find wheather it is Alphabet,Digit ,or Special Character\n");
60 | scanf("%c",&M);
61 | if(M>='a' && M<='z' || M>='A' && M<='Z')
62 | {
63 | printf("%c is an Alphabet",M);
64 | }
65 | else if(M>='0' && M<='9')
66 | {
67 | printf("%c is a Digit",M);
68 | }
69 | else
70 | {
71 | printf("%c is a special Character",M);
72 | }
73 | return 0;
74 | }*/
75 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/IRON_MAN.py:
--------------------------------------------------------------------------------
1 | # import turtle
2 | # # Top Part
3 | # piece1=[[(-40, 120), (-70, 260), (-130, 230),
4 | # (-170, 200), (-170, 100), (-160, 40), (-170, 10),
5 | # (-150, -10), (-140, 10), (-40, -20), (0, -20)],[(0, -20),
6 | # (40, -20), (140, 10), (150, -10), (170, 10), (160, 40),
7 | # (170, 100), (170, 200), (130, 230), (70, 260), (40, 120),
8 | # (0, 120)]]
9 | # # Middle Part
10 | # piece2=[[(-40, -30), (-50, -40), (-100, -46), (-130, -40),
11 | # (-176, 0), (-186, -30), (-186, -40), (-120, -170),
12 | # (-110, -210), (-80, -230), (-64, -210), (0, -210)],
13 | # [(0, -210), (64, -210), (80, -230), (110, -210), (120, -170), (186, -40), (186, -30), (176, 0), (130, -40), (100, -46), (50, -40), (40, -30), (0, -30)]]
14 | # #Bottom Part
15 | # piece3=[[(-60, -220), (-80, -240), (-110, -220),
16 | # (-120, -250),(-90, -280), (-60, -260), (-30, -260), (-20, -250), (0, -250)],[(0, -250), (20, -250), (30, -260), (60, -260),
17 | # (90, -280), (120, -250),(110, -220), (80, -240), (60, -220), (0, -220)]]
18 | # turtle.hideturtle()
19 | # turtle.bgcolor('#ba161e') #Dark Red
20 | # turtle.setup(500,600)
21 | # turtle.title("I AM IRONMAN")
22 | # piece1Goto=(0,120)
23 | # piece2Goto=(0,-30)
24 | # piece3Goto=(0,-220)
25 | # turtle.speed(2)
26 | # def draw_piece(piece,pieceGoto):
27 | # turtle.penup()
28 | # turtle.goto(pieceGoto)
29 | # turtle.pendown()
30 | # turtle.color('#fab104') #Light Yellow
31 | # turtle.begin_fill()
32 | # for i in range(len(piece[0])):
33 | # x,y=piece[0][i]
34 | # turtle.goto(x,y)
35 |
36 | # for i in range(len(piece[1])):
37 | # x,y=piece[1][i]
38 | # turtle.goto(x,y)
39 | # turtle.end_fill()
40 | # draw_piece(piece1,piece1Goto)
41 | # draw_piece(piece2,piece2Goto)
42 | # draw_piece(piece3,piece3Goto)
43 | # turtle.hideturtle()
44 | # turtle.done()
--------------------------------------------------------------------------------
/2nd Year/Learn.c:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #define max 5
4 | void push();
5 | void pop();
6 | void display();
7 | void peep();
8 | int top=-1,item,STACK[max];
9 | int main(){
10 | int choice;
11 | while(1){
12 | printf("1.Push\n");
13 | printf("2.Pop\n");
14 | printf("3.Display\n");
15 | printf("4.Peep\n");
16 | printf("5.Exit\n");
17 | printf("Enter your CHOICE:\n");
18 | scanf("%d",&choice);
19 | switch(choice){
20 | case 1:
21 | push();
22 | break;
23 | case 2:
24 | pop();
25 | break;
26 | case 3:
27 | display();
28 | case 4:
29 | peep();
30 | break;
31 | case 5:
32 | exit(0);
33 | default:
34 | printf("Enter a Valid Choice !!!");
35 | }
36 | }
37 | return 0;
38 | }
39 | void push(){
40 | if(top==max-1){
41 | printf("STACK OVERFLOW !!!");
42 | return;
43 | }
44 | printf("Enter the ITEM to push onto the STACK: \n");
45 | scanf("%d",&item);
46 | top=top+1;
47 | STACK[top] = item;
48 | printf("\n***Element has been Inserted***\n");
49 | }
50 | void pop(){
51 | if(top==-1){
52 | printf("STACK UNDERFLOW !!!");
53 | return;
54 | }
55 | item = STACK[top];
56 | top=top-1;
57 | printf("\n***Deletion Operation is done***\n");
58 | }
59 | void display(){
60 | int top2=top;
61 | while(top2!=-1){
62 | printf("%d\n",STACK[top2]);
63 | top2--;
64 | }
65 | }
66 | void peep(){
67 | if(top==-1){
68 | printf("Nothing to show here!!!");
69 | }
70 | int top1=top;
71 | while(top1!=0){
72 | printf("\n%d\n\n",STACK[top1]);
73 | break;
74 | }
75 | }
76 |
--------------------------------------------------------------------------------
/Websites Practice/Practice.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 | Document
8 |
9 |
10 |
11 | Hello! I Have Grown from a men to a GOD!!
12 |
13 |
14 |
15 |
16 |
17 | Name
18 | Contact
19 | Roll. NO:
20 | Section
21 |
22 |
23 | Alfreds Futterkiste
24 | 6371349165
25 | CIT21075
26 | 4C
27 |
28 |
29 | Centro comercial Moctezuma
30 | 9984851951
31 | 5481454
32 | 4D
33 |
34 |
35 | Ernst Handel
36 | 9545215216
37 | 65515
38 | 1D
39 |
40 |
41 | Island Trading
42 | 8965655545
43 | 9651658
44 | 2C
45 |
46 |
47 | Laughing Bacchus Winecellars
48 | 9614845154
49 | 6651165
50 | 2C
51 |
52 |
53 | Magazzini Alimentari Riuniti
54 | 6484656554
55 | 855424
56 | 3C
57 |
58 |
59 |
60 |
61 |
62 |
63 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/Mannu_project.c:
--------------------------------------------------------------------------------
1 | //Question.1//
2 | //%d for integer,
3 | //%c for A-Z character,
4 | //%s for string denoted by char[],
5 | //%u for undefined data,
6 | //%LD for long double and double,
7 | //%f for floating points
8 | /*#include
9 | int main(){
10 | char name[]="Mahendra Singh";
11 | int age=19;
12 | char rollno[]="CIT21075";
13 | char branch[]="CS and IT";
14 | char Play[]="I love to play football";
15 |
16 | printf("My name is %s\n",name);
17 | printf("I am %d years old\n",age);
18 | printf("My alloted roll number is %s as CIT is to mention that ",rollno);
19 | printf("I am in %s branch\n",branch);
20 | printf("%s because I enjoy Playing football",Play);
21 |
22 | return 0;
23 | }*/
24 | //Question 2//
25 | /*#include
26 | int main(){
27 | char c;
28 | printf("enter a character:");
29 | scanf("%c",&c);
30 | printf("ASCII value of c=%d",c);
31 | return 0;
32 |
33 | }*/
34 | //Question 3//
35 | /*#include
36 | int main(){
37 |
38 | float celsius,fahrenheit;
39 | printf("Enter temperature in celsius:");
40 | scanf("%f",&celsius);
41 |
42 | fahrenheit = (celsius*9/5) + 32; //Celsius to Fahrenheit Conversion formula//
43 |
44 | printf("%f celsius = %f fahrenheit",celsius,fahrenheit);
45 |
46 | return 0;
47 | }*/
48 |
49 |
50 |
51 |
52 |
53 |
54 | //Question 4//
55 | #include
56 | int main(){
57 | int num1,num2;
58 | printf("enter a number\n");
59 | scanf("%d",&num1);
60 | printf("enter another number");
61 | scanf("%d",&num2);
62 | int sum= num1 + num2;
63 | int sub = num1 - num2;
64 | int multiplication = num1 * num2;
65 | int division = num1 / num2;
66 |
67 | printf("sum of num1 and num2 = %d\n",sum);
68 | printf("substraction of num1 and num2 = %d\n",sub);
69 | printf("multiplication of num1 and num2 = %d\n",multiplication);
70 | printf("division of num1 and num2 = %d\n",division);
71 |
72 | return 0;
73 | }
74 |
--------------------------------------------------------------------------------
/2nd Year/chef.java:
--------------------------------------------------------------------------------
1 | // import java.util.Scanner;
2 | // public class chef{
3 | // public static void main(String[] args){
4 | // Scanner scan = new Scanner(System.in);
5 | // int t = scan.nextInt();
6 | // for (int i = 0; i=Y){
10 | // System.out.println(Y);
11 | // }
12 | // if(X=Y){
27 | // System.out.println(4*X + Y);
28 | // }
29 | // if(X<=Y){
30 | // System.out.println(4*Y+X);
31 | // }
32 |
33 | // }
34 | // }
35 | // }
36 | // import java.util.Scanner;
37 | // public class chef{
38 | // public static void main(String[] args){
39 | // Scanner scan = new Scanner(System.in);
40 | // int T = scan.nextInt();
41 | // for(int i = 0; i20){
44 | // System.out.println("HOT");
45 | // }
46 | // else{
47 | // System.out.println("COLD");
48 | // }
49 |
50 | // }
51 | // }
52 | // }
53 | import java.util.Scanner;
54 | public class chef{
55 | public static void main(String[] args){
56 | Scanner scan = new Scanner(System.in);
57 | int T = scan.nextInt();
58 | for(int i = 0; i=b && c>=d){
64 | int A = a+c;
65 | System.out.println(A);
66 | }
67 | else if(b>=a && d>=c){
68 | int B = b+d;
69 | System.out.println(B);
70 | }
71 | }
72 | }
73 | }
74 |
--------------------------------------------------------------------------------
/Mannu.c:
--------------------------------------------------------------------------------
1 | //#include
2 | //int main(){
3 | // int r,arr[r],sum=0,max;
4 | // printf("Enter the no. of element: ");
5 | // scanf("%d",&r);
6 | // for(int i=0;i
27 | //int main(){
28 | // int pos,r;
29 | // scanf("%d",&r);
30 | // int arr[r];
31 | // for(int i=0;i=r || pos<=0){
42 | // printf("Enter valid Position %d is not the valid position...",pos);
43 | // }
44 | // else{
45 | // int num;
46 | // printf("Enter no, to be inserted: ");
47 | // scanf("%d",&num);
48 | // for(int i=r-1;i>=pos;i--){
49 | // arr[i+1]=arr[i];
50 | // }
51 | // arr[pos]=num;
52 | // for(int i=0;i
58 | int insert(){
59 | int pos,r;
60 | scanf("%d",&r);
61 | int arr[r];
62 | for(int i=0;i=r || pos<=0){
73 | printf("Enter valid Position %d is not the valid position...",pos);
74 | }
75 | else{
76 | int num;
77 | printf("Enter no, to be inserted: ");
78 | scanf("%d",&num);
79 | for(int i=r-1;i>=pos;i--){
80 | arr[i+1]=arr[i];
81 | }
82 | arr[pos]=num;
83 | for(int i=0;i
2 | // #define max 5
3 | // int Array(){
4 | // int STACK[max];
5 | // for(int i=0;i
19 | #include
20 | #define max 5
21 | void push();
22 | void pop();
23 | void display();
24 | void peep();
25 | int top=-1,item,STACK[max]=[1,2,4,5,7];
26 | int main(){
27 | int choice;
28 | while(1){
29 | printf("1.Push\n");
30 | printf("2.Pop\n");
31 | printf("3.Display\n");
32 | printf("4.Peep\n");
33 | printf("5.Exit\n");
34 | printf("Enter your CHOICE:\n");
35 | scanf("%d",&choice);
36 | switch(choice){
37 | case 1:
38 | push();
39 | break;
40 | case 2:
41 | pop();
42 | break;
43 | case 3:
44 | display();
45 | break;
46 | case 4:
47 | peep();
48 | break;
49 | case 5:
50 | exit(0);
51 | default:
52 | printf("Enter a Valid Choice !!!");
53 | }
54 | }
55 | return 0;
56 | }
57 | void push(){
58 | if(top==max-1){
59 | printf("STACK OVERFLOW !!!");
60 | return;
61 | }
62 | printf("Enter the ITEM to push onto the STACK: \n");
63 | scanf("%d",&item);
64 | top=top+1;
65 | STACK[top] = item;
66 | printf("\n***Element has been Inserted***\n");
67 | }
68 | void pop(){
69 | if(top==-1){
70 | printf("STACK UNDERFLOW !!!");
71 | return 0;
72 | }
73 | item = STACK[top];
74 | top=top-1;
75 | printf("\n***Deletion Operation is done***\n");
76 | }
77 | void display(int top2){
78 | while(top2!=-1){
79 | printf("%d ",STACK[top2]);
80 | top2--;
81 | }
82 | }
83 | void peep(){
84 | if(top==-1){
85 | printf("Nothing to show here!!!");
86 | }
87 | for(int i=0;i>=max-1;i--){
88 | printf("%d ",i);
89 | break;
90 | }
91 | }
--------------------------------------------------------------------------------
/2022 New folder/sipl.cpp:
--------------------------------------------------------------------------------
1 | // #include
2 | // #define max 5
3 | // int Array(){
4 | // int STACK[max];
5 | // for(int i=0;i
20 | #include
21 | #define max 5
22 | void push();
23 | void pop();
24 | void display();
25 | void peep();
26 | int top=-1,item,STACK[max];
27 | int main(){
28 | int choice;
29 | while(1){
30 | printf("1.Push\n");
31 | printf("2.Pop\n");
32 | printf("3.Display\n");
33 | printf("4.Peep\n");
34 | printf("5.Exit\n");
35 | printf("Enter your CHOICE:\n");
36 | scanf("%d",&choice);
37 | switch(choice){
38 | case 1:
39 | push();
40 | break;
41 | case 2:
42 | pop();
43 | break;
44 | case 3:
45 | display();
46 | break;
47 | case 4:
48 | peep();
49 | break;
50 | case 5:
51 | exit(0);
52 | default:
53 | printf("Enter a Valid Choice !!!");
54 | }
55 | }
56 | return 0;
57 | }
58 | void push(){
59 | if(top==max-1){
60 | printf("STACK OVERFLOW !!!");
61 | return;
62 | }
63 | printf("Enter the ITEM to push onto the STACK: \n");
64 | scanf("%d",&item);
65 | top=top+1;
66 | STACK[top] = item;
67 | printf("\n***Element has been Inserted***\n");
68 | }
69 | void pop(){
70 | if(top==-1){
71 | printf("STACK UNDERFLOW !!!");
72 | return;
73 | }
74 | item = STACK[top];
75 | top=top-1;
76 | printf("\n***Deletion Operation is done***\n");
77 | }
78 | void display(int top2){
79 | while(top2!=-1){
80 | printf("%d ",STACK[top2]);
81 | top2--;
82 | }
83 | }
84 | void peep(){
85 | if(top==-1){
86 | printf("Nothing to show here!!!");
87 | }
88 | for(int i=0;i>=max-1;i--){
89 | printf("%d ",i);
90 | break;
91 | }
92 | }
93 |
--------------------------------------------------------------------------------
/2022 New folder/menu.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | void gotoxy (int x, int y);
4 | int main(){
5 | int x,y;
6 | scanf("%d%d",&x,&y);
7 | int choice,i,num,a;
8 | unsigned long int fact,sum;
9 | while(1){
10 | printf("MENU\n\n\n");
11 | printf("1 to find Factorial \n");
12 | printf("2 to add two numbers \n");
13 | printf("3 to find the no. is even or odd \n");
14 | printf("4 to convert fahrenheit to celsius \n");
15 | printf("5 to find the largest no. amoung 3 numbers \n");
16 | printf("6 TO QUIT\n");
17 | printf("Enter Choice:\n");
18 | scanf("%d",&choice);
19 |
20 |
21 | switch(choice){
22 | case 1:
23 | printf("Enter Any number: \n");
24 | scanf("%d",&a);
25 | num=1;
26 | for (i=1; i<=a ; i++)
27 | {
28 | num*=i;
29 | }
30 | printf("Factorial of is %d\n\n\n",num);
31 | break;
32 |
33 | case 2:
34 |
35 | sum=0;
36 | do
37 | {
38 | printf("Enter Any numbers to add :\n");
39 | scanf("%d",&num);
40 |
41 | sum+=num;
42 | } while (num!=0);
43 | printf("The sum is %d \n\n\n",sum);
44 |
45 | break;
46 |
47 | case 3:
48 | printf("Enter Any number:\n");
49 | scanf("%d",&num);
50 | if(num%2==0){
51 | printf("Number is even");
52 | }
53 | else
54 | printf("Number is odd\n\n\n");
55 |
56 | break;
57 |
58 | case 4:
59 | printf("Enter any number :\n");
60 | scanf("%d",&num);
61 | fact = num * (9/5) + 32;
62 | printf("Fahrenheit is %d\n\n\n",fact);
63 |
64 | break;
65 |
66 | case 5:
67 | printf("Enter any number to find the largest amoung them");
68 | scanf("%d%d%d",&fact,&i,&num);
69 | if(num>fact && num>i){
70 | printf("The %d largest amoung them",num);
71 | }
72 | else if(fact>i){
73 | printf("The %d lagest amoung them",fact);
74 | }
75 | else
76 | printf("%d is largest amoung them\n\n\n",&num);
77 | break;
78 |
79 | case 6:
80 | exit(0);
81 |
82 | }
83 | }return 0;
84 | }
85 |
--------------------------------------------------------------------------------
/Web/Divy.css:
--------------------------------------------------------------------------------
1 | #qw {
2 | font-size: small;
3 | color: black;
4 | font-family: "Trebuchet MS", "Lucida Sans Unicode", "Lucida Grande",
5 | "Lucida Sans", Arial, sans-serif;
6 | }
7 | body {
8 | background-color: #ece5f0ff;
9 | }
10 | #di1 {
11 | background-color: #39a0edff;
12 | height: 65px;
13 | }
14 | /* --xiketic: #1c0b19ff;
15 | --celeste: #9bf3f0ff;
16 | --carolina-blue: #39a0edff;
17 | --magnolia: #ece5f0ff;
18 | #3b28ccff;
19 | --oxford-blue: #031d44ff; */
20 | #di2 {
21 | background-color: #39a0edff;
22 | height: 150px;
23 | }
24 | #di3 {
25 | background-color: #ece5f0ff;
26 | height: 50px;
27 | }
28 |
29 | #di5 {
30 | background-color: #004147;
31 | height: 150px;
32 | }
33 | #man {
34 | margin-left: 300px;
35 | }
36 | #mam:hover {
37 | background-color: yellow;
38 | }
39 | .flex-container {
40 | display: flex;
41 | flex-direction: row;
42 | align-content: space-between;
43 | align-items: center;
44 | }
45 | #div4 {
46 | height: 400px;
47 | }
48 | #d41 {
49 | background-color: #031d44ff;
50 | text-align: center;
51 | height: 350px;
52 | width: 30%;
53 | margin-left: 5%;
54 | color: #fff;
55 | }
56 | #d42 {
57 | background-color: #031d44ff;
58 | text-align: center;
59 | height: 350px;
60 | width: 30%;
61 | color: #fff;
62 | }
63 |
64 | #d43 {
65 | background-color: #031d44ff;
66 | text-align: center;
67 | height: 350px;
68 | width: 30%;
69 | color: #fff;
70 | }
71 | #d4 {
72 | height: 70px;
73 | }
74 | #di6 {
75 | color: white;
76 | background-color: #ece5f0ff;
77 | height: 150px;
78 | }
79 | #di0 {
80 | height: 350px;
81 | border-radius: 7px;
82 | }
83 |
84 | #ma {
85 | width: 30%;
86 | height: 50%;
87 | }
88 | #i1 {
89 | height: 500px;
90 | width: 100%;
91 | }
92 | .flex-container2 {
93 | display: flex;
94 | padding-left: 10%;
95 | justify-content: flex-start;
96 | align-items: center;
97 | }
98 | .flex-container2 > button {
99 | display: flex;
100 | background-color: orange;
101 | height: 60%;
102 | }
103 |
104 | .flex-container5{
105 | display: flex;
106 | flex-direction:row;
107 | align-items: center;
108 | justify-content: center;
109 |
110 |
111 | }
112 | .flex-container3{
113 | display: flex;
114 | align-items: center;
115 |
116 | }
117 |
118 | #regi1 {
119 | margin: top 5px;
120 | }
121 | #butt1 {
122 | border-radius: 50px;
123 | }
124 |
--------------------------------------------------------------------------------
/Websites Practice/new.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 | Document
8 |
9 |
10 |
11 | How am I Looking Today
12 | Time
13 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
21 |
22 | C.V Raman Global University
23 | Your Dreams Come true only here, Where are you ?
24 |
37 | Select Your Branch
38 |
39 |
40 | B.tech
41 | M.tech
42 | PHD
43 | B.sc
44 | M.sc
45 | Diploma
46 | DDUY
47 |
48 | Programs
49 |
50 | B.tech
51 | B.tech
52 | B.tech
53 | B.tech
54 | B.tech
55 | B.tech
56 | B.tech
57 |
58 |
59 | Pizza Hut
60 | Dominos
61 | Burgur King
62 |
63 |
64 |
65 |
66 |
67 |
68 |
69 |
--------------------------------------------------------------------------------
/Web/Hack.css:
--------------------------------------------------------------------------------
1 | #qw {
2 | font-size: small;
3 | color: black;
4 | font-family: "Trebuchet MS", "Lucida Sans Unicode", "Lucida Grande",
5 | "Lucida Sans", Arial, sans-serif;
6 | }
7 |
8 | body {
9 | background-color: #ece5f0ff;
10 | }
11 | #di1 {
12 | background-color: #39a0edff;
13 | height: 65px;
14 | }
15 | /* --xiketic: #1c0b19ff;
16 | --celeste: #9bf3f0ff;
17 | --carolina-blue: #39a0edff;
18 | --magnolia: #ece5f0ff;
19 | #3b28ccff;
20 | --oxford-blue: #031d44ff; */
21 | #di2 {
22 | background-color: #39a0edff;
23 | height: 130px;
24 | }
25 | #di3 {
26 | background-color: #ece5f0ff;
27 | height: 50px;
28 | }
29 |
30 | #di5 {
31 | background-color: #004147;
32 | height: 150px;
33 | }
34 | #mam{
35 | border-radius: 10px;
36 |
37 | }
38 | #mam:hover {
39 | background-color: #fff;
40 | transform :scale(1.2);
41 | box-shadow: 5px 2px;
42 |
43 | }
44 | .flex-container {
45 | display: flex;
46 | flex-direction: row;
47 | align-content: space-between;
48 | align-items: center;
49 |
50 | }
51 | #div4 {
52 | height: 400px;
53 | }
54 | #d41 {
55 | background-color: #031d44ff;
56 | text-align: center;
57 | height: 350px;
58 | width: 30%;
59 | margin-left: 5%;
60 | color: #fff;
61 |
62 |
63 | }
64 | #d42 {
65 | background-color: #031d44ff;
66 | text-align: center;
67 | height: 350px;
68 | width: 30%;
69 | color: #fff;
70 | }
71 |
72 | #d43 {
73 | background-color: #031d44ff;
74 | text-align: center;
75 | height: 350px;
76 | width: 30%;
77 | color: #fff;
78 | }
79 | #d4 {
80 | height: 70px;
81 | }
82 | #di6 {
83 | color: white;
84 | background-color: #ece5f0ff;
85 | height: 150px;
86 | }
87 | #di0 {
88 | height: 350px;
89 | border-radius: 7px;
90 | }
91 |
92 | #ma {
93 | width: 30%;
94 | height: 50%;
95 | }
96 | #i1 {
97 | height: 500px;
98 | width: 100%;
99 | }
100 | .flex-container2 {
101 | display: flex;
102 | padding-left: 10%;
103 | justify-content: flex-start;
104 | align-items: center;
105 | }
106 | .flex-container2 > button {
107 | display: flex;
108 | background-color: orange;
109 | height: 60%;
110 | }
111 |
112 | .flex-container5{
113 | display: flex;
114 | flex-direction:row;
115 | align-items: center;
116 | justify-content: center;
117 |
118 |
119 | }
120 | .flex-container3{
121 | display: flex;
122 | align-items: center;
123 |
124 | }
125 | #sh{
126 | width: 100%;
127 | }
128 | #regi1 {
129 | margin: top 5px;
130 | }
131 | #butt1 {
132 | border-radius:9px;
133 | background-color:#39a0edff;
134 | border:transparent;
135 | }
136 | #butt1:hover{
137 | background-color: rgb(245, 240, 240);
138 | transform: scale(1.2);
139 | }
140 | #butt2{
141 | border:transparent;
142 | background-color:#39a0edff;
143 | border-radius:px
144 | }
145 | #butt2:hover{
146 | background-color:#39a0edff;
147 | transform:scale(1.2);
148 | }
149 | #mam{
150 | background-color: #39a0edff;
151 | border:transparent;
152 | }
153 |
--------------------------------------------------------------------------------
/Websites Practice/index.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 | Document
8 |
9 |
10 |
11 | This is Heading
12 | This is 2nd Heading
13 |
14 |
15 | HOME
16 |
17 | STICKERS
18 | About
19 | Services
20 |
21 |
22 |
23 | S.no
24 | Phone Number
25 | Name
26 | Addresses
27 |
28 |
29 | 1
30 | 9812210329
31 | Mannu
32 | HEY Dearer Customer
33 | Lund dete hai
34 |
35 |
36 | 2
37 | 544521451545
38 | mahnedra
39 | Asam
40 |
41 |
42 |
43 |
Hey Customer
44 |
67 |
68 |
69 |
70 | What is function Write down inthe checkbox
71 |
72 |
73 |
74 |
75 |
76 | MR. Heisenberg
77 | Miss De-Broglie
78 |
79 |
80 |
81 |
82 |
83 |
--------------------------------------------------------------------------------
/Websites Practice/WEBSITES.css:
--------------------------------------------------------------------------------
1 | /* #pk{
2 | width: 100%;
3 | height: 100%;
4 | display:block;
5 |
6 | background-repeat: no-repeat;
7 | background-image: url("https://th.bing.com/th/id/OIP.mgsYK6sN9fLz7VlFTV-6qgHaHa?pid=ImgDet&rs=1");
8 |
9 | }
10 | option{
11 | background-color: aqua;
12 | }
13 | #pop{
14 | background-color: bisque;
15 | font-family: Arial, Helvetica, sans-serif;
16 | font: size 19px;
17 | } */
18 | /* img{
19 | width: 200px;
20 | height: 200px;
21 | }
22 | body{
23 | background-image: url("");
24 | background-repeat:no-repeat;
25 | color: aquamarine;
26 | background-color: rgb(243, 237, 237);
27 | }
28 | h1{
29 | font-family: monospace;
30 | }
31 | #z{
32 | font-family: Cambria, Cochin, Georgia, Times, 'Times New Roman', serif;
33 | font-size: large;
34 | background-color: aqua;
35 | border-radius: 5px;
36 | margin-right: 235px;
37 | }
38 | }
39 | #int{
40 | font-family: Cambria, Cochin, Georgia, Times, 'Times New Roman', serif;
41 | font-size: large;
42 | border-radius: 5px;
43 | margin-right: 235px;
44 | }
45 | #z{
46 | font-family: Cambria, Cochin, Georgia, Times, 'Times New Roman', serif;
47 | font-size: large;
48 | border-radius: 5px;
49 | margin-right: 500px
50 | }
51 | #zz{
52 | font-family:fantasy;
53 | font-size: large;
54 |
55 | }
56 | #manu{
57 | font-family:fantasy;
58 | font-size: large;
59 | }
60 | #qw{
61 | text-align: right;
62 | text-align: ;
63 | }
64 | select:hover{
65 | background-color:brown;
66 |
67 | }
68 | img:hover{
69 | background-color:yellow;
70 |
71 | }
72 | button:hover{
73 | background-color:yellow;
74 | }
75 | #aa{
76 | text-align: right;
77 | }
78 | #demo{
79 | text-align: right
80 | } */
81 | *{
82 | margin: 0;
83 | }
84 | .flex-container{
85 | display: flex;
86 | justify-content: center;
87 | flex-direction: row;
88 | justify-content: space-between;
89 | justify-content: space-around;
90 | background-color:deepskyblue;
91 | font-family:Impact, Haettenschweiler, 'Arial Narrow Bold', sans-serif;
92 | border-radius:5px;
93 |
94 | }
95 | .animated-background{
96 | background: linear-gradient(
97 | to right, rgb(246, 41, 41), rgb(7, 61, 239), rgb(231, 12, 195) ,rgb(255, 242, 0));
98 | background-size: 400% 400%;
99 | animation:animate-background 10s infinite ease-in-out;
100 | }
101 | @keyframes animate-background{
102 | 0%{
103 | background-position:0% 50% ;
104 | }
105 | 50%{
106 | background-position:50% 100%;
107 | }
108 | 100%{
109 | background-position:0% 50%;
110 | }
111 | }
112 | #d2{
113 | height:4000px;
114 |
115 | }
116 | #a1{
117 | background-color: rgb(89, 50, 205);
118 | text-align:center;
119 | font-family:'Gill Sans', 'Gill Sans MT', Calibri, 'Trebuchet MS', sans-serif;
120 | font-size:xx-large;
121 | }
122 | #a2{
123 | background-color: burlywood;
124 | background-image: url(/Itachi.jpg);
125 | text-align:center;
126 | width:100px;
127 | height:100px;
128 | border-radius: 5px;
129 | margin-top:5px;
130 | margin-bottom: 5px;
131 | background-size: 200px;
132 | background-position-x: -50px;
133 | background-repeat:no-repeat;
134 | }
135 |
--------------------------------------------------------------------------------
/2022 New folder/sam0.cpp:
--------------------------------------------------------------------------------
1 | //#include
2 | //int main(){
3 | // int t,A,B,N,Q=-1;
4 | // scanf("%d",&t);
5 | //
6 | // for(int i=0;i
23 | //int main(){
24 | // int t,A,B,N,Q=-1;
25 | // scanf("%d",&t);
26 | // for(int i=0;i
42 | //using namespace std;
43 | //int main(){
44 | // string name;
45 | // cout<<"Hello Mothafouka";
46 | // cin>>name;
47 | // for(int i=0;i
53 | //int main(){
54 | // int t,a,b,c,d;
55 | // scanf("%d",&t);
56 | // for(int i=0;i=b && c>=d){
59 | // int A=a+c;
60 | // printf("%d",A);
61 | // }
62 | // else if(a>=b && d>=c){
63 | // int B = a+d;
64 | // printf("%d",B);
65 | // }
66 | // else if(b>=a && c>=d){
67 | // int C = b+c;
68 | // printf("%d",C);
69 | // }
70 | // else if(b>=a && d>=c){
71 | // int D = b+d;
72 | // printf("%d",D);
73 | // }
74 | // printf("\n");
75 | // }
76 | // return 0;
77 | //}
78 |
79 | //#include
80 | //void Max(int a,int b,int c){
81 | // if(a>=b && a>=c){
82 | // printf("%d is greatest",a);
83 | // }
84 | // else if(b>=c){
85 | // printf("%d is greatest",b);
86 | // }
87 | // else{
88 | // printf("%d is greatest",c);
89 | // }
90 | //}
91 | //void main(int x,int y,int z){
92 | // scanf("%d %d %d ",&x,&y,&z);
93 | // Max(x,y,z);
94 | //}
95 |
96 |
97 |
98 |
99 | #include
100 | void insert(int,int);
101 | void del(int);
102 | void dis();
103 | int a[20],n;
104 | int main(){
105 | int i,pos,num;
106 | printf("Enter the values: ");
107 | scanf("%d",&n);
108 | printf("Enter values: ");
109 | for(i=0;i=pos;i--){
138 | a[i+1]=a[i]; // :::Assigning the increased array [1+index] to the previous one:::
139 | }
140 | a[pos]=num;
141 | printf("Insertion successful\n");
142 | n=n+1;// :::Increasing the Size of the array by 1(one):::
143 | }
144 | void del(int pos){
145 | int i;
146 | for(i=pos;i
3 | int Areal()
4 | {
5 | int l,b,area;
6 | printf("Enter Lenght of Rectangle : ");
7 | scanf("%d",&l);
8 | printf("Enter width of Rectangle :");
9 | scanf("%d",&b);
10 | area = l*b;
11 | printf("Area of rectangle is %d",area);
12 | return area;
13 | }
14 | int main()
15 | {
16 | Areal();
17 |
18 | return 0;
19 | }*/
20 | /* SQUARE ROOT OF GIVEN NUMBER USING FUNCTION ********************************************************************************************/
21 | /*#include
22 | #include
23 | int squaroot()
24 | {
25 | float x,result;
26 | printf("Enter value: ");
27 | scanf("%f",&x);
28 | result=sqrt(x);
29 | printf("Square root of %f is %f",x,result);
30 | return 0;
31 | }
32 | int main()
33 | {
34 | squaroot();
35 | return 0;
36 | }*/
37 | /* REVERSING A STRING USING FUNCTIONS ************************************************************************************************************/
38 | /*#include
39 | #include
40 | int man(char st[])
41 | {
42 | int len;
43 | len = strlen(st);
44 | for(len=0;len>=0;len--)
45 | {
46 | putchar(st[len-1]);
47 | }
48 | }
49 | int main()
50 | {
51 | char name[]="tesB ehT sI margorP C";
52 | lent(name);
53 | return 0;
54 | }*/
55 | /* MAKE FIBONACCI SERIES USING STRING************************************************************************************************************/
56 | /*#include
57 | int Fibonacci(){
58 | int i,n;
59 | int t1 = 0;
60 | int t2 = 1;
61 | int nterm = t1 + t2;
62 | printf("Enter the number of terms: \n");
63 | scanf("%d",&n);
64 |
65 | for (i=3 ; i<=n ; ++i)
66 | {
67 | printf("%d\t",nterm);
68 | t1 = t2;
69 | t2 = nterm;
70 | nterm = t1 +t2;
71 | }
72 | return 0;
73 | }
74 | int main(int t1,int t2)
75 | {
76 | printf("Fibonacci Series: %d %d ",t1,t2);
77 | Fibonacci();
78 | return 0;
79 | }*/
80 |
81 | /*#include
82 | int main(){
83 | int n,sum=0,rem,pro=1;
84 | printf("enter no.");
85 | scanf("%d",&n);
86 | while(n>0)
87 | {
88 | rem=n%10;
89 | sum+=rem;
90 | pro*=rem;
91 |
92 | n/=10;
93 | }
94 | printf("Sum of digits = %d\n",sum);
95 | printf("Product of digits is = %d\n",pro);
96 | return 0;
97 | }*/
98 |
99 | // #include
100 | // int main(){
101 | // int i,j,r;
102 | // printf("Enter Any No.");
103 | // scanf("%d",&r);
104 | // for(i=1;i<=r;i++){
105 | // for(j=1;j<=i;j++)
106 | // printf("* ");
107 | // printf("\n");
108 |
109 | // }
110 | // return 0;
111 |
112 |
113 | // }
114 | // ****WITH RETURN AND WITH ARGUMENT****
115 | // #include
116 | // int add(int x, int y){
117 | // int c = x+y;
118 | // }
119 | // int main(int a,int b){
120 | // printf("Enter 1st no.: \n");
121 | // scanf("%d%d",&a,&b);
122 | // int z = add(a,b);
123 | // printf("The sum is %d",z);
124 |
125 | // return 0;
126 | // }
127 | // ****WITHOUT RETURN AND WITH ARGUMENT****
128 | // #include
129 | // int add(int x , int y){
130 | // x,y;
131 | // int z = x+y;
132 | // return z;
133 | // }
134 | // void main(int a,int b){
135 | // a,b;
136 | // printf("Enter the Values:\n");
137 | // scanf("%d%d",&a,&b);
138 | // int c = add(a,b);
139 | // printf("The sum is %d",c);
140 |
141 | // }
142 | // #include
143 | // int fact(int x,int y){
144 | // y=1;
145 | // for(int i=1; i<=x; ++i){
146 | // y*=i;
147 | // }
148 | // return y;
149 | // }
150 | // int main(int f,int x){
151 | // x=1;
152 | // printf("Enter the Value:\n");
153 | // scanf("%d",&f);
154 | // int factorial = fact(f,x);
155 | // printf("The Factorial is %d\n",factorial);
156 | // printf("%d! = %d",f,factorial);
157 | // return factorial;
158 |
159 | // }
160 | // ** without return with arguments **
161 | #include
162 | void fact(int x){
163 |
164 | }
--------------------------------------------------------------------------------
/n/mannu.py:
--------------------------------------------------------------------------------
1 | # *******1st*********
2 |
3 | # x=int(input("Enter 1st Value"))
4 | # if(x<0):
5 | # print("The value is -ve")
6 | # else:
7 | # print("The value is +ve")
8 |
9 | # *******2nd*************
10 |
11 | # x=int(input("Enter any value: "))
12 | # if(x%2==0):
13 | # print("Entered value is EVEN")
14 | # else:
15 | # print("Entered Value is ODD")
16 |
17 | # *****3RD*****
18 |
19 | # x=int(input("Enter Year: \n"))
20 | # if(x%4==0):
21 | # print("THIS IS LEAP YEAR")
22 | # else:
23 | # print("THIS IS NOT A LEAP YEAR")
24 |
25 | # ***********************4TH******************** 24-03-2020******************
26 | # c=int(input("Enter Celsius"))
27 | # f=32+(9/5)*c
28 | # print(f)
29 |
30 | # *********************5TH***********************
31 |
32 | # x=int(input("Enter Any Number"))
33 | # sqrt=x**(1/2)
34 | # print(sqrt)
35 |
36 | # ******************6TH****************
37 | # x=int(input("Enter No. \n"))
38 | # y=int(input("Enter 2nd No. \n"))
39 | # z=int(input("Enter 3rd No. \n"))
40 | # print(x,y,z)
41 | # if(x>y & y>z):
42 | # print("The largest number is ",x)
43 |
44 | # elif(y>z):
45 | # print("the largest number is ",y)
46 |
47 | # else:
48 | # print("the largest number is ",z)
49 |
50 | # ******************7TH****************
51 | # x=int(input("Enter any Number \n"))
52 | # fact=1
53 | # for i in range(1,x+1):
54 | # i=++i
55 | # fact=fact*i
56 |
57 | # print(fact)
58 |
59 | # *****************8TH*******************
60 | # x=int(input("Enter Any Number \n"))
61 | # s=0
62 | # i=x
63 | # while(x!=0):
64 | # r=x%10
65 | # product=(r*r*r)
66 | # s=s+product
67 |
68 | # x=x//10
69 | # if(s==i):
70 | # print("It is a ARMSTRONG number")
71 | # else:
72 | # print("It is not a ARMSTRONG number")
73 |
74 | # ******************9TH******************
75 | # n=int(input("Enter No. \n"))
76 | # for i in range(1,n):
77 | # n=n+i
78 | # print(n)
79 |
80 | # **********************10TH***************
81 | # x=int(input("Enter any number"))
82 | # n1=0
83 | # n2=1
84 | # n3=n1+n2
85 | # print(n1)
86 | # print(n2)
87 | # for i in range(1,x):
88 | # n1=n2
89 | # n2=n3
90 | # n3=n1+n2
91 | # print(n3)
92 |
93 | # *************************************31 march 2022**************
94 | # 1.)))))))
95 | # x=int(input("Enter any no."))
96 | # i=x
97 | # while(x!=0):
98 | # r=x%10
99 | # print(r,end='')
100 | # x=x//10
101 |
102 | # 2.))))))))))
103 | # nat=int(input("Enter Any Number: \n"))
104 | # for i in range(1,nat):
105 | # nat=nat+i
106 |
107 | # print(nat)
108 |
109 | # 3.))))))))))))
110 | # x=int(input("Enter any Number: \n"))
111 | # if()
112 |
113 | # 4.))))))))))))
114 | # x=int(input("Enter Any Number \n"))
115 | # s=0
116 | # i=x
117 | # while(x!=0):
118 | # r=x%10
119 | # product=(r*r*r)
120 | # s=s+product
121 |
122 | # x=x//10
123 | # if(s==i):
124 | # print("It is a ARMSTRONG number")
125 | # else:
126 | # print("It is not a ARMSTRONG number")
127 |
128 | # 5.))))))))))))
129 | # n=int(input("Enter LOOPING no.: \n"))
130 | # num1=0
131 | # num2=1
132 | # num3=num1+num2
133 | # print(num1)
134 | # print(num2)
135 | # for i in range(1,n):
136 | # num1=num2
137 | # num2=num3
138 | # num3=num1 + num2
139 | # print(num3)
140 |
141 | # 6.)))))))))))))))
142 | # n=float(input("Enter Any NUMBER:\n"))
143 | # for i in range(1,11.1):
144 | # print(n*i)
145 |
146 | name,age,attractive = "Mahendra Singh",19,True
147 | print(name)
148 | print(age)
149 | print(attractive)
150 | print(name.find("gh"))
151 | print(name.count("a"))
152 | print(name.replace("a","o"))
153 | import math
154 | print(int(math.pow(5,2)))
155 | print(int(math.sqrt(81)))
156 | x = int(input("Enter no. : "))
157 | y = int(input("Enter 2nd No. : "))
158 | z = int(input("Enter 3rd No. : "))
159 | print(max(x,y,z))
160 | print(min(x,y,z))
161 | # ******************************************SLICING************************************************************
162 | name = name[0:8]
163 | print(name)
164 | char1 =input("Enter any Character")
165 | result1 = ord(char1)
166 | print("ASCII value of the character {} is {}.".format(char1, result1))
167 | n=int(input("Enter No. \n"))
168 | s=0
169 | i=0
170 | while(n>=i):
171 | s=s+i
172 | i=i+1
173 | print(s)
--------------------------------------------------------------------------------
/Web/Trial.htm:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 | Document
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
18 |
19 |
REGISTER
20 |
LOGIN
21 |
22 |
23 |
24 |
25 |
29 |
30 |
31 |
32 |
33 |
34 |
35 |
36 |
37 |
38 | Search
39 |
40 |
41 |
42 |
Highlighted Research
43 |
Name
44 | Name
45 | Name
46 | Name
47 | Name
48 | Name
49 | Name
50 | Name
51 | Name
52 | Name
53 |
Recent Seminars
54 |
Name
55 | Name
56 | Name
57 | Name
58 | Name
59 | Name
60 | Name
61 | Name
62 | Name
63 | Name
64 |
Upcoming Events
65 |
Name
66 | Name
67 | Name
68 | Name
69 | Name
70 | Name
71 | Name
72 | Name
73 | Name
74 | Name
75 |
76 |
77 |
78 |
79 |
Quick Link
80 |
81 | About Us
82 | FAQ
83 |
84 |
85 |
Important Links
86 |
87 | Login/Register
88 | Events
89 |
90 |
91 |
Contact Us
92 |
93 |
94 |
95 | FOLLOW US
96 |
97 |
98 |
99 |
100 |
101 |
102 |
103 |
104 |
105 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/Untitled1.cpp:
--------------------------------------------------------------------------------
1 | /*#include
2 | int Areal()
3 | {
4 | int l,b,area;
5 | printf("Enter Lenght of Rectangle : ");
6 | scanf("%d",&l);
7 | printf("Enter width of Rectangle :");
8 | scanf("%d",&b);
9 | area = l*b;
10 | printf("Area of rectangle is %d",area);
11 | return area;
12 | }
13 | int main()
14 | {
15 | Areal();
16 |
17 | return 0;
18 | }*/
19 |
20 | /*#include
21 | #include
22 | int squaroot()
23 | {
24 | float x,result;
25 | printf("Enter value: ");
26 | scanf("%f",&x);
27 | result=sqrt(x);
28 | printf("Square root of %f is %f",x,result);
29 | return 0;
30 | }
31 | int main()
32 | {
33 | squaroot();
34 | return 0;
35 | }*/
36 |
37 | /*#include
38 | #include
39 | int man(char st[])
40 | {
41 | int len;
42 | len = strlen(st);
43 | for(len;len>=0;len--)
44 | {
45 | putchar(st[len-1]);
46 | }
47 | }
48 | int main()
49 | {
50 | char name[]="tesB ehT sI margorP C";
51 | man(name);
52 | return 0;
53 | }*/
54 |
55 | /*#include
56 | int Fibonacci(){
57 | int i,n;
58 | int t1 = 0;
59 | int t2 = 1;
60 | int nterm = t1 + t2;
61 | printf("Enter the number of terms: \n");
62 | scanf("%d",&n);
63 |
64 | for (i=3 ; i<=n ; ++i)
65 | {
66 | printf("%d\t",nterm);
67 | t1 = t2;
68 | t2 = nterm;
69 | nterm = t1 +t2;
70 | }
71 | return 0;
72 | }
73 | int main(int t1,int t2)
74 | {
75 | printf("Fibonacci Series: %d %d ",t1,t2);
76 | Fibonacci();
77 | return 0;
78 | }*/
79 | /*#include
80 | #include
81 | int squaroot()
82 | {
83 | float x,result;
84 | printf("Enter value: ");
85 | scanf("%f",&x);
86 | result=sqrt(x);
87 | printf("Square root of %f is %f",x,result);
88 | return 0;
89 | }
90 | int main()
91 | {
92 | squaroot();
93 | return 0;
94 | }*/
95 |
96 | /*#include
97 | int main(){
98 | int a,b=1,n;
99 | printf("Enter no. of star to make half pyramid :");
100 | scanf("%d",&a);
101 | for (n = 1; n<=a ; n++){
102 | for (b=1; b<=n ;b++){
103 | printf("* ");
104 | }
105 | printf("\n");
106 |
107 | }
108 | return 0;
109 | }*/
110 | /*TODAY'S TEST AND VIVA [ 16 - 12 - 21 ] */
111 | #include
112 | int main(){
113 | int a,b,n;
114 | printf("Enter no. of star to make half pyramid :");
115 | scanf("%d",&a);
116 | for (n = 1; n>=1 ; ++n){
117 | for (b=1; b<=n ;b++){
118 | printf("* ");
119 | }
120 | printf("\n");
121 |
122 | }
123 | return 0;
124 | }
125 |
126 | /*#include
127 | int main(){
128 | char grade;
129 | printf("Enter Your Grade to know your result\n");
130 | scanf("%c",&grade);
131 |
132 | switch(grade){
133 | case 'O':
134 | printf("You have scored above 97 percentile");
135 | break;
136 | case 'E':
137 | printf("You have scored above 91");
138 | break;
139 | case 'A':
140 | printf("you have scored above 87");
141 | break;
142 | case 'B':
143 | printf("you have scored above 78");
144 | break;
145 | case 'C':
146 | printf("You have scored below 70");
147 | break;
148 | case 'D':
149 | printf("You have scored below 50");
150 | break;
151 | default:
152 | printf("YOU ARE FAIL GO REVISE THE SYLLABUS AND GIVE EXAMS AGAIN");
153 | }
154 | return 0;
155 | }*/
156 |
157 | /*#include
158 | int main(){
159 | int a,b,s=0,m=1;
160 | printf("Enter any three digit numric value");
161 | scanf("%d",&a);
162 | while(a!=0)
163 | {
164 | b=a%10;
165 | s=a+b;
166 | m=a*b;
167 | a=a/10;
168 | }
169 | if(s==m)
170 | printf("The No. is a spy number");
171 |
172 | else
173 | printf("The No. is Not a spy number");
174 |
175 | return 0;
176 | }*/
177 |
178 | /*#include
179 | int main(){
180 |
181 | }*/
182 |
183 | /*#include
184 | int main(){
185 | int num1,num2,num3;
186 | printf("enter value for num1",num1);
187 | scanf("%d",&num1);
188 | printf("enter value for num2",num2);
189 | scanf("%d",&num2);
190 | printf("enter value for num3",num3);
191 | scanf("%d",&num3);
192 | if(num1
3 | int main()
4 | {
5 | printf("");
6 | return 0;
7 | }*/
8 | //Program 2//
9 | /*#include
10 | int main(){
11 | int x;
12 | x=123;
13 | printf("my age is %d years old",x);
14 | return 0;
15 | }*/
16 | //Program 3 //
17 | /*#include
18 | int main(){
19 | printf("my name is mannu \n");
20 | printf("and your phone number is 800xxxxxx7");
21 | }*/
22 | //Program 4//
23 | /*#include
24 | int main(){
25 | int x=19;
26 | int y=22;
27 | char name[] ="Mahendra Singh";
28 | char* grade ="A";
29 | printf("Your name is %s \n",name);
30 | printf("and your age is %d thats right\n",x);
31 | return 0;
32 | }*/
33 | //PROGRAM 5//
34 | /*#include
35 | int main(){
36 | char name[]="Mahendra singh";
37 | int x=21;
38 | char* grade="A";
39 | int age=19;
40 |
41 | printf("My name is %s\n",name);
42 | printf("and my age is %d years old\n",age);
43 | return 0;
44 | }*/
45 |
46 |
47 | /*#include
48 | int main(){
49 | int year;
50 | printf("The year is leap year or not\n");
51 | scanf("%d",&year);
52 | (year%4==0 && year%100!=0) ? (printf("The year is leap year")):(printf("Year is not leap year"));
53 | return 0;
54 | }*/
55 |
56 |
57 |
58 | /*#include
59 | int main(){
60 | float x,y,a;
61 | printf("Enter two Variables :\n");
62 | scanf("%f%f",&x,&y);
63 |
64 | printf("Afer Swaping variable 1st is %f and variable 2nd is %f\n",x,y);
65 | a=x;
66 | x=y;
67 | y=a;
68 | printf("Before Swapping Variable 1st is %f and Vriable 2nd is %f\n",x,y);
69 |
70 | return 0;
71 |
72 |
73 | }*/
74 |
75 | /*#include
76 | int main(){
77 | int a,b;
78 | printf("Enter two Variable\n");
79 | scanf("%d%d",&a,&b);
80 |
81 | printf("Afer Swaping variable 1st is %d and variable 2nd is %d\n",a,b);
82 | a=a*b;
83 | b=a/b;
84 | a=a/b;
85 | printf("Before swapping variable 1st is %d and variable 2 is %d\n",a,b);
86 | return 0;
87 | }*/
88 |
89 |
90 | /*#include
91 | int main(){
92 | int num;
93 | printf("Enter Number to check weither number is odd or even");
94 | scanf("%d",&num);
95 | (num%2==0) ? (printf("This number is even")):(printf("This number is odd"));
96 | return 0;
97 |
98 | }*/
99 |
100 | /*#include
101 | int main(){
102 | int a,b,c;
103 | printf("Enter value two value ");
104 | scanf("%d%d%d",&a,&b,&c);
105 |
106 |
107 | }*/
108 |
109 | // #include
110 | // int main(){
111 | // int a,b,c=0;
112 | // printf("Enter first number:",a);
113 | // scanf("%d",&a);
114 | // printf("Enter second number:",b);
115 | // scanf("%d",&b);
116 | // c=a;
117 | // a=b;
118 | // b=c;
119 | // printf("After swapping \n");
120 | // printf("a=%d\n",a);
121 | // printf("b=%d\n",b);
122 |
123 | // return 0;
124 | // }
125 |
126 | /*#include
127 | int main(){
128 | int number;
129 | printf("enter a number:",number);
130 | scanf("%d",&number);
131 | if(number%2==0)
132 | printf("%d is even",number);
133 | else
134 | printf("%d is odd",number);
135 |
136 | return 0;
137 |
138 | }*/
139 |
140 | /*#include
141 | int main(){
142 | int num1,num2,num3;
143 | printf("enter value for num1",num1);
144 | scanf("%d",&num1);
145 | printf("enter value for num2",num2);
146 | scanf("%d",&num2);
147 | printf("enter value for num3",num3);
148 | scanf("%d",&num3);
149 | if(num1
164 | int main(){
165 | int a,b,c=0;
166 | printf("enter value for a :",a);
167 | scanf("%d",&a);
168 | printf("enter valyue for a :",b);
169 | scanf("%d",&b);
170 | printf("Before swapping \n");
171 | printf("a=%d\n",a);
172 | printf("b=%d\n",b);
173 | c=a+b;
174 | a=c-b;
175 | b=c-b;
176 | printf("After swapping\n");
177 | printf("a=%d\n",a);
178 | printf("b=%d\n",b);
179 |
180 | return 0;
181 |
182 | }*/
183 |
184 | #include
185 | int main(){
186 | int a,b; int pp,lp;
187 | printf("enter the selling price");
188 | scanf("%d",&a);
189 | printf("enter the cost price");
190 | scanf("%d",&b);
191 | if(a>b)
192 | {
193 | pp=((a-b)*100)/b;
194 | printf("%d is profit percentage\n",pp);
195 | }
196 | else if(b>a)
197 | {
198 | lp=((b-a)*100)/b;
199 | printf("%d is loss percentage\n",lp);
200 | }
201 | else
202 | printf("neither profit nor loss");
203 | }
204 |
--------------------------------------------------------------------------------
/NEW/Again.c:
--------------------------------------------------------------------------------
1 | //#include
2 | //#include
3 | //#include
4 | //#include
5 | //
6 | //int main(){
7 | // char str[20];
8 | // gets(str);
9 | // printf("%s", str);
10 | // return 0;
11 | //}
12 |
13 | //#include
14 | //int main(){
15 | // int arr[20],n,n1;
16 | // printf("Enter the Range: \n");
17 | // scanf("%d",&n);
18 | // for(int i=0;i
37 | //int main(){
38 | // int arr[20],n,n1,temp;
39 | // printf("Enter the Range: \n");
40 | // scanf("%d",&n);
41 | // for(int i=0;i
74 | #include
75 | #define max 5
76 | void push();
77 | void pop();
78 | void display();
79 | void search();
80 | void peep();
81 | int STACK[max],top=-1,n,n1;
82 | int main(){
83 | int choice;
84 | while(1){
85 | printf("\n1.PUSH\n");
86 | printf("2.POP\n");
87 | printf("3.DISPLAY\n");
88 | printf("4.SEARCH\n");
89 | printf("5.PEEP\n");
90 | printf("6.EXIT\n");
91 | printf("Enter your Choice: \n");
92 | scanf("%d",&choice);
93 | switch(choice){
94 | case 1:
95 | push();
96 | break;
97 | case 2:
98 | pop();
99 | break;
100 | case 3:
101 | display();
102 | case 4:
103 | search();
104 | break;
105 | case 5:
106 | peep();
107 | break;
108 | case 6:
109 | exit(0);
110 | }
111 | }
112 | return 0;
113 | }
114 | void push(){
115 | if(top==max-1){
116 | printf("STACK OVERFLOW!! :-(\n");
117 | return;
118 | }
119 | top=top+1;
120 | printf("Enter the element to insert:\n");
121 | scanf("%d",&n);
122 | STACK[top]=n;
123 | printf("OPERATION SUCCESSFULLY DONE **:-)**\n");
124 | }
125 | void pop(){
126 | if(top==-1){
127 | printf("STACK UNDERFLOW !! :-(\n");
128 | return;
129 | }
130 | n=STACK[top];
131 | top=top-1;
132 | printf("OPERATION SUCCESSFULLY DONE **:-)**\n");
133 | }
134 | void display(){
135 | while(top!=-1){
136 | printf("%d\n",STACK[top]);
137 | top--;
138 | }
139 | }
140 | void search(int n1){
141 | printf("Enter any element \n");
142 | scanf("%d",&n1);
143 | for(int i=0;i
159 | //#include
160 | //#define max 5
161 | //void enqueue();
162 | //void dequeue();
163 | //void disp();
164 | //int QUEUE[max],front=-1,rear=-1,n;
165 | //int main(){
166 | // int choice;
167 | // while(1){
168 | // printf("\n1.Enqueue \n");
169 | // printf("2.Dequeue\n");
170 | // printf("3.Display\n");
171 | // printf("Enter your Choice");
172 | // scanf("%d",&choice);
173 | // switch (choice) {
174 | // case 1:
175 | // enqueue();
176 | // break;
177 | // case 2:
178 | // dequeue();
179 | // break;
180 | // case 3:
181 | // disp();
182 | // break;
183 | // case 4:
184 | // exit(0);
185 | // default:
186 | // printf("\nEnter Valid Choice\n");
187 | // break;
188 | // }
189 | // }
190 | //}
191 | //void enqueue(){
192 | // if(rear==max-1){
193 | // printf("\nQUEUE OVERFLOW !!!\n");
194 | // return;
195 | // }
196 | // else{
197 | // if(front==-1){
198 | // front=0;
199 | // }
200 | // printf("Enter the Data to enqueue: \n");
201 | // scanf("%d",&n);
202 | // rear++;
203 | // QUEUE[rear] = n;
204 | // }
205 | //}
206 | //void dequeue(){
207 | // if(front==-1 || front>rear){
208 | // printf("QUEUE UNDERFLOW !!!\n");
209 | // return;
210 | // }
211 | // else{
212 | // n=QUEUE[front];
213 | // printf("The Item DEQUEUED IS %d",QUEUE[front]);
214 | // front++;
215 | // }
216 | //}
217 | //void disp(){
218 | // if(front==-1){
219 | // printf("!!@!! Nothing is here !!@!!\n");
220 | // return;
221 | // }
222 | // else{
223 | // printf("The ELEMENTS ARE: \n");
224 | // for(int i=front;i<=rear;i++){
225 | // printf("%d \n",QUEUE[i]);
226 | // }
227 | // }
228 | //}
229 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/DEV.c:
--------------------------------------------------------------------------------
1 | /*#include
2 | int main(){
3 |
4 | float fahrenheit,celsius;
5 | printf("Enter temperature in fahrenheit:");
6 | scanf("%f",&fahrenheit);
7 |
8 | fahrenheit = (celsius * 9/5) + 32; //Celsius to Fahrenheit Conversion formula//
9 |
10 | printf("%f fahrenheit = %f celsius",fahrenheit,celsius);
11 |
12 | return 0;
13 | }*/
14 |
15 | /*#include
16 | int main(){
17 | char m;
18 | printf("Enter any value to know the character\n");
19 | scanf("%c",&m);
20 | if('a'<=m && 'z'>=m || 'A'<=m && 'Z'>=m){
21 | printf("It's a Alphabet");
22 | }
23 | else if('0'<=m && '9'>=m){
24 | printf("It's a Digit");
25 | }
26 | else{
27 | printf("It's is a speacial character");
28 | }
29 | return 0;
30 |
31 | }*/
32 |
33 | /*#include
34 | int main(){
35 | int i,j,n;
36 | printf("Enter a no. to form a half pyramid");
37 | scanf("%d",&n);
38 | for(i=1;i<=n;i++){
39 | for(j=1;j<=i;j++)
40 | printf("@@@ ");
41 | printf("\n");
42 |
43 |
44 | }
45 | return 0;
46 | }*/
47 |
48 | /*#include
49 | int main(){
50 | int i,sum=0;
51 | do{
52 | printf("Enter no. to add");
53 | scanf("%d",&i);
54 | sum= sum + i;
55 | }while(i!=0);
56 | printf("Sum is %d",sum);
57 | return 0;
58 | }*/
59 |
60 | /*#include
61 | int main(){
62 | int num1,num2,num3;
63 | printf("enter value for num1\n",num1);
64 | scanf("%d",&num1);
65 | printf("enter value for num2\n",num2);
66 | scanf("%d",&num2);
67 | printf("enter value for num3\n",num3);
68 | scanf("%d",&num3);
69 | if(num1
85 | int main(){
86 | int num1,num2,num3;
87 | printf("enter num1");
88 | scanf("%d",&num1);
89 | printf("enter num2");
90 | scanf("%d",&num2);
91 | printf("enter num3");
92 | scanf("%d",&num3);
93 | if(num1>num2 && num1>num3){
94 | printf("%d is largest",num1);
95 | }
96 | else if(num2>num3){
97 | printf("%d is largest",num2);
98 | }
99 | else{
100 | printf("%d is largest",num3);
101 | }
102 | return 0;
103 | }*/
104 |
105 | /*1. ) Write a Program to calculate and display the volume of a CUBE having its height (h=10cm),
106 | width (w=12cm) and depth (8cm).*/
107 |
108 | /*#include
109 | #include
110 |
111 | int main()
112 | {
113 | float width=12, length=8, height=10;
114 | float volume;
115 |
116 | volume = width * length * height;
117 |
118 | printf("\n Volume of cuboids is : %.3f", volume);
119 |
120 | return 0;
121 | }*/
122 |
123 | /*Q2. Write a program to take input of name, rollno and marks obtained by a student in 5 subjects
124 | each have its 100 full marks and display the name, rollno with percentage score secured.*/
125 | /*#include
126 | #include
127 |
128 | int main ()
129 | {
130 |
131 | char name[20];
132 | int roll;
133 | float sub1,sub2,sub3,sub4,sub5,roll_no,per,total;
134 |
135 | printf("enter the name of student");
136 | gets(name);
137 | printf("Enter the student's, roll number and marks in five subjects:");
138 | scanf("%d %f %f %f %f %f",&roll,&sub1,&sub2,&sub3,&sub4,&sub5);
139 | total=sub1+sub2+sub3+sub4+sub5;
140 | per=100*total/500;
141 | printf("percentage scored by student %f :\n",per);
142 |
143 |
144 | return 0;
145 |
146 | }
147 | */
148 | /*Q3. Write a program to take a character input from keyboard and check if it is a number or
149 | alphabet or special character*/
150 |
151 | /*#include
152 | int main(){
153 | char m;
154 | printf("Enter any Character\n");
155 | scanf("%c",&m);
156 | if(m>='a' && m<='z' || m>='A' && m<='Z')
157 | {
158 | printf("%c is alphabet\n",m);
159 | }
160 | else if(m>='0' && m<='9')
161 | {
162 | printf("%c is Digit\n",m);
163 | }
164 | else
165 | {
166 | printf("%c is a special character\n",m);
167 | }
168 | return 0;
169 |
170 | }
171 | */
172 |
173 | /*Q4. Write a program to read two matrices of order 3 * 2, add them and display the resultant
174 | matrix in matrix form.*/
175 | // #include
176 | // int main() {
177 | // int r, c, a[100][100], b[100][100], sum[100][100], i, j;
178 | // printf("Enter the number of rows (between 1 and 100): ");
179 | // scanf("%d", &r);
180 | // printf("Enter the number of columns (between 1 and 100): ");
181 | // scanf("%d", &c);
182 |
183 | // printf("\nEnter elements of 1st matrix:\n");
184 | // for (i = 0; i < r; ++i)
185 | // for (j = 0; j < c; ++j) {
186 | // printf("Enter element a%d%d: ", i + 1, j + 1);
187 | // scanf("%d", &a[i][j]);
188 | // }
189 |
190 | // printf("Enter elements of 2nd matrix:\n");
191 | // for (i = 0; i < r; ++i)
192 | // for (j = 0; j < c; ++j) {
193 | // printf("Enter element b%d%d: ", i + 1, j + 1);
194 | // scanf("%d", &b[i][j]);
195 | // }
196 |
197 | // // adding two matrices
198 | // for (i = 0; i < r; ++i)
199 | // for (j = 0; j < c; ++j) {
200 | // sum[i][j] = a[i][j] + b[i][j];
201 | // }
202 |
203 | // // printing the result
204 | // printf("\nSum of two matrices: \n");
205 | // for (i = 0; i < r; ++i)
206 | // for (j = 0; j < c; ++j) {
207 | // printf("%d ", sum[i][j]);
208 | // if (j == c - 1) {
209 | // printf("\n\n");
210 | // }
211 | // }
212 |
213 | // return 0;
214 | // }
215 | /*#include
216 | int main(){
217 | int i,n,pow;
218 | printf("Enter value: \n");
219 | scanf("%d",&i);
220 | printf("enter value: \n");
221 | scanf("%d",&n);
222 | pow=i*n;
223 | printf(pow);
224 | return 0;
225 | }*/
226 |
--------------------------------------------------------------------------------
/2022 New folder/1.c:
--------------------------------------------------------------------------------
1 | /*#include
2 | int main(){
3 | int grade;
4 | printf("Welcome mother fucker: \n");
5 | while(1){
6 | scanf("%d",&grade);
7 | switch(grade){
8 | case 1:
9 | {
10 | char a;
11 | printf("Add loda:\n");
12 | scanf("%f",&a);
13 | printf("name Added Successfully\n");
14 | break;
15 |
16 | }
17 | case '2':
18 | {
19 | char a;
20 | printf("Enter Doctor's name: \n");
21 | scanf("%f",&a);
22 | printf("Name Added Successfully\n");
23 | break;
24 | }
25 | case 3:
26 | {
27 | char a;
28 | printf("Enter Your Specilization: \n");
29 | scanf("%f",&a);
30 | printf("Added Successfully\n");
31 | break;
32 |
33 | }
34 | default:
35 | printf("Invalid grade");
36 | break;
37 | }
38 | return 0;
39 | }
40 | */
41 | /*#include
42 | int input();
43 | void output(float);
44 | int main()
45 | {
46 | float result;
47 | int choice, num;
48 | printf("Press 1 to calculate area of circle\n");
49 | printf("Press 2 to calculate area of square\n");
50 | printf("Press 3 to calculate area of sphere\n");
51 | printf("Enter your choice:\n");
52 | choice = input();
53 | switch (choice) {
54 | case 1: {
55 | printf("Enter radius:\n");
56 | num = input();
57 | result = 3.14 * num * num;
58 | printf("Area of sphere=");
59 | output(result);
60 | break;
61 | }
62 | case 2: {
63 | printf("Enter side of square:\n");
64 | num = input();
65 | result = num * num;
66 | printf("Area of square=");
67 | output(result);
68 | break;
69 | }
70 | case 3: {
71 | printf("Enter radius:\n");
72 | num = input();
73 | result = 4 * (3.14 * num * num);
74 | printf("Area of sphere=");
75 | output(result);
76 | break;
77 | }
78 | default:
79 | printf("wrong Input\n");
80 | }
81 | return 0;
82 | }
83 | int input()
84 | {
85 | int number;
86 | scanf("%d", &number);
87 | return (number);
88 | }
89 | void output(float number)
90 | {
91 | printf("%f", number);
92 | } */
93 |
94 | //#include
95 | //#include
96 | //int main(){
97 | // int choice,i,num;
98 | // unsigned long int fact,sum;
99 | // while(1){
100 | // printf("MENU\n\n\n");
101 | // printf("1 to find Factorial \n");
102 | // printf("2 to add two numbers \n");
103 | // printf("3 to find the no. is even or odd \n");
104 | // printf("4 to convert fahrenheit to celsius \n");
105 | // printf("5 to find the largest no. amoung 3 numbers \n");
106 | // printf("6 TO QUIT\n");
107 | // printf("Enter Choice:\n");
108 | // scanf("%d",&choice);
109 | //
110 | //
111 | // switch(choice){
112 | // case 1:
113 | // printf("Enter Any number: \n");
114 | // scanf("%d",&num);
115 | // int y=num;
116 | // fact = 1;
117 | // for (i=1; i<=num ; ++i)
118 | // {
119 | // num*=i;
120 | // }
121 | // printf("Factorial of %d is %d",y,num);
122 | // break;
123 | //
124 | // case 2:
125 | // printf("Enter Any numbers to add :\n");
126 | // scanf("%d",&num);
127 | //
128 | // do
129 | // {
130 | // printf("Enter Any numbers to add :\n");
131 | // scanf("%d",&num);
132 | //
133 | // sum+=num;
134 | // } while (num!=0);
135 | // printf("The sum is %d \n\n\n",sum);
136 | //
137 | // break;
138 | //
139 | // case 3:
140 | // printf("Enter Any number:\n");
141 | // scanf("%d",&num);
142 | // if(num%2==0){
143 | // printf("Number is even");
144 | // }
145 | // else
146 | // printf("Number is odd");
147 | //
148 | // break;
149 | //
150 | // case 4:
151 | // printf("Enter any number :\n");
152 | // scanf("%d",&num);
153 | // fact = num * (9/5) + 32;
154 | // printf("Fahrenheit is %d",fact);
155 | //
156 | // break;
157 | //
158 | // case 5:
159 | // printf("Enter any number to find the largest amoung them");
160 | // scanf("%d%d%d",&fact,&i,&num);
161 | // if(num>fact && num>i){
162 | // printf("The %d largest amoung them",num);
163 | // }
164 | // else if(fact>i){
165 | // printf("The %d lagest amoung them",fact);
166 | // }
167 | // else
168 | // printf("%d is largest amoung them",&num);
169 | //
170 | // case 6:
171 | // exit(0);
172 | //
173 | // }
174 | // }return 0;
175 | //}
176 |
177 |
178 |
179 |
180 | // ** Ascending Order ARRAY **
181 | #include
182 | int main(){
183 | int n,arr[n],e,s,p=0,pos;
184 | printf("enter the size: \n");
185 | scanf("%d",&n);
186 | for(int i=0;iarr[a]){
196 | e = arr[i];
197 | arr[i] = arr[a];
198 | arr[a] = e;
199 | }
200 | }
201 | }
202 | printf("Enter element to search:-- ");
203 | scanf("%d",&s);
204 | for(int i=0;i<=n;i++){
205 | if(arr[i]==s){
206 | p=1;
207 | printf("%d",i);
208 | break;
209 | }
210 | }
211 | // printf("Enter the position to be deleted: ");
212 | // scanf("%d ",&pos);
213 | // void del(int pos){
214 | // for(int i=pos;i
2 | #include
3 | int main(){
4 | char name[25];
5 | printf("Enter your Name : \n");
6 | scanf("%s",&name);
7 | printf("Hello %s",name);
8 | while(strlen(name) == 1){
9 | printf("you Dumb Enter Your Name:::==== \n");
10 | printf("Enter your Name: ");
11 | scanf("%s",&name);
12 | printf("Hello %s",name);
13 |
14 | }
15 | return 0;
16 | }*/
17 | // Taking Input in 1-D Array;
18 | /*#include
19 | int main(){
20 | int a;
21 | printf("Enter the size: ");
22 | scanf("%d",&a);
23 | int arr[a];
24 | for(int i=0;i
34 | int main(){
35 | int a,b;
36 | printf("Rows: ");
37 | scanf("%d",&a);
38 | printf("Coloumn: ");
39 | scanf("%d",&b);
40 | int arr[a][b];
41 | for(int i=0;i
58 | //int main(){
59 | // int num[20];
60 | // int i, j, a, n;
61 | // printf("enter number of elements in an array\n");
62 | // scanf("%d", &n);
63 | // printf("Enter the elements\n");
64 | // for (i = 0; i < n; ++i)
65 | // scanf("%d", &num[i]);
66 | // for (i = 0; i < n; ++i){
67 | // for (j = i + 1; j < n; ++j){
68 | // if (num[i] > num[j]){
69 | // a = num[i];
70 | // num[i] = num[j];
71 | // num[j] = a;
72 | // }
73 | // }
74 | // }
75 | // printf("The numbers in ascending order is:\n");
76 | // for (i = 0; i < n; ++i){
77 | // printf("%d\n", num[i]);
78 | // }
79 | //}
80 |
81 | /*#include
82 | int main(){
83 | int s,arr[s];
84 | printf("gc");
85 | scanf("%d",&s);
86 | for(int i=0;iarr[i+1]) {
95 | int temp = arr[i];
96 | arr[i] = arr[i+1];
97 | arr[i+1] = temp;
98 | }
99 | }
100 | }
101 | for(int i=0;i
106 | int main(){
107 | int r,c,arr[r][c];
108 | printf("Enter rows and coloumn: \n");
109 | scanf("%d%d",&r,&c);
110 | printf("Enter the Elements: ");
111 | for(int i=0;i
125 | int main(){
126 | int i,arr[i];
127 | int ANS=0;
128 | printf("Enter no. of problems done in each week: ");
129 | for (int i=1;i<=4;i++){
130 | printf("P%d = ",i);
131 | scanf("%d",&arr[i]);
132 | }
133 | for(int i=0;i<5;i++){
134 | if(arr[i]>=10){
135 | ANS=ANS+1;
136 | }
137 |
138 | }
139 | printf("%d",ANS);
140 | return 0;
141 | }*/
142 | /*#include
143 | #include
144 | int main(){
145 | char str[40],str1[40],A;
146 | str1[40] = str[40];
147 | printf("Enter the Word: ");
148 | scanf("%s",&str);
149 | A = strrev(str);
150 | printf("The Reverse is %s",A);
151 | }*/
152 |
153 | /*#include
154 | #include
155 | int main()
156 | {
157 | char str1[40];
158 | char str[40],a;
159 | printf ("string: \n");
160 | scanf ("%s", str1);
161 | printf("%s",str);
162 | if(strrev(str1)==str){
163 | printf("YES");
164 | }
165 | else{
166 | printf("NO");
167 | }
168 |
169 | return 0;
170 | }*/
171 | /*#include
172 | int main(){
173 | int t;
174 | long int X1,X2,Y1,Y2;
175 | printf("Enter Price: \n");
176 | scanf("%d",&t);
177 | for(int i=0;iY2){
186 | printf("%ld",X1+Y2);
187 | }
188 | if(X1Y2){
189 | printf("%ld",X1+Y2);
190 | }
191 |
192 | }
193 |
194 | }*/
195 | //#include
196 | //int main(){
197 | // int t;
198 | // scanf("%d",&t);
199 | // int X1,Y1,X2,Y2,TOT1,TOT2;
200 | // for(int i=0;i
218 | //int main(){
219 | // int t,a,n;
220 | // scanf("%d",&t);
221 | // for(int i=0;i
228 | //int main(){
229 | // int r,c,arr[r][c];
230 | // printf("Enter rows And colounm: \n");
231 | // scanf("%d%d",&r,&c);
232 | // int t=r,p=c;
233 | //
234 | // for(int i=0;i<=t;i++){
235 | // printf("\n");
236 | // for(int j=0;j
250 | //int main(){
251 | // int N,K,t;
252 | // scanf("%d",&t);
253 | // for(int i=0;i=K){
257 | // printf("NO");
258 | // }
259 | // if(N
267 | //int main(){
268 | // int t,N,K,M;
269 | // scanf("%d",&t);
270 | // for(int i=0;iR && N%R == 0){
276 | // printf("%d",N/R);
277 | // }
278 | // else{
279 | // printf("%d",(N/R)+1);
280 | // }
281 | // }
282 | //}
283 | //#include
284 | //int main(){
285 | // int arr[3][3];
286 | //// printf("Enter the no. of ROWS AND COLOUMN: \n");
287 | //// scanf("%d",&r);
288 | //// scanf("%d",&c);
289 | // for(int i=0;i<3;i++){
290 | // for(int j=0;j<3;j++){
291 | // printf("Arr[%d][%d]=",i,j);
292 | // scanf("%d",&arr[i][j]);
293 | // }
294 | // for(int i=0;i<3;i++){
295 | // for(int j=0;j<3;j++){
296 | // printf("%d",arr[i][j]);
297 | // }
298 | // }
299 | // return 0;
300 | // }
301 | //
302 |
--------------------------------------------------------------------------------
/Websites Practice/Websites.html:
--------------------------------------------------------------------------------
1 |
26 |
56 |
--------------------------------------------------------------------------------
/Python Pro/Matrix_Cal.py:
--------------------------------------------------------------------------------
1 | import copy
2 |
3 |
4 | class Matrix:
5 |
6 | def __init__(self, inper):
7 | self.rows, self.columns = inper.split()
8 |
9 | def create(self):
10 | self.matrix = [[float(n) for n in input().split()] for _row in range(int(self.rows))]
11 |
12 | def add(self, mtx):
13 | if self.rows == mtx.rows and self.columns == mtx.columns:
14 | result = [[self.matrix[i][j] + mtx.matrix[i][j] for j in range(len(self.matrix[0]))] for i in
15 | range(len(self.matrix))]
16 | for row in result:
17 | for number in row:
18 | print(number, end=" ")
19 | print()
20 | else:
21 | print("ERROR")
22 |
23 | def multiply(self, number):
24 | result = [[self.matrix[i][j] * number for j in range(len(self.matrix[0]))] for i in range(len(self.matrix))]
25 | for row in result:
26 | for number in row:
27 | print(round(number, 4), end=" ")
28 | print()
29 |
30 | def transpose(self):
31 | transposed = [[self.matrix[i][j] for i in range(len(self.matrix))] for j in range(len(self.matrix[0]))]
32 | self.matrix = transposed
33 |
34 | def transpose_side(self):
35 | transposed = [[self.matrix[i][j] for i in range(-1, -len(self.matrix) - 1, -1)] for j in
36 | range(-1, -len(self.matrix[0]) - 1, -1)]
37 | self.matrix = transposed
38 |
39 | def transpose_vertical(self):
40 | for row in self.matrix:
41 | row.reverse()
42 |
43 | def transpose_horizontal(self):
44 | self.matrix.reverse()
45 |
46 | def printer(self):
47 | for row in self.matrix:
48 | for number in row:
49 | print(int(number), end=" ")
50 | print()
51 |
52 | def multiply_matrices(self, mtx):
53 | if self.columns != mtx.rows:
54 | print("The operation cannot be performed.")
55 | else:
56 | result = [[sum([self.matrix[i][k] * mtx.matrix[j][k] for k in range(len(mtx.matrix[0]))]) for j in
57 | range(len(mtx.matrix))] for i in range(len(self.matrix))]
58 |
59 | for row in result:
60 | for number in row:
61 | print(round(number, 2), end=" ")
62 | print()
63 |
64 | @staticmethod
65 | def determinant(mtx):
66 | if len(mtx) == 1:
67 | return mtx[0][0]
68 | elif len(mtx) == 2:
69 | det = mtx[0][0] * mtx[1][1] - mtx[1][0] * mtx[0][1]
70 | return det
71 | else:
72 | recur = 0
73 | for i, e in enumerate(mtx):
74 | rex = mtx[0][i] * Matrix.determinant([[el for ind, el in enumerate(matx) if ind != i] for matx in mtx[1:]])
75 | if i % 2 == 0:
76 | recur += rex
77 | else:
78 | recur -= rex
79 | return recur
80 |
81 | @staticmethod
82 | def create_identity_matrix(siz):
83 | size = int(siz.split()[0])
84 | return [[1 if i == j else 0 for i in range(size)] for j in range(size)]
85 |
86 | @staticmethod
87 | def cofactor_matrix(size, mtx):
88 | cofa = []
89 | for i in range(len(mtx)):
90 | temp_cof = []
91 | for j in range(len(mtx[0])):
92 | temp_mtx = copy.deepcopy(mtx)
93 | temp_mtx.pop(i)
94 | # print(temp_mtx)
95 | for mitx in temp_mtx:
96 | # print(mitx)
97 | mitx.pop(j)
98 | # print(mitx)
99 | cof_el = Matrix.determinant(temp_mtx) * (-1)**(i+j)
100 | temp_cof.append(cof_el)
101 | cofa.append(temp_cof)
102 | c = Matrix(size)
103 | c.matrix = cofa
104 | return c
105 |
106 |
107 | def menu():
108 | while True:
109 | print("1. Add matrices\n2. Multiply matrix by a constant\n3. Multiply matrices\n\
110 | 4. Transpose matrix\n5. Calculate a determinant\n6. Inverse matrix\n0. Exit")
111 | choice = input()
112 | if choice == "1":
113 | print("Enter size of first matrix: ")
114 | matrix_a = Matrix(input())
115 | print("Enter first matrix: ")
116 | matrix_a.create()
117 |
118 | print("Enter size of second matrix: ")
119 | matrix_b = Matrix(input())
120 | print("Enter second matrix: ")
121 | matrix_b.create()
122 |
123 | print("The result is:")
124 | matrix_a.add(matrix_b)
125 |
126 | elif choice == "2":
127 | print("Enter size of matrix: ")
128 | matrix_a = Matrix(input())
129 | print("Enter matrix: ")
130 | matrix_a.create()
131 |
132 | const = int(input("Enter constant: "))
133 | print("The result is:")
134 | matrix_a.multiply(const)
135 |
136 | elif choice == "3":
137 | print("Enter size of first matrix: ")
138 | matrix_a = Matrix(input())
139 | print("Enter first matrix: ")
140 | matrix_a.create()
141 |
142 | print("Enter size of second matrix: ")
143 | matrix_b = Matrix(input())
144 | print("Enter second matrix: ")
145 | matrix_b.create()
146 | matrix_b.transpose()
147 | # print(matrix_b.matrix)
148 | print("The result is:")
149 | matrix_a.multiply_matrices(matrix_b)
150 |
151 | elif choice == "4":
152 | print('1. Main diagonal\n2. Side diagonal\n3. Vertical line\n4. Horizontal line')
153 | tran_choice = input("Your choice: ")
154 | print("Enter size of matrix: ")
155 | matrix_a = Matrix(input())
156 | print("Enter matrix: ")
157 | matrix_a.create()
158 | if tran_choice == "1":
159 | matrix_a.transpose()
160 | elif tran_choice == "2":
161 | matrix_a.transpose_side()
162 | elif tran_choice == "3":
163 | matrix_a.transpose_vertical()
164 | elif tran_choice == "4":
165 | matrix_a.transpose_horizontal()
166 |
167 | matrix_a.printer()
168 |
169 | elif choice == "5":
170 | print("Enter size of matrix: ")
171 | matrix_a = Matrix(input())
172 | print("Enter matrix: ")
173 | matrix_a.create()
174 | print("The result is:")
175 | print(matrix_a.determinant(matrix_a.matrix))
176 |
177 | elif choice == "6":
178 | size = input("Enter size of matrix: ")
179 | matrix_a = Matrix(size)
180 | print("Enter matrix: ")
181 | matrix_a.create()
182 | det_a = matrix_a.determinant(matrix_a.matrix)
183 |
184 | iden = Matrix.create_identity_matrix(size)
185 | matrix_c = Matrix.cofactor_matrix(size, matrix_a.matrix)
186 | matrix_c.transpose()
187 | # print(matrix_c.matrix)
188 | # print(det_a)
189 | if det_a:
190 | print("The result is:")
191 | matrix_c.multiply(1 / det_a)
192 | else:
193 | print("This matrix doesn't have an inverse.")
194 |
195 | else:
196 | break
197 |
198 |
199 | menu()
200 |
--------------------------------------------------------------------------------
/2101020451 CIT21075/Var.c:
--------------------------------------------------------------------------------
1 | /*#include
2 | int main(){
3 | char E = 100;
4 | printf("%c\n",E);
5 | return 0;
6 | }*/
7 | //Important Type::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::://
8 |
9 | /*#include
10 | int main(){
11 | char grade;
12 | printf("Enter Your Grade to know your result\n");
13 | scanf("%c",&grade);
14 |
15 | switch(grade){
16 | case 'A':
17 | printf("Give him a applose");
18 | break;
19 | case 'B':
20 | printf("You did good!");
21 | break;
22 | case 'C':
23 | printf("You did okay!");
24 | break;
25 | case 'D':
26 | printf("Atleast It's not E grade");
27 | break;
28 | case 'E':
29 | printf("Sorry to say you have to give another shot to go forward");
30 | break;
31 | default:
32 | printf("Please enter a valid grade");
33 | }
34 | return 0;
35 | }*/
36 | //****************************************************** TODAYS WORK 02-11-21*****************************************************************************************************************************
37 | /*#include
38 | int main(){
39 | int x;
40 | printf("Enter a number to check it is divisible by 5 and 11 or not");
41 | scanf("%d",&x);
42 | if(x%5==0 && x%11==0)
43 | {
44 | printf("This number is divisible by 5 as well as by 11 too");
45 | }
46 | return 0;
47 |
48 |
49 | }*/
50 |
51 | /*#include
52 | int main(){
53 | char m;
54 | printf("Enter any Character\n");
55 | scanf("%c",&m);
56 | if(m>='a' && m<='z' || m>='A' && m<='Z')
57 | {
58 | printf("%c is alphabet\n",m);
59 | }
60 | else if(m>='0' && m<='9')
61 | {
62 | printf("%c is Digit\n",m);
63 | }
64 | else
65 | {
66 | printf("%c is a special character\n",m);
67 | }
68 | return 0;
69 |
70 | }*/
71 |
72 | /*#include
73 | int main(){
74 | int s,c,p;
75 | printf("Enter Selling price");
76 | scanf("%d",&s);
77 | printf("Enter Cost price");
78 | scanf("%d",&c);
79 | if(s>c){
80 | p=((s-c));
81 | printf("%d is profit",p);
82 | }
83 | else if(s
97 | int main(){
98 | int a,b,per;
99 | printf("Enter selling price");
100 | scanf("%d",&a);
101 | printf("Enter Costing Price");
102 | scanf("%d",&b);
103 | if(a>b)
104 | }*//********************************************
105 |
106 | /*#include
107 | int main(){
108 | int a,b; int pp,lp;
109 | printf("enter the selling price");
110 | scanf("%d",&a);
111 | printf("enter the cost price");
112 | scanf("%d",&b);
113 | if(a>b)
114 | {
115 | pp=((a-b)*100)/b;
116 | printf("%d is profit percentage\n",pp);
117 | }
118 | else if(b>a)
119 | {
120 | lp=((b-a)*100)/b;
121 | printf("%d is loss percentage\n",lp);
122 | }
123 | else
124 | printf("neither profit nor loss");
125 | }*/
126 |
127 | /*#include
128 | int main(){
129 | char grade;
130 | printf("Enter Your Grade to know your result\n");
131 | scanf("%c",&grade);
132 |
133 | switch(grade){
134 | case 'O':
135 | printf("you scored 97 above");
136 | break;
137 | case 'E':
138 | printf("you scored 85 above");
139 | break;
140 | case 'A':
141 | printf("you scored 77 above");
142 | break;
143 | case 'B':
144 | printf("you scored 66 above");
145 | break;
146 | case 'D':
147 | printf("you scored 55 above ");
148 | break;
149 | case 'F':
150 | printf("You Scored below 50 you are fail");
151 | default:
152 | printf("Please enter a valid grade");
153 | }
154 | return 0;
155 |
156 | }*/
157 |
158 | /*#include
159 | int main(){
160 | int a,b;
161 | printf("Enter 1st value:\n");
162 | scanf("%ld",&a);
163 | printf("Enter 2nd value:\n");
164 | scanf("%ld",&b);
165 | if(a>b)
166 | {
167 | printf("%ld is bigger than %ld ",a,b);
168 | }
169 | else if(a
181 | int main(){
182 | int a;
183 | printf("Please Enter a number:\n");
184 | scanf("%d",&a);
185 | if(a>0)
186 | {
187 | printf("%d is a +ve Number",a);
188 | }
189 | else if(a<0)
190 | {
191 | printf("%d is a -ve Number",a);
192 | }
193 | else
194 | {
195 | printf("%d is ZERO",a);
196 | }
197 | return 0;
198 | }*/
199 |
200 | /*#include
201 | int main(){
202 | int num1,num2,num3;
203 | printf("enter value for num1",num1);
204 | scanf("%d",&num1);
205 | printf("enter value for num2",num2);
206 | scanf("%d",&num2);
207 | printf("enter value for num3",num3);
208 | scanf("%d",&num3);
209 | if(num1
225 | int main(){
226 | int i,n;
227 | int t1 = 0;
228 | int t2 = 1;
229 | int nterm = t1 + t2;
230 | printf("Enter the number of terms: \n");
231 | scanf("%d",&n);
232 | printf("Fibonacci Series: %d %d ",t1,t2);
233 |
234 | for (i=3 ; i<=n ; ++i)
235 | {
236 | printf("%d\t",nterm);
237 | t1 = t2;
238 | t2 = nterm;
239 | nterm = t1 +t2;
240 | }
241 | return 0;
242 | }*/
243 |
244 | /*#include
245 | int main(){
246 | int i,sum=0;
247 | do{
248 | printf("Enter Number to add \n");
249 | scanf("%d",&i);
250 | sum=sum + i;
251 | }while(i!=0);
252 | return 0;
253 |
254 | }*/
255 |
256 | /*#include
257 | int main(){
258 | int a,b,n;
259 | printf("Enter no. of star to make half pyramid :");
260 | scanf("%d",&a);
261 | for (n = 1; n>=a ; n++){
262 | for (b=1; b<=n ;b++){
263 | printf("* ");
264 | }
265 | printf("\n");
266 |
267 | }
268 | return 0;
269 | }*/
270 |
271 | // #include
272 | // int main(){
273 | // int i,a,b=1;
274 | // printf("Enter Number: \n");
275 | // scanf("%d",&a);
276 | // for(i=1; i<=a; ++i){
277 | // b*=i;
278 | // }
279 | // printf("enter Factorial %d ",b);
280 | // return 0;
281 |
282 | // }
283 |
284 | /*#include
285 | int main(){
286 | int i,x,y=1;
287 | printf("ENTER A NUMBER TO FIND FACTORIAL: \n");
288 | scanf("%d",&x);
289 | for(i=1; i<=x; i++){
290 | y*=i;
291 | }
292 | printf("The factorial of entered number is %d",y);
293 | return 0;
294 | }*/
295 | #include
296 | int main(){
297 | int i;
298 | for (i = 0; i < 10; i++)
299 | {
300 | printf(i);
301 | }
302 |
303 | }
--------------------------------------------------------------------------------
/2nd Year/Func.c:
--------------------------------------------------------------------------------
1 | // **ADDITION**
2 | // ****WITH RETURN AND WITH ARGUMENT****
3 | // #include
4 | // int add(int x, int y){
5 | // int c = x+y;
6 | // }
7 | // int main(int a,int b){
8 | // printf("Enter 1st no.: \n");
9 | // scanf("%d%d",&a,&b);
10 | // int z = add(a,b);
11 | // printf("The sum is %d",z);
12 |
13 | // return 0;
14 | // }
15 | // ****WITHOUT RETURN AND WITH ARGUMENT****
16 | // #include
17 | // int add(int x , int y){
18 | // x,y;
19 | // int z = x+y;
20 | // return z;
21 | // }
22 | // void main(int a,int b){
23 | // a,b;
24 | // printf("Enter the Values:\n");
25 | // scanf("%d%d",&a,&b);
26 | // int c = add(a,b);
27 | // printf("The sum is %d",c);
28 | // }
29 | // ****without return and without arguments****
30 | // #include
31 | // void add(){
32 | // int x,y;
33 | // scanf("%d%d",&x,&y);
34 | // int c = x+y;
35 | // printf("The sum is %d",c);
36 | // }
37 | // void main(){
38 | // printf("Enter the Values: \n");
39 | // add();
40 | // }
41 | // ****with return Without argument****with
42 | // int add(){
43 | // int x,y;
44 | // scanf("%d%d",&x,&y);
45 | // int c = x+y;
46 | // printf("The sum is %d",c);
47 | // }
48 | // int main(){
49 | // printf("Enter the Elements: \n");
50 | // return add();
51 | // }
52 | // ****with RETURN AND WITH ARGUMENT****
53 | // **FACTORIAL**
54 | // #include
55 | // int fact(int x,int y){
56 | // y=1;
57 | // for(int i=1; i<=x; ++i){
58 | // y*=i;
59 | // }
60 | // return y;
61 | // }
62 | // int main(int f,int x){
63 | // x=1;
64 | // printf("Enter the Value:\n");
65 | // scanf("%d",&f);
66 | // int factorial = fact(f,x);
67 | // printf("The Factorial is %d\n",factorial);
68 | // printf("%d! = %d",f,factorial);
69 | // return factorial;
70 |
71 | // }
72 | // ****without return without arguments****
73 | // void fact(){
74 | // int b=1,a;
75 | // scanf("%d",&a);
76 | // for(int i=1; i<=a; ++i){
77 | // b=b*i;
78 | // }
79 | // printf("The Factorial is %d \n",b);
80 | // }
81 | // void main(){
82 | // int A;
83 | // printf("Enter the no. of time it should me itarate: \n");
84 | // scanf("%d",&A);
85 | // printf("Enter the NO.: \n");
86 | // for(int i=0; i<5;++i){
87 | // fact();
88 | // }
89 | // }
90 | // ****With return Without arguments****
91 | // #include
92 | // int fact(){
93 | // int b=1,a;
94 | // printf("Enter the No.: ");
95 | // scanf("%d",&a);
96 | // for(int i=1;i<=a;++i){
97 | // b*=i;
98 | // }
99 | // printf("The factorial is %d",b);
100 | // }
101 | // int main(){
102 | // return fact();
103 | // }
104 | // ****without return with arguments****
105 | // void fact(int a,int b){
106 | // b=1;
107 | // for(int i=1;i<=a;i++){
108 | // b*=i;
109 | // }
110 | // printf("Factorial is %d\n",b);
111 | // }
112 | // void main(int X,int f){
113 | // for(int i=0;i<4;i++){
114 | // printf("Enter the Number: \n");
115 | // scanf("%d",&X);
116 | // fact(X,f);
117 | // }
118 | // }
119 | // ****with RETURN AND WITH ARGUMENT****
120 | // *MULTIPLICATION*
121 | // #include
122 | // int mul(int a,int b,int c){
123 | // int M = a*b*c;
124 | // printf("%d",M);
125 | // }
126 | // int main(x,y,z){
127 | // scanf("%d%d%d",&x,&y,&z);
128 | // mul(x,y,z);
129 | // return 0;
130 | // }
131 | // ****without return without arguments****
132 | // #include
133 | // void mul(){
134 | // int a,b,c;
135 | // scanf("%d%d%d",&a,&b,&c);
136 | // int M = a*b*c;
137 | // printf("%d",M);
138 | // }
139 | // void main(){
140 | // mul();
141 | // }
142 | // ****with return without arguments****
143 | // #include
144 | // int mul(){
145 | // int x,y,z;
146 | // scanf("%d %d %d",&x,&y,&z);
147 | // int M = x*y*z;
148 | // printf("%d",M);
149 | // return M;
150 | // }
151 | // int main(){
152 | // printf("Enter the Number: \n");
153 | // mul();
154 | // return 0;
155 | // }
156 | // ****without return with arguments****
157 | // #include
158 | // void mul(int x,int pro){
159 | // pro=1;
160 | // do{
161 | // scanf("%d",&x);
162 | // pro = pro * x;
163 | // printf("%d\n",pro);
164 | // }while(x != 0);
165 | // }
166 | // void main(int Num,int P){
167 | // printf("Enter the Number: \n");
168 | // mul(Num,P);
169 | // }
170 |
171 | // ****with RETURN AND WITH ARGUMENT****
172 | // *GREATEST OF THREE NO.*
173 | // #include
174 | // int func(int x,int y,int z){
175 | // if(x>=y && x>=z){
176 | // printf("%d is greatest",x);
177 | // }
178 | // else if(y>=z){
179 | // printf("%d is greatest",y);
180 | // }
181 | // else{
182 | // printf("%d is greatest",z);
183 | // }
184 | // }
185 | // int main(int a,int b,int c){
186 | // printf("Enter the Number: \n");
187 | // scanf("%d %d %d",&a,&b,&c);
188 | // func(a,b,c);
189 | // return 0;
190 | // }
191 | // ****without return without arguments****
192 | // #include
193 | // void Max(){
194 | // int a,b,c;
195 | // scanf("%d %d %d",&a,&b,&c);
196 | // if(a>=b && a>=c){
197 | // printf("%d is greatest",a);
198 | // }
199 | // else if(b>=c){
200 | // printf("%d is greatest",b);
201 | // }
202 | // else{
203 | // printf("%d is greatest",c);
204 | // }
205 | // }
206 | // void main(){
207 | // printf("Enter the No: ");
208 | // Max();
209 | // }
210 | // ****with return without arguments****
211 | // #include
212 | // int Max(){
213 | // int a,b,c;
214 | // scanf("%d %d %d",&a,&b,&c);
215 | // if(a>=b && a>=c){
216 | // printf("%d is greatest",a);
217 | // }
218 | // else if(b>=c){
219 | // printf("%d is greatest",b);
220 | // }
221 | // else{
222 | // printf("%d is greatest",c);
223 | // }
224 | // }
225 | // int main(){
226 | // printf("Enter the No.: ");
227 | // return Max();
228 | // }
229 | // ****without return with arguments****
230 | // #include
231 | // void Max(int x,int y,int z){
232 | // if(x>=y && x>=z){
233 | // printf("%d is greatest",x);
234 | // }
235 | // else if(y>=z){
236 | // printf("%d is greatest",y);
237 | // }
238 | // else{
239 | // printf("%d is greatest",z);
240 | // }
241 | // }
242 | // void main(int a,int b,int c){
243 | // printf("Enter the Number: \n");
244 | // scanf("%d %d %d",&a,&b,&c);
245 | // Max(a,b,c);
246 | // }
247 | // ****REVERSE OF NUMBER****
248 | // **With return with arguments**
249 | // #include
250 | // int REVERSE(int n,int remainder,int rev){
251 | // rev=0;
252 | // while(n!=0){
253 | // remainder = n%10;
254 | // rev = rev*10 + remainder;
255 | // n=n/10;
256 | // }
257 | // printf("%d",rev);
258 | // return rev;
259 | // }
260 | // int main(int Num,int REM,int REV){
261 | // REV = 0;
262 | // printf("Enter the NUMBER: ");
263 | // scanf("%d",&Num);
264 | // REVERSE(Num,REM,REV);
265 | // }
266 | // ***without return without arguments***
267 | // #include
268 | // void REVERSE(){
269 | // int n,remainder,rev=0;
270 | // scanf("%d",&n);
271 | // while(n!=0){
272 | // remainder = n%10;
273 | // rev = rev*10 + remainder;
274 | // n=n/10;
275 | // }
276 | // printf("%d",rev);
277 | // }
278 | // void main(){
279 | // printf("Enter the Number:\n");
280 | // REVERSE();
281 | // }
282 |
283 |
284 |
285 |
286 |
287 | #include
288 | #include
289 | #define MAX 5
290 | void push();
291 | void pop();
292 | void display();
293 | void peep();
294 | int STACK[MAX],top=-1,item;
295 | int main(){
296 | int choice;
297 | while(1){
298 |
299 | printf("1.Push\n");
300 | printf("2.Pop\n");
301 | printf("3.Display\n");
302 | printf("4.Peep\n");
303 | printf("5.Exit\n");
304 | printf("Enter your CHOICE:\n");
305 | scanf("%d",&choice);
306 | switch (choice) {
307 | case 1:
308 | push();
309 | break;
310 | case 2:
311 | pop();
312 | break;
313 | case 3:
314 | display();
315 | case 4:
316 | peep();
317 | break;
318 | case 5:
319 | exit(0);
320 | default:
321 | printf("Enter the Valid Choice !!!");
322 | break;
323 | }
324 | }
325 | return 0;
326 | }
327 | void push(){
328 | if(top==MAX-1){
329 | printf("\nSTACK OVERFLOW\n");
330 | return;
331 | }
332 | printf("Enter the Item: \n");
333 | scanf("%d",&item);
334 | top+=1;
335 | STACK[top] = item;
336 | printf("\n PUSH SUCCESFULLY DONE\n");
337 | }
338 | void pop(){
339 | if(top==MAX-1){
340 | printf("Under Flow\n");
341 | return;
342 | }
343 | item = STACK[top];
344 | top-=1;
345 | printf("\n%d has been deleted succesfully!\n");
346 | }
347 | void display(int top1){
348 | while(top1!=-1){
349 | printf("%d\n",STACK[top1]);
350 | top1--; }
351 |
352 | }
353 | void peep(int top2){
354 | if(top2==-1){
355 | printf("\nNOTHING TO SHOW (EMPTY)");
356 | while(top2!=-1){
357 | printf("%d\n",STACK[top2]);
358 | }
359 | printf("%d\n",STACK[top2]);
360 | }
361 | }
362 |
--------------------------------------------------------------------------------
/2022 New folder/HospitalManagement.c:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | struct ad
4 | {
5 | char name[30];
6 | char disease[30];
7 | int cabin,phone,age;
8 | } x[100];
9 | int n,i,j=0,a=0,sum=0,g,flag,num;
10 | void read();
11 | void add();
12 | void view();
13 | void search();
14 | void edit();
15 | void del();
16 | void show();
17 | int main()
18 | {
19 | read();
20 | int c,i,q;
21 | printf("Simple Hospital Management System\n");
22 | int m,n;
23 | //making out the pattern
24 |
25 | for(m=1; m<=4; m++)
26 | {
27 | for(n=1; n<=5; n++)
28 | printf(" ");
29 | for(n=1; n<=m-1; n++)
30 | {
31 | printf(" ");
32 | }
33 | for(n=1; n<=4-m+1; n++)
34 | {
35 | if(n==4-m+1 || m==1 || m==4)
36 | printf("*");
37 | else
38 | printf(" ");
39 | }
40 | for(n=1; n<=4-m+1; n++)
41 | {
42 | if(n==1 ||m==1 || m==4)
43 | printf("*");
44 | else
45 | printf(" ");
46 | }
47 | printf("\n");
48 | }
49 | while(c!=6)
50 | {
51 |
52 | printf("**Enter your choice**\n\n1. Add Information\n2. View Information\n3. Search\n4. Edit Information\n5. Delete Information\n6. Exit\n\nOption=");
53 | scanf("%d",&c);//choice for option
54 | fflush(stdin);//making it clear
55 | if(c==1)//add
56 | {
57 | system("cls");
58 | add();
59 | }
60 | else if(c==2)//view
61 | {
62 | system("cls");
63 | view();
64 | }
65 | else if(c==3)//search
66 | {
67 | system("cls");
68 | search();
69 | }
70 | else if(c==4)//edit
71 | {
72 | system("cls");
73 | edit();
74 | }
75 | else if(c==5)//delete
76 | {
77 | system("cls");
78 | del();
79 | }
80 | else if(c==6)
81 | {
82 | write();
83 | return 0;
84 | }
85 | else
86 | {
87 | system("cls");
88 | printf("\n\nInvalid input , try again by using valid inputs");
89 | }
90 | printf("\n\n");
91 | }
92 | }
93 | void add()
94 | {
95 | printf("\n\n");
96 | printf("Already data inputed on the database =%d\n\n",num);//how many inputs
97 | printf("How many entry do you want to add=\n");
98 | scanf("%d",&n);
99 | sum=n+num;
100 |
101 | for(i=num,j=0; i
2 | int main(){
3 | int n,sum=0,rem,pro=1;
4 | printf("enter no.");
5 | scanf("%d",&n);
6 | while(n>0)
7 | {
8 | rem=n%10;
9 | sum+=rem;
10 | pro*=rem;
11 |
12 | n/=10;
13 | }
14 | printf("Sum of digits = %d\n",sum);
15 | printf("Multiplication of digits = %d\n",pro);
16 |
17 | return 0;
18 | }*/
19 |
20 | /*#include
21 | int main(){
22 | char x;
23 | printf("Enter a character: ");
24 | scanf("%c",&x);
25 | if(x>='a' && x<='z' || x>='A' && x<='Z'){
26 | printf("Its a Character: ");
27 | }
28 | else if(x>='0' && x<='9'){
29 | printf("Its a digit");
30 | }
31 | else
32 | printf("Its a speacial character: ");
33 | return 0;
34 | }*/
35 |
36 | /*#include
37 | int main(){
38 | int n,i;
39 | printf("Enter a number to find a table of the digit: ");
40 | scanf("%d",&n);
41 | for(int i=1;i<=10;i++){
42 | printf("%d X %d = %d\n",n,i,n*i);
43 | }
44 | printf("Multiplication Table of %d is given below",n);
45 | printf("\n");
46 | return 0;
47 | }*/
48 |
49 | /*#include
50 | int main(){
51 | int i,j,n;
52 | printf("Enter value of n: ");
53 | scanf("%d",&n);
54 | for(i=1;i<=n;i++){
55 | for(j=1;j<=i;j++)
56 | printf("* ");
57 | printf("\n");
58 |
59 | }
60 | }*/
61 | /*incomplete ***************** *********** *********** *********** *********** */
62 | /*#include
63 | int main(){
64 | int i,j,n;
65 | printf("Enter a value: ");
66 | scanf("%d",&n);
67 | for(i=n;i>=1;i--){
68 | for(j=n;j>=i;j--)
69 | printf("* ");
70 | printf("\n");
71 |
72 |
73 | }
74 | return 0;
75 | }*/
76 |
77 | /*#include
78 | int main(){
79 | int n=1,i,a;
80 | printf("Enter a Number\n");
81 | scanf("%d",&a);
82 | for(i=1;i<=a;i++){
83 | n*=i;
84 |
85 | }
86 | printf("factorial of %d is %d ",a,n);
87 | return 0;
88 | }*/
89 |
90 | /*#include
91 | int main(){
92 | int a,b,c,d;
93 | printf("Enter no. of stars");
94 | scanf("%3d",&a);
95 | for(b=1;b<=a;b++){
96 | for(c=1;c<=b;c++)
97 | for(d=1;d<=a;d++)
98 | printf("$ ");
99 | printf("\n");
100 | printf("$ ");
101 | printf("\n");
102 | }
103 | }*/
104 |
105 | /*#include
106 | int main(){
107 | int a,pro=1;
108 | while(a>1){
109 | if(a>1){
110 | printf("Enter a no. to take product");
111 | scanf("%d",&a);
112 | pro*=a;
113 | }
114 | }
115 | printf("The sum of the numbers are %d",pro);
116 |
117 | return 0;
118 | }*/
119 |
120 | /*#include
121 | int main(){
122 | int n,i,j;
123 | printf("Enter no. of stars");
124 | scanf("%d",&n);
125 | for(i=1;i<=n;i++){
126 | for(j=1;j<=n-i;j++)
127 | printf(" ");
128 | for(j=1;j<=i;j++)
129 | printf("* ");
130 | for(j=1;j>i;j++)
131 | printf("* ");
132 | printf("\n");
133 |
134 | }
135 | return 0;
136 | }*/
137 | /*#include
138 | int main(){
139 | int i,sum=0;
140 | do{
141 | printf("Entre no.");
142 | scanf("%d",&i);
143 | sum+=i;
144 | printf("sum is %d \n",sum);
145 | }while(i!=0);
146 |
147 | return 0;
148 | }*/
149 |
150 | /*#include
151 | #include
152 | void gotoxy (int x, int y);
153 | int main(){
154 | int choice,i,num,a;
155 | unsigned long int fact,sum;
156 | while(1){
157 | printf("MENU\n\n\n");
158 | printf("1 to find Factorial \n");
159 | printf("2 to add two numbers \n");
160 | printf("3 to find the no. is even or odd \n");
161 | printf("4 to convert fahrenheit to celsius \n");
162 | printf("5 to find the largest no. amoung 3 numbers \n");
163 | printf("6 TO QUIT\n");
164 | printf("Enter Choice:\n");
165 | scanf("%d",&choice);
166 |
167 |
168 | switch(choice){
169 | case 1:
170 | printf("Enter Any number: \n");
171 | scanf("%d",&a);
172 | int num=1;
173 | for (i=1; i<=a ; i++)
174 | {
175 | num*=i;
176 | }
177 | printf("Factorial of is %d\n\n\n",num);
178 | break;
179 |
180 | case 2:
181 |
182 | sum=0;
183 | do
184 | {
185 | printf("Enter Any numbers to add :\n");
186 | scanf("%d",&num);
187 |
188 | sum+=num;
189 | } while (num!=0);
190 | printf("The sum is %d \n\n\n",sum);
191 |
192 | break;
193 |
194 | case 3:
195 | printf("Enter Any number:\n");
196 | scanf("%d",&num);
197 | if(num%2==0){
198 | printf("Number is even");
199 | }
200 | else
201 | printf("Number is odd\n\n\n");
202 |
203 | break;
204 |
205 | case 4:
206 | printf("Enter any number :\n");
207 | scanf("%d",&num);
208 | fact = num * (9/5) + 32;
209 | printf("Fahrenheit is %d\n\n\n",fact);
210 |
211 | break;
212 |
213 | case 5:
214 | printf("Enter any number to find the largest amoung them");
215 | scanf("%d%d%d",&fact,&i,&num);
216 | if(num>fact && num>i){
217 | printf("The %d largest amoung them",num);
218 | }
219 | else if(fact>i){
220 | printf("The %d lagest amoung them",fact);
221 | }
222 | else
223 | printf("%d is largest amoung them\n\n\n",&num);
224 | break;
225 |
226 | case 6:
227 | exit(0);
228 |
229 | }
230 | }return 0;
231 | }*/
232 |
233 |
234 | #include
235 | #include
236 | struct ad
237 | {
238 | char name[30];
239 | char disease[30];
240 | int cabin,phone,age;
241 | } x[100];
242 | int n,i,j=0,a=0,sum=0,g,flag,num;
243 | void read();
244 | void add();
245 | void view();
246 | void search();
247 | void edit();
248 | void del();
249 | void show();
250 | int main()
251 | {
252 | read();
253 | int c,i,q;
254 | printf("Simple Hospital Management System\n");
255 | int m,n;
256 | //making out the pattern
257 |
258 | for(m=1; m<=4; m++)
259 | {
260 | for(n=1; n<=5; n++)
261 | printf(" ");
262 | for(n=1; n<=m-1; n++)
263 | {
264 | printf(" ");
265 | }
266 | for(n=1; n<=4-m+1; n++)
267 | {
268 | if(n==4-m+1 || m==1 || m==4)
269 | printf("*");
270 | else
271 | printf(" ");
272 | }
273 | for(n=1; n<=4-m+1; n++)
274 | {
275 | if(n==1 ||m==1 || m==4)
276 | printf("*");
277 | else
278 | printf(" ");
279 | }
280 | printf("\n");
281 | }
282 | while(c!=6)
283 | {
284 |
285 | printf("**Enter your choice**\n\n1. Add Information\n2. View Information\n3. Search\n4. Edit Information\n5. Delete Information\n6. Exit\n\nOption=");
286 | scanf("%d",&c);//choice for option
287 | fflush(stdin);//making it clear
288 | if(c==1)//add
289 | {
290 | system("cls");
291 | add();
292 | }
293 | else if(c==2)//view
294 | {
295 | system("cls");
296 | view();
297 | }
298 | else if(c==3)//search
299 | {
300 | system("cls");
301 | search();
302 | }
303 | else if(c==4)//edit
304 | {
305 | system("cls");
306 | edit();
307 | }
308 | else if(c==5)//delete
309 | {
310 | system("cls");
311 | del();
312 | }
313 | else if(c==6)
314 | {
315 | write();
316 | return 0;
317 | }
318 | else
319 | {
320 | system("cls");
321 | printf("\n\nInvalid input , try again by using valid inputs");
322 | }
323 | printf("\n\n");
324 | }
325 | }
326 | void add()
327 | {
328 | printf("\n\n");
329 | printf("Already data inputed on the database =%d\n\n",num);//how many inputs
330 | printf("How many entry do you want to add=\n");
331 | scanf("%d",&n);
332 | sum=n+num;
333 |
334 | for(i=num,j=0; i