0% found this document useful (0 votes)
6 views3 pages

gramming-amp-programming-methodology-cppm-p_compress

The document outlines the course structure for 'Computer Programming & Programming Methodology (CPPM)', which includes a total of 4 credits and consists of both theoretical and practical applications over 15 weeks. It aims to introduce students to essential programming concepts using the C language, covering topics such as algorithms, data types, control structures, and arrays. The course includes various units focusing on programming fundamentals, input/output operations, decision-making statements, iterative processes, and pointers, along with a list of reference books for further study.

Uploaded by

aatifkureshi1212
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views3 pages

gramming-amp-programming-methodology-cppm-p_compress

The document outlines the course structure for 'Computer Programming & Programming Methodology (CPPM)', which includes a total of 4 credits and consists of both theoretical and practical applications over 15 weeks. It aims to introduce students to essential programming concepts using the C language, covering topics such as algorithms, data types, control structures, and arrays. The course includes various units focusing on programming fundamentals, input/output operations, decision-making statements, iterative processes, and pointers, along with a list of reference books for further study.

Uploaded by

aatifkureshi1212
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Paper – 104 Computer Pr

Prog
ogramming & Prog
Programming Methodology

(CPPM)

CourseCode:
Course 104
Course
CourseTitle:
itle: Computer Programming& ProgrammingMethodology (CP
(CPPM)
PM)
Total Credits: 4 Credits
Credits
Nature of Subj
bjec
ect : Theory and Practical application
Teachingper Week: 4 Hours per week per Semester
Minimumweeks per
Minimum 15 weeks (Including
(Including class
class work,
work, examina
nati
tion,
on, prepara
aration
tion etc.)
Semester:
Review/Re
Review/Revision
vision Yea
Year: Jun
June, 2020
Purposeof CCourse
ourse : - Com
Co mputer programming (of (often
ten shortened to programming) iis s a process that
leads from an origi
origina
nall formulation
ulation of a computing problem to executable
computer programs.
- Programming involves activities such as analysis, developing,
under
erstan
standi
ding
ng, gener
erating
ating algori
algorithm
thms, verif
verificati
ication
on of requ
requiiremenents
ts of
algorithm
algorithms includi
including
ng their correctne
correctness,
ss, and
and iim
mpl
plem
ementatio
tation
n (common
(commonlly
referred to as coding)
coding) of al
algori
gorithm
thms iin
n a target programming language.
- Students pursuing their Graduation
Graduation program wi willl encounter their fi first
rst
programming langu
language which iis s one of the piopionee
neer computer programming
languages.
-
Purpose
program
progr ammof
ingthe course
langu is to re
age, structu emof
structure phasis
code,o
code, on
n concepts
algori thms, flof
algorithm Com
Co
ow- mpi
ow-charpil
ts,ler
charts, based
problem
probl em
solvi
solving
ng attitude, concepts of variables
variables and declaratio
claration
n mechanis ism
m of
dif
diffferent datatypes, si
simmpl
ple
e I/O
I/O statements, conditi
conditional
onal statements, lloops,
oops,
compound iterations, stristrings
ngs and certain iinbu
nbuil
iltt functions,
functions, header ffiiles,
concepts of arrays and one dimensional
dimensional numeric array operations,
operations, numericeric
inbuilt functi
functions
ons and
and concepts of pointe
pointers.

Objective : Object of this course is to introd


Obje introduce students the essenti
tials
als of compute
uterr
Programming and programming methodology
thodology usi
using
ng C language.
Pre-requisite: None
Course
Cour se Outcome : - Students wi
willl be able to formulate
formulate a computing
ting probl
roblem
em to executabl
executable
e
computer programusi using
ng C lang
language.
- Understand about compi
compiller based programming langu
languages.
- Concepts of variables,
variables, lit
lite
erals, datatypes, conversio
conversions ns of data types, iinpu
nput
and output data and processing
processing of data, inbuil
inbuiltt functi
functions,
ons, arrays, header
files, conditional and iterative statements.
Course Content: UNIT-1:
IT-1: Introduction
1.
1.1
1 Concepts of Program
Programming Language
1.1.1
1.1. 1 Introducti
ction
on of Source Code, Obj
Object
ect Code and executable code
1.1.2 Algorithm and Flowchart
1.1.3
1.1. 3 Concepts of Structured Programming Language
1.2 Concepts
Concepts of Editor, Interpre
Interpreter aand
nd Compile
Compiler
1.2.1
1.2. 1 Introducti
Introductionon of C programbody structure
1.2.2
1.2. 2 Characte
Character Set, concepts of variabl
variablees and constants
1.2.3 Identifiers, literals, Key words
1.2.4 Data types (signed and unsigned) (Numeric : int, short int, long, float,
double)
5,Conce
1.2.5
1.2. (Character
pts of type:
sourcechar, string)
code, obj
obje and
ect void.
code and executable code.
UNIT-2: Input/
Input/Output
Output Statements and Operators:
2.1
2.1 Input/Output statements:
2.1.1 Concepts of Header files (STDIO,CONIO)
2.1.1.1 Concepts
Concepts of pre-compil
compile er directi
directives.
2.1.1.2
2.1. 1.2 Use of #inlcude
nlcude and #def defiine
2.
2.2
2 Input/Output Statements:
2.2.1
2.2.1 Input statements : scan
scanff(), getc()
tc(),, getch()
getch(),, gets()
gets(),, getch
getchar()
ar()
2.2.2
2.2.2 Output
Output State
Statemments: printf
printf()
(),, putc()
putc(),puts(
,puts(),
), putc
putcha
har()r()
2.2.3 Type spe
specifi
cifiers (form
(formatting strings) : %d, %ld, %f %f,, %c, %s, %lf
2.3 Operators
Operators :
2.3.1 Arithm
Arithmetetiic ope
operat
rators
ors ( +, -, *, /, %, ++, --, )
2.3.2 Logical Operators ( &&, ||, ! )
2.3.
2.3.33 Rel
Relati
ational
onal Operators
Operators ( >, <, ==, >=, <=, !=)!=)
2.3.4
2.3. 4 Bi
Bit-
t-wi
wise
se operators ( &, |, ^, <<, >>)
2.3.5
2.3. 5AAssi
ssignm
gnment operators ( =, +=, -=, *=, /=, %=)
2.3.6 Ternary Oper
Operator
ator and
and use of sisizeof
zeof()
() function.
2.4 Important Built-in functions:
2.4.1
2.4. 1 Use
Use of <string.h>:
string.h>: ( strlen, strcmp, strcpy, strcastrcat,
t, strr
strrev)
ev)
2.4.2 Use of <math.h>: (abs(), floor(), round(), ceil(), sqrt(), exp(), log(), sin(),
cos(), tan(), pow() and trunc())

UNIT-3: Decisi
Decision
on Making statements :
3.1 if
if statements :
3.1.1 simple if statements
3.1.2 if…else statements
3.1.3 if…else if….else statements
3.1.4
3.1. 4 Nested if statements.
3.2
3.2 Switch..
Switch..case
case statements
3.2.1
3.2. 1 Use of break and default
3.2.2
3.2. 2 Dif
Difference betwee
between switch and if statem
statements.

UNIT-4: It
Iterativ
erative
e statements :
4.1 Use of goto statement ffor
or iteration
4.2 while loop
4.3 do..while loop
4.4 for loop
4.5 Nested wh
whiile, do..
do..whil
while
e and for loops
4.6 Ju
Jum
mpining
g statement: (break and continue)

UNIT-5: Concepts of Arrays and pointer


5.1 Concepts of Single-dimensional Array
5.1.1
5.1. 1 Numereric
ic si
single
ngle dimensional
nsional AArray
rray
5.1.2
5.1.2 Numereriic single
single di
dim
mensi sional
onal array operations:
operations:
5.1.2.1
5.1. 2.1 Sorting array inin as
ascen
cendi ding
ng or descending. (Bubbl
(Bubble e and selection)
5.1.2.2
5.1. 2.2 Searc
Searching
hing eleme
element nt ffrom
rom array (L (Linear Se
Search
arch)
5.1.3
5.1. 3 Character Single di dimmensi
ensional
onal Array
Array
5.1.3.1
5.1. 3.1 Character
cter Single
Single dimensi
dimensional
onal array operations:
operations:
5.1.3.2 Use of \0, \n and
and \t
5.2 Pointers:
5.2.1
5.2. 1 Concepts
Concepts of PoPoiinters
5.2.2 Declaring and initial
initialiizi
zing
ng int, fl
float
oat,, ch
char
ar a
and
nd voi
voidd pointers
5.2.3
5.2.3 Pointer to single
single dimensio
dimensiona
nall numeric array.
Referenc
Reference Books: 1. Programming in C, Balaguruswam
Balaguruswami – TMH
2. C: How to Program, Deitel & Deitel
Deitel - PHI
3. C Programming Language, Kernigham& R
Ritchi
itchie
e - TMH
4. Programming in C, Stephan
phan K
Kochan
ochan - CBS
CBS
5. Mas
Maste
tering Tur
urbo
bo C, Kelly
Kelly & Bootle
Bootle - BPB
6. C Language Programming – Byron Gottfried - TMH
7. Let us C, Yash
Y ashwan
want Kanetk
Kanetkar
ar - BPB Publicati
Publication
on
8. Magnifying C, Arpita Gopal - PHI
9. Probl
Problem
emSolvi
Solving
ng with C, Somashekara
shekara - PHI
10. Programming in C, Pradip DeyDey & Manas Ghosh – Oxf
Oxford
ord
Teaching Class Work,
Work, Discu
Discussion,
ssion, Se
Self
lf--Study,
Study, Seminars and/or
and/or A
Assignm
ssignments
Methodology:
Evaluation
Evaluation Method: 30% intern
internal assessment. 70% Externa
External assessment

You might also like