COURSE FILE
Programming
Principle &
Algorithm
Course: bca-I
Subject code: s102
Faculty name: VIKAS SHARMA
SYLLABUS
UNIT-I
Introduction to ‘C’ Language
History, Structures of ‘C’ Programming, Function as building blocks.
Language Fundamentals
Character set, C Tokens, Keywords, Identifiers, Variables, Constant, Data Types,
Comments.
UNIT-II
Operators
Types of operators, Precedence and Associativity, Expression, Statement and types
of
statements.
Build in Operators and function
Console based I/O and related built in I/O function: printf(), scanf(), getch(),
getchar(),
putchar(); Concept of header files, Preprocessor directives: #include, #define.
UNIT-III
Control structures
Decision making structures: If, If-else, Nested If-else, Switch; Loop Control
structures:
While, Do-while, for, Nested for loop; Other statements: break, continue, goto, exit.
UNIT-IV
Introduction to problem solving
Concept: problem solving, Problem solving techniques (Trail & Error, Brain Storming,
Divide & Conquer) Steps in problem solving (Define Problem, Analyze Problem,
Explore Solution) Algorithms and Flowcharts (Definitions, Symbols), Characteristics
of
an algorithm Conditionals in pseudo-code, Loops in pseudo code
Time complexity: Big-Oh notation, efficiency Simple Examples: Algorithms and
flowcharts (Real Life Examples).
UNIT-V
Simple Arithmetic Problems
Addition / Multiplication of integers, Determining if a number is +ve / -ve / even / odd,
Maximum of 2 numbers, 3 numbers, Sum of first n numbers, given n numbers,
Integer
division, Digit reversing, Table generation for n, ab
, Factorial, sine series, cosine series, nCr , Pascal Triangle, Prime number, Factors
of a number, Other problems such as
Perfect number, GCD numbers etc (Write algorithms and draw flowchart), Swapping
UNIT-VI
Functions
Basic types of function, Declaration and definition, Function call, Types of function,
Parameter passing, Call by value, Call by reference, Scope of variable, Storage
classes,
Recursion
BASIC INFORMATION
 LECTURE HOURS (PER WEEK FOR SEMESTER): 4
 LAB HOURS (PER WEEK FOR SEMESTER): 2
 CREDIT HOURS: 6
LIST OF REFERENCES
 COURSE NOTES
 ESSENTIAL BOOKS
o 1. Let us C-Yashwant Kanetkar.(LUCY)
 RECOMMENDED BOOKS
o Programming in C-Balagurusamy(CBS)
o Problem solving using C-Somashekhara(PSCS)
 REFERENCE BOOKS
o IGNOU study material.(IGNOU)
 PERIODICALS, WEBSITES
o www.tutorialspoint.com
o www.cprogramming.com
LECTURE PLAN FOR PPA(s102)
UNIT
1
2
TIME
(in
days)
TOPICS
TOTAL
TIME
(in days)
Problem and its characteristics.
1
Problem solving tools
Algorithm and examples
1
Flowchart and symbols, examples
2
2
Introduction to C language
1
First C Program: to print a message, addition of 2 numbers
C tokens
2
2
Operators
3
Class test and assignment
1
SELECTION STATEMENTS: IF, IF… ELSE, SWITCH
ITERATIVE STATEMENTS: FOR LOOP, WHILE LOOP, DO… WHILE
LOOP
3
Programs: Practical in LAB
Tips and tricks
Quiz
Function: factorial,
2
3
1
2
Passing a value to a function
Programs in LAB
Class test
Call by value, call by pointer
Recursion
2
3
1
1
4
Pointer
4
Class test and assignment
1
6
Chap1. PSCS
9
Chap1. LUCY
3
3
4
Ref.
12
Chap2&3. LUCY
18
Chap4.
LUCY/IgnouSM
Scope of variable, Storage classes
5
LAB:
Prime number, Factors of a number, nCr , Pascal Triangle
Digit reversing, Table generation for n,
Viva Preparation
ab
2
6
17
5
Course Notes/
Hand Outs
4
TOTAL LECTURES:
62
STUDENT ASSESMENT METHOD
METHOD
PURPOSE
SCHEDULE
WEIGHTING
OF
ASSESMENT
ORAL EXAM
TO ASSESS THE SKILLS
OF ANALYSIS AND
END OF EACH CHAPTER
DISCUSSION
5%
WRITTEN EXAM
TO ASSESS THE
ABILITY TO
REMEMBER; TO
ASSESS THE
UNDESTANDING OF
SCIENTIFIC
BACKGROUND
END OF EACH CHAPTER &
INTERNAL EXAM
60%
AFTER EVERY UNIT
15%
AFTER 2 UNITS
10%
PRACTICAL
TO ASSESS THE
EXAM/PRESENTATION PROFESSIONAL SKILLS
ASSIGNMENTS
TO ASSESS THE
ABILITY TO WORK IN
GROUP