ISBN- 978-81-932613-3-0
AUTHOR- Prof. Yadav Sangeeta Ramchandra, Prof. Mane Asha C.
| Unit | Contents | No. of Lectures |
| 1 | Introduction: Concept – Problem-Solving, Algorithm, Program Development Cycle, Characteristics of an Algorithm, Time Complexity – Big-Oh Notation, Flowcharts, Simple Examples – Algorithms and Flowcharts. | 5 |
| 2 | Simple Arithmetic Problems: Addition/Multiplication of Integers, Determining if a Number is +ve/–ve/even/odd, Maximum of 2 Numbers, 3 Numbers, Sum of First n Numbers, Given n Numbers, Integer Division, Digit Reversing, Table Generation for n, ab, Factorial, Sine Series, Cosine Series, nCr, Pascal Triangle, Prime Number, Factors of a Number, Other Problems such as Perfect Number, GCD of 2 Numbers, etc. (Write Algorithms and Draw Flowcharts). | 13 |
| 3 | Recursion: Concept, Multiplication, Factorial, Ackerman Function, Fibonacci Series, Permutation Generation. | 8 |
| 4 | Algorithms Using Arrays: Maximum and Minimum of Array, Reversing Elements of an Array, Mean and Median of n Numbers, Row Major and Column Major form of Array Representation, Matrices – Addition, Multiplication, Transpose, Symmetry, Upper/Lower Triangular. | 8 |
| 5 | Sorting and Searching: Insertion Sort, Bubble Sort, Selection Sort, Quick Sort (Recursive), Merge Sort, Radix Sort, Bucket Sort, Counting Sort, Sequential and Binary Search.(Performance Analysis for Space Requirement and Speed using Big-Oh Notation is Essential). | 13 |
Specific References
Your review appreciation cannot be sent
Report comment
Report sent
Your report cannot be sent
Write your review
Review sent
Your review cannot be sent
ISBN- 978-81-932613-3-0
AUTHOR- Prof. Yadav Sangeeta Ramchandra, Prof. Mane Asha C.
check_circle
check_circle