LESSON PLAN

Faculty
Name
Semester: Session: 2019-2020 Contact Hours per week:
Subject: C AND DATA Branch:MCA Total Credit:3 (40 hrs)
STRUCTURE
Period DECEMBER 2021 – MAY 2022 Subject Code:
Text Books: T1. E. Balagurusamy, Programming in ANSI ‘C’, 8th Edition, Tata McGraw Hill, 2019.
T2.Reema Thareja, Data Structures Using C, 2nd Edition ,Oxford University Press, 2014.
T3. M. Tanenbaum, “Data Structures using C & C++”,Prentice-Hall of India Pvt. Ltd.

Reference R1. Bruno R Preiss, “Data Structures and Algorithms with

books: Object Oriented Design Pattern in C++”, John Wiley & Sons,
Inc., 1999.
R2. Horowitz and Sahani, “Fundamentals of data
Structures”,Galgotia Publication Pvt. Ltd

COURSE
OBJECTIVES
:

COURSE OUTCOME:

CO 1 The learner should be able to understand the key dimensions of the challenges in Cloud Computing
CO 2 The learner should be able to extract technological implications for selecting cloud computing for
own organization
CO 3 The learner should be able to use and application for initiating and installing cloud-based
applications.
CO 4 The learner should be able to describe needs for capacity building and training in cloud computing-
related IT areas
CO 5 The learner should be able to analyze a plan for cloud deployment in runtime environment
CO 6 The learner should be able to design and develop cloud security and cloud infrastructure
Sl. No. Date Topics to be covered 60 Min Class Mode Links COs
proposed Distribution of
LM ICT IM Teachin
g
Module – I( C Language Fundamentals)

1 30 30 GB CO-
Arrays 1
2 GB CO-
Strings 1
3 PPT CO-
Character set, Keywords, 1
4 GB CO-
Data Types, Constant 1
5 PPT CO-
Variables, Statements, Expressions
1
6 GB CO-
Operators, Precedence of operators 1
7 PPT CO-
Input- output Assignments, 1
8
Control structures
9
Decision making and Branching
10
Decision making & looping.
11 Declarations.

12 REVISION AND QUESTION ANSWER

DISCUSSION(BPUT &INTERVIEW)

13 REVISION AND QUESTION ANSWER

DISCUSSION(BPUT &INTERVIEW)

MODULE-II( Monolithic & Modular programs )

14 User defined PPT CO-
functions 2
15 PPT CO-
standard functions 2
16 PPT CO-
Formal and Actual arguments,
2
17 Functions category, function GB CO-
prototypes 2
18 PPT CO-
parameter passing
2
19 PPT CO-
Recursion,
2
16 GB CO-
Storage Classes: Auto, Extern,
2
17 GB CO-
Storage Classes: Global, Static.
2
18 GB CO-
Character handling in C
2
19 GB CO-
String handling functions
2
20 Union & File handling PPT CO-
2
21 REVISION AND QUESTION ANSWER
DISCUSSION(BPUT &INTERVIEW)
22 REVISION AND QUESTION ANSWER
DISCUSSION(BPUT &INTERVIEW)
 Module – III( Pointer Variables)

23 Pointer variable GB CO-

and its 3
importance
24 Pointer Arithmetic passing GB CO-
parameters, 3
25 PPT CO-
Declaration of structures, 3
26 PPT CO-
Pointer to pointer, 3
27 GB CO-
pointer to structures, 3
28 PPT CO-
pointer to function 3
29 PPT CO-
unions dynamic memory allocations, 3
30 file handling in GB CO-
C 3

31 REVISION AND QUESTION ANSWER PPT CO-

DISCUSSION(BPUT &INTERVIEW) 4
32 REVISION AND QUESTION ANSWER GB CO-
DISCUSSION(BPUT &INTERVIEW) 4

MODULE-IV( Development of Algorithms )

33 Notations and GB CO-
Analysis, 5

34 Storage structures for arrays-sparse GB CO-

matrices 5
35 GB CO-
Stacks 6
36 PPT CO-
Queues 6
37 PPT CO-
Applications of Stack 6
38
Prefix, Postfix and Infix expressions
39
Circular queue
40 Double ended
queue.

39 REVISION AND QUESTION ANSWER

DISCUSSION(BPUT &INTERVIEW)
40 REVISION AND QUESTION ANSWER
DISCUSSION(BPUT &INTERVIEW
41 REVISION AND QUESTION ANSWER
 DISCUSSION(BPUT &INTERVIEW

Signature of the faculty

Date:

NOTE:

GB:-GREEN BOARD

LM:-LECTURE METHOD (THROUGH WHITE OR GREEN BOARD)

IM:- INTERACTIVE METHOD (THROUGH CASE STUDY, PPT, GD)

ICT:-INFORMATION AND COMMUNICATION TECHNOLOG

CO(COURSE OUTCOME) & COURSE OBJECTIVE IS DONE BY INDIVIDUAL