You are on page 1of 3

Code 

     :  CSC415
Course  :  Fundamentals Of Computer Problem Solving
Level  :  Degree
Credit Unit  :  3
Contact Hour  :  4 (2 + 2 + 0)
Part  :  1
Course Status  :  Core
Prerequisite  :  None

Course Outcomes : 

After completing this course, the student should able to:

  identify the steps in problem solving

 state the problem according to a given requirement

 write a simple computer program using structured approach

 adopt a good algorithm-writing style

Course Description : 

This course is an introduction to problem solving using computers. It emphasizes various aspects of problem
solving, mainly consisting of the problem domain, phases of problem solving and basic techniques in designing
a solution.

The approach to problem solving is via structured programming. At this stage, the emphasis will be on
computer problem solving rather than syntactical aspects of the chosen programming language.

Syllabus Content

Introduction To Computer Programs


•  A Brief History of Programming Language
•  Introduction to Programming
-  What is a computer program and importance of computer programming
-  Importance of good programs.
-  Relationship between compilers, interpreters, assemblers and programs
•  Program Development Life Cycle
-  Problem solving phases; problem definition, algorithm  design and implementation
-  analysis, design, coding, maintenance

Basic Elements Of A Computer Program


  Identifier, variable, constant
  Data variables, data types and rules for naming and declaring data variables
  Basic data types
  Arithmetic operators
  Assignment statement
  Input/output statement – fix data, keyboard, file
  Arithmetic expression
  Debugging and error handling
  Sequential control structure

Selection Control Structure


  Boolean expression
  Relational and logical operators
  Decision Control Instructions
-  One way selection
-  Two way selection
-  Multiple selection

Repetition Control Structure


  Counter-controlled structure
  Sentinel-controlled structure
  Flag-controlled structure
  While Loop
  For loop
  Do While
  Nested loop

Functions
  Introduction to Functions
  Function declaration/prototype
  Function definition
  Function call
  Built in function – math and string function
  User defined function
  Pass by value, pass by reference

Arrays
  Definition of array
  Array Declaration
  Array Initialization
  Accessing individual elements of an array
  Searching and sorting element in array

Teaching Methodology: 

A combination of any of the following methods:


  Lectures
  Laboratory

Assessment: 

Final examination – One 3-hour paper  : 60%


Course Work (Continuous assessments; assignments, quizzes, tests) : 40%

Recommended Text (if any): 

Malik, D.S., C++ Programming: From Problem Analysis To Program Design, Course Technology, 2002.

References: 

1.  Farrell, Joyce,  Programming Logic and Design Comprehensive,  2nd edition, Course Technology 2002.
2.  Zak, Dianne,  An Introduction to Programming with C++, 2nd edition, Course Technology, 2001.
3.  Robertson, Lesley,  Simple Programming Design, 3rd edition, Course Technology, 2000.
4.  Kenneth A. Lambert, Nance,  Understanding programming and Problem Solving with C++, West Publishing,
1996.
5.  Stroustrop, Bjarne,  The C++ Programming Language, Reading Mass, Addison Wesley, 1991.

You might also like