PROGRAMMING FOR PROBLEM SOLVING

I Year I- Sem.,

Course Title: Programming For Problem Solving Course Code: AS25-05ES03

Teaching Scheme (L: T:P): 3:0:0 Credits: 3
Type of Course: Lecture Total Contact Periods: 48 Hrs
Continuous Internal Evaluation: 40 Marks Semester End Exam: 60 Marks

Course Objectives:
Introduce the importance of programming, C language constructs, and program development,
data structures, searching, and sorting to enhance problem-solving skills.

Course Outcomes:

C113.1 Write C programs using variables, data types, expressions, control structures, and loops
C113.2 Use functions, pointers, and modular programming to develop structured programs.
C113.3 Work with arrays, strings, and related library functions for data processing.
C113.4 Apply recursion, structures, unions, and file handling to solve problems.
C113.5 Use searching, sorting, linked lists, and stacks.

UNIT - I:
Overview of C: C Language Elements, Variable Declarations and Data Types, Executable Statements,
General Form of a C Program, Arithmetic Expressions, Formatting Numbers in Program Output.
Selection Structures: Control Structures, Conditions, if Statement, if Statements with Compound
Statements, Decision Steps in Algorithms.
Repetition and Loop Statements: Repetition in Programs, Counting Loops and the while Statement,
Computing a Sum or Product in a Loop, for Statement, Conditional Loops, Loop Design, Nested Loops,
do-while Statement.

UNIT - II:
Top-Down Design with Functions: Building Programs from Existing Information, Library Functions, Top-
Down Design and Structure Charts, Functions without Arguments, Functions with Input Arguments.
Pointers and Modular Programming: Pointers and the Indirection Operator, Functions with Output
Parameters, Multiple Calls to a Function with Input/output Parameters, Scope of Names, Formal Output
Parameters as Actual Arguments.

UNIT - III:
Arrays: Declaring and Referencing Arrays, Array Subscripts, Using for Loops for Sequential Access,
Using Array Elements as Function Arguments, Array Arguments, Searching and Sorting an Array,
Parallel Arrays and Enumerated Types, Multidimensional Arrays.
Strings: String Basics, String Library Functions: Assignment and Substrings, Longer Strings:
Concatenation and Whole-Line Input, String Comparison, Arrays of Pointers.

UNIT - IV:
Recursion: The Nature of Recursion, Tracing a Recursive Function, Recursive Mathematical Functions,
Recursive Functions with Array and String Parameters
Structure and Union Types: User-Defined Structure Types, Structure Type Data as Input and
Output Parameters, Functions with Structured Result Values, Union Types.
Text and Binary File Pointers: Input/ Output Files - Review and Further Study, Binary Files,
Searching a Database.
UNIT - V:
Searching and Sorting: Basic searching in an array of elements (linear and binary search
techniques), Basic algorithms to sort array of elements (Bubble, Insertion and Selection sort
algorithms).
Introduction to Data Structures: Basic Terminology, Classification of Data Structures, Linear
list – Introduction, singly linked list, Stack- Operations, Queue- Operations.

TEXT BOOKS:
1. Jeri R. Hanly and Elliot B. Koffman, Problem solving and Program Design in C 7th Edition,
Pearson.
2. B.A. Forouzan and R.F. Gilberg C Programming and Data Structures, Cengage Learning, (3rd
Edition).
3. Data Structures: A Pseudocode Approach with C, 2 nd Edition, R. F. Gilberg and B.A.Forouzan,
Cengage Learning

REFERENCE BOOKS:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of
India.
2. E. Balagurusamy, Computer fundamentals and C, 2nd Edition, McGraw-Hill.
3. Yashavant Kanetkar, Let Us C, 18th Edition, BPB.
4. R.G. Dromey, How to solve it by Computer, Pearson (16th Impression).
5. Programming in C, Stephen G. Kochan, Fourth Edition, Pearson Education.
6. Herbert Schildt, C: The Complete Reference, Mc Graw Hill, 4th Edition.
7. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill.
 DEPARTMENT OF FRESHMEN ENGINEERING
Name of the Faculty: Mr. CH V GANESH Class: I - I SEM
Course Name: PROGRAMMING FOR PROBLEM SOLVING Course Code: AS25-05ES03
Academic Year: 2025-26 Section: ECE

LESSON PLAN

Unit Lecture Teaching

Topic name Sessions
Number No Aid
Introduction to C language, importance of PPT/CBT
1 L1 1
programming
C language elements, variable declarations, data PPT/CBT
1 L2 1
types
Executable statements, general form of a C PPT/CBT
1 L3 1
program
Arithmetic expressions & formatting program PPT/CBT
1 L4 1
output
Control structures: if statement, compound PPT/CBT
1 L5 1
statements
1 L6 if-else, nested if, else-if ladder, decision making 1 PPT/CBT
1 L7 Loops – while, for, do-while 1 PPT/CBT
1 L8 Loop design – sum/product, counting loops 1 PPT/CBT
1 L9 Nested loops & conditional loops 1 PPT/CBT
Practical demo: Loop-based problem solving (sum Lab Demo
1 L10 1
of series, prime check, factorial)
1 L11 Debugging & error handling in C programs 1 CBT
1 L12 Revision + Quiz 1 Quiz/Viva
2 L13 Top-down design, library functions, structure charts 1 PPT
2 L14 Functions – definition, declaration, prototypes 1 PPT/CBT
2 L15 Functions without arguments, with input arguments 1 PPT/CBT
2 L16 Return statement, multiple arguments 1 PPT/CBT
2 L17 Pointers – basics, indirection operator 1 PPT/CBT
Functions with output parameters (call by PPT/CBT
2 L18 1
value/reference)
2 L19 Scope of variables, storage classes 1 PPT/CBT
2 L20 Pointers with functions (input/output parameters) 1 PPT/CBT
2 L21 Modular programming with functions & pointers 1 PPT/CBT
Practical demo: Functions & pointers in problem Lab Demo
2 L22 1
solving
2 L23 Advanced problems on recursion vs iteration 1 Whiteboard
2 L24 Revision + Quiz 1 Quiz/Viva
Arrays – declaration, accessing elements, PPT/CBT
3 L25 1
subscripts
Using loops for sequential access, arrays as PPT/CBT
3 L26 1
arguments
3 L27 Searching and sorting arrays – intro 1 PPT/CBT
 3 L28 Multi-dimensional arrays, parallel arrays 1 PPT/CBT
3 L29 Strings – declaration & initialization 1 PPT/CBT
3 L30 String input/output, null character 1 PPT/CBT
String handling functions (strlen, strcpy, strcat, PPT/CBT
3 L31 1
strcmp, etc.)
3 L32 Arrays of pointers, pointers to strings 1 PPT/CBT
Advanced string operations (substrings, PPT/CBT
3 L33 1
concatenation, comparison)
Practical demo: String manipulation problems Lab Demo
3 L34 1
(palindrome, word count, substring search)
Case study: Matrix operations using arrays Whiteboard
3 L35 1
(addition, multiplication) /CBT
3 L36 Revision + Quiz 1 Quiz/Viva
4 L37 Recursion – basics, tracing recursive functions 1 PPT/CBT
4 L38 Recursive mathematical functions 1 PPT/CBT
4 L39 Recursion with arrays & strings 1 PPT/CBT
4 L40 Structures – definition, declaration, initialization 1 PPT/CBT
Array of structures, nested structures, pointer to PPT/CBT
4 L41 1
structure
4 L42 Union types, typedef, bit fields 1 PPT/CBT
4 L43 File handling – text files (open, read, write, close) 1 PPT/CBT
4 L44 Binary files, database searching 1 PPT/CBT
Practical demo: Recursive problems (Towers of Lab Demo
4 L45 1
Hanoi, Fibonacci, GCD)
Mini-case study: Student database using structures CBT
4 L46 1
& file handling
Advanced discussion: File handling applications in PPT
4 L47 1
real-world systems
4 L48 Revision + Quiz 1 Quiz/Viva
5 L49 Searching – Linear search algorithm 1 PPT/CBT
5 L50 Binary search algorithm 1 PPT/CBT
5 L51 Bubble sort algorithm 1 PPT/CBT
5 L52 Insertion sort algorithm 1 PPT/CBT
5 L53 Selection sort algorithm 1 PPT/CBT
Data structures basics – terminology & PPT
5 L54 1
classification
5 L55 Singly linked list – introduction, operations 1 PPT/CBT
5 L56 Stack – operations and implementation 1 PPT/CBT
5 L57 Queue – operations and implementation 1 PPT/CBT
Practical demo: Comparing sorting algorithms on Lab Demo
5 L58 1
runtime performance
Problem solving session: Implementing stack & Whiteboard
5 L59 1
queue applications /CBT
5 L60 Revision + Quiz 1 Quiz/Viva

Faculty Sign HoD