27/01/23, 12:27 pm - Messages to yourself are end-to-end encrypted.

No one outside

27/01/23, 12:07 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

of this chat, not even WhatsApp, can read or listen to them. Tap to learn more.

27/01/23, 12:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

27/01/23, 12:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 12:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 12:10 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 12:10 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 12:25 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 12:58 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 1:00 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 2:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 2:11 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 2:34 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 2:47 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 2:48 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 2:55 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 2:57 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 3:00 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 3:11 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 3:11 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 3:11 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 3:11 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/01/23, 11:28 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
28/01/23, 2:58 pm - 𝕴𝖓𝖉𝖚: *BWT-INTERNAL QUIZ 3 (JS)- SEM I-2022-23*

https://bit.ly/BWT_QUIZ3_JS

It has been scheduled at *3:00 🕒 PM*

Compulsory to attempt each question

28/01/23, 8:01 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

Note: The time limit is 20 minutes for the exam

28/01/23, 8:02 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

28/01/23, 8:03 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
28/01/23, 8:03 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
28/01/23, 8:04 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
28/01/23, 8:49 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
28/01/23, 8:50 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
31/01/23, 8:21 am - 𝕴𝖓𝖉𝖚: <Media omitted>
08/02/23, 10:03 am - 𝕴𝖓𝖉𝖚: http://exam.shekhauniexam.in/emitra_Registration.aspx?

08/02/23, 10:14 am - 𝕴𝖓𝖉𝖚: <Media omitted>

logid=1

08/02/23, 10:19 am - 𝕴𝖓𝖉𝖚: <Media omitted>

08/02/23, 10:19 am - 𝕴𝖓𝖉𝖚: <Media omitted>
08/02/23, 12:32 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
08/02/23, 12:51 pm - 𝕴𝖓𝖉𝖚: file:///E:/BAForm.html
09/02/23, 9:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/02/23, 9:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/02/23, 9:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
13/02/23, 5:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
14/02/23, 10:26 pm - 𝕴𝖓𝖉𝖚: Tutorial 7 m 2nd m 2nd
20/02/23, 5:12 am - 𝕴𝖓𝖉𝖚: <Media omitted>
20/02/23, 5:12 am - 𝕴𝖓𝖉𝖚: <Media omitted>
20/02/23, 5:51 pm - 𝕴𝖓𝖉𝖚: http://202.131.126.234/uvpce/ExamPapers/B.Tech/B.Tech
%20sem%201,2/Sem%201/B.Tech.Sem%201%20&%202%20NOV-DEC-2016%20EG.PDF
20/02/23, 5:51 pm - 𝕴𝖓𝖉𝖚: http://202.131.126.234/uvpce/ExamPapers/B.Tech/B.Tech

20/02/23, 5:51 pm - 𝕴𝖓𝖉𝖚: http://202.131.126.234/uvpce/ExamPapers/B.Tech/B.Tech

%20sem%201,2/Sem%201/B.Tech%20CE-IT-EC-BM-MR%20Sem.1%202013%20EG.pdf

20/02/23, 5:51 pm - 𝕴𝖓𝖉𝖚: http://202.131.126.234/uvpce/ExamPapers/B.Tech/B.Tech

%20sem%201,2/Sem%201/B.Tech%20CE-IT-EC-BM-MR%20Sem.1%202014%20EG.pdf

20/02/23, 5:52 pm - 𝕴𝖓𝖉𝖚: http://202.131.126.234/uvpce/ExamPapers/B.Tech/B.Tech

%20sem%201,2/Sem%201/B.Tech%20CE-IT-EC-BM%20Sem.1%202010%20EG.pdf

20/02/23, 5:52 pm - 𝕴𝖓𝖉𝖚: http://202.131.126.234/uvpce/ExamPapers/B.Tech/B.Tech

%20sem%201,2/Sem%201/B.Tech%20CE-IT-EC-BM%20Sem.1%202011%20EG.pdf

20/02/23, 5:52 pm - 𝕴𝖓𝖉𝖚: http://202.131.126.234/uvpce/ExamPapers/B.Tech/B.Tech

%20sem%201,2/Sem%201/B.Tech%20CE-IT-EC-BM%20Sem.1%202012%20EG.pdf

21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>

%20sem%201,2/Sem%201/B.Tech%20Sem.1%202015%20EG.PDF

21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>

21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:39 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:40 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 8:41 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 9:36 am - 𝕴𝖓𝖉𝖚: <Media omitted>
21/02/23, 2:50 pm - 𝕴𝖓𝖉𝖚: Hey, join Airtel prepaid today using my invitation link
for a better calling & data experience. Get ₹100 off on your next recharge 😎

26/03/23, 1:13 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

u.airtel.in/eXvGKI

26/03/23, 7:15 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

28/03/23, 8:53 am - 𝕴𝖓𝖉𝖚: <Media omitted>
02/04/23, 6:59 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
03/04/23, 7:54 am - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:19 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23, 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
 9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

9:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

2:51 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

24/04/23,

3:09 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

30/04/23,

3:10 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

30/04/23,

3:11 pm - 𝕴𝖓𝖉𝖚: 2.2 Tak hi karungi

30/04/23,

3:11 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

30/04/23,

3:11 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

30/04/23,

3:11 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

30/04/23,

8:47 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

30/04/23,

12:37 pm - 𝕴𝖓𝖉𝖚: *All students kindly note*

01/05/23,
04/05/23,

For UHV-1 subject

Today Online internal Quiz examination is scheduled

Link for exam

https://forms.gle/J8WVMkAwGnWZG9nMA

Note:

04/05/23, 12:59 pm - 𝕴𝖓𝖉𝖚: *All students kindly note*

*Link will be closed on 5 may 2023, 1800 hrs*

For UHV-1 subject

Today Online internal Quiz examination is scheduled

Link for exam

https://forms.gle/J8WVMkAwGnWZG9nMA
Note:
1.*Link will be closed on 5 may 2023, 1800 hrs*
2. All students have to attempt the exam.

09/05/23, 11:52 am - 𝕴𝖓𝖉𝖚: Dear students,

3. Quiz result marks have weightage to the end semister examination.

Download and install one application using below mentioned link.

Only for Android users.

https://drive.google.com/drive/folders/1jwyzjhzpUuPvUZzvJ4I-fn58sRVjBSwQ?
usp=share_link

11/05/23, 5:01 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

Do it on a urgent basis during your lunch break hour.

11/05/23, 8:21 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

11/05/23, 8:21 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
13/05/23, 9:40 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
13/05/23, 10:51 pm - 𝕴𝖓𝖉𝖚: <script>
document.writeln(Math.abs(-4)+"<br>");
document.writeln(Math.abs(-7.8)+"<br>");
document.writeln(Math.abs('-4'));
</script>
II) <script>
document.writeln(Math.max(22,34,12,15)+"<br>");
document.writeln(Math.max(-10,-24,-12,-20));
</script>
III) <script>
document.writeln(Math.random()) ;
</script>
IV) <script>
document.writeln(Math.pow(2,3)+"<br>");
document.writeln(Math.pow(5,1.4));
</script>
V) <script>
document.writeln(Math.sqrt(16)+ "<br>");
document.writeln(Math.sqrt(12));

15/05/23, 9:18 pm - 𝕴𝖓𝖉𝖚: 1. Write a program to create JavaScript array,

</script>

initialize it and perform basic

15/05/23, 9:19 pm - 𝕴𝖓𝖉𝖚: 2. Create a string and perform operations like:

operations like, push(), pop(), reverse(), sort(), slice(), concat()

charAt(), concat(), replace(), slice(),

15/05/23, 9:19 pm - 𝕴𝖓𝖉𝖚: Write a JavaScript code to display date in DD/MM/YYYY

toLowerCase(), toUpperCase(), slice(), substring()

and time in HH:MM:SS

15/05/23, 9:19 pm - 𝕴𝖓𝖉𝖚: 4. Write down the output of the following code:
format.

I) <script>
document.writeln(Math.abs(-4)+"<br>");
document.writeln(Math.abs(-7.8)+"<br>");
document.writeln(Math.abs('-4'));
</script>
II) <script>
document.writeln(Math.max(22,34,12,15)+"<br>");
document.writeln(Math.max(-10,-24,-12,-20));
</script>
III) <script>
document.writeln(Math.random()) ;
</script>
IV) <script>
document.writeln(Math.pow(2,3)+"<br>");
document.writeln(Math.pow(5,1.4));
</script>
V) <script>
document.writeln(Math.sqrt(16)+ "<br>");
document.writeln(Math.sqrt(12));

15/05/23, 9:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

</script>

23/05/23, 2:25 pm - 𝕴𝖓𝖉𝖚: Dear Students

You can check your attendance status on following link

24/05/23, 11:04 am - 𝕴𝖓𝖉𝖚: www.vlabs.iitkgp.ernet.in/be

https://tinyurl.com/xwrhzzea

Please find above the link of virtual laboratory for performing physics

24/05/23, 11:04 am - 𝕴𝖓𝖉𝖚: http://vlabs.iitkgp.ernet.in/be/#

experiments.

26/05/23, 10:32 am - 𝕴𝖓𝖉𝖚: *Dear Girl Students,*

Greetings from Ganpat University- Mobile Application Development Club.

We are calling all aspiring women students who are passionate coders and tech
enthusiasts from engineering colleges across India! Join us for the second edition
of Google’s #GirlHackathon and register today. The winning participants stand a
chance to win exciting cash prizes & Google merchandise.

Register now: https://goo.gle/girl-hackathon-website-2023.

Please note 28th May, 2023 is the last day to register! *#Girlhackathon2023*
*#WomenInTech* *#Google*

Regards,

26/05/23, 3:11 pm - 𝕴𝖓𝖉𝖚: https://forms.gle/iWqcDNgZUEz63czH6

GUNI-UVPCE - Google for Developers Edu Team

29/05/23, 8:11 am - 𝕴𝖓𝖉𝖚: <Media omitted>

07/06/23, 6:32 pm - 𝕴𝖓𝖉𝖚: Indu@2028
15/06/23, 1:20 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
15/06/23, 3:34 pm - 𝕴𝖓𝖉𝖚: Dear Students of CEIT- A/B/C/D class are required to
submit their PPS assignment- 2 by accessing the provided link.

Link: https://forms.gle/FxtmV7o2F6cNy1xy5

Last date for submission is 17th June 2023.

17/06/23, 9:44 am - 𝕴𝖓𝖉𝖚: https://forms.gle/DmSPYfEUvt3SmVd29

After the specified date no response will be accepted.

17/06/23, 10:15 am - 𝕴𝖓𝖉𝖚: https://forms.gle/oaBCWDEPnvfA7eP27

17/06/23, 10:38 am - 𝕴𝖓𝖉𝖚: <Media omitted>
17/06/23, 12:45 pm - 𝕴𝖓𝖉𝖚: Cyclonic Storm Biparjoy LIVE Tracker, Updates &

18/06/23, 1:04 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

Forecast | Zoom Earth https://zoom.earth/storms/biparjoy-2023/

20/06/23, 10:36 am - 𝕴𝖓𝖉𝖚: <Media omitted>

20/06/23, 10:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
20/06/23, 10:40 am - 𝕴𝖓𝖉𝖚: <Media omitted>
20/06/23, 11:48 am - 𝕴𝖓𝖉𝖚: *Greetings, anticipated Software Engineers!!*

We are thrilled to inform you about an upcoming online session titled *"Recent
Trends and Technological development using AngularJS "* designed exclusively for
CEIT students in their second semester, specifically those enrolled in the ITW
subject.

This event aims to offer you a practical understanding of Angular JS within an

industrial context. Throughout the session, you will delve into the fundamental
principles and practical implementation of Angular JS. Additionally, we will
explore real-life scenarios, present examples, and discuss various use cases to
further enhance your comprehension.

Join the Session with expert speaker *Mr. Abhishek Ankush*, Technical Architect
Royal Philips Bangalore, India. 10+ Years of Experience with Royal Philips, Wipro
and Accenture. Expertise across C#, JAVA, Angular, Software Design, Strategic
Planning, Project Management, Risk & Change Management and Customer Engagement.
Register here for the session: https://forms.gle/V59VVbhukwVSU4ReA
Joining Link: //tiny.cc/ITW_AngularJs
Mode: Online
Date: 24th June 2023
Time: 10:00 AM to 12:00 PM (IST)

For any query contact: Prof. Manish Kumar, Prof. Rani Singh , Prof. Chirag Gami

20/06/23, 10:35 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

Contactn No-9681124927

22/06/23, 7:53 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

22/06/23, 7:53 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/06/23, 10:20 am - 𝕴𝖓𝖉𝖚: *Greetings, anticipated Software Engineers!!*

We are thrilled to inform you about an upcoming online session titled *"Recent
Trends and Technological development using AngularJS "* designed exclusively for
CEIT students in their second semester, specifically those enrolled in the ITW
subject.

This event aims to offer you a practical understanding of Angular JS within an

industrial context. Throughout the session, you will delve into the fundamental
principles and practical implementation of Angular JS. Additionally, we will
explore real-life scenarios, present examples, and discuss various use cases to
further enhance your comprehension.

Join the Session with expert speaker *Mr. Abhishek Ankush*, Technical Architect
Royal Philips Bangalore, India. 10+ Years of Experience with Royal Philips, Wipro
and Accenture. Expertise across C#, JAVA, Angular, Software Design, Strategic
Planning, Project Management, Risk & Change Management and Customer Engagement.
Register here for the session: https://forms.gle/V59VVbhukwVSU4ReA
Joining Link: //tiny.cc/ITW_AngularJs
Mode: Online
Date: 24th June 2023
Time: 10:00 AM to 12:00 PM (IST)

For any query contact: Prof. Manish Kumar, Prof. Rani Singh , Prof. Chirag Gami

24/06/23, 10:32 am - 𝕴𝖓𝖉𝖚: *Greetings, anticipated Software Engineers!!*

Contactn No-9681124927

We are thrilled to inform you about an upcoming online session titled *"Recent
Trends and Technological development using AngularJS "* designed exclusively for
CEIT students in their second semester, specifically those enrolled in the ITW
subject.
This event aims to offer you a practical understanding of Angular JS within an
industrial context. Throughout the session, you will delve into the fundamental
principles and practical implementation of Angular JS. Additionally, we will
explore real-life scenarios, present examples, and discuss various use cases to
further enhance your comprehension.

Join the Session with expert speaker *Mr. Abhishek Ankush*, Technical Architect
Royal Philips Bangalore, India. 10+ Years of Experience with Royal Philips, Wipro
and Accenture. Expertise across C#, JAVA, Angular, Software Design, Strategic
Planning, Project Management, Risk & Change Management and Customer Engagement.
Register here for the session: https://forms.gle/V59VVbhukwVSU4ReA
Joining Link: //tiny.cc/ITW_AngularJs
Mode: Online
Date: 24th June 2023
Time: 10:00 AM to 12:00 PM (IST)

For any query contact: Prof. Manish Kumar, Prof. Rani Singh , Prof. Chirag Gami

24/06/23, 3:07 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

Contactn No-9681124927

24/06/23, 3:27 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

30/06/23, 3:07 pm - 𝕴𝖓𝖉𝖚: Dear students of CEIT-A/B/C/D class

Quiz Link for PPS : https://forms.gle/QLAst9Gv62yFQpUs5

Note: link will not accept any response after 3:25 pm. Please submit on time

02/07/23, 11:49 am - 𝕴𝖓𝖉𝖚: <Media omitted>

*Mention your name and Enrollment no properly*

02/07/23, 11:58 am - 𝕴𝖓𝖉𝖚: <Media omitted>

02/07/23, 12:00 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
02/07/23, 12:01 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
02/07/23, 12:01 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
02/07/23, 12:01 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
02/07/23, 12:01 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
03/07/23, 3:32 pm - 𝕴𝖓𝖉𝖚: https://forms.gle/S5CRU3iUAr3diezdA

Please find above link of *Physics QUIZ-2* for Semester 2 CE/IT/CE_AI all students.

Date : 03.07.2023
Time : 03:30 PM to 03:40 PM
Syllabus : Full

04/07/23, 7:48 am - 𝕴𝖓𝖉𝖚: <Media omitted>

Type : MCQ

05/07/23, 10:36 pm - 𝕴𝖓𝖉𝖚: Call by value and pass by

07/07/23, 7:40 am - 𝕴𝖓𝖉𝖚: <Media omitted>
reference

07/07/23, 10:59 pm - 𝕴𝖓𝖉𝖚: Topic: Data Science

Join Zoom Meeting on:

https://zoom.us/j/96865334009

Meeting ID: 968 6533 4009

𝕴𝖓𝖉𝖚: <Media omitted>

Registered students must join tomorrow sharp at 10 am.

𝕴𝖓𝖉𝖚: 3.1
08/07/23, 1:16 pm -

𝕴𝖓𝖉𝖚: explicit and implicit

08/07/23, 1:29 pm -

𝕴𝖓𝖉𝖚: #include <stdio.h>

08/07/23, 1:38 pm -
10/07/23, 5:46 am -
int main()
{
char str1[50], str2[50], i, j;
printf("\nEnter first string: ");
scanf("%s",str1);
printf("\nEnter second string: ");
scanf("%s",str2);
/* This loop is to store the length of str1 in i
* It just counts the number of characters in str1
* You can also use strlen instead of this.
*/
for(i=0; str1[i]!='\0'; ++i);

/* This loop would concatenate the string str2 at

* the end of str1
*/
for(j=0; str2[j]!='\0'; ++j, ++i)
{
str1[i]=str2[j];
}
// \0 represents end of string
str1[i]='\0';
printf("\nOutput: %s",str1);

return 0;

10/07/23, 5:46 am - 𝕴𝖓𝖉𝖚: strcat

}

10/07/23, 10:51 am - 𝕴𝖓𝖉𝖚: include<stdio.h>

#include<conio.h>
void main()
{
int n,i,t,c,d,s=0;
clrscr();

printf("\n Enter the range from 0 to : ");

scanf("%d",&n);

printf("\n Armstrong Numbers are :");

for(i=0;i<=n;i++)
{
t=i;
s=0;

while(t!=0)
{
d=t%10;
c=d*d*d;
s=s+c;
t=t/10;
}

if(s==i)
printf(" %d",i);

getch();
10/07/23, 10:51 am - 𝕴𝖓𝖉𝖚: For Armstrong
}

10/07/23, 10:51 am - 𝕴𝖓𝖉𝖚: Concatenate of string

10/07/23, 11:14 am - 𝕴𝖓𝖉𝖚: include <stdio.h>
#include <conio.h>
#include <string.h>
void main(){
char string[20],temp;
int i,length;
printf("Enter String : ");
scanf("%s",string);
length=strlen(string)-1;
for(i=0;i<strlen(string)/2;i++){
temp=string[i];
string[i]=string[length];
string[length--]=temp;
}
printf("
Reverse string :%s",string);
getch();

10/07/23, 11:14 am - 𝕴𝖓𝖉𝖚: Reverse of string

}

14/07/23, 11:51 am - 𝕴𝖓𝖉𝖚: <Media omitted>

14/07/23, 11:52 am - 𝕴𝖓𝖉𝖚: <Media omitted>
14/07/23, 11:53 am - 𝕴𝖓𝖉𝖚: <Media omitted>
14/07/23, 11:53 am - 𝕴𝖓𝖉𝖚: <Media omitted>
14/07/23, 11:54 am - 𝕴𝖓𝖉𝖚: <Media omitted>
14/07/23, 11:54 am - 𝕴𝖓𝖉𝖚: <Media omitted>
14/07/23, 11:55 am - 𝕴𝖓𝖉𝖚: <Media omitted>
14/07/23, 11:55 am - 𝕴𝖓𝖉𝖚: <Media omitted>
16/07/23, 5:31 pm - 𝕴𝖓𝖉𝖚: Power of series
18/07/23, 6:56 pm - 𝕴𝖓𝖉𝖚: I’ve got you a gift - ₹300 off 🎁

And also the secret to superfast wi-fi!

Get up to 1 Gbps speed, free hardware & installation, free home delivery.

19/07/23, 7:50 am - 𝕴𝖓𝖉𝖚: सोयाबीन

Just use my referral link u.airtel.in/w5NYWj, get discount when you join.

19/07/23, 7:50 am - 𝕴𝖓𝖉𝖚: Meggi

22/07/23, 10:36 am - 𝕴𝖓𝖉𝖚: <Media omitted>
22/07/23, 10:37 am - 𝕴𝖓𝖉𝖚: <Media omitted>
22/07/23, 10:38 am - 𝕴𝖓𝖉𝖚: <Media omitted>
24/07/23, 6:14 am - 𝕴𝖓𝖉𝖚: persent simple
24/07/23, 6:14 am - 𝕴𝖓𝖉𝖚: facts ,daily routine,often ,everyday
24/07/23, 6:18 am - 𝕴𝖓𝖉𝖚: present continuous : action happening now, temporary

24/07/23, 6:21 am - 𝕴𝖓𝖉𝖚: past simple: comletely past talks

activities, changes taking place now

24/07/23, 6:27 am - 𝕴𝖓𝖉𝖚: past continuous : unfinished+ finished action or

24/07/23, 6:28 am - 𝕴𝖓𝖉𝖚: past perfect: experiences(on going time period),recent

past+now+future

24/07/23, 6:33 am - 𝕴𝖓𝖉𝖚: persent perfect continuous: action start in past and
action or events

24/07/23, 6:33 am - 𝕴𝖓𝖉𝖚: past perfect:

still continue

24/07/23, 6:33 am - 𝕴𝖓𝖉𝖚: two action in past which happen first

24/07/23, 6:36 am - 𝕴𝖓𝖉𝖚: past perfect continuous: a action in past which continue

25/07/23, 8:20 pm - 𝕴𝖓𝖉𝖚: Diffusion process

and second action happen
 8:28 pm - 𝕴𝖓𝖉𝖚: Fermi level
8:28 pm - 𝕴𝖓𝖉𝖚: Pn junction band
25/07/23,

11:01 pm - 𝕴𝖓𝖉𝖚: Working of megnetostriction oscillator

25/07/23,

11:27 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

25/07/23,

11:27 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

29/07/23,

11:27 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

29/07/23,

3:03 pm - 𝕴𝖓𝖉𝖚: Dear Students

29/07/23,
10/08/23,

Hope you all are doing well

Greetings from the Department of Computer Engineering / Information Technology , U

V Patel College of Engineering.

As your *3rd semester regular teaching starts from 16/08/2023 (Wednesday)*, It is

advised to *check your Class & Batch details* in advance from the given link below.
Link:- https://tinyurl.com/52d2ckw6

Time table schedule of your Class & Batch will be shared in a group shortly.

In case any query contact the respective branch Proctor.

15/08/23, 5:18 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

Thank you.

15/08/23, 6:27 pm - 𝕴𝖓𝖉𝖚: From tomorrow onwards, the regular teaching sessions
will commence for 3rd semester.

Kindly, find the time-table link in the following site (Link:

https://sites.google.com/ganpatuniversity.ac.in/oddsem2023/3sem )

*Note:* Following batches will have lab in the first slot of 7:20 am to 9:00 am:

23/08/23, 5:26 pm - 𝕴𝖓𝖉𝖚: Dear all

3A-1, 3A-2, 3A-3, 3A-4, 3B-1, 3AI-1, 3AI-2, and 3CSBS-1

As per the ISRO official website, they are broadcasting the Live Landing of
Chandrayan-3 mission on August 23, 2023, starting from 17:27 Hrs. IST (5:27 PM).
Let's encourage students to see the *Live Landing to mark India's Historic Mission
to Moon.*
🌖

Please click the link to know more:

25/08/23, 3:28 pm - 𝕴𝖓𝖉𝖚: https://t.me/+b8XmJt-HkTBhOTdl

https://www.isro.gov.in/Chandrayaan3SoftLandingMessage.html

02/09/23, 3:25 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

04/09/23, 8:28 am - 𝕴𝖓𝖉𝖚: <Media omitted>
17/09/23, 9:37 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct stack {
char data;
struct stack *next;
}*top=NULL;

typedef struct stack st;

int execute(char[]);
int opd(char);
int opr(char);
int matchpair(char,char);
char pop();
int main(){

char x[80];
printf("ENTER string = ");
gets(x);
int ans=execute(x);

if (ans== 1) {
printf("The expression '%s' is valid.\n", x);
} else {
printf("The expression '%s' is not valid.\n", x);
}

int execute(char x[]){

int n;
int i=0;
n = strlen(x);

for(i=0;i<n-1;i++){
if (opd(x[i]) && opd(x[i+1])||opr(x[i])&& opr(x[i+1]))
{
return 0;
}

else if(x[i]=='('|| x[i]=='['|| x[i]=='{') {

void push(char m){

st *p=(st *)malloc(sizeof(st));
p->data=m;
p->next=top;
top=p;

else if(x[i]==')'|| x[i]==']'|| x[i]=='}'){

char pop(){
st *p=(st *)malloc(sizeof(st));
if(top==NULL){
printf("stack is underflow");
}
else{
char data = p->data;
top = p->next;
free(p);
return data;
}
}

}}
return (top==NULL);
}

int opd(char m){

if ((m >='a' && m<= 'z')||(m >='A'&& m<= 'Z')||(m >= '0' && m<= '9'))
{
return 1;
}

else{
return 0;
}
}

int opr(char m){

if(m =='+' || m =='-' || m =='*' || m =='/'){
return 1;
}
else{

return 0;
}
}

int matchpair(char open, char close) {

if (open == '(' && close == ')')
return 1;
if (open == '[' && close == ']')
return 1;
if (open == '{' && close == '}')
return 1;
return 0;

17/09/23, 9:38 pm - 𝕴𝖓𝖉𝖚: ENTER string = {(a+b)*(c+d)}

}

19/09/23, 12:45 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

The expression '{(a+b)*(c+d)}' is valid.

21/09/23, 9:42 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>

#include <stdlib.h>
#include <string.h>

struct stack {
char data;
struct stack* next;
};

typedef struct stack st;

st* top = NULL;

int execute(char[]);
int opd(char);
int opr(char);
int matchpair(char, char);
void push(char);
char pop();

int main() {
char x[80];
printf("ENTER string = ");
gets(x);
int ans = execute(x);

if (ans == 1) {
printf("The expression '%s' is valid.\n", x);
} else {
printf("The expression '%s' is not valid.\n", x);
}
}

void push(char m) {
st* p = (st*)malloc(sizeof(st));
p->data = m;
p->next = top;
top = p;
}

char pop() {
if (top == NULL) {
printf("stack is underflow");
return 0; // Return a default value (you can handle this differently)
} else {
char data = top->data;
st* p = top;
top = top->next;
free(p);
return data;
}
}

int execute(char x[]) {

int n;
int i = 0;
n = strlen(x);

for (i = 0; i < n; i++) {

if (opd(x[i])) {
continue; // Ignore operands
} else if (opr(x[i])) {
push(x[i]); // Push operators onto the stack
} else if (x[i] == '(' || x[i] == '[' || x[i] == '{') {
push(x[i]); // Push opening brackets onto the stack
} else if (x[i] == ')' || x[i] == ']' || x[i] == '}') {
char popped = pop(); // Pop the top element from the stack
if (!matchpair(popped, x[i])) {
return 0; // Mismatched brackets
}
}
}

// Check if there are any unmatched opening brackets left

 if (top != NULL) {
return 0;
}

return 1;
}

int opd(char m) {
return (m >= 'a' && m <= 'z') || (m >= 'A' && m <= 'Z') || (m >= '0' && m <=
'9');
}

int opr(char m) {
return (m == '+' || m == '-' || m == '*' || m == '/');
}

int matchpair(char open, char close) {

if (open == '(' && close == ')')
return 1;
if (open == '[' && close == ']')
return 1;
if (open == '{' && close == '}')
return 1;
return 0;

25/09/23, 7:58 am - 𝕴𝖓𝖉𝖚: <Media omitted>

}

30/09/23, 9:49 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

01/10/23, 12:04 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
01/10/23, 5:07 pm - 𝕴𝖓𝖉𝖚: Tel
01/10/23, 5:07 pm - 𝕴𝖓𝖉𝖚: Aata
01/10/23, 5:07 pm - 𝕴𝖓𝖉𝖚: Pyaz lakshan
01/10/23, 5:08 pm - 𝕴𝖓𝖉𝖚: Dhaniya powder
01/10/23, 5:08 pm - 𝕴𝖓𝖉𝖚: Chaval
01/10/23, 5:08 pm - 𝕴𝖓𝖉𝖚: Neem की datal
01/10/23, 5:08 pm - 𝕴𝖓𝖉𝖚: Chini
01/10/23, 5:08 pm - 𝕴𝖓𝖉𝖚: Chaypati
01/10/23, 5:09 pm - 𝕴𝖓𝖉𝖚: 3 Copy
02/10/23, 5:57 pm - 𝕴𝖓𝖉𝖚: #include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct stack {
char ch;
struct stack *next;
};
struct stack *top = NULL;

int checkExp(char[]);
void infixToPostfix(char[]);
int isopr(char);
int isopd(char);
int iprec(char);
int sprec(char);
void push(char);
char pop();
int evaluatePostfix(char []);

int main() {
char x[80];
 printf("Enter the String : ");
gets(x);
if(checkExp(x)) {
infixToPostfix(x);
int result = evaluatePostfix(x);
printf("Result: %d\n", result);
}
else {
printf("Invalid Expression\n");
}

return 0;
}

int iprec(char m) {
switch(m) {
case '+' : case '-' :
return 2;
case '*' : case '/' : case '%' :
return 4;
case '^' :
return 6;
case '(' :
return 8;
default :
return -1;
}
}

int sprec(char m) {
switch(m) {
case '+' : case '-' :
return 2;
case '*' : case '/' : case '%' :
return 4;
case '^' :
return 6;
case '(' :
return 1;
default :
return -1;
}
}

int isopd(char m) {
if((m>='a' && m<='z') || (m>='A' && m<='Z') || (m>='0' && m<='9')) {
return 1;
} else {
return 0;
}
}

int isopr(char m) {
if(m=='+' || m=='-' || m=='*' || m=='/' || m=='^') {
return 1;
} else {
return 0;
}
}
void push(char m) {
struct stack *p = (struct stack *)malloc(sizeof(struct stack));
p->ch = m;
p->next = top;
top = p;
}

char pop() {
struct stack* p;
char data;

if (top != NULL) {
p = top;
top = top->next;
data = p->ch;
free(p);
return data;
}
}

int checkExp(char x[80]) {

int i,n;
n = strlen(x);

for(i=0;i<n-1;i++) {
if((isopd(x[i]) && isopd(x[i+1])) || (isopr(x[i]) && isopr(x[i+1])) ||
(isopr(x[i]) && x[i+1]==')') || (x[i]=='(' && isopr(x[i+1]))) {
return 0;
}
}

return 1;
}

void infixToPostfix(char x[80]) {

char y[80];
int i,n,k=0;
n = strlen(x);

for(i=0;i<n;i++) {
if(isopd(x[i])) {
y[k++]=x[i];
}
else if(x[i]=='(') {
push(x[i]);
}
else if(x[i]==')') {
while(top->ch!='(')
y[k++] = pop();
pop();
}
else if(isopr(x[i])) {
while(sprec(top->ch)>=iprec(x[i]))
y[k++]=pop();
push(x[i]);
}
}
 while(top!=NULL) {
y[k++]=pop();
}

y[i]='\0';

printf("Postfix Expression:");
puts(y);
}

int evaluatePostfix(char expression[80]) {

for (int i = 0; expression[i] != '\0'; i++) {

if (isopd(expression[i])) {
push( expression[i] - '0');
} else if (expression[i] == '+' || expression[i] == '-' || expression[i] ==
'*' || expression[i] == '/') {
int operand2 = pop();
int operand1 = pop();
switch (expression[i]) {
case '+':
push(operand1 + operand2);
break;
case '-':
push(operand1 - operand2);
break;
case '*':
push(operand1 * operand2);
break;
case '/':
push(operand1 / operand2);
break;
}
}
}

return pop();

02/10/23, 5:57 pm - 𝕴𝖓𝖉𝖚: #include<stdio.h>

}

#include<string.h>
#include<stdlib.h>
struct stack {
char ch;
struct stack *next;
};
struct stack *top = NULL;

int checkExp(char[]);
void infixToPostfix(char[]);
int isopr(char);
int isopd(char);
int iprec(char);
int sprec(char);
void push(char);
char pop();

int main() {
 char x[80];
printf("Enter the String : ");
gets(x);
if(checkExp(x)) {
infixToPostfix(x);
} else {
printf("Invalid Expression\n");
}

return 0;
}

int iprec(char m) {
switch(m) {
case '+' : case '-' :
return 2;
case '*' : case '/' : case '%' :
return 4;
case '^' :
return 6;
case '(' :
return 8;
default :
return -1;
}
}

int sprec(char m) {
switch(m) {
case '+' : case '-' :
return 2;
case '*' : case '/' : case '%' :
return 4;
case '^' :
return 6;
case '(' :
return 1;
default :
return -1;
}
}

int isopd(char m) {
if((m>='a' && m<='z') || (m>='A' && m<='Z') || (m>='0' && m<='9')) {
return 1;
} else {
return 0;
}
}

int isopr(char m) {
if(m=='+' || m=='-' || m=='*' || m=='/' || m=='^') {
return 1;
} else {
return 0;
}
}

void push(char m) {
 struct stack *p = (struct stack *)malloc(sizeof(struct stack));
p->ch = m;
p->next = top;
top = p;
}

char pop() {
struct stack *p;
if(top!=NULL) {
p=top;
top=top->next;
}
return p->ch;
}

int checkExp(char x[80]) {

int i,n;
n = strlen(x);

for(i=0;i<n-1;i++) {
if((isopd(x[i]) && isopd(x[i+1])) || (isopr(x[i]) && isopr(x[i+1])) ||
(isopr(x[i]) && x[i+1]==')') || (x[i]=='(' && isopr(x[i+1]))) {
return 0;
}
}

return 1;
}

void infixToPostfix(char x[80]) {

char y[80];
int i,n,k=0;
n = strlen(x);

for(i=0;i<n;i++) {
if(isopd(x[i])) {
y[k++]=x[i];
}
else if(x[i]=='(') {
push(x[i]);
}
else if(x[i]==')') {
while(top->ch!='(')
y[k++] = pop();
pop();
}
else if(isopr(x[i])) {
while(sprec(top->ch)>=iprec(x[i]))
y[k++]=pop();
push(x[i]);
}
}

while(top!=NULL) {
y[k++]=pop();
}

y[i]='\0';
 printf("Postfix Expression:");
puts(y);

02/10/23, 6:09 pm - 𝕴𝖓𝖉𝖚: #include<stdio.h>

}

int fab(int n){

if(n<=1){
return 1;
}
return fab(n-1)+fab(n-2);
}

int main(){
int n,i;
printf("Enter the term :");
scanf("%d",&n);
for ( i = 0; i < n; i++)
{
printf("%d \n", fab(i));
}

02/10/23, 6:12 pm - 𝕴𝖓𝖉𝖚: #include<stdio.h>

}

void hanoi(int n,char s,char m, char d){

if(n>0)
{
hanoi(n-1,s,d,m);
printf("move %d from %c to %c\n",n,s,d);
hanoi(n-1,m,s,d);
}}
int main(){
printf("enter the no of disk : ");
int n;
scanf("%d",&n);
char s='a';
char m='b';
char d='d';
hanoi(n,s,m,d);

02/10/23, 6:13 pm - 𝕴𝖓𝖉𝖚: enter the no of disk : 3

}

move 1 from a to d
move 2 from a to b
move 1 from d to b
move 3 from a to d
move 1 from b to a
move 2 from b to d

05/10/23, 8:37 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

move 1 from a to d

11/10/23, 3:13 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

20/10/23, 12:32 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/10/23, 12:32 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>
#include<stdlib.h>
struct node{
int data;
struct node *next;
};
struct node *head;
void insertatfirst();
void insertatend();
//void insertatposition();
//void deleteatfirst();
//void deletatend();
//void deletatposition();
void display();
int main() {
int choice=0;
while(choice!=9){
printf("Enter the operatin number \n");
printf("1.insertatfirst\n2.insertatend\n3.insertatposition\n4.deleteatfirst\
n5.deletatend\n6.deletatposition\n7.display\n");
printf("Enetr your choice =\n");
scanf("%d",&choice);
switch(choice){
case 1:
insertatfirst();
break;

case 7:
display();
break;

default :
printf("Invalid option \n");
}
}

void insertatfirst(){
int item;
struct node *ptr=(struct node *)malloc(sizeof(struct node));
if(ptr==NULL){
printf("link list is empty");
}
else{
printf("insert value =");
scanf("%d",&item);
ptr->data=item;
ptr->next=head;
printf("Element inserted");
}
ptr=head;
}

void display(){
struct node *ptr=(struct node *)malloc(sizeof(struct node));
if(ptr!=NULL){
printf("%d",ptr->data);
ptr=ptr->next;
}
}

void insertatend(){
int item;
struct node *ptr,*temp;
temp=head;
ptr=(struct node *)malloc(sizeof(struct node));

if(ptr!=NULL){
printf("empty \n");
 }
else{
printf("Enter element");
scanf("%d",&item);
ptr->data=item;
while(temp->next!=NULL){
temp=temp->next;
}
temp->next=ptr;
ptr->next=NULL;

void insertatposition(){
int item,index;
int i=0;
struct node *ptr,*temp*newnode;
ptr=(struct node *)malloc(sizeof(struct node));
printf("Enter the new data =\n");
scanf("%d",&item);
printf("Enter the position\n");
scanf("%d",&index);
ptr->data=item;
for(i=0;i<index;i++){
temp=temp->next;
}
temp->next=newnode;
newnode->next=temp->next;

}
void deletatfirst(){
struct node *ptr=(struct node *)malloc(sizeof(struct node));
ptr=head;
head=head->next;
free(head);
}
void deletatend(){

struct node *ptr,*temp;

ptr=(struct node *)malloc(sizeof(struct node));
ptr=head;
while(temp->next!=NULL){
temp=temp->next;
}
ptr->next=NULL;
free(temp);
}
return 0;

23/10/23, 4:27 pm - 𝕴𝖓𝖉𝖚: https://www.figma.com/file/F76FrBgSveMwR7wi3XkEyG/gas-

}

24/10/23, 10:16 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>

lekage?type=design&node-id=64%3A17&mode=design&t=Ek1K4dMqibHwPY2h-1

#include <stdlib.h>

void EnqueueF(int x);

void DequeueR();
void EnqueueR(int x);
void DequeueF();
void Display();
int queue[7];
int front = -1, rear = -1, max = 7;

int main()
{
int choice, ch, x;
do
{
printf("1. EnqueueR()\n2. DequeueF()\n
3.EnqueueF()\n 4.DequeueR\n 5. Display()\n");
printf("Enter your Choice : ");
scanf("%d",&choice);

switch(choice) {
case 1:
printf("Enter element you want to enqueue : ");
scanf("%d", &x);
EnqueueR(x);
break;
case 2:
DequeueF();
break;
case 3:
printf("Enter element you want to enqueue : ");
scanf("%d", &x);
EnqueueF(x);
break;
case 4:
DequeueR();
break;
case 5:
Display();
break;
default:
printf("Invalid Choice\n");
}

printf("Do you want to Continue? (1 for Yes):-");

scanf("%d",&ch);
} while (ch == 1);
getch();
return 0;
}

void DequeueR()
{
if (front == -1 && rear == -1)
{
printf("under flow\n");
}
else if (front == rear)
{
printf("Dequeue() Done for : %d\n", queue[front]);
front = rear = -1;
}
else if (rear == 0)
 {
printf("Dequeue() Done for : %d\n", queue[front]);
rear = max - 1;
}
else
{
printf("Dequeue() Done for : %d\n", queue[front]);
rear = rear - 1;
}
}
void DequeueF()
{
if (front == -1 && rear == -1)
{
printf("under flow\n");
}
else if (front == rear)
{
printf("Dequeue() Done for : %d\n", queue[front]);
front = rear = -1;
}
else if (front == max - 1)
{
printf("Dequeue() Done for : %d\n", queue[front]);
front = 0;
}
else
{
printf("Dequeue() Done for : %d\n", queue[front]);
front = front + 1;
}
}

void EnqueueR(int x)
{
if ((front == 0 && rear == max - 1) || (front == rear + 1))
{
printf("OVER FLOW");
}
else if (front == -1 && rear == -1)
{
front = rear = 0;
queue[rear] = x;
}
else if (rear == max - 1)
{
rear = 0;
queue[rear] = x;
}
else
{
rear = rear + 1;
queue[rear] = x;
}
}

void EnqueueF(int x)
{
if ((front == 0 && rear == max - 1) || (front == rear + 1))
 {
printf("OVER FLOW");
}
else if (front == -1 && rear == -1)
{
front = rear = 0;
queue[front] = x;
}
else if (front == max - 1)
{
front = 0;
queue[front] = x;
}
else
{
front = front + 1;
queue[front] = x;
}
}

void display()
{
int i;
for (i = 0; i < max; i++)
{
printf("%d\t", queue[i]);
}
printf("\nDisplay() Done\n");

26/10/23, 7:19 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

}

30/10/23, 9:48 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>

#include <stdlib.h>
struct node
{
struct node *next;
struct node *pre;
int data;
};
struct node *head;

void insertatfirst(int x);

void insertatlast(int x);
void display();
void insertatmid(int x);

int main()
{
int x, y, z;
do
{
printf("1.Insertatfirst\n 2.Insertatlast \n 3.Insert at middle \n
4.Display\n");
printf("enter your choice=");
scanf("%d", &x);

switch (x)
{
case 1:
printf("Enter element\n");
 scanf("%d", &y);
insertatfirst(y);
break;

case 2:
printf("Enter element\n");
scanf("%d", &y);
insertatlast(y);
break;

case 3:
printf("Enter element\n");
scanf("%d", &y);
insertatmid(y);
break;

case 4:
display();
break;

default:
printf("invalid chice!!!\n");
}
printf("do you want to continue ? =");
scanf("%d", &z);
} while(z == 1);
}

void insertatfirst(int x)
{
struct node *ptr = (struct node *)malloc(sizeof(struct node));
if (ptr == NULL)
{
printf("memory is not available");
}
ptr->data = x;
ptr->next = NULL;
if (head == NULL)
{
ptr->pre = NULL;
head = ptr;
}
else
{

ptr->next = head;
ptr->pre = NULL;
head->pre = ptr;
head = ptr;
}
printf("\nDONE\n");
}

void insertatlast(int x)
{
struct node *temp = head;
struct node *ptr = (struct node *)malloc(sizeof(struct node));
if (ptr == NULL)
{
 printf("memory is not available");
}
ptr->data = x;
ptr->next = NULL;
if (head == NULL)
{

ptr->pre = NULL;
head = ptr;
}
else
{

while (temp->next != NULL)

{
temp = temp->next;
}
temp->next = ptr;
ptr->pre = temp;
ptr->next = NULL;
}
}
void insertatmid(int x){
struct node *ptr=(struct node*)malloc(sizeof(struct node));
struct node *temp=head;
int index;
printf("Enter the position=");
scanf("%d",&index);
if(ptr==NULL){
printf("memory is not allocated");
}
ptr->data = x;
ptr->next = NULL;
if (head == NULL)
{

ptr->pre = NULL;
head = ptr;
}
else{
for (int i = 1; i <index-1; i++)
{
temp=temp->next;
}

ptr->next=temp->next;
temp->next=ptr;
ptr->pre=temp;
temp->next->pre=ptr;
}}

void display(){
struct node *ptr = head;
while (ptr != NULL)
{
printf("element = %d\n", ptr->data);
ptr = ptr->next;
}
}
05/11/23, 10:24 am - 𝕴𝖓𝖉𝖚: 476744161
10/11/23, 12:17 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
13/11/23, 6:20 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>
#include <stdlib.h>

struct node {
int data;
struct node *next;
};

struct node *head;

void insertatfirst(int x);

void insertatend(int x);
void insertatposition(int item, int index);
void deleteatfirst();
void deleteatend();
void deleteatposition(int index);
void display();

int main() {
int choice = 0;
int item, index;

printf("Enter the operation number\n");

printf("1.insertatfirst\n2.insertatend\n3.insertatposition\n4.deleteatfirst\
n5.deleteatend\n6.deleteatposition\n7.display\n");
printf("Enter your choice =\n");
scanf("%d", &choice);

while (choice != 8) {
switch (choice) {
case 1:
printf("Enter element=");
scanf("%d", &item);
insertatfirst(item);
break;

case 2:
printf("Enter element=");
scanf("%d", &item);
insertatend(item);
break;

case 3:
printf("Enter element=");
scanf("%d", &item);
printf("Enter position=");
scanf("%d", &index);
insertatposition(item, index);
break;

case 4:
deleteatfirst();
break;

case 5:
deleteatend();
break;
 case 6:
printf("Enter position=");
scanf("%d", &index);
deleteatposition(index);
break;

case 7:
display();
break;

default:
printf("Invalid option\n");
}

printf("Enter your choice =\n");

scanf("%d", &choice);
}

return 0;
}

void insertatfirst(int x) {
struct node *temp = (struct node *)malloc(sizeof(struct node));
if (temp == NULL) {
printf("Memory not available\n");
return;
}
temp->data = x;
temp->next = NULL;
if (head != NULL) {
temp->next = head;
}
head = temp;
}

void display() {
struct node *ptr = head;
while (ptr != NULL) {
printf("%d ", ptr->data);
ptr = ptr->next;
}
printf("\n");
}

void insertatend(int x) {
struct node *temp = (struct node *)malloc(sizeof(struct node));
if (temp == NULL) {
printf("Memory not available\n");
return;
}
temp->data = x;
temp->next = NULL;
if (head == NULL) {
head = temp;
return;
}
struct node *t1 = head;
while (t1->next != NULL) {
 t1 = t1->next;
}
t1->next = temp;
}

void insertatposition(int item, int index) {

int i = 0;
struct node *ptr, *temp;
ptr = (struct node *)malloc(sizeof(struct node));
if (ptr == NULL) {
printf("Memory not available\n");
return;
}
ptr->data = item;
ptr->next = NULL;
if (index == 1) {
ptr->next = head;
head = ptr;
} else {
temp = head;
for (i = 0; i < (index - 2); i++) {
temp = temp->next;
}
ptr->next = temp->next;
temp->next = ptr;
}
}

void deleteatfirst() {
if (head == NULL) {
printf("List is already empty.\n");
return;
}
struct node *ptr = head;
if (head->next == NULL) {
printf("Value deleted is %d\n", head->data);
head = NULL;
free(ptr);
} else {
head = head->next;
free(ptr);
}
}

void deleteatend() {
if (head == NULL) {
printf("List is already empty.\n");
return;
}
struct node *ptr = head, *temp;
if (head->next == NULL) {
printf("Value deleted is %d\n", head->data);
head = NULL;
free(ptr);
} else {
while (ptr->next != NULL) {
temp = ptr;
ptr = ptr->next;
}
 temp->next = NULL;
printf("Value deleted is %d\n", ptr->data);
free(ptr);
}
}

void deleteatposition(int index) {

struct node *ptr = head, *temp;
int i = 0;
if (index == 1) {
head = ptr->next;
free(ptr);
} else {
for (i = 0; i < (index - 2); i++) {
ptr = ptr->next;
}
temp = ptr->next;
ptr->next = temp->next;
printf("Value deleted is %d\n", temp->data);
free(temp);
}

13/11/23, 6:20 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>

}

#include <stdlib.h>

struct node {
int data;
struct node *next;
};

struct node *head;

void insertatfirst(int x);

void insertatend(int x);
void insertatposition(int item, int index);
void deleteatfirst();
void deleteatend();
void deleteatposition(int index);
void display();

int main() {
int choice = 0;
int item, index;

printf("Enter the operation number\n");

printf("1.insertatfirst\n2.insertatend\n3.insertatposition\n4.deleteatfirst\
n5.deleteatend\n6.deleteatposition\n7.display\n");
printf("Enter your choice =\n");
scanf("%d", &choice);

while (choice != 8) {
switch (choice) {
case 1:
printf("Enter element=");
scanf("%d", &item);
insertatfirst(item);
break;

case 2:
 printf("Enter element=");
scanf("%d", &item);
insertatend(item);
break;

case 3:
printf("Enter element=");
scanf("%d", &item);
printf("Enter position=");
scanf("%d", &index);
insertatposition(item, index);
break;

case 4:
deleteatfirst();
break;

case 5:
deleteatend();
break;

case 6:
printf("Enter position=");
scanf("%d", &index);
deleteatposition(index);
break;

case 7:
display();
break;

default:
printf("Invalid option\n");
}

printf("Enter your choice =\n");

scanf("%d", &choice);
}

return 0;
}
void display(){
struct node *ptr=head;
printf("Printing List:\n");
if(head==NULL){
printf("List is Empty \n");
return;
}
do
{
printf(" %d", ptr->data);
ptr=ptr->next;
}
while(ptr!=head);

printf("\n");
}
void insertatend(int x){
struct node *temp=head;
struct node *ptr=(struct node *)malloc(sizeof(struct node));
ptr->data=x;
ptr->next=NULL;

if(ptr==NULL){
printf("Memory Unavailable:\n");
return;
}
if (head==NULL){
head=ptr;
ptr->next=head;
return;
}
while(temp->next!=head){
temp=temp->next;
}
temp->next=ptr;
ptr->next=head;
}

void insertatfirst(int x){

struct node *ptr = (struct node *)malloc(sizeof(struct node));
struct node *temp = head;
ptr->data = x;
ptr->next = NULL;
if (ptr == NULL) {
printf("Memory Unavailable:\n");
return;
}
if (head == NULL) {
head = ptr;
ptr->next = head;
return;
}
while (temp->next != head) {
temp = temp->next;
}
ptr->next = head;
head = ptr;
temp->next = head;
}

void insertatposition(int item, int index){

struct node *newnode, *temp;
int i;
if (index == 1) {
insertatfirst(item);
} else {
newnode = (struct node *)malloc(sizeof(struct node));
newnode->data = item;
newnode->next = NULL;
temp = head;
for (i = 0; i < index - 2; i++) {
temp = temp->next;
}
 newnode->next = temp->next;
temp->next = newnode;
}
}

void deleteatfirst() {
struct node *temp = head;
struct node *temp2 = head;
if (head == NULL) {
printf("List is Empty\n");
return;
}
if (temp->next == head) {
head = NULL;
free(temp);
return;
}
while (temp->next != head) {
temp = temp->next;
}

head = temp2->next;
temp->next = head;
printf("The deleted node is : %d\n", temp2->data);
free(temp2);
}

void deleteatend() {
struct node *temp = head;
struct node *prev;
if (head == NULL) {
printf("List is Empty\n");
return;
}
if (temp->next == head) {
head = NULL;
free(temp);
return;
}
while (temp->next != head) {
prev = temp;
temp = temp->next;
}
prev->next = head;
printf("The deleted node is : %d\n", temp->data);
free(temp);
}

void deleteatposition(int index) {

struct node *prev, *temp = head;
int i;
if (head == NULL) {
printf(" List is Empty\n");
} else if (index == 1) {
deleteatfirst();
} else {
for (i = 0; i < index - 1; i++) {
prev = temp;
temp = temp->next;
 }
prev->next = temp->next;
printf("The deleted node is : %d\n", temp->data);
free(temp);
}

13/11/23, 6:37 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>

}

#include <stdlib.h>

struct node {
int data;
struct node *next;
struct node *prev;
};

struct node *head;

void insertatfirst(int x);

void insertatend(int x);
void insertatposition(int item, int index);
void deleteatfirst();
void deleteatend();
// void deleteatposition(int index);
void display();

int main() {
int choice = 0;
int item, index;

printf("Enter the operation number\n");

printf("1.insertatfirst\n2.insertatend\n3.insertatposition\n4.deleteatfirst\
n5.deleteatend\n6.deleteatposition\n7.display\n");
printf("Enter your choice =\n");
scanf("%d", &choice);

while (choice != 8) {
switch (choice) {
case 1:
printf("Enter element=");
scanf("%d", &item);
insertatfirst(item);
break;

case 2:
printf("Enter element=");
scanf("%d", &item);
insertatend(item);
break;

case 3:
printf("Enter element=");
scanf("%d", &item);
printf("Enter position=");
scanf("%d", &index);
insertatposition(item, index);
break;

case 4:
deleteatfirst();
 break;

case 5:
deleteatend();
break;

// case 6:
// printf("Enter position=");
// scanf("%d", &index);
// deleteatposition(index);
// break;

case 6:
display();
break;

default:
printf("Invalid option\n");
}

printf("Enter your choice =\n");

scanf("%d", &choice);
}

return 0;
}

void display(){

struct node *temp=head;

printf("Forward Traversing :\n");
if(head==NULL){
printf("List is Empty \n");
return;
}
do
{
printf(" %d", temp->data);
temp=temp->next;
}
while(temp!=head);

printf("\n");
}

void insertatfirst(int x){

struct node *new_node=(struct node *)malloc(sizeof(struct node));
new_node->data=x;
new_node->next=NULL;
new_node->prev=NULL;
if(new_node==NULL){
printf("Memory Unavailable:\n");
}
else if (head==NULL){
head=new_node;
}
else{
head->prev=new_node;
new_node->next=head;
 head=new_node;
}
}

void insertatend(int x){

struct node *new_node=(struct node *)malloc(sizeof(struct node));
struct node *temp=head;
new_node->data=x;
new_node->next=NULL;
new_node->prev=NULL;
if(new_node==NULL){
printf("Memory Unavailable:\n");
}
else if (head==NULL){
head=new_node;
}
else{
while(temp->next!=NULL){
temp=temp->next;
}
temp->next=new_node;
new_node->prev=temp;
}

void insertatposition(int item, int index){

struct node *new_node=(struct node *)malloc(sizeof(struct node));
struct node *temp=head;
struct node *temp2;
int i;
new_node->data=item;
new_node->next=NULL;
new_node->prev=NULL;
if(new_node==NULL)
{ printf("Memory Unavailable:\n"); }
else if (head==NULL)
{ head=new_node; }
else
{ for(i=0;i<index-1;i++)
{ temp2=temp;
temp = temp->next; }
new_node->next = temp;
new_node -> prev = temp2;
temp2->next = new_node;
temp->prev=new_node;
}

}
void deleteatfirst(){
struct node *temp = head;
if (head == NULL)
{
printf("List is Empty\n");
return;
}
else if(temp->next == NULL){
head = NULL;
}
 else{
temp = temp->next;
head = temp;
temp->prev = NULL;
}
free(temp);
}

void deleteatend(){
struct node *temp = head;
if (head == NULL)
{
printf("List is Empty\n");
return;
}
else if (temp->next == NULL)
{
head = NULL;
}
else{
while (temp->next != NULL)
{
temp = temp->next;
}
temp->prev->next = NULL;
free(temp);
}}

// void deleteatposition(int index){

19/11/23, 10:21 am - 𝕴𝖓𝖉𝖚: https://www.quikr.com/homes/land-of-4500sqft-for-sale-

// }

in-sikar/p/367395053?
source=qh&_gl=1*a7e0vs*_ga*Z3hVdXBtZmNPZzV6ek44MUF6Q0Q5X01ZNUNWUUhzTzIySHgyOEdfZ0NT
c0RVdk5XOFpWSjRuWjdIdmZ6ZXhJbQ..*_ga_GK13V3NJGZ*MTcwMDM2ODg2OC4xLjEuMTcwMDM2OTI5MC4

21/11/23, 11:36 am - 𝕴𝖓𝖉𝖚: // Online C compiler to run C program online

wLjAuMA..

#include <stdio.h>
int display(int a[],int n){
int i;
for(i=0;i<n;i++){
printf("element %d\n",a[i]);
}
}
int selectionsort(int a[],int n){
int i,j;
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(a[i]>a[j]){
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("after sorting\n");
for(i=0;i<n;i++){
printf("element %d\n",a[i]);
}
}
int main() {
int a[]={2,5,9,1,7};
int n=sizeof(a)/sizeof(a[0]);
display(a,n);
selectionsort(a,n);
return 0;

21/11/23, 11:44 am - 𝕴𝖓𝖉𝖚: Selection sort

}

25/11/23, 10:27 pm - 𝕴𝖓𝖉𝖚: 35035321786

28/11/23, 8:47 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
29/11/23, 10:53 am - 𝕴𝖓𝖉𝖚: Pav badam Pav khaju pao akhrot
29/11/23, 10:53 am - 𝕴𝖓𝖉𝖚: Pao Gond 1 kg good 1 kg ghee
29/11/23, 10:53 am - 𝕴𝖓𝖉𝖚: Ek khopre ki gift
29/11/23, 10:54 am - 𝕴𝖓𝖉𝖚: 100 gram Agaj ke bich
29/11/23, 10:54 am - 𝕴𝖓𝖉𝖚: 100 gram khaskhas
29/11/23, 10:55 am - 𝕴𝖓𝖉𝖚: 100 gram kali mirch
05/12/23, 1:50 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
06/12/23, 12:02 am - 𝕴𝖓𝖉𝖚: Java for dummies
06/12/23, 10:34 am - 𝕴𝖓𝖉𝖚: public class Main {
// Method that declares it might throw an Exception
public static void methodWithException() throws Exception {
// Simulating a scenario where an exception might occur
int result = 10 / 0; // This will throw an ArithmeticException
}

public static void main(String[] args) {

try {
// Calling the method that throws an exception
methodWithException();
} catch (Exception e) {
// Catching the exception thrown by the method
System.out.println("Exception caught: " + e);
}
}

06/12/23, 10:38 am - 𝕴𝖓𝖉𝖚: // Custom exception class extending Exception

}

class CustomException extends Exception {

// Constructor to initialize the exception with a message
public CustomException(String message) {
// Call the superclass (Exception) constructor with the message
super(message);
}
}

public class Main {

public static void main(String[] args) {
try {
// Simulating a condition that triggers the custom exception
int balance = 100;
int withdrawAmount = 200;

if (withdrawAmount > balance) {

// Throw the custom exception with a specific message
throw new CustomException("Insufficient balance to withdraw.");
} else {
System.out.println("Withdrawal successful!");
}
} catch (CustomException e) {
 // Catching the custom exception and printing its message
System.out.println("Exception caught: " + e.getMessage());
}
}

06/12/23, 10:40 am - 𝕴𝖓𝖉𝖚: // Define interfaces

}

interface Interface1 {
void method1();
}

interface Interface2 {
void method2();
}

// Implement interfaces
class MyClass implements Interface1, Interface2 {
@Override
public void method1() {
System.out.println("Implementing method1");
}

@Override
public void method2() {
System.out.println("Implementing method2");
}
}

public class Main {

public static void main(String[] args) {
MyClass obj = new MyClass();
obj.method1();
obj.method2();
}

06/12/23, 10:40 am - 𝕴𝖓𝖉𝖚: Multiple Inheritance using interface

}

06/12/23, 10:41 am - 𝕴𝖓𝖉𝖚: public class Implement {

public static void main(String args[]){
e obj=new e();
obj.m1();
obj.m2();
obj.m3();
obj.m4();
}
}
interface a{
abstract void m1();
}
interface b{
abstract void m2();
}
interface c extends a,b{
abstract void m3();
}
class d{
void m4(){
System.out.println("this is from d class");
}
}
class e extends d implements c{
public void m1(){
System.out.println("this is from a interface");
}
public void m2(){
System.out.println("this is from b interface");
}
public void m3(){

06/12/23, 10:41 am - 𝕴𝖓𝖉𝖚: 5.6

System.out.println("this is from c interface");

06/12/23, 11:04 am - 𝕴𝖓𝖉𝖚: class MyThread extends Thread {

public void run() {
System.out.println("MyThread running");
}
}

public class Main {

public static void main(String[] args) {
MyThread thread1 = new MyThread();
MyThread thread2 = new MyThread();

thread1.start();
thread2.start();
}
}

06/12/23, 7:20 pm - 𝕴𝖓𝖉𝖚: In simple terms, a materialized view is a database

MULTIPLE THREAD

object that stores the result of a query as a table. It's like taking a snapshot of
the query's output and saving it for quick access.it response fast. does not waste

06/12/23, 7:20 pm - 𝕴𝖓𝖉𝖚: it updated manually

time to resolve query.it stored in disk as object.

06/12/23, 7:29 pm - 𝕴𝖓𝖉𝖚: What is Query Optimization Process? Explain.

06/12/23, 7:30 pm - 𝕴𝖓𝖉𝖚: Parsing: Breaking down the SQL query into a format that
the database can understand.

Semantic Analysis: Checking the query for correctness and ensuring that the
specified tables and columns exist.

Query Transformation: Rewriting the query to find more efficient ways to retrieve
the data.

Optimization: Identifying the most efficient execution plan, which involves

choosing the best algorithms and access methods to retrieve the data.

Execution: Carrying out the optimized query plan to fetch the results from the

06/12/23, 9:15 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

database.

15/12/23, 2:59 pm - 𝕴𝖓𝖉𝖚: 9428419129

18/12/23, 10:54 am - 𝕴𝖓𝖉𝖚: // Online C compiler to run C program online
#include <stdio.h>
void Merge(int a[],int beg,int end);
void sort(int a[],int beg,int mid,int end);
void display(int a[],int n){
for(int i=0;i<n;i++){
printf("%d\t",a[i]);
}

}
void Merge(int a[],int beg,int end){
if(beg<end){
 int mid=(beg+end)/2;
Merge(a,beg,mid);
Merge(a,mid+1,end);
sort(a,beg ,mid,end);

}
void sort(int a[],int beg,int mid,int end){
int i=beg;
int j=mid+1;
int k=beg;
int b[end+1];
while(i<=mid && j<=end){
if(a[i]<= a[j]){
b[k]=a[i];
i++;
}else{
b[k]=a[j];
j++;
}
k++;
}
if(i>mid){
while(j<=end){
b[k]=a[j];
k++;
j++;
}

}
else{
while(i<=mid){
b[k]=a[i];
k++;
i++;
}
}

for(k=beg;k<=end;k++){
a[k]=b[k];
}
}
int main() {
int arr[]={1,9,5,3,7,15};
int n=sizeof(arr)/sizeof(arr[0]);
printf("Before sorting :-\n");
display(arr,n);
printf("After sorting :-\n");
Merge(arr,0,n-1);
display(arr,n);
return 0;

18/12/23, 10:55 am - 𝕴𝖓𝖉𝖚: // Time complexity...............

}

// best case=o(n)
// average case=o(n^2)
// worst case=o(n^2)
#include <stdio.h>
void display(int a[], int n)
{
for (int i = 0; i < n; i++)
{
printf("%d\t", a[i]);
}
}
int Insertionsort(int a[], int n)
{
for (int i = 1; i < n; i++)
{
int temp = a[i];
int j = i - 1;

while (j >= 0 && a[j] > temp)

{
a[j + 1] = a[j];
j--;
}
a[j + 1] = temp;
}
}
int main()
{
int a[] = {3, 5, 2, 0, 1};
int n = sizeof(a) / sizeof(a[0]);
printf("Before sorting\n");
display(a, n);
printf("\nAfter Sorting\n");
Insertionsort(a, n);
display(a, n);

18/12/23, 10:55 am - 𝕴𝖓𝖉𝖚: //Time complexity....................

}

//best case=o(n)
//average case=o(n^2)
//worst case=o(n^2)

#include<stdio.h>
void print(int a[], int n)
{

for(int i = 0; i < n; i++)

{
printf("%d ",a[i]);
}
}
void bubble(int a[], int n)
{

for(int i = 0; i < n; i++)

{ for(int j=i+1;j<n;j++){
if(a[i] > a[j])
{
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
} }
}
void main ()
{

int a[5] = { 10, 35, 32, 13, 26};

int n = sizeof(a)/sizeof(a[0]);
printf("Before sorting array elements are - \n");
print(a, n);
bubble(a, n);
printf("\nAfter sorting array elements are - \n");
print(a, n);

18/12/23, 10:55 am - 𝕴𝖓𝖉𝖚: //Time complexity...............

}

//best case=o(n^2)
//average case=o(n^2)
//worst case=o(n^2)

#include <stdio.h>
void display(int a[], int n)
{
for (int i = 0; i < n; i++)
{
printf("%d\t", a[i]);
}
}
int selectionsort(int a[], int n)
{

for (int i = 0; i < n - 1; i++)

{
int small=i;

for (int j = i + 1; j < n; j++)

{
if (a[small] > a[j])
{
small=j;

int temp = a[small];

a[small] = a[i];
a[i] = temp;
}
}
}
}
int main()
{
int a[] = {2, 5, 9, 1, 7};
int n = sizeof(a) / sizeof(a[0]);
printf("Before sorting array elements are - \n");
display(a, n);
selectionsort(a,n);
printf("/n After sorting array elements are - \n");
display(a, n);

return 0;

26/12/23, 11:33 am - 𝕴𝖓𝖉𝖚: <Media omitted>

}

26/12/23, 11:33 am - 𝕴𝖓𝖉𝖚: <Media omitted>

26/12/23, 11:33 am - 𝕴𝖓𝖉𝖚: <Media omitted>
26/12/23, 12:42 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
26/12/23, 12:42 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
26/12/23, 7:20 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/12/23, 1:04 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/12/23, 1:04 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/12/23, 8:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/12/23, 8:34 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/12/23, 8:38 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
30/12/23, 10:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
30/12/23, 10:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
30/12/23, 10:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
30/12/23, 10:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
31/12/23, 4:59 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
31/12/23, 4:59 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
31/12/23, 4:59 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
31/12/23, 4:59 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
31/12/23, 4:59 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
31/12/23, 9:21 pm - 𝕴𝖓𝖉𝖚: Extract
01/01/24, 7:41 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
01/01/24, 7:41 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
01/01/24, 7:42 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
01/01/24, 7:43 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
02/01/24, 8:30 am - 𝕴𝖓𝖉𝖚: allowing for stable storage and sequential data
processing

02/01/24, 8:31 am - 𝕴𝖓𝖉𝖚: Counters.

Master slave jk flip flop

Storage registers.
Shift registers.
Data storage.
Bounce elimination switch.
Latch.
Data transfer

02/01/24, 8:32 am - 𝕴𝖓𝖉𝖚: What are the real applications of flip-flops?

JK FLIP FLOP

Flip-flops and latches are used as data storage elements to store a single bit

02/01/24, 8:33 am - 𝕴𝖓𝖉𝖚: Shift resistors

(binary digit) of data

02/01/24, 8:33 am - 𝕴𝖓𝖉𝖚: What are RS flip-flops?

D FLIP FLOP

The RS flip-flop is used to store binary information (i.e. 0 or 1). It consists of

two inputs, SET and RESET. In RS flip-flop 'R' Stands for RESET and 'S' stands for

02/01/24, 8:34 am - 𝕴𝖓𝖉𝖚: What are the real life applications of multiplexer?
SET

Multiplexers are used in telephone networks for integration of several audio

02/01/24, 8:35 am - 𝕴𝖓𝖉𝖚: Demultiplexers are used in Communication systems

signals on a single transmission line

02/01/24, 10:09 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>

void Merge(int a[],int beg,int end);
void sort(int a[],int beg,int mid,int end);
void display(int a[],int n){
for(int i=0;i<n;i++){
printf("%d\t",a[i]);
}

}
void Merge(int a[],int beg,int end){
if(beg<end){
int mid=(beg+end)/2;
 Merge(a,beg,mid);
Merge(a,mid+1,end);
sort(a,beg ,mid,end);

}
void sort(int a[],int beg,int mid,int end){
int i=beg;
int j=mid+1;
int k=beg;
int b[end+1];
while(i<=mid && j<=end){
if(a[i]<= a[j]){
b[k]=a[i];
i++;
}else{
b[k]=a[j];
j++;
}
k++;
}
if(i>mid){
while(j<=end){
b[k]=a[j];
k++;
j++;
}

}
else{
while(i<=mid){
b[k]=a[i];
k++;
i++;
}
}

for(k=beg;k<=end;k++){
a[k]=b[k];
}
}
int main() {
int arr[]={1,9,5,3,7,15};
int n=sizeof(arr)/sizeof(arr[0]);
printf("Before sorting :-\n");
display(arr,n);
printf("\nAfter sorting :-\n");
Merge(arr,0,n-1);
display(arr,n);
return 0;

02/01/24, 10:47 pm - 𝕴𝖓𝖉𝖚: #include<stdio.h>

}

void shellsort(int a[],int n){

for (int gap = n/2; gap>=1; gap=gap/2)
{
for (int j = gap; j <n; j++)
{
for (int i = j-gap; i >=0; i=i-gap)
 {
if (a[i+gap]<a[i])
{
int temp=a[i+gap];
a[i+gap]=a[i];
a[i]=temp;
}

void display(int a[], int n)

{
for (int i = 0; i < n; i++)
{
printf("%d\t", a[i]);
}
}
int main(){
int a[] = {2, 5, 9, 1, 7};
int n = sizeof(a) / sizeof(a[0]);
printf("Before sorting array elements are - \n");
display(a, n);
shellsort(a,n);
printf("/n After sorting array elements are - \n");
display(a, n);

return 0;

02/01/24, 10:57 pm - 𝕴𝖓𝖉𝖚: //worst case=o(n^2)

}

//Best case and Avarage case=o(nlogn)

#include<stdio.h>
void display(int a[],int n){
for (int i = 0; i < n; i++)
{
printf("%d \t",a[i]);
}
}
int partition(int a[],int lb,int ub){
int pivot=a[lb];
int start =lb;
int end =ub;
while (start<end)
{
while (a[start]<=pivot)
{
start++;
}
while (a[end]>pivot)
{
end--;
}
if(start<end){
 int temp=a[start];
a[start]=a[end];
a[end]=temp;
}

int temp2=a[lb];
a[lb]=a[end];
a[end]=temp2;
return end;
}

void Quick(int a[],int lb,int ub){

while (lb<ub)
{
int loc=partition(a,lb,ub);
Quick(a,lb,loc);
Quick(a,loc+1,ub);
}

int main(){
int a[]={98,45,12,36,100};
int n=sizeof(a)/sizeof(a[0]);
int lb=0;
int ub=n-1;
printf("Before Sorting :\n");
display(a,n);
printf("\nAfter Sorting :\n");
Quick(a,lb,ub);
display(a,n);

02/01/24, 11:18 pm - 𝕴𝖓𝖉𝖚: #include <stdio.h>

}

/* function to heapify a subtree. Here 'i' is the

index of root node in array a[], and 'n' is the size of heap. */
void heapify(int a[], int n, int i)
{
int largest = i; // Initialize largest as root
int left = 2 * i + 1; // left child
int right = 2 * i + 2; // right child
// If left child is larger than root
if (left < n && a[left] > a[largest])
largest = left;
// If right child is larger than root
if (right < n && a[right] > a[largest])
largest = right;
// If root is not largest
if (largest != i) {
// swap a[i] with a[largest]
int temp = a[i];
a[i] = a[largest];
a[largest] = temp;

heapify(a, n, largest);
}
}
/*Function to implement the heap sort*/
void heapSort(int a[], int n)
{
for (int i = n / 2 - 1; i >= 0; i--)
heapify(a, n, i);
// One by one extract an element from heap
for (int i = n - 1; i >= 0; i--) {
/* Move current root element to end*/
// swap a[0] with a[i]
int temp = a[0];
a[0] = a[i];
a[i] = temp;

heapify(a, i, 0);
}
}
/* function to print the array elements */
void printArr(int arr[], int n)
{
for (int i = 0; i < n; ++i)
{
printf("%d", arr[i]);
printf(" ");
}

}
int main()
{
int a[] = {48, 10, 23, 43, 28, 26, 1};
int n = sizeof(a) / sizeof(a[0]);
printf("Before sorting array elements are - \n");
printArr(a, n);
heapSort(a, n);
printf("\nAfter sorting array elements are - \n");
printArr(a, n);
return 0;

03/01/24, 8:36 am - 𝕴𝖓𝖉𝖚: #include <stdio.h>

}

#include <stdlib.h>

struct node {
int data;
struct node *right_child;
struct node *left_child;
};

struct node* new_node(int x){

struct node *temp;
temp = malloc(sizeof(struct node));
temp->data = x;
temp->left_child = NULL;
temp->right_child = NULL;

return temp;
}

struct node* search(struct node * root, int x){

if (root == NULL || root->data == x)
 return root;
else if (x > root->data)
return search(root->right_child, x);
else
return search(root->left_child, x);
}

struct node* insert(struct node * root, int x){

if (root == NULL)
return new_node(x);
else if (x > root->data)
root->right_child = insert(root->right_child, x);
else
root -> left_child = insert(root->left_child, x);
return root;
}
struct node* find_minimum(struct node * root) {
if (root == NULL)
return NULL;
else if (root->left_child != NULL)
return find_minimum(root->left_child);
return root;
}

struct node* delete(struct node * root, int x) {

if (root == NULL)
return NULL;
if (x > root->data)
root->right_child = delete(root->right_child, x);
else if (x < root->data)
root->left_child = delete(root->left_child, x);
else {
if (root->left_child == NULL && root->right_child == NULL){
free(root);
return NULL;
}
else if (root->left_child == NULL || root->right_child == NULL){
struct node *temp;
if (root->left_child == NULL)
temp = root->right_child;
else
temp = root->left_child;
free(root);
return temp;
}
else {
struct node *temp = find_minimum(root->right_child);
root->data = temp->data;
root->right_child = delete(root->right_child, temp->data);
}
}
return root;
}

void inorder(struct node *root){

if (root != NULL)
{
inorder(root->left_child);
 printf(" %d ", root->data);
inorder(root->right_child);
}
}

int main() {
struct node *root;
root = new_node(20);
insert(root, 5);
insert(root, 1);
insert(root, 15);
insert(root, 9);
insert(root, 7);
insert(root, 12);
insert(root, 30);
insert(root, 25);
insert(root, 40);
insert(root, 45);
insert(root, 42);

inorder(root);
printf("\n");

root = delete(root, 1);

root = delete(root, 40);

root = delete(root, 45);

root = delete(root, 9);

inorder(root);
printf("\n");

return 0;

𝕴𝖓𝖉𝖚: https://youtube.com/shorts/Ze6abwYCapA?
}
10/01/24, 7:21 am -

𝕴𝖓𝖉𝖚:
si=NQDNRftY5aTXDdMN

𝕴𝖓𝖉𝖚:
11/01/24, 6:10 pm - <Media omitted>

𝕴𝖓𝖉𝖚:
15/01/24, 9:04 pm - Minimal cover

𝕴𝖓𝖉𝖚:
15/01/24, 9:04 pm - Closer attribute

𝕴𝖓𝖉𝖚:
15/01/24, 9:04 pm - Candidate key

𝕴𝖓𝖉𝖚:
15/01/24, 9:04 pm - Primary key

𝕴𝖓𝖉𝖚:
15/01/24, 9:04 pm - All normal forms

𝕴𝖓𝖉𝖚:
15/01/24, 9:18 pm - 2 phase locking protocol

𝕴𝖓𝖉𝖚:
15/01/24, 9:18 pm - Deadlock

𝕴𝖓𝖉𝖚:
15/01/24, 9:24 pm - Conflict and view serializability

𝕴𝖓𝖉𝖚:
15/01/24, 9:48 pm - Dbms structure

𝕴𝖓𝖉𝖚:
17/01/24, 9:10 am - <Media omitted>

𝕴𝖓𝖉𝖚:
17/01/24, 9:11 am - <Media omitted>

𝕴𝖓𝖉𝖚:
17/01/24, 9:11 am - <Media omitted>

𝕴𝖓𝖉𝖚:
17/01/24, 9:11 am - <Media omitted>

𝕴𝖓𝖉𝖚:
17/01/24, 9:11 am - <Media omitted>

𝕴𝖓𝖉𝖚:
17/01/24, 9:11 am - <Media omitted>

𝕴𝖓𝖉𝖚:
17/01/24, 9:11 am - <Media omitted>

𝕴𝖓𝖉𝖚:
17/01/24, 9:11 am - <Media omitted>

𝕴𝖓𝖉𝖚:
17/01/24, 9:16 am - <Media omitted>

𝕴𝖓𝖉𝖚:
17/01/24, 9:17 am - <Media omitted>
17/01/24, 9:18 am - <Media omitted>
04/02/24, 9:36 pm - 𝕴𝖓𝖉𝖚: https://youtube.com/shorts/rUeJEFW9vQc?si=HUX14QknCFT-

26/02/24, 8:16 am - 𝕴𝖓𝖉𝖚: <Media omitted>

ToKM

27/02/24, 9:05 am - 𝕴𝖓𝖉𝖚: <Media omitted>

28/02/24, 7:59 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
29/02/24, 7:20 am - 𝕴𝖓𝖉𝖚: <Media omitted>
29/02/24, 9:18 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
29/02/24, 9:21 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
29/02/24, 10:34 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
29/02/24, 10:42 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
01/03/24, 8:18 am - 𝕴𝖓𝖉𝖚: <Media omitted>
01/03/24, 8:18 am - 𝕴𝖓𝖉𝖚: <Media omitted>
03/03/24, 1:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
03/03/24, 1:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
03/03/24, 1:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
04/03/24, 9:56 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 9:00 am - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/03/24, 3:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
07/03/24, 9:00 am - 𝕴𝖓𝖉𝖚: <Media omitted>
07/03/24, 9:24 am - 𝕴𝖓𝖉𝖚: <Media omitted>
10/03/24, 5:22 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
10/03/24, 5:22 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
11/03/24, 2:45 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
11/03/24, 2:46 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
11/03/24, 3:00 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 10:10 am - 𝕴𝖓𝖉𝖚:
https://drive.google.com/drive/folders/1356Ws8zVF4jPyG75pxsH3UjI1ZhNa3TC?

12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

usp=sharing

12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/03/24, 2:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
16/03/24, 1:38 pm - 𝕴𝖓𝖉𝖚: 1272
19/03/24, 8:19 am - 𝕴𝖓𝖉𝖚: <Media omitted>
20/03/24, 12:38 am - 𝕴𝖓𝖉𝖚: def dfs(graph, start):
visited, stack = set(), [start]
 while stack:
vertex = stack.pop()
if vertex not in visited:
visited.add(vertex)
stack.extend(graph[vertex] - visited)

20/03/24, 12:39 am - 𝕴𝖓𝖉𝖚: from collections import deque

return visited

def bfs(graph, start):

visited, queue = set(), deque([start])
while queue:
vertex = queue.popleft()
if vertex not in visited:
visited.add(vertex)
queue.extend(graph[vertex] - visited)

20/03/24, 11:16 pm - 𝕴𝖓𝖉𝖚: Generator and normal function

return visited

20/03/24, 11:17 pm - 𝕴𝖓𝖉𝖚: Important points of generator

20/03/24, 11:22 pm - 𝕴𝖓𝖉𝖚: Set and frozen set
20/03/24, 11:22 pm - 𝕴𝖓𝖉𝖚: Regular expression
24/03/24, 10:18 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
30/03/24, 8:29 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
02/04/24, 8:04 pm - 𝕴𝖓𝖉𝖚: ChatGPT 3.5

User
The objective of our project is to provide biometric security through fingerprint
authentication in ATM application.
The fingerprint is a person’s most unique physical characteristic.
fingerprint based ATM is a desktop application where fingerprint of the user is
used as a authentication. The fingerprint minutiae feature are different for each
human being so the user can be identified uniquely. Instead of using ATM card
fringerprint based ATM is safer and secure. There is no worry of losing ATM card
and no need to carry ATM card in your wallet.you just have to use your fingerprint
in order to do any banking transaction. The user has no login using his
fingerprint and he has to entr the pin code in order to do further transaction.
The user can withdraw money from his account.useer can transfer money to various
accounts by mentioning account number. In order to withdraw money user has to enter
the amount he want to withdraw. The user must have appropriate balance in his ATM
account to do transaction. User can view the balance available in his
respectiveaccount.
Under biometrics, we've got iris recognition, face recognition, and fingerprint
recognition. By using these techniques, your account will be easily accessible and
no one will be able to withdraw your funds illegally. This is designed to provide
better security for ATMs.

The ATM system encompasses various GUI menus including the SENSOR, to provide high
security. It peovides secure access to the accountof a customer. The ATM must be
able to provide the following services to the customer:
ENTER PIN : a customer is allowed to enter the pin code for his/her account.
CHANGE PIN: a customer must be able to change the pin linkedto the card.
ENROLL FINGER: a customer is allowed to enrol the fingerprint impression which has
been used to provide security to the account
CHANGE FINGERPRINT: a customer is allowed to change the fingerprint impression.
ENTER EMAIL: a customer is required to provide a valid email address through out
the use of his/her account.
CHANGE EMAIL: a customer or user can also change the registered email from his/her
account that is also sync with the generated messages.
Functional requirements:
Facility of aborting transaction: a customer must be able to abort a transaction in
progress by pressing the cancel key instead if responding to a request from the
machine.
Email code format: the email provided should be of proper format and contain @
symbol
Facility of email reentering : if the customer email is invalid , the customer will
be required to re-enter the email information before a specific transaction can be
proceeded.
Register finger: put your finger on top of the device and allow itto record the
fingerprint.
Facility of reentering the finger: if the clints fingerprint is inacceptable the
customer will be essential to re-enroll the impression before an operation can
proceed.
Denial of specific services, if email goes wrong: if the customer is unable to
successfully enter the email address the service would be denied for the particular
users.
PIN CODE FORMAT: Pin should be of exactly 4 digit.
Non functional requirements:
Scope: the scope of this project is to allow the user to get secure transaction
and account access with the best scope of security transactions out there.
Functionality: the system include multiple functionality with access to deposited
amount withdrawn , transferred,receipt is generated and user has complete access to
his/her account with some limitations.
Usability: the web portal or interface is independent of the users skills. Non-
technical users are also able to use the system with ease. The interface follows
all the basic principles of Human Computer Interaction.
Reliability: the system is reliable to not make any human errors with lag and
error debug compatibility. The system shows confirmation of reliable use and
information tracking.
Security: the fingerprint provided by the user to the system requires complete
security and all information for these expense and purpose is secured with end-to-
end encryption system.
Hardware requirement:
1. Fingerprint Scanner: This is the primary hardware component responsible for
capturing the fingerprint image. It should be a high-quality scanner capable of
accurate fingerprint recognition.
2. Processor and Memory: A robust processor and sufficient memory are necessary
for storing and processing fingerprint data securely. This includes comparing
captured fingerprint images with stored templates for authentication.
3. Display Screen: An interactive display screen is essential for guiding users
through the authentication process and displaying transaction information.
4. Card Reader: While fingerprint authentication may replace traditional PIN-
based authentication, some implementations may still require a card reader for
additional security or compatibility with existing systems.
5. Keypad or Touchscreen: A keypad or touchscreen interface may be needed for
users to input additional information, such as account numbers or transaction
amounts.
6. Network Connectivity: The ATM machine should be equipped with network
connectivity (Ethernet or wireless) for communication with the banking system to
verify user identity and process transactions securely.
7. Enclosure and Security Features: The ATM machine should be housed in a secure
enclosure to protect it from tampering and unauthorized access. Security features
such as locks, alarms, and surveillance cameras may also be incorporated for added
protection.
8. Power Supply: A reliable power supply is essential to ensure uninterrupted
operation of the ATM machine. This may include a backup power source such as a
battery or generator in case of power outages.
9. Printer: Optionally, an integrated printer can be included for printing
transaction receipts for users.
10. Biometric Template Storage: Secure storage for biometric templates is
necessary to store and manage fingerprint data securely. This may involve encrypted
storage and stringent access controls to protect sensitive information.
11. Anti-Spoofing Measures: Depending on the level of security required,
additional hardware such as liveness detection sensors may be incorporated to
prevent spoofing attacks.
12. Accessibility Features: Consideration should be given to accessibility
features such as audio instructions and tactile feedback for visually impaired
users

Soft ware requirements:

1. Fingerprint Recognition Algorithm: This software module is responsible for
capturing, processing, and comparing fingerprint images to authenticate users. It
should include robust algorithms for fingerprint feature extraction and matching
against stored templates.
2. User Interface (UI) Software: The UI software provides the interface through
which users interact with the ATM machine. It should guide users through the
authentication process, transaction selection, and receipt printing (if
applicable). The UI should be intuitive, easy to navigate, and accessible to users
with different levels of technical proficiency.
3. Transaction Processing Software: This software component handles the
processing of ATM transactions, including balance inquiries, cash withdrawals, fund
transfers, and account deposits. It communicates with the banking system or a
transaction processing network to authorize and complete transactions securely.
4. Database Management System (DBMS): A DBMS is required to store and manage
user data, including fingerprint templates, account information, transaction logs,
and audit trails. The DBMS should provide robust security features to protect
sensitive information from unauthorized access or tampering.
5. Encryption and Security Software: Strong encryption algorithms and security
protocols are essential to protect sensitive data transmitted between the ATM
machine and the banking system. This includes encrypting communication channels,
securing stored data, and implementing authentication mechanisms to prevent
unauthorized access.
6. Biometric Template Management Software: This software module manages the
storage, retrieval, and updating of biometric templates (fingerprint images)
associated with user accounts. It should include features for template enrollment,
verification, and revocation, while ensuring compliance with privacy regulations
and data protection standards.
7. Transaction Logging and Auditing Software: To maintain accountability and
traceability, the ATM system should log all transaction activities, including user
authentication attempts, transaction requests, and system events. Audit logs should
be securely stored and accessible for monitoring, analysis, and compliance
purposes.
8. Error Handling and Recovery Software: Robust error handling mechanisms should
be implemented to detect and recover from errors or anomalies during system
operation. This includes handling communication failures, hardware malfunctions,
and software glitches to ensure uninterrupted service availability.
9. Maintenance and Diagnostics Software: Software tools for system maintenance,
diagnostics, and remote monitoring are necessary for managing and troubleshooting
ATM deployments efficiently. These tools help identify and resolve issues
proactively, minimizing downtime and ensuring optimal system performance.
10. Integration Interfaces: APIs (Application Programming Interfaces) or
integration frameworks may be needed to facilitate integration with external
systems, such as banking core systems, authentication servers, and fraud detection
systems.
11. Software Updates and Patch Management: A mechanism for deploying software
updates, patches, and security fixes is essential to address vulnerabilities and
ensure the ATM system remains secure and up-to-date.
Features table for admin and user:
Admin User
• Biometric authentication
• User enrolment
• Transaction logging
• Account management
• Transaction limits
• Receipt printing • Biometric authentication
• Transaction logging
• Security measures
• User interface
• Emergency access

I want like this fir library management in sort

4 / 4

ChatGPT
For a library management system using biometric security, here's a condensed
version:

Objective: Implement biometric security using fingerprint authentication for

library access and transactions.

Key Features:

Biometric Authentication: Users can access library services and resources using
their fingerprint.
User Enrollment: New users can enroll their fingerprint to create a library
account.
Transaction Logging: All library transactions are logged for accountability and
auditing purposes.
Account Management: Admins can manage user accounts, including adding, modifying,
and deleting accounts.
Transaction Limits: Set transaction limits for users to regulate borrowing and
returning items.
Receipt Printing: Generate receipts for borrowed items or other library
transactions.
Functional Requirements:

User authentication via fingerprint.

New user registration and fingerprint enrollment.
Logging of borrowing, returning, and other transactions.
Admin capabilities for managing user accounts and transaction limits.
Receipt generation for transactions.
Non-functional Requirements:

Security: Ensure secure storage and transmission of biometric data.

Reliability: System should operate without errors and downtime.
Usability: User-friendly interface for both technical and non-technical users.
Scalability: Ability to handle a large number of users and transactions.
Performance: Fast response times for authentication and transaction processing.
Hardware Requirements:

Fingerprint scanner for capturing biometric data.

Processor and memory for processing fingerprint images and transaction data.
Display screen for user interaction.
Network connectivity for communication with the library system.
Enclosure and security features for physical protection.
Software Requirements:

Fingerprint recognition algorithm for authentication.

User interface software for interaction with users.
Transaction processing software for handling library transactions.
Database management system for storing user data and transaction logs.
Encryption and security software for protecting sensitive data.

03/04/24, 7:49 am - 𝕴𝖓𝖉𝖚: <Media omitted>

Error handling and recovery software for system reliability.

03/04/24, 7:49 am - 𝕴𝖓𝖉𝖚: <Media omitted>

03/04/24, 7:49 am - 𝕴𝖓𝖉𝖚: <Media omitted>
03/04/24, 7:50 am - 𝕴𝖓𝖉𝖚: <Media omitted>
03/04/24, 7:50 am - 𝕴𝖓𝖉𝖚: <Media omitted>
03/04/24, 7:50 am - 𝕴𝖓𝖉𝖚: <Media omitted>
03/04/24, 7:51 am - 𝕴𝖓𝖉𝖚: <Media omitted>
04/04/24, 12:57 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
04/04/24, 1:15 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
04/04/24, 10:29 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/04/24, 6:34 am - 𝕴𝖓𝖉𝖚: <Media omitted>
05/04/24, 6:35 am - 𝕴𝖓𝖉𝖚: <Media omitted>
05/04/24, 8:04 am - 𝕴𝖓𝖉𝖚: <Media omitted>
05/04/24, 6:54 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/04/24, 6:57 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/04/24, 7:00 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
06/04/24, 11:00 pm - 𝕴𝖓𝖉𝖚: You deleted this message
06/04/24, 11:09 pm - 𝕴𝖓𝖉𝖚: You deleted this message
06/04/24, 11:12 pm - 𝕴𝖓𝖉𝖚: You deleted this message
07/04/24, 5:14 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
07/04/24, 5:27 pm - 𝕴𝖓𝖉𝖚: You deleted this message
07/04/24, 5:50 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
10/04/24, 5:54 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
10/04/24, 5:54 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
10/04/24, 10:12 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
12/04/24, 8:03 am - 𝕴𝖓𝖉𝖚: <Media omitted>
12/04/24, 8:03 am - 𝕴𝖓𝖉𝖚: <Media omitted>
13/04/24, 5:34 pm - 𝕴𝖓𝖉𝖚: You deleted this message
13/04/24, 6:31 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
13/04/24, 6:32 pm - 𝕴𝖓𝖉𝖚: You deleted this message
13/04/24, 6:42 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
13/04/24, 7:13 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
13/04/24, 7:14 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
13/04/24, 8:53 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
13/04/24, 8:54 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
16/04/24, 7:07 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
16/04/24, 7:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
16/04/24, 7:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
18/04/24, 10:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
21/04/24, 2:18 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
21/04/24, 2:19 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
21/04/24, 2:25 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
22/04/24, 9:16 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
22/04/24, 9:16 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
22/04/24, 9:16 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
23/04/24, 8:44 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
23/04/24, 10:54 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/24, 8:08 am - 𝕴𝖓𝖉𝖚: <Media omitted>
24/04/24, 8:08 am - 𝕴𝖓𝖉𝖚: <Media omitted>
28/04/24, 5:20 pm - 𝕴𝖓𝖉𝖚: 2og chaval,2kg chini, 500gm kheer के chaval ,500gm Daal
12/05/24, 9:59 pm - 𝕴𝖓𝖉𝖚: https://youtube.com/shorts/8JQhb9jDWYc?

14/05/24, 7:08 am - 𝕴𝖓𝖉𝖚: <Media omitted>

si=lXNB6E6xphEMwsjr

14/05/24, 7:57 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

16/05/24, 10:47 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
16/05/24, 10:47 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
17/05/24, 8:32 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 8:40 am - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 5:04 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 5:05 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 5:48 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 5:52 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 5:54 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 6:08 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 8:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 8:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 8:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 10:03 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/05/24, 10:03 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
21/05/24, 8:21 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
21/05/24, 9:41 pm - 𝕴𝖓𝖉𝖚: You deleted this message
21/05/24, 9:41 pm - 𝕴𝖓𝖉𝖚: You deleted this message
21/05/24, 9:42 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
21/05/24, 9:46 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
21/05/24, 9:49 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
21/05/24, 9:54 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
21/05/24, 10:02 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
22/05/24, 12:26 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
22/05/24, 12:27 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
22/05/24, 12:36 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
22/05/24, 12:46 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/05/24, 10:26 am - 𝕴𝖓𝖉𝖚: Macroni ,noodles ,soya sauce, tomato sauce ,vinegar
24/05/24, 10:26 am - 𝕴𝖓𝖉𝖚: Moong ki daal
24/05/24, 10:29 am - 𝕴𝖓𝖉𝖚: Eno
24/05/24, 10:35 am - 𝕴𝖓𝖉𝖚: Amul butter
24/05/24, 10:35 am - 𝕴𝖓𝖉𝖚: Bread
24/05/24, 10:38 am - 𝕴𝖓𝖉𝖚: Milk bikis biscuit
29/05/24, 2:09 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
29/05/24, 2:10 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
29/05/24, 8:56 pm - 𝕴𝖓𝖉𝖚:
https://drive.google.com/drive/folders/1356Ws8zVF4jPyG75pxsH3UjI1ZhNa3TC?

29/05/24, 10:48 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

usp=sharing

30/05/24, 8:02 am - 𝕴𝖓𝖉𝖚: <Media omitted>

03/06/24, 8:33 pm - 𝕴𝖓𝖉𝖚: Cocomo model
Testing alpha beta
Black box and white box
Rad model imp
Coupling cohesion
Daigram

05/06/24, 8:41 am - 𝕴𝖓𝖉𝖚: <Media omitted>

cyclometic complexity

05/06/24, 8:42 am - 𝕴𝖓𝖉𝖚: <Media omitted>

05/06/24, 8:43 am - 𝕴𝖓𝖉𝖚: <Media omitted>
05/06/24, 8:43 am - 𝕴𝖓𝖉𝖚: <Media omitted>
05/06/24, 8:43 am - 𝕴𝖓𝖉𝖚: <Media omitted>
05/06/24, 10:55 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/06/24, 10:55 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/06/24, 10:55 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/06/24, 10:55 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
05/06/24, 10:55 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/06/24, 10:47 am - 𝕴𝖓𝖉𝖚: import threading
import time

def print_hello():
for i in range(5):
time.sleep(1)
print("Hello")

def print_world():
for i in range(5):
time.sleep(1)
print("World")

# Create threads
thread1 = threading.Thread(target=print_hello)
thread2 = threading.Thread(target=print_world)

# Start threads
thread1.start()

24/06/24, 10:19 am - 𝕴𝖓𝖉𝖚:

thread2.start()

25/06/24, 5:37 pm - 𝕴𝖓𝖉𝖚: [email protected]

https://www.mygreatlearning.com/academy/courses/11607618/13680

25/06/24, 5:37 pm - 𝕴𝖓𝖉𝖚: Dsni2005

25/06/24, 5:37 pm - 𝕴𝖓𝖉𝖚: Udemy password:Udemy2005
29/06/24, 12:17 am - 𝕴𝖓𝖉𝖚: <Media omitted>
29/06/24, 12:17 am - 𝕴𝖓𝖉𝖚: <Media omitted>
29/06/24, 12:19 am - 𝕴𝖓𝖉𝖚: <Media omitted>
29/06/24, 12:38 am - 𝕴𝖓𝖉𝖚: <Media omitted>
29/06/24, 11:28 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
30/06/24, 11:30 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
01/07/24, 1:16 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
06/08/24, 7:37 pm - 𝕴𝖓𝖉𝖚:
https://www.instagram.com/stories/indu_jeph/3428539600876931322?

14/08/24, 7:10 am - 𝕴𝖓𝖉𝖚: Hh

utm_source=ig_story_item_share&igsh=MTNrcW9ucmp4djB1aw==

17/08/24, 7:49 am - 𝕴𝖓𝖉𝖚: https://[email protected]?id=21723861193286

17/08/24, 7:50 am - 𝕴𝖓𝖉𝖚: https://[email protected]?id=21723861250712
17/08/24, 7:51 am - 𝕴𝖓𝖉𝖚: https://[email protected]?id=21723861262862
17/08/24, 7:51 am - 𝕴𝖓𝖉𝖚: https://[email protected]?id=21723861272011
17/08/24, 7:51 am - 𝕴𝖓𝖉𝖚: https://[email protected]?id=21723861281388
17/08/24, 7:51 am - 𝕴𝖓𝖉𝖚: https://[email protected]?id=21723861291036
17/08/24, 7:51 am - 𝕴𝖓𝖉𝖚: https://[email protected]?id=21723861309056
17/08/24, 7:52 am - 𝕴𝖓𝖉𝖚: https://[email protected]?id=21723861317547
17/08/24, 7:52 am - 𝕴𝖓𝖉𝖚: https://[email protected]?id=21723861327129
21/08/24, 9:12 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
23/08/24, 9:39 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/08/24, 1:20 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/08/24, 1:21 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
25/08/24, 6:11 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
25/08/24, 6:19 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
26/08/24, 4:43 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
26/08/24, 5:03 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
26/08/24, 5:03 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
26/08/24, 5:04 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
26/08/24, 5:05 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
26/08/24, 5:05 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
26/08/24, 5:06 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/08/24, 6:55 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
27/08/24, 7:04 pm - 𝕴𝖓𝖉𝖚:

28/08/24, 6:40 am - 𝕴𝖓𝖉𝖚: <Media omitted>

https://courses.cognitiveclass.al/certificates/5df30fde36ae488fb1a92feaeca30503

08/09/24, 10:07 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

09/09/24, 11:20 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/09/24, 11:20 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/09/24, 11:21 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/09/24, 11:21 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/09/24, 11:21 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/09/24, 11:21 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/09/24, 11:21 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/09/24, 11:21 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/09/24, 11:21 am - 𝕴𝖓𝖉𝖚: <Media omitted>
09/09/24, 11:23 am - 𝕴𝖓𝖉𝖚: <Media omitted>
12/09/24, 1:26 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
13/09/24, 11:03 am - 𝕴𝖓𝖉𝖚: 2023.3.6.exe
13/09/24, 6:30 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
16/09/24, 7:54 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
16/09/24, 8:42 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
18/09/24, 10:41 am - 𝕴𝖓𝖉𝖚: <Media omitted>
18/09/24, 11:25 am - 𝕴𝖓𝖉𝖚: <Media omitted>
18/09/24, 7:12 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
18/09/24, 10:57 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
20/09/24, 9:37 am - 𝕴𝖓𝖉𝖚: https://youtu.be/4LX64MDPikc?si=G_rGeQIsdvxvvmcU
22/09/24, 6:55 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
22/09/24, 6:55 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
22/09/24, 6:57 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/09/24, 5:34 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/09/24, 5:34 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/09/24, 5:34 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
24/09/24, 11:16 pm - 𝕴𝖓𝖉𝖚: <Media omitted>
25/09/24, 8:07 am - 𝕴𝖓𝖉𝖚: <Media omitted>
25/09/24, 12:16 pm - 𝕴𝖓𝖉𝖚: def stuff(flag, esc, data):
stuffed = flag
for byte in data:
if byte == flag or byte == esc:
stuffed += esc + byte
else:
stuffed += byte
stuffed += flag
return stuffed
def destuff(flag, esc, stuffed_data):
destuffed = ""
i = 1 # Skip the initial flag
while i < len(stuffed_data) - 1: # Skip the final flag
if stuffed_data[i] == esc:
i += 1
destuffed += stuffed_data[i]
else:
destuffed += stuffed_data[i]
i += 1
return destuffed print("Byte Stuffing")
flag = input("Enter Flag: ")
esc = input("Enter Esc: ")
data = input("Enter Data: ")
print("Original Data: ", data)
stuffed_data = stuff(flag, esc, data)
print("Stuffed Data:", stuffed_data)
destuffed_data = destuff(flag, esc, stuffed_data)

30/09/24, 12:01 pm - 𝕴𝖓𝖉𝖚: <Media omitted>

print("Destuffed Data:", destuffed_data)

30/09/24, 6:30 pm - 𝕴𝖓𝖉𝖚: <Media omitted>