Scribd
Upload
29 views2 pages

Problem Solving Syllabus

The document outlines a syllabus for a course on Problem Solving Techniques, detailing objectives and topics covered across five units. Key areas include algorithms, fundamental problem-solving strategies, factoring methods, array techniques, and text processing. The course aims to provide a systematic approach to problem-solving and efficient methods for various computational tasks.

Uploaded by

n37142693
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
29 views2 pages

Problem Solving Syllabus

The document outlines a syllabus for a course on Problem Solving Techniques, detailing objectives and topics covered across five units. Key areas include algorithms, fundamental problem-solving strategies, factoring methods, array techniques, and text processing. The course aims to provide a systematic approach to problem-solving and efficient methods for various computational tasks.

Uploaded by

n37142693
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

PROBLEM SOLVING SYLLABUS

Subject Subject Name L T P S Marks

Inst. Hours
Code

Category

Credits

External

Total
CIA
23BIT2S2
PROBLEM SOLVING Specific
Y - - - 2 2 25 75 100
TECHNIQUES Elective
Course Objective
C1 Understand the systematic approach to problem solving.

C2 Know the approach and algorithms to solve specific fundamental problems.

C3 Understand the efficient approach to solve specific factoring-related problems.

C4 Understand the efficient array-related techniques to solve specific problems.


Understand the efficient methods to solve specific problems related to text processing.
C5
Understand how recursion works.
Details No. of
Hours
UNIT I Introduction: Notion of algorithms and programs – Requirements for 6
solving problems by computer – The problem-solving aspect: Problem
definition phase, Getting started on a problem, The use of specific
examples, Similarities among problems, Working backwards from the
solution – General problem-solving strategies - Problem solving using top-
down design – Implementation of algorithms – The concept of Recursion.
UNIT II Fundamental Algorithms: Exchanging the values of two variables – 6
Counting - Summation of a set of numbers - Factorial computation - Sine
function computation - Fibonacci Series generation - Reversing the digits
of an integer – Base Conversion.
UNIT III Factoring Methods: Finding the square root of a number – The smallest 6
divisor of an integer – 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 largepower –
Computing the nth Fibonacci number.
UNIT IV Array Techniques: Array order reversal – Array counting or histograming 6
– Finding the maximum number in a set - Removal ofduplicates from an
ordered array - Partitioning an array – Finding the kth smallest element –
Longest monotone subsequence.
UNIT V Text Processing and Pattern Searching: Text line length adjustment – 6
Left and right justification of text – Keyword searching in text – Text line
editing – Linear pattern search.
Recursive algorithms: Towers of Hanoi – Permutation generation.
Total 30

You might also like