MCA102 - Problem Solving Techniques |
UNIT I INTRODUCTION TO COMPUTER PROBLEM-SOLVING |
Introduction - The Problem-solving Aspect - Top-down Design-implementation of Algorithms-
Program Verification - The Efficiency of Algorithms. Fundamental Algorithms - Exchanging the
values of Two Variables - Counting - Summation of a set of Numbers - Factorial Computation-Sine
function computation - Generation of the Fibonacci sequence - Reversing the Digits of an Integer -
Base ConversionCharacter to Number Conversion. |
UNIT II FACTORING METHODS |
Finding the square Root of a number - The Smallest Divisor of an Integer - The Greatest Common
Divisor of Two Integers - Generating Prime Numbers - Computing the Prime Factors of an Integer -
Generation of Pseudo - random Numbers - Raising a Number to a Large Power - Computing the nth
Fibonacci Number. |
UNIT IIIARRAY TECHNIQUES |
Array Order Reversal-Array Counting or Histogramming - Finding the Maximum Number in a
Set - Removal of Duplicates from an Ordered Array - Partitioning an Array – Finding the kth
Smallest Element - Longest Monotone Subsequence. |
UNIT IVSORTING AND SEARCHING |
The Two-way Merge - Sorting by Selection - Sorting by Exchange-Sorting by Insertion - Sorting
by Diminishing Increment - Sorting by Partitioning - Binary Search - Hash Searching. |
UNIT VTEXT PROCESSING AND PATTERN SEARCHING |
Text Line Length Adjustment - Left and Right Justification of Text - Keyword Searching in Text-
Text Line editing - Linear Pattern Search - Sub linear Pattern Search. |
Reference Books |
1 R.G.Dromey “ How to Solve it by Computer ”, Pearson Education, India, 2007.
2 Seymour Lipschutz, “Essentials computer Mathematics”, Schaums’ outlines series,
Tata McGrawHill Edition, 2004. |