BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI WORK-INTEGRATED LEARNING PROGRAMMES DIVISION BITS-WIPRO Collaborative Programme: MS in Software Engineering I SEMESTER COURSE HANDOUT Course No. : SEWP ZC142 Course Title : Computer Programming Course Description The course covers the following topics through lectures: Basic Model of a Computer; Problem Solving – Basic Computing Steps and Flow Charting (Assignment, Sequencing, Conditionals, Iteration). Programming Constructs – Expressions, Statements, Conditionals, Iterators/Loops, Functions/Procedures; Data Types – Primitive Types, Tuples, Choices (Unions or Enumerations), Lists/Arrays, Pointers and Dynamically Allocated Data. Input output and Files. While the topics are taught using a specific language, the intent of the course is to teach a programming methodology not a programming language. Programming exercises are provided which involves the development and testing of iterative and procedural programs using bounded and unbounded iterations, function composition, random access lists, sequential access lists, dynamically allocated lists, and file access. Scope and Objectives The primary goals of the course are to introduce: Basic representation of data and how to process data using the representation inside a computer. Techniques for specifying data and operations on data using a programming language Systematic techniques and approaches for constructing programs. Prescribed Text Books T1. J.R. Hanly and E.B. Koffman, Problem Solving and Program Design in C. 5 th Edition. Pearson Education 2007 Reference Books
BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE,
PILANIWORK-INTEGRATED LEARNING PROGRAMMES DIVISIONBITS-WIPRO
Collabora!"# Pro$ra%%#& MS !' So()ar# E'$!'##r!'$I SEMESTER
COURSE HANDOUTCo*r+# No,& SEWP -C./0Co*r+# T!l# & Co%1*#r
Pro$ra%%!'$ Co*r+# D#+2r!1!o' The course covers the following
topics through lectures: Basic Model of a Computer; Problem Solving
Basic Computing Steps and Flow Charting !ssignment" Se#uencing"
Conditionals" $teration%&Programming Constructs '(pressions"
Statements" Conditionals" $terators)*oops"
Functions)Procedures;+ataT,pesPrimitiveT,pes" Tuples"
Choices-nionsor'numerations%" *ists)!rra,s" Pointersand+,namicall,
!llocated +ata& $nput output and Files& .hile the topics
are taught using a specific language"the intent of the course is to
teach a programming methodolog, not a programming
language&Programming e(ercises are provided which involves the
development and testing of iterative andprocedural programs using
bounded and unbounded iterations" function composition" random
access lists"se#uential access lists" d,namicall, allocated lists"
and file access&S2o1# a'3 Ob4#2!"#+The primar, goals of the
course are to introduce: Basic representation of data and how to
process data using the representation inside a computer&
Techni#ues for specif,ing data and operations on data using a
programming language S,stematic techni#ues and approaches for
constructing programs&Pr#+2r!b#3 T#5 Boo6+T/& 0&1&
2anl, and '&B& 3offman"Problem Solving and Program +esign
in C& 4th'dition& Pearson'ducation 5667R#(#r#'2# Boo6+
R.& 1&0& +rome,& Problem Solving using
Computer& Prentice 2all $ndia& 'astern 'conom, 'dition&
5665&R0& Brian .& 3ernighan" +ennis 1itchie& The C
Programming *anguage& Prentice 2all& 5nd 'dition&Pla'
o( S#l( S*37S#++!o'8L#ar'!'$ Ob4#2!"# To1!2 R#(#r#'2# o T#5 Boo6To
*'3#r+a'3 9o)o 3#(!'# a'31ro2#++ ba+!2 3aa :'*%b#r+;Ba+!2+ o(
Co%1*!'$ < Daa a'3 Co%1*a!o', Model of a computer& Problem
Solving Daa T71#+8 9perations and 1epresentation :umbers$ntegers
and $nteger 9perationsM#%or7a'3Var!abl#+*ocations"!ddresses"
+efinitionsdeclarations Daa Ta'3 D71#+ < Bool#a' Val*#+ a'3
Bool#a' 9perations; Sets and Bit ;ectors 8 Bit ;ector 9perations;
Characters and Character Sets; E51r#++!o' E"al*a!o' !ssociativit,
and Precedence& Conditional '(pression T. S#2, 0,0,0,=.0To
*'3#r+a'3 3!((#r#' 3aa 71#+a'3 *+# o( %#%or7 !'
1ro$ra%%!'$Var!abl#+ a'3 A++!$'%#' < Forms of !ssignment
$ncrement)+ecrement%" Se#uencing& Daa T71#+ 1eal numbers
vs& 1ational :umbers; !ccurac," Precision" and 1ange&
Floating Point 1epresentation" Single and +oublePrecisionDaa T71#+
T,pe Conversion $mplicit and'(plicitBa+!2+ o( I'1* > O*1*
Character andBuffered $)9E5#r'al I'#r(a2# (or 9# Pro$ra%
Compilationand '(ecutionT. S#2, 0,?, @,.?To *'3#r+a'3 2o'+r*2+ o(
+r*2*r#3 1ro$ra%%!'$ !'2l*3!'$ 2o'3!!o'al+ a'3 !#ra!o'+Probl#%
Sol"!'$ < S#A*#'!al a'3 Co'3!!o'al'(ecution; Flow Charting;
Preconditions andPostconditions& Statements Se#uential
andConditional Statements& -ser +efined +ata 'numerated +ata
T,pes&T. C9, //-=Probl#% Sol"!'$ < R#1#!!"# E5#2*!o'
