Beruflich Dokumente
Kultur Dokumente
1. Faculty Information
2. Course Overview
This course aims at teaching students to approach problem solving in an organized manner.
It imparts the ability to interpret a particular situation/problem and plan its solution in a systematic
and logical manner.
It emphasizes on developing the ability to formulate solutions by logically deriving unambiguous
step by step instructions to perform tasks.
It trains the students to apply modular approach to solutions by applying abstraction and
decomposition.
3. Course Syllabus
Unit 1
Basics: Introduction, Information and data, Data encoding. Logic: Boolean logic, Applications of
propositional logic.
Unit 2
Problem Solving and Algorithmic Thinking: Problem definition, Logical reasoning, Problem
decomposition, Abstraction. Algorithmic thinking: Flowcharting, Name binding, Selection,
Repetition, Modularization. Data organization: List and Arrays. Simple algorithms, comparison of
performance of algorithms.
1|5
Unit 3
Problem Solving Techniques: Factoring and Recursion Techniques, Search and Sort techniques,
Greedy Techniques, Divide and Conquer, Text processing and Pattern matching.
TEXT BOOKS:
1. David Riley and Kenny Hunt , Computational thinking for modern solver, Chapman &
Hall/CRC, 2014
2. R.G. Dromey , “How to solve it by Computer”, PHI, 2008
CO2: Design algorithms and implement solutions for scenarios and problems
CO4: Analyse algorithmic building blocks, trace algorithm flow for states of computation and
analyse techniques and strategies
5. Lecture Plan
36-37 Factoring and Recursion Factoring, Learn to express tasks CO-4 PO-3,5,9
Techniques Recursion, Base recursively.
case, Recursive Understand basic forms
step, Stopping of recursion.
condition
38-41 Searching and sorting Search key, Linear
Understand how CO-4 PO-3,5,9
search, Binarysearching is performed
search, Data using the intuitive
decomposition,linear search technique.
Select and Swap,
Understand how
Selection sort,
halving the population
Bubble sort enables efficient
searching.
Observe the use of data
decomposition in the
two search techniques.
Note the need for re-
arrangement of a
collection of data.
Learn selection and
bubble sorting
technique.
42 MOCK TEST-III
ENDSEMESTER EXAM
4|5
5. Evaluation and Grading
6. Continuous Evaluation
CO – PO Affinity Map
5|5