0% found this document useful (0 votes)
96 views6 pages

Cps Lesson Plan2020

The document outlines a lesson plan for a course on C Programming for Problem Solving that covers topics such as basic C concepts, decision making and looping, arrays and strings, modular programming, and pointers across 3 modules over 50 lecture hours. The course aims to enable students to write algorithms, implement programming constructs, use data structures, and design modular programs using structures and pointers. The lesson plan details the topics, delivery mode, dates, and outcomes covered in each lecture.

Uploaded by

Vidya channaiah
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
0% found this document useful (0 votes)
96 views6 pages

Cps Lesson Plan2020

The document outlines a lesson plan for a course on C Programming for Problem Solving that covers topics such as basic C concepts, decision making and looping, arrays and strings, modular programming, and pointers across 3 modules over 50 lecture hours. The course aims to enable students to write algorithms, implement programming constructs, use data structures, and design modular programs using structures and pointers. The lesson plan details the topics, delivery mode, dates, and outcomes covered in each lecture.

Uploaded by

Vidya channaiah
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
You are on page 1/ 6

LESSON PLAN

SUBJECT TITLE C Programming for Problem Solving


SUBJECT TYPE CORE
SUBJECT CODE 18CPS13
ACADEMIC YEAR 2020 (EVEN SEMESTER) BATCH 2019-2023
SCHEME CBCS scheme (Effective from the academic year 2016 -2017)
SEMESTER & SECTION I Semester CSE ‘C’ Section
IA MARKS 40 EXAM MARKS 60
NUMBER OF LECTURE TOTAL NUMBER OF
5 50
HOURs/WEEK LECTURE HOURS
NO. OF TIMES
FACULTY NAME Mrs.Vidya Y 5
HANDLED
COURSE LEARNING OBJECTIVES: This course will enable students to
1. Familiarize with writing of algorithms, fundamentals of C and philosophy of problem solving
2. Implement different programming constructs and decomposition of problems into functions
3. Use and implement data structures like arrays and structures to obtain solutions
4. Define and use of pointers with simple applications

Course Outcomes: At the end of this course, students are able to:
CO1 Interpret the basic principles of C Programming
CO2 Acquire decision making and looping concepts
CO3 Explore usage of Arrays and strings
CO4 Design and develop modular programming.
CO5 Modularize the given problems using structures
CO6 Effective utilization of pointers and Preprocessor Directives.

CO-PO MATRIX
COURSE
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
OUTCOMES
CO1 2 - - - - - - - - - - 1 2 - - -
CO2 2 2 - - - - - - - - - 1 1 2 - -
CO3 2 1 2 1 1 - - - - - - 1 1 - 2 -
CO4 2 2 3 - 1 - - - - - 1 1 1 2 1 -
CO5 2 - - - - - - - - - - 1 1 1 2 -
CO6 2 1 1 - - - - - - - 2 1 1 2 1 -
DELIVERY PLAN WITH DETAILS
MODULE – 1
Mode of
Date of COs
Lecture Delivery
Delivery Covered
Topic (Pls Tick )
#
1 2 3 4
1 Introduction to computer hardware and

CO1
software: Computer Generations and types 

2 Bits,bytes and words, CPU, Primary Memory,



CO1
Secondary Memory, port sand connections 

3 Input devices and output devices,computers in a



CO1
network, network hardware 

4 Software basics and types.Overview of C: Basic



CO1
structure of C program 

5 Executing a C program, constants 


CO1
6 Variables and data types+programming exercises 
 CO1
7 Operators in C 
 CO1
8 Expressions+programming exercises  CO1

Textbook : 1 and chapter : 1, 2, 3
Reference book : 1 and chapter :1,2(upto 2.3)
Faculty:
Allotted Taken
Signatures #HOURS
HoD: 8 12

Remarks

MODULE – 2
Lecture Topic Mode of Date of COs
# Delivery Delivery Covered
(Pls Tick )
1 2 3 4
1 Managing Input Output operations   CO2
 
2 Conditional Branching:if statement, if…else CO2
 
statements,Nesting of if…else statements  

3 Switch statement, ? : operator, goto statements   CO2


 
4 Loops: while statement, do statement   CO2
 
5 for statements, jumps in loops   CO2
 
6 Roots of quadratic Equation+ programming CO2
 
exercises  

7 Computation of Binomial coefficient+ CO2


 
programming exercises  

8 Plotting of Pascals triangle+ programming CO2


 
exercises  

Textbook : 1 and chapter: 4,5,6


Faculty:
Allotted Taken
Signatures #HOURS
HoD: 8 10

Remarks

MODULE – 3
Lecture Topic Mode of Date of COs
# Delivery Delivery Covered
(Pls Tick )
1 2 3 4
1 Arrays 1D   CO3
 
2 Arrays 2D   CO3
 
3 Character arrays   CO3
 
4 strings   CO3
 
5 Searching algorithms: linear and binary search   CO3
 
6 Sorting algorithms: Bubble Sort Selection Sort   CO3
 
7 programming exercises   CO3
 
8 programming exercises   CO3
 
Textbook : 1 and chapter :7, 8
Faculty:
Allotted Taken
Signatures #HOURS
HoD: 8

Remarks
MODULE – 4
Lecture Topic Mode of Date of COs
# Delivery Delivery Covered
(Pls Tick )
1 2 3 4
1 User defined functions   CO4
 
2 Categories of functions   CO4
 
3 Nesting of functions,Recursion   CO4
 
4 Passing arrays to functions   CO4
 
5 Passing strings to functions   CO4
 
6 Factorial of positive integers   CO4
 
7 Fibonacci series   CO4
 
8 Programming exercises   CO4
 
Textbook: 1 and chapter : 9
Faculty:
#HOURS Allotted Taken
Signatures
HoD: 8

Remarks

MODULE – 5
Lecture Topic Mode of Date of COs
# Delivery Delivery Covered
(Pls Tick )
1 2 3 4
1 Structures: Declaration and initialization   CO5
 
2 Array of structures,structures within structures   CO5
 
3 Structures and functions   CO5
 
4 Pointers: Declaring and initializing   CO6
 
5 Pointer and character arrays   CO6
 
6 Pointers and functions   CO6
 
7 Preprocessor directives: file inclusion and macro CO6
 
substitution  

8 Compiler control directives   CO6


 
Textbook : 1 and chapter :10, 11, 14
Faculty: Allotted Taken
Signatures #HOURS
HoD: 8

Remarks

Text Books:
1. E. Balaguruswamy, Programming in ANSI C, 7th edition.
2. Brian W Kernighan and Dennis M Ritchie, The ‘C’ Programming Language.
Reference Books:
1. Sumitabha Das, Computer Fundamentals and C Programming.
2. Gary J Bronson, ANSI C Programming,4th edition.
3. Dey and Ghosh, Programming in C, 3rd edition.
4. Vikas Gupta: Computer concepts and C programming.
5. R S Bichkar ,Programming with C.
6. V Rajaraman, Computer Programming in C.
7. Basavaraj S Anami, Shanumagappa, A Angadi, Sunilkumar S, , Manvi, Computer Concepts
and C programming.

(Note: Mode of Delivery


1:Black Board 2:PPT 3:Video 4:Demo/Hands-on)

INTERNAL/ASSIGNMENT/QUIZ SCHEDULE

TEST and QUIZ COs and Portions Covered ASSIGNMENT


Test# and DATE CO Modules Assignment# DATE
Quiz#
T1 & Q1 A1
T2 & Q2 A2
T3 & Q3 A3

SUMMARY

Faculty:
Allotted Taken
Signatures Total
With Date HoD: #HOURS

Remarks
ENCLOSURES

1. Syllabus
2. CO Attainment
3. Gap Analysis
4. Special lectures/talks arranged if any

Feedback by PAC

Faculty Course coordinator PAC HOD

You might also like