1. TMC 1414 Introduction to Programming

2. Lecturer Johari Abdullah Office : Admin Office, Level 3, Block A FCSIT
Mobile No:
FB: Johari Abdullah

3. Course Outline
This course provides a general introduction to programming language.
It is designed to give students the ability to write simple console programs and to be able to understand such programs written by others.
The course covers problem solving skills, writing algorithms, basic programming syntax, control structures (loops, if statements, switches), functions and input/output operations.
The course forms part of a core courses for the undergraduate program within the faculty, and provide programming foundation for other courses.

4. Lectures/Tutorial Group 1
Tuesday
9.00 am am
Tutorial Room 7 (TR7)
Lab slot
Friday
2.30pm-4.30 pm
Lab Network 1, Level 1, Block A, FCSIT

5. Lectures/Tutorial Group 2
Lecture/Tutorial slot
Monday
4.00 pm pm
OS lab
Lab slot
Thursday
6.00 pm-8.00 pm
Teaching Lab 2

6. Course Content are available online
Register yourself at Morpheus for the online content of this course
Please visit Morpheus for announcements, lecture notes, assignments, lab question(s), forum interaction and etc.

7. Assessment Lab Tests (Two Lab Test) – 5%  Assignments– 15% 
Group Project –20% 
Mid Term Exam – 20% 
Final Exam – 40%

8. ITP Workshop
For students who obtain less than 50 marks for their lab test2 exams they are advised to attend the ITP workshop conducted during the midterm break.
Students that are identified by a lecturer to attend the workshop are advised to attend
Students who would like to attend the workshop voluntarily can also do so but slots are subjected to availability.
Attendance will be taken
Progress of students during the workshop before and after the workshop will be monitored

9. Syllabus Lecture 1: Introduction  Definition of computer
 What is Programming?
 History and type of programming languages
 Programming process
Lecture 2: Problem Solving and Algorithms
 What is problem solving
 The software Development method of problem solving;
 Steps in the software development method;
 Design and representation of algorithms
 Programming errors and debugging
 Program verification and testing
 Program documentation
Lecture 3: Fundamental of Programming
 The programming language character set and tokens
 Programming language Structure
 Programming language Styles
Lecture 4 : Control Structure
 Selection Structures
 Repetition control Structures
Lecture 5: Arithmetic Calculation
 Basic Arithmetic operators
 Type of Arithmetic expression

10. Syllabus  Searching array Lecture 6 : Functions
 Function definitions
 Function prototypes
 Calling function : by value and by reference
 Random Number Generation
 Storage classes
 Scope Rules
 Recursion
Lecture 7 : Array
 Defining arrays
 Array Examples
 Passing arrays to Functions
 Sorting array
 Searching array
Lecture 8 : Pointer
 Pointer variable Definitions and initialization
 Pointer operators
 Passing arguments to function by reference
 Pointer expressions and pointer arithmetic
 Arrays of pointers
 String manipulation Functions of the string handling library
 Comparison functions of the string handling library
 Search functions of the string handling library

11. Syllabus Lecture 9 : Characters and strings
 Fundamentals of strings and characters
 Character Handling Library
 String conversion Functions
 Standard Input/output Library Functions
 String manipulation Functions of the string handling library
 Comparison functions of the string handling library
 Search functions of the string handling library
Lecture 10 : Formatted Input/output
 Streams
 Formatting output with printf
 Printing integers
 Printing floating point numbers
 Printing Strings and Characters
 Others conversion Specifies
 Printing with field widths and precision
 Printing literals and escape sequences
 Reading formatted input with scanf
Lecture 11 : Basic Data Structures
 Structure Definition and Initialization
 Accessing Members of Structures
 Using Structures with Functions
 Typedef
 Unions
 Bitwise Operators
 Bit Fields
 Enumeration Constants

12. Syllabus Lecture 12: File Operation  The Data Hierarchy  Files
 Sequential Access File
 Random Access Files

13. Reference Books
C How to Program, Seventh Edition by Deitel and Deitel. Pearson Education (Main Reference Book)
C by Example by Greg M.Perry. QUE corporation
Programming Language Essentials, Henri E.Bal, Dick Grune, Addison-Wesley
Problem Solving using C, Uckan, Irwin publishing.
A book on C, Kelly&Pohl, Addison Wesley

14. Thank You