The document discusses 10 problem statements related to algorithms and flowcharts. It provides the steps to design algorithms and draw flowcharts to: 1) exchange two values with and without a temporary variable, 2) find the sum of digits in a number, 3) find the sum of integers in an array, 4) count digits in a number, 5) compute factorials, 6) compute sine functions, 7) generate Fibonacci sequences, 8) reverse digits of a number, 9) convert a decimal number to binary, and 10) references used. For each problem, it lists the steps of the algorithm and includes examples.
This presentation is on problem solving & design for students taking computer science [2210]. Unfortunately I can't give the full explanation here. For any suggestions or clarifications, you can mail me on buxooa72@gmail.com.
Slides for a college course at City College San Francisco. Based on "The Shellcoder's Handbook: Discovering and Exploiting Security Holes ", by Chris Anley, John Heasman, Felix Lindner, Gerardo Richarte; ASIN: B004P5O38Q.
Instructor: Sam Bowne
Class website: https://samsclass.info/127/127_F18.shtml
Slides for a college course at City College San Francisco. Based on "The Shellcoder's Handbook: Discovering and Exploiting Security Holes ", by Chris Anley, John Heasman, Felix Lindner, Gerardo Richarte; ASIN: B004P5O38Q.
Instructor: Sam Bowne
Class website: https://samsclass.info/127/127_F18.shtml
This presentation is on problem solving & design for students taking computer science [2210]. Unfortunately I can't give the full explanation here. For any suggestions or clarifications, you can mail me on buxooa72@gmail.com.
Slides for a college course at City College San Francisco. Based on "The Shellcoder's Handbook: Discovering and Exploiting Security Holes ", by Chris Anley, John Heasman, Felix Lindner, Gerardo Richarte; ASIN: B004P5O38Q.
Instructor: Sam Bowne
Class website: https://samsclass.info/127/127_F18.shtml
Slides for a college course at City College San Francisco. Based on "The Shellcoder's Handbook: Discovering and Exploiting Security Holes ", by Chris Anley, John Heasman, Felix Lindner, Gerardo Richarte; ASIN: B004P5O38Q.
Instructor: Sam Bowne
Class website: https://samsclass.info/127/127_F18.shtml
This lecture discusses the concept of Regular Expressions along with its usage in different tools such as grep, sed, and awk
Check the other Lectures and courses in
http://Linux4EnbeddedSystems.com
or Follow our Facebook Group at
- Facebook: @LinuxforEmbeddedSystems
Lecturer Profile:
- https://www.linkedin.com/in/ahmedelarabawy
How Triton can help to reverse virtual machine based software protectionsJonathan Salwan
The first part of the talk is going to be an introduction to the Triton framework to expose its components and to explain how they work together. Then, the second part will include demonstrations on how it's possible to reverse virtual machine based protections using taint analysis, symbolic execution, SMT simplifications and LLVM-IR optimizations.
PHP unserialization vulnerabilities: What are we missing?Sam Thomas
Video at: https://www.youtube.com/watch?v=PqsudKzs79c
An introduction to PHP unserialization vulnerabilities, with some practical tips on methodology. Based around three new exploits for old vulnerabilities (CVE-2011-4962, CVE-2013-1453, CVE-2013-4338).
This lecture discusses the concept of Regular Expressions along with its usage in different tools such as grep, sed, and awk
Check the other Lectures and courses in
http://Linux4EnbeddedSystems.com
or Follow our Facebook Group at
- Facebook: @LinuxforEmbeddedSystems
Lecturer Profile:
- https://www.linkedin.com/in/ahmedelarabawy
How Triton can help to reverse virtual machine based software protectionsJonathan Salwan
The first part of the talk is going to be an introduction to the Triton framework to expose its components and to explain how they work together. Then, the second part will include demonstrations on how it's possible to reverse virtual machine based protections using taint analysis, symbolic execution, SMT simplifications and LLVM-IR optimizations.
PHP unserialization vulnerabilities: What are we missing?Sam Thomas
Video at: https://www.youtube.com/watch?v=PqsudKzs79c
An introduction to PHP unserialization vulnerabilities, with some practical tips on methodology. Based around three new exploits for old vulnerabilities (CVE-2011-4962, CVE-2013-1453, CVE-2013-4338).
Man has hitherto devised several manual methods to solve the problems of multiplying numbers. The
Egyptians and the Russians methods are part of the several ways. In this research some of the old methods of
multiplications were analyzed and some new ones were discovered, developed and formulated by the author.
This paper presents to the world, new manual ways of multiplying numbers.
Image Segmentation
Types of Image Segmentation
Semantic Segmentation
Instance Segmentation
Types of Image Segmentation Techniques based on the image properties:
Threshold Method.
Edge Based Segmentation.
Region-Based Segmentation.
Clustering Based Segmentation.
Watershed Based Method.
Artificial Neural Network Based Segmentation.
Image processing, Noise, Noise Removal filtersKuppusamy P
Basics of images, Digital Images, Noise, Noise Removal filters
Reference:
Richard Szeliski, Computer Vision: Algorithms and Applications, Springer 2010
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptxEduSkills OECD
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
2. Problem Statement 1: Design an algorithm and
draw the flow chart to exchange two values.
• Let’s consider two glasses denoted A and B with 30 ml
mango juice and 50 ml orange juice. Find out the way to
exchange the juice in A and B.
Dr. Kuppusamy P
3. • Declare variables
• Initialize the values
Problem Statement 1: Design an algorithm and
draw the flow chart to exchange two values.
Dr. Kuppusamy P
4. Problem Statement 1: Design an algorithm and
draw the flow chart to exchange two values.
Move Glass A value 30 to Glass
Temp
Move Glass B value 50 to
Glass A
Dr. Kuppusamy P
5. Problem Statement 1: Design an algorithm and
draw the flow chart to exchange two values.
Move Glass Temp value 30 to
Glass B
Dr. Kuppusamy P
6. Problem Statement 1: Design an algorithm and
draw the flow chart to exchange two values.
Algorithm
Step 1. Start
Step 2. Declare two variables A, B and one more variable temp
Step 3. Read the positive numbers to A and B
Step 3. temp ← A
Step 4. A ← B
Step 5. B ← temp
Step 6. Display interchanged numbers in A , B
Step 7. Stop
Dr. Kuppusamy P
7. Problem Statement 1: Design an algorithm and
draw the flow chart to exchange two values.
Algorithm
Step 1. Start
Step 2. Declare two variables A, B and one more variable temp
Step 3. Read the positive numbers to A and B
Step 3. temp ← A
Step 4. A ← B
Step 5. B ← temp
Step 6. Display interchanged numbers in A , B
Step 7. Stop
Read the positive
numbers to A and B
temp ← A
A ← B
B ← temp
Display
interchanged
numbers in A , B
Stop
Start
Declare variables A, B,
temp
Dr. Kuppusamy P
8. Problem Statement 2: Design an algorithm
and draw the flow chart to exchange two
values without using temporary variable.
Algorithm
Step 1. Start
Step 2. Declare two variables A, B
Step 3. Read the positive numbers as A and B
Step 3. A ← A + B
Step 4. B ← A - B
Step 5. A ← A - B
Step 6. Display interchanged numbers in A , B
Step 7. Stop
E.g. A = 7, B= 5
A = 7 + 5 =12
B = 12-5 =7
A= 12 - 7 =5
Dr. Kuppusamy P
9. Problem Statement 2: Design an algorithm
and draw the flow chart to exchange two
values without using temporary variable.
Algorithm
Step 1. Start
Step 2. Declare two variables A, B
Step 3. Read the positive numbers as A and B
Step 3. A ← A + B
Step 4. B ← A - B
Step 5. A ← A - B
Step 6. Display interchanged numbers in A , B
Step 7. Stop
E.g. A = 7, B= 5
A = 7 + 5 =12
B = 12-5 =7
A= 12 - 7 =5
Read the positive
numbers to A and B
A ← A + B
B ← A - B
A ← A - B
Display
interchanged
numbers in A , B
Stop
Start
Declare variables A, B
Dr. Kuppusamy P
10. Problem Statement 3: Design an algorithm and draw
the flow chart to find the sum of individual digits for
the given non negative integer.
Step 1. Start
Step 2. Declare variable n
Step 3. Read non negative integer (n)
Step 4. Initialize result ← 0
Step 5. Repeat until n > 0
Step 5.1 result ← result + (n % 10)
Step 5.2 n ← n / 10
Step 6. Display result
Step 7. Stop
E.g. Iteration: 1
n = 76
result = 0 + (76 % 10)
n = 76/10
Iteration: 2
n = 7
result = 6 + (7 % 10)
n = 7/10
Dr. Kuppusamy P
11. Repeat
Yes No
Problem Statement 3: Design an algorithm and draw
the flow chart to find the sum of individual digits for
the given non negative integer.
Step 1. Start
Step 2. Declare variable n
Step 3. Read non negative integer (n)
Step 4. Initialize result ← 0
Step 5. Repeat until n > 0
Step 5.1 result ← result + (n % 10)
Step 5.2 n ← n / 10
Step 6. Display result
Step 7. Stop
Read the positive
number n
result ← result + (n % 10)
n ← n / 10
Display the result
Stop
Start
Declare variable n
Repeat until n >0
Dr. Kuppusamy P
12. Problem Statement 4: Design an algorithm and draw
the flow chart to find the sum of given set of n positive
integer.
Step 1. Start
Step 2. Declare variables n, sum, a, i
Step 3. Read total numbers value (n) and ‘n’ positive integers in array ‘a’
Step 4. Initialize sum ← 0 , i ← 0
Step 5. Repeat until i < n
Step 5.1 sum ← sum + a[i]
Step 5.2 i ← i + 1
Step 6. Display sum
Step 7. Stop
n = 3
a[] = {2, 3, 4}
sum = 0 , i=0
Iteration: 1
sum = 0 + 2
i = i +1
Iteration: 2
sum = 2 + 3
i = i +1
Iteration: 3
sum = 5 + 4
i = i +1
Dr. Kuppusamy P
13. Problem Statement 4: Design an algorithm and draw
the flow chart to find the sum of given set of n positive
integer.
Step 1. Start
Step 2. Declare variables n, sum, a
Step 3. Read total numbers value (n)
and ‘n’ positive integers in
array ‘a’
Step 4. Initialize sum ← 0, i ← 0,
Step 5. Repeat until i < n
Step 5.1 sum ← sum + a[i]
Step 5.2 i ← i + 1
Step 6. Display sum
Step 7. Stop
Repeat
Yes No
Read total numbers value (n)
and ‘n’ integers in array ‘a’
sum ← sum + a[i]
i ← i + 1
Display the sum
Stop
Start
Declare variable n, sum, a
Repeat until i <n
Dr. Kuppusamy P
14. Problem Statement 5: Design an algorithm and draw
the flow chart to find the number of digits in given
number
Sample Input 1: 4582
Sample Output 1: The number of digits in 4582 is 4
Algorithm
Step 1. Start
Step 2. Declare variables
Step 3. Read the input
Step 4. Initialize count ← 0
Step 4. Repeat until n !=0
Step 5.1 count ← count + 1
Step 5.2 n ← n / 10
Step 6. Display count
Step 7. End
Iteration: 1
count = 0 + 1
n= 4582 /10
Iteration: 2
count = 1 + 1
n= 458 /10
Iteration: 3
count = 2 + 1
n= 45 /10
Iteration: 4
count = 3 + 1
n= 4 /10
Iteration: 5
n != 0 → False
Dr. Kuppusamy P
15. Problem Statement 6: Design an algorithm and draw
the flow chart to find Factorial computation
of given number
Sample Input 1: 4!
Sample Output 1: 24
Step 1. Begin
Step 2. Declare variables
Step 3. Read the decimal number n
Step 4. Initialize fact ← 1, i ← 1
Step 4. if (n != 0)
Step 4.1. Repeat until 1 to n
Step 4.1.1 fact ← fact * i
Step 4.1.2 increment i
Step 5. Display fact
Step 7. End
Iteration: 1
fact = 1 * 1
i = i +1
Iteration: 2
fact = 1 * 2
i = i +1
Iteration: 3
fact = 2 *3
i = i +1
Iteration: 4
fact = 6 * 4
i = i +1
Iteration: 5
i < =n → False
Dr. Kuppusamy P
16. Problem Statement 7: Design an algorithm and draw
the flow chart to find Sine function computation
Step 1. Begin.
Step 2. Read the input x and n
Step 3. Convert x value to radius using rad ← 3.14/180*x.
Step 4. Initialize sum ← rad, sign ← -1.
Step 5. Repeat for i ← 3 to n in increment by 2.
Step 5.1 power ← pow(rad, i).
Step 5.2 factorial ← factorial*(i-1)*i.
Step 5.3 result ← power / factorial.
Step 5.4 sum ← sum + (sign * result).
Step 5.5 k ← k*(-1).
Step 6. Display the sum as sine series result.
Step 7. End.
Dr. Kuppusamy P
Repeat
Yes No
Read the input x and n
power ← pow(rad, i).
factorial ← factorial*(i-1)*i.
result ← power / factorial.
sum ← sum + (sign * result).
k ← k*(-1)
Display the sum
Stop
Start
Declare variable
Repeat until i <n
Initialize sum, sign
17. Problem Statement 8: Design an algorithm and draw
the flow chart to generate Fibonacci sequence
Step 1. Begin
Step 2. Get Non-negative decimal limit n
Step 3. Initialize num1 ← 0, num2 ← 1
Step 4. Display num1 and num2
Step 5. Repeat until 1 to n- 2
Step 5.1 num3 ← num1 + num2
Step 5.2 Display num3
Step 5.3 num1 ← num2
Step 5.4 num2 ← num3
Step 6. End
Dr. Kuppusamy P
Input : 5
Output: 0, 1, 1, 2, 3, 5
18. Problem Statement 9: Design an algorithm and draw
the flow chart to Reverse the digits of an integer
Step 1. Begin
Step 2. Get Non-negative integer num
Step 3. Initialize reversed ← 0
Step 4. Repeat until num > 0
Step 4.1 digit ← n % 10
Step 4.2 reversed ← (reversed * 10) + digit;
Step 4.3 num ← num / 10
Step 5. Display reversed
Step 6. End
Dr. Kuppusamy P
Input : 598
Output: 895
19. Problem Statement 10: Design an algorithm and draw the flow chart to
Decimal to Binary conversion
Step 1. Begin
Step 2. Get a Positive decimal number (n)
Step 3. Initialize result as null
Step 4. if (n > 1)
Step 4.1. Repeat until n < 2
Step 4.1.1 Remainder ← n % 2
Step 4.1.2 Append remainder with result
Step 4.1.3 n ← n / 2
Step 5. Append n with result
Step 6. Display the reverse of result
Step 7. End
Dr. Kuppusamy P
Input : 3
Output: 011
Repeat
Yes No
Read integer n
Remainder ← n % 2
Append remainder with result
n ← n / 2
Append n with result
Display the reverse of
result
Stop
Start
Declare variable
Initialize result as null
Repeat until n<2
20. References
Dr. Kuppusamy P
• Herbert Schildt, “Java: The Complete Reference”, McGraw-Hill Education, Tenth
edition, 2017.
• https://www.sitesbay.com