2015 - Shrimad Rajchandra Institute of Management and Computer

advertisement
Shrimad Rajchandra Institute of Management & Computer Application
Uka Tarsadia University
2015
5 Years Integrated M.C.A. 1st Semester
Course: 060060101- Fundamentals of Programming
Lesson Plan
Objective: To introduce the fundamentals of programming concepts, methodology and enforce
logical thinking to design and develop algorithm along with problem solving techniques.
Course Outcomes: Upon completion of the course, students shall be able to
CO1:
CO2:
CO3:
CO4:
CO5:
CO6:
CO7:
Sub
Unit
Unit
Describe the basic concepts of programming.
Solve problems through program development life cycle.
Design and develop programs using conditional and loop control statements.
Get knowledge about array and able to use for problem solving.
Design and develop programs using methods.
Perform file operations like read, write and append.
Design and develop derived data type and use in problem solving.
No. of
Lectu
re(s)
[8]
1
1.1
1
1.2
2
1.3
2
1.4
1
1.5
1
1.6
1
[8]
2
2.1
1
2.2
1
2.3
1
2.4
1
Mr. Hiren Patel
Topics
Reference Chapter/
Additional Reading
Introduction of Computers, Logic and Structure
http://cs.lmu.edu/~ray/
Programming Paradigm
notes/paradigms/
Programming Process: Problem
Understanding, Planning, Coding,
FJ #1-pg no 8 to 13
Translation, and Testing
Data Hierarchy, Flowchart
Symbols, Pseudo Code Statements FJ #1-pg no 15 to 22
and Connector
Variables, Data Types and Evolution BR #2-pg no 31 to 42,
of Programming Techniques
FJ # 1-pg no 27
Unstructured Spaghetti Code and
FJ # 3-pg no 93 to 95
Recognizing Structure
FJ # 3-pg no 111 to 115
Appendix K-1 -pg no 844
Storage Classes and Basic Structures
to 850
The Program Planning Process and Making Decisions
Documentation, Advantages of
BR #2-pg 77 to 78
Modularization and Program
FJ #2-pg no 52 to 59
Modularization
Local and Global Variables and
FJ #2-pg no 59 to 61
Constants
Mainline Logic and Procedural
FJ #2-pg no 61 to 66
Programs
Hierarchy Chart and Features of
FJ #2-pg no 66 to 76
Teaching
Methodology
To be used
Evaluat
ion
Param
eters
PPT
Discussion
Chalk-Board,
Discussion
PPT, Chalk-
Board
PPT, Chalk-
Board
PPT
PPT
PPT,
Discussion
PPT, ChalkBoard
PPT, ChalkBoard
Discussion
Quiz-1
2.5
3
2.6
1
[8]
3.1
3
3
3.2
2
3.3
2
3.4
1
6
PPT,
Demonstration
PPT
Looping and Control Breaks
FJ #3-pg no 95 to 103
BR #5-pg no 238-243
FJ #4-pg no 148, 155,
Common Mistakes and Advantages of 162, 185
Looping
BR #5-pg no 255-264
Control and Nested Loops
For, Do While and Do Until Loops
BR #6-pg no 309 to 319
BR #6-pg no 338 to 341
4.1
1
4.2
1
4.3
2
Constant Arrays and Parallel Arrays
4.4
1
Searching from Array
BR#8-pg no 463,465
FJ #6-pg no 240 to 242
FJ #6-pg no 246 to 253
FJ #6-pg no 242, 254
4.5
2
String processing
BR #11-pg no 666 - 712
[7]
5
Case Structure and Decision Tables
BR #3-pg no 94 to 108
BR #3-pg no 232 to 233
BR #5-pg no 236
FJ #3-pg no 96 to 97
FJ #3-pg no 144
Single-Level Break and MultipleLevel Control Break
Arrays
Array Declaration and Memory
allocation
Array Initialization
[7]
4
Program Design
Boolean Expressions, Relational
Operators, Logical Operators,
Precedence
Methods
Method Creation with single
parameter
FJ #6-pg no 229 to 231
5.1
2
BR #4-pg no 155 to 162
5.2
1
Method Calling
BR #4-pg no 165 to 166
5.3
2
Method Creation with Multiple
Parameters
BR #4-pg no 186
5.4
2
Passing Arrays into Methods
BR #8-pg no 473-481
6.1
[10]
1
BR #9-pg no 558 to 572
6.2
2
Derived Types and File Handling
Overview of Pointers
Structure declaration and Structure
of Array
6.3
1
Enumerated and Union Types
BR #12-pg no 746,782
6.4
3
Sequential and Binary Files :
Creation, Merging and Updating
BR #13-pg no 821 to 842
6.5
1
Command Line Arguments
6.6
2
Preprocessor Directives
BR #12-pg no 752 to 768
BR #Appendix-H pg no
1091-1094
BR #Appendix-I pg no
836
Chalk- Board,
Demonstration
Chalk-Board,
Demonstration
Chalk-Board,
Demonstration
Chalk-Board,
Demonstration
Unit
Test-1
Chalk-Board,
Demonstration
Demonstration
Chalk-Board,
Demonstration
Demonstration
Chalk-Board,
Discussion
Discussion,
Demonstration
Discussion,
Demonstration
Discussion,
Demonstration
Discussion,
Demonstration
PPT
PPT,
Demonstration
PPT,
Unit
Demonstration
Test-2,
PPT,Discussion
Internal
Demonstration
Demonstration
PPT,
Discussion
Course objectives and Course outcomes mapping:
 To introduce the fundamentals of programming concepts and methodology: CO1, CO2, CO3,
CO4, CO5, CO6, CO7
 Enforce logical thinking to design and develop algorithm: CO1, CO2, CO3
 To become familiar with problem solving techniques: CO3, CO4, CO5, CO6, CO7
Course Units and Course Outcomes Mapping:
Unit
No.
Unit
Course outcome
CO1
1
2
3
4
5
6
Introduction of Computers, Logic
and Structure
The Program Planning Process and
Making Decisions
Looping and Control Breaks
Arrays
Methods
Derived Types and File Handling
CO2
CO3
CO4
CO5


















CO6
CO7


Course Outcomes and Programme Outcomes Mapping:
Programme Outcomes
PO1
PO2
CO1


CO2


CO3


CO4


CO5


CO6


CO7


PO3
PO4
PO5
PO6
Course Outcomes
Computing Environment:
A student must have the following computing environment in laboratory and or on his/her
laptop and.

GNU gcc compiler in Linux platform.
Modes of Transaction (Delivery):


Lecture method shall be used but along with it, as and when required, discussion method
would be fruitful. It shall be supplemented with various appropriate audio-visual aids.
Activity assignment shall be given to the student. Assignment questions should be logical
and twisted.
Activities/Practicum:
The following activities shall be carried out by the students.

Historical study of the Programming languages.

Study of standard header files.

Programs for core elements of the subject.
The following activities shall be carried out by the teacher.

Demonstrate programming environment, program testing and debugging using GDB utility.

Discussion of programming standards and coding style with data validation.

Recent trend in programming.
Text Book:
1.
2.
Joyce Farrel - Programming Logic and Design - Cengage Learning [#FJ]
Behrouz Forouzan, Richard Giberg - Computer Science-A Structure Approach Using C Cengage Learning [#BR]
Reference Books:
1.
2.
3.
4.
5.
Pradip Dey, Manas Ghosh- Programming in C - Oxford Higher Education
Y. Kantikar – Let us C – BPB Publication
Juneja, Anita Seth- Programming in C - Cengage Learning
Amiya Rath, Alok Jagadev, Santosh Swain- Programming in C - SCITECH
B. Gottfried – Schaum’s outline of Programming with C - Shaum Series
Concept Map:
Fundamental of Programming
Unit 1: Introduction of Computers, Logic and Structure
Unit 2: The Program Planning Process and Making Decisions
Unit 3: Looping and Control Breaks
Unit 4: Arrays
Unit 5: Methods
Unit 6: Derived Types and File Handling
Download