IFF 1444: INTRODUCTION TO PROGRAMMING (ICT)
SEF 1514 : COMPUTER 2 (Physical Science & Engineering)

REQUIRED TEXTBOOK
RECOMMENDED TEXTBOOKS


Noor Hasrina Bakar, Noor Azimah Hassan, Mohd Norhaedir Idris, Mahmoud Al-Shawabkeh (2011). Programming in C for Foundation (2nd ed.)

Download>> ERRATA

Chapter 3 part 2 : Correction

 

 

 

 

 

 

 

 

 

 

 

 

Bronson, G. J., (2007). A first book of ANSI C (4th ed.)
Pacific Grove, CA: Brooks/Cole

Forouzan, B. A., & Gilberg, R. F., (2001). A structured programming approach using C (2nd ed.), Pacific Grove, CA: Brooks/Cole

Hanly, J. R., & Koffman, E. B., (2010). Problem solving and program design in C (6th ed.), Boston, MA: Pearson Education Inc.

 

 

Course Synopsis

This course covers topics: Computing Concepts of C and Structure Programming, Numbering Systems, Program Planning and Design, Top-down Programming Development Algorithms, C Data Types and Variables Declarations, Selection and Repetitions Control Structure, User-defined and Standard Library Functions, Arrays and Strings.

LEARNING MATERIALS SEMESTER 3 2011/2012

Tentative dates for assignments, quizzes, mid semester exam and presentation:

QUIZ
CHAPTER
WEEK
DATE
1
1, 2
4
30/1/2012 – 3/2/2012
2
3
6
13/2/2012 – 17/2/2012
Mid sem exam
1,2,3
8
5/3/2012 – 11/3/2012
3
4
11
26/3/2012 – 30/3/2012
4
5,6
13
2/4/2012 – 6/4/2012
  • Assignment 1: Week 3
  • Assignment 2: Week 7
  • Assignment 3: Week 12
  • Group Project Presentation: Week 14

 

SAMPLE PROGRAMMING PROJECTS

  • Sample project reports (hardcopy) are also available, don't forget to drop by my room if you want to borrow (",)

 

[ Sem 1 2011/2012 ]

 

Assessment:

METHOD
WEIGHTAGE (%)
1) 4 Quizzes
15
2) 3 Assignments
15
3) 1 Mini Project (a group of 2-3)
15
4) MidSem Exam
15
5) Final Exam
40
Total
100 %

Lecture Notes:

WEEK/

ASSESSMENT

TOPIC
PPT NOTES/ACTIVITIES

1

Lecture:
• Computing Concepts
• Evolution of Operating systems
• Programming Languages
• Binary systems
• Development Of C and Structured Programming

2


Lecture:
• Program Planning and Design
• Program Documentation
• Top-Down program Development
• Algorithms, Pseudo-code, Flowchart
• Debugging

3


Lecture:
• Data types and Variables declarations
• Assignment statement
• Input/Output Statements

4


Lecture:
• Assignments, accumulators
• Memory and Defined Constants
• Arithmetic Expressions
• Integer/ Floating Point/ Mixed Expressions
• Operators Precedence and Associativity
• Operators: ( ), *, /, %, +, -
• Logical Operators >, >=, <, <=,!=, ==
• Formatted output

5

 


Lecture:
• Relational / Boolean expressions
• Unary Logical Operators: &&, ||, !
• Flow of Control: Selection
• Nested if statements
• Simple Selection

6


Lecture:
• Extended forms of Selection – Multi-way selection Control Structure: Repetitions
• while and do statements

7


Lecture:
• Fixed Looping: for statement
• Use of sentinels and validity checks
• Nested loops

8

 


Lecture:
• Standard library functions
• Input/output library functions
• Mathematical library functions
• Random number function

9


Lecture:
• User-defined Functions
o Function Prototypes
o Function Definitions
o Function calls
• Variable Scope
• Variable Storage Class
• Passing By Value

10


11


Lecture:
• Concepts of arrays
• Single-Dimensional and Two-Dimensional Arrays
(character excluded)

12


Lecture:
• Examples Using/Accessing Arrays
• Passing Arrays to function(pass by reference)
• Sorting and Searching Algorithms
• Application of Matrices(addition/substraction)

13

 


Lecture:
• Character Strings
• String Input and Output
• String Processing
• Array of characters

14


Lecture:
• String Processing
• Character-by character input

FINAL EXAM