Course: Programming Fundamentals, Section: TOPIC 1: INTRODUCTION TO PROBLEM SOLVING

General

Course Leader Details Forum

Ms. Noor Zuhaili bt Md Yasin

Master of Computer Science (Software Engineering), Universiti Putra Malaysia

Field of study: Software Engineering, Programming, Knowledge Management (Ontology)

: zuhaili@nilai.edu.my

S222, Science Block (School of Computing, FEST)

: 017 3464414

Thursday (10-12pm), Friday (8-10am)

Course Guide

Topic 1	Introduction To Problem Solving
	1.1	Problem Identification
	1.2	Basic Introduction to Programming Lifecycle
	Summary



Topic 2	Usage of the Program Development Environment
	2.1	Introduction to Program Environment
	2.2	Stages to Produce Programs
	2.3	Using the Editor


Topic 3	Structured Program Design
	3.1	Program Design Concepts
	3.2	Several Methods for Programming Design
	3.3	Algorithms
	3.4	Applications in Programming Environment
	Summary


Topic 4	Fundamentals of Programming
	4.1	Introduction to Syntax and Semantics
	4.2	Introduction to Basic Input/ Output Statements
	Summary


Topic 5	Basic Data Types and Declarations
	5.1	Integer numbers
	5.2	Real Numbers, fixed and floating point format
	5.3	String and Characters
	Summary


Topic 6	Constants and Variables Declarations
	6.1	Constants Declarations
	6.2	Variables naming and regulations
	6.3	Assignment statement using specific variables
	Summary


Topic 7	Arithmetic Operations
	7.1	Addition, substraction, multiplication, division, modules
	7.2	Operators Precedence
	7.3	Arithmetic Expressions
	Summary


Topic 8	Selection Constructs
	8.1	Relational and Logical Operators
	8.2	IF Statement
	8.3	Multiple IF Statements
	8.4	Other Constructs- elif
	Summary


Topic 9	Iteration Constructs
	9.1	For Loop
	9.2	While Loop
	Summary
	Key Terms
			50

Topic 10	Functions
	10.1	Built in Functions
	10.2	Programmer Defined Functions
	10.3	Parameter Passing
	Summary


Topic 11	Array
	11.1	Declarations of Arrays
	11.2	Access elements of an Array
	11.3	The length of an Array
	11.4	Adding Array element
	11.5	Removing an Array
	11.6	Array Methods
	Summary

You may download the following points to note and cover page thru the link:

1. https://drive.google.com/file/d/1VCkzl6n1_u79t3Dvw94ut-F0HMoheBJS/view?usp=share_link
2. https://drive.google.com/file/d/11QHdYjYXW9kui3agRj8ls-DGMp_O6I4-/view?usp=share_link

INTRODUCTION TO THE COURSE

Hi!

Welcome to OEC3102 Programming Fundamentals

OEC3102 introduces the fundamental programming concepts and principles. It emphasises on the practical aspects about the programming language and to solve the intended problems using the specified technique.

It covers the fundamental concepts of program design and the skills of a programming method. The applications of these skills encourage the well-structured and documented program by using Python programming language. This is intended to develop the skill of program design and programming in a chosen programming language. This material provides a basis for program development throughout the fields.

Good luck & enjoy learning.

CONTINUOUS ASSESSMENT SCHEDULE

This course is assessed by both coursework and examination.

NZMY~

TOPIC 1: INTRODUCTION TO PROBLEM SOLVING

LEARNING OUTCOMES

By the end of this topics, you will be able to:

1. Explain the essence of computational problem solving

2. Explain what a computer algorithm is

3. Describe about program development life cycle

1.0 ALGORITHMIC PROBLEM SOLVING

Algorithms, building blocks of algorithms (statements, state, control flow, functions), notation (pseudo code, flow chart, programming language), algorithmic problem solving, simple strategies for developing algorithms (iteration, recursion). Illustrative problems: find minimum in a list, insert a card in a list of sorted cards, guess an integer number in a range, Towers of Hanoi.

1.1 Algorithms

What is algorithm?

An algorithm is a collection of well-defined, unambiguous and effectively computable instructions ,if execute it will return the proper output.

well-defined- The instructions given in an algorithm should be simple and defined well.

Unambiguous- The instructions should be clear,there should not be ambiguity .

Effectively computable- The instructions should be written step by step ,which helps computer to understand the control flow .

We often use algorithm in our day-to-day life,but when and how?

Our cooking receipe

Our daily routine as a student

When we buy something

When we go outing

Our class routine

How it helps?

How an algorithm should be?

It should be in simple English,what a programmer wants to say. It has a start,a middle and an end. Probably an algorithm should have,

Start

1. In the middle it should have set of tasks that computer wants to do and it should be in simple English and clear.

2. To avoid ambiguous should give no for each step.

Stop

1.2 PROGRAM DEVELOPMENT LIFE CYCLE

When we want to develop a program using any programming language, we follow a sequence of steps. These steps are called phases in program development. The program development life cycle is a set of steps or phases that are used to develop a program in any programming language.

Generally, the program development life cycle contains 6 phases, they are as follows:

Problem Definition
Problem Analysis
Algorithm Development
Coding & Documentation
Testing & Debugging
Maintenance

Summary

In this topic, you have learnt that on how to solving a problem.

When solving a computational problem, either suitable existing algorithms may be found or new algorithms must be developed. Example, for the Traveling Salesman problem, there are various (nontrivial) algorithms that can be utilized, as mentioned, for solving problems with tens of thousands of cities. Finally, for the game of chess, since it is infeasible to look ahead at the final outcomes of every possible move, there are algorithms that make a best guess at which moves to make. Algorithms that work well in general but are not guaranteed to give the correct result for each specific problem are called heuristic algorithms.

Program Implementation

Then, you are able to design decisions provide general details of the data representation and the algorithmic approaches for solving a problem. The details, however, do not specify which programming language to use, or how to implement the program. That is a decision for the implementation phase. Since we are programming in Python, the implementation needs to be expressed in a syntactically correct and appropriate way, using the instructions and features available in Python.

Program Testing

As humans, we have abilities that far exceed the capabilities of any machine, such as using common sense reasoning, or reading the expressions of another person. However, one thing that we are not very good at is dealing with detail, which computer programming demands. Therefore, while we are enticed by the existence of increasingly capable computing devices that unfailingly and speedily execute whatever instructions we give them, writing computer programs is difficult and challenging. As a result, programming errors are pervasive, persistent and inevitable. However, the sense of accomplishment of developing software that can be of benefit to hundreds, thousands, or even millions of people can be extremely gratifying. If it were easy to do, the satisfaction would not be as great.

Given this fact, software testing is a crucial part of software development. Testing is done incrementally as a program is being developed, when the program is complete, and when the program needs to be updated.

By refer to this video lecture, you will get better understanding in this topic.

Duration: 1 hour

Topic 1- Video Lecture (1 hour) File
Self-Check 1.1: Test Yourself(Duration 2 hours) Quiz

Restricted Not available unless: The activity Topic 1- Video Lecture (1 hour) is marked complete
Self-Check 1.2: Duration 2 hours

Restricted Not available unless: The activity Self-Check 1.1: Test Yourself(Duration 2 hours) is marked complete
SIM Lecture Note- Topic 1 (Duration: 3 hours) File

Dear All,
Kindly check the note from the SIM for this topic. 😀
Test it! - 2 hours Quiz

1. A good definition of computer science is “the science of programming computers.” (TRUE/FALSE)

2.         Which of the following areas of study are included within the field of computer science?

(a)        Software engineering

(b)        Database management

(c)        Information security

(d)       All of the above

2. In order to computationally solve a problem, two things are needed: a representation of the problem and that solves it.

3. Leaving out detail in a given representation is a form of   .

4. A “brute-force” approach for solving a given problem is to:

(a) Try all possible algorithms for solving the problem.

(b) Try all possible solutions for solving the problem.

(c) Try various representations of the problem.

(d) All of the above

5. For which of the following problems is a brute-force approach practical to use?

(a) Man, Cabbage, Goat, Wolf problem

(b) Traveling Salesman problem

(c) Chess-playing program

(d) All of the above
Check your knowledge- 2 hours Quiz

1. Which of the following are true of an algorithm?

(a) Has a finite number of steps

(b) Produces a result in a finite amount of time

(c) Solves a general problem

(d) All of the above

2. Algorithms were first developed in the 1930–1940s when the first computing machines appeared. (TRUE/FALSE)

3. Algorithms and computers are a “perfect match” because: (Select all that apply.)

(a) Computers can execute a large number of instructions very quickly.

(b) Computers can execute instructions reliably without error.

(c) Computers can determine which algorithms are the best to use for a given problem

General

TOPIC 1: INTRODUCTION TO PROBLEM SOLVING

TOPIC 1: INTRODUCTION TO PROBLEM SOLVING

Contact Us