LESSON PLAN
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
B.Tech. Computer Science and Engineering (R25 Regulations)
Subject: Programming for Problem Solving
Subject Code: CS105ES
Regulation: R25
Academic Year: 2025-26
Semester: I Year I Semester
Credits: 3-0-0-3 (L-T-P-C)
Branch: Computer Science and Engineering (CSE-I)
Faculty Name: _________________
Date of Preparation: _________________
COURSE OVERVIEW
Course Objectives
1. To learn the fundamentals of computers
2. To understand the various steps in program development
3. To learn the syntax and semantics of the C programming language
4. To learn the usage of structured programming approaches in solving problems
Course Outcomes
After completion of this course, students will be able to:
1. Write algorithms and to draw flowcharts for solving problems
2. Convert the algorithms/flowcharts to C programs
3. Code and test a given logic in the C programming language
4. Decompose a problem into functions and to develop modular reusable code
5. Use arrays, pointers, strings and structures to write C programs
6. Apply searching and sorting algorithms to solve problems
ACADEMIC CALENDAR (I YEAR I SEMESTER - 2025-26)
Event Duration Dates
Induction Programme 1 Week 11.08.2025 - 18.08.2025
1st Spell of Instructions 9 Weeks 19.08.2025 - 18.10.2025
First Mid Term Examinations 1 Week 21.10.2025 - 27.10.2025
2nd Spell of Instructions 7 Weeks 28.10.2025 - 15.12.2025
Second Mid Term Examinations 1 Week 16.12.2025 - 20.12.2025
Preparation Holidays & Practicals 1 Week 22.12.2025 - 27.12.2025
End Semester Examinations 2 Weeks 29.12.2025 - 09.01.2026
Total Teaching Hours Available: 48 hours (3 hours/week × 16 weeks)
LESSON PLAN DISTRIBUTION
Unit Title Hours Percentage
UNIT-I Overview of C 12 25%
UNIT-II Top-Down Design with Functions and Pointers 10 21%
UNIT-III Arrays and Strings 10 21%
UNIT-IV Recursion and Structures 8 17%
UNIT-V File Handling and Searching/Sorting 8 17%
TOTAL 48 100%
DETAILED LESSON PLAN
UNIT-I: Overview of C (12 Hours)
Week 1-4 (19.08.2025 - 13.09.2025)
Lecture
Date Topics Teaching Methods References
No.
Introduction to Programming,
L1 19.08.2025 Chalk & Talk, PPT T1: Ch.1
Compilers and Compilation Process
C Language Elements, Character Set,
L2 20.08.2025 Chalk & Talk, Examples T1: Ch.2
Keywords, Identifiers
Demonstration, Code
L3 22.08.2025 Variable Declarations and Data Types T1: Ch.2
Examples
Problem Solving,
L4 26.08.2025 Constants, Operators and Expressions T1: Ch.3
Examples
Lecture
Date Topics Teaching Methods References
No.
Executable Statements, General Form Live Coding,
L5 27.08.2025 T1: Ch.2
of C Program Demonstration
Arithmetic Expressions, Formatting Practice Session,
L6 29.08.2025 T1: Ch.3
Numbers Examples
Selection Structures: Control Algorithm Design,
L7 02.09.2025 T1: Ch.4
Structures, Conditions Flowcharts
Programming
L8 03.09.2025 if Statement, if-else Statements T1: Ch.4
Examples
if Statements with Compound Complex Examples,
L9 05.09.2025 T1: Ch.4
Statements Practice
Repetition and Loop Statements: while
L10 09.09.2025 Loop Design Principles T1: Ch.5
Statement
for Statement, Computing Sum and Mathematical
L11 10.09.2025 T1: Ch.5
Product Applications
Conditional Loops, Nested Loops, do- Advanced Loop
L12 12.09.2025 T1: Ch.5
while Statement Concepts
Unit-I Assessment:
Assignment 1: Basic C programs with control structures
Tutorial: Problem solving using loops and conditions
UNIT-II: Top-Down Design with Functions and Pointers (10 Hours)
Week 5-7 (16.09.2025 - 04.10.2025)
Lecture
Date Topics Teaching Methods References
No.
Building Programs from Existing Software Design
L13 16.09.2025 T1: Ch.6
Information Concepts
Library Functions, Top-Down
L14 17.09.2025 Modular Programming T1: Ch.6
Design
Structure Charts, Functions without
L15 19.09.2025 Function Design T1: Ch.6
Arguments
L16 23.09.2025 Functions with Input Arguments Parameter Passing T1: Ch.6
Pointers and the Indirection
L17 24.09.2025 Memory Concepts T1: Ch.7
Operator
L18 26.09.2025 Functions with Output Parameters Reference Parameters T1: Ch.7
Multiple Calls to Functions with I/O Advanced Function
L19 30.09.2025 T1: Ch.7
Parameters Usage
Lecture
Date Topics Teaching Methods References
No.
L20 01.10.2025 Scope of Names Variable Scope Rules T1: Ch.7
Formal Output Parameters as Actual Parameter
L21 03.10.2025 T1: Ch.7
Arguments Mechanisms
Review and Problem Solving Practice and All
L22 04.10.2025
Session Clarification References
Unit-II Assessment:
Assignment 2: Function-based program development
Quiz: Pointers and function concepts
UNIT-III: Arrays and Strings (10 Hours)
Week 8-10 (28.10.2025 - 15.11.2025)
Note: First Mid-Term break from 21.10.2025 - 27.10.2025
Lecture
Date Topics Teaching Methods References
No.
Array Concepts,
L23 28.10.2025 Declaring and Referencing Arrays T1: Ch.8
Examples
L24 29.10.2025 Array Subscripts, Sequential Access Indexing Techniques T1: Ch.8
Using Array Elements as Function Array Parameter
L25 31.10.2025 T1: Ch.8
Arguments Passing
Array Arguments, Searching and Algorithm
L26 04.11.2025 T1: Ch.8
Sorting Arrays Implementation
Advanced Array
L27 05.11.2025 Parallel Arrays and Enumerated Types T1: Ch.8
Concepts
L28 07.11.2025 Multidimensional Arrays Matrix Operations T1: Ch.8
String Basics, String Library
L29 11.11.2025 String Manipulation T1: Ch.9
Functions
L30 12.11.2025 Assignment and Substrings String Operations T1: Ch.9
String Concatenation, Whole-Line Advanced String
L31 14.11.2025 T1: Ch.9
Input Functions
Complex String
L32 15.11.2025 String Comparison, Arrays of Pointers T1: Ch.9
Operations
Unit-III Assessment:
Assignment 3: Array and string manipulation programs
Practical: String processing applications
UNIT-IV: Recursion and Structures (8 Hours)
Week 11-12 (18.11.2025 - 29.11.2025)
Lecture
Date Topics Teaching Methods References
No.
L33 18.11.2025 The Nature of Recursion Concept Introduction T1: Ch.10
L34 19.11.2025 Tracing a Recursive Function Step-by-step Analysis T1: Ch.10
Mathematical
L35 22.11.2025 Recursive Mathematical Functions T1: Ch.10
Examples
Recursive Functions with Array and
L36 26.11.2025 Advanced Recursion T1: Ch.10
String Parameters
L37 28.11.2025 User-Defined Structure Types Structure Definition T1: Ch.11
Structure Type Data as Input and Structure Parameter
L38 29.11.2025 T1: Ch.11
Output Parameters Passing
Functions with Structured Result
L39 02.12.2025 Returning Structures T1: Ch.11
Values
L40 03.12.2025 Union Types Union vs Structure T1: Ch.11
Unit-IV Assessment:
Assignment 4: Recursive programming solutions
Tutorial: Structure-based applications
UNIT-V: File Handling and Searching/Sorting (8 Hours)
Week 13-14 (05.12.2025 - 15.12.2025)
Lecture
Date Topics Teaching Methods References
No.
Input/Output Files - Review and
L41 05.12.2025 File I/O Concepts T1: Ch.12
Further Study
File Handling
L42 09.12.2025 Binary Files, File Operations T1: Ch.12
Techniques
Searching a Database, File
L43 10.12.2025 Database Operations T1: Ch.12
Processing
Search Algorithm
L44 12.12.2025 Basic Searching: Linear Search T1: Ch.13
Analysis
L45 13.12.2025 Binary Search Techniques Efficient Searching T1: Ch.13
L46 15.12.2025 Bubble Sort Algorithm Sorting Fundamentals T1: Ch.13
Insertion and Selection Sort
L47 - Comparative Analysis T1: Ch.13
Algorithms
Lecture
Date Topics Teaching Methods References
No.
All
L48 - Review and Integration Session Course Summary
References
Note: Last 2 lectures may be adjusted based on Second Mid-Term schedule
Unit-V Assessment:
Assignment 5: File handling and sorting programs
Final Project: Comprehensive C programming application
TEXT BOOKS
T1: Jeri R. Hanly and Elliot B. Koffman, "Problem solving and Program Design in C", 7th Edition,
Pearson
T2: B.A. Forouzan and R.F. Gilberg, "C Programming and Data Structures", Cengage Learning,
3rd Edition
REFERENCE BOOKS
R1: Brian W. Kernighan and Dennis M. Ritchie, "The C Programming Language", Prentice Hall of
India
R2: E. Balagurusamy, "Computer fundamentals and C", 2nd Edition, McGraw-Hill
R3: Yashavant Kanetkar, "Let Us C", 18th Edition, BPB
R4: R.G. Dromey, "How to solve it by Computer", Pearson, 16th Impression
R5: Herbert Schildt, "C: The Complete Reference", McGraw Hill, 4th Edition
ASSESSMENT PATTERN (As per R25 Regulations)
Continuous Internal Evaluation (CIE) - 40 Marks
Two Mid-Term Examinations: 30 marks (15 marks each, average taken)
Part-A: Objective/Quiz (10 marks)
Part-B: Descriptive (20 marks)
Assignments: 5 marks (Average of 2 assignments)
Viva-Voce/PPT/Case Study: 5 marks
Semester End Examination (SEE) - 60 Marks
Part-A: 10 marks (5 short answer questions × 2 marks each) - Compulsory
Part-B: 50 marks (5 questions × 10 marks each, one from each unit with either-or choice)
Duration: 3 hours
LABORATORY CORRELATION
This theory course is supplemented by CS107ES: Programming for Problem Solving Lab which
provides hands-on programming experience with:
Program development environment
Implementation of algorithms covered in theory
Debugging and testing techniques
Project-based learning
ASSIGNMENTS SCHEDULE
Assignment Unit Coverage Due Date Marks Topics
Assignment 1 Unit-I 20.09.2025 5 Control Structures and Loops
Assignment 2 Unit-II 10.10.2025 5 Functions and Pointers
Assignment 3 Unit-III 20.11.2025 5 Arrays and Strings
Assignment 4 Unit-IV 05.12.2025 5 Recursion and Structures
Assignment 5 Unit-V 18.12.2025 5 File Handling and Sorting
TUTORIAL SESSIONS
Regular tutorial sessions will be conducted to:
Solve programming problems
Clarify doubts from lectures
Discuss assignment solutions
Prepare for examinations
Enhance problem-solving skills
INNOVATION AND ADDITIONAL ACTIVITIES
1. Programming Contests: Monthly coding competitions
2. Industry Interaction: Guest lectures from software professionals
3. Project Work: Mini-projects using C programming
4. Peer Learning: Group problem-solving sessions
5. Online Resources: Supplementary materials from MOOCs platforms
CO-PO MAPPING
Course Outcome PO1 PO2 PO3 PO4 PO5 PO12
CO1 3 2 - - - -
CO2 3 2 2 - - -
CO3 3 2 2 2 - -
CO4 3 2 2 2 1 -
CO5 3 2 2 2 1 -
CO6 3 2 2 2 1 1
Scale: 1-Low correlation, 2-Medium correlation, 3-High correlation
REMARKS AND UPDATES
This lesson plan is prepared as per R25 Academic Regulations effective from AY 2025-26
Regular updates will be made based on student feedback and academic requirements
Faculty may adjust the pace based on class understanding and progress
All dates are subject to change as per university notifications
Prepared by: _________________
Signature: _________________
Date: _________________
Approved by:
Head of Department: _________________
Signature: _________________
Date: _________________
Document Version: 1.0
Last Updated: August 2025
Next Review: December 2025
