You are on page 1of 3

IT 31- Programming 1

Course Description This course introduces the students to the fundamentals of logic formulation together with their implementation in the C programming language. This course should serve as a foundation for students in the Bachelor of Science in Information Technology program. Course Objectives 1. 2. 3. 4. 5. 6. 7. Learn the components in problem solving Explore the strategies in problem solving in relation to procedural programming Analyze problems Design algorithms to solve problems Implement algorithms in a programming language Test programming solutions to problems Apply recursion as a programming solution

******************************************************************************************* Introduction Topic: GUIDELINES TO ACHIEVE GOOD PROGRAMMING 1. Make sure you understand the problem you are trying to solve. *You understand what the question is asking. 2. Once you have a clear picture in your mind of the problem, you should write out the specifications that the program is to satisfy. * Consider the specification (requirement or condition) of the program. For example, how are the numbers to be input into the program? Should the program be able to sort integers or real numbers as well? 3. Having decided exactly what the specifications of the program are, you must now consider the coding of it. Proper Topic: Algorithm An algorithm (method, procedure, or technique) is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. Algorithms are used for calculation, data processing, and automated reasoning. Expressing algorithms Algorithms can be expressed in many kinds of notation, including natural languages, pseudocode, flowcharts, programming languages or control tables (processed by interpreters). Natural language expressions of algorithms tend to be verbose and ambiguous, and are rarely used for complex or technical algorithms. Pseudocode, flowcharts and control tables are structured ways to express algorithms that avoid many of the ambiguities common in natural language statements. Programming languages are primarily intended for expressing algorithms in a form that can be executed by a computer, but are often used as a way to define or document algorithms.

A flowchart is a type of diagram that represents an algorithm or process, showing the steps as boxes of various kinds, and their order by connecting these with arrows

Genevev G. Reyes CCIT Laboratory Instructor

IT 31- Programming 1

Pseudocode is an artificial and informal language that helps programmers develops algorithms. Pseudocode is a "text-based" detail (algorithmic) design tool.

Example of Algorithm Natural Language


How to prepare 3in1 hot coffee 1. Pour coffee mix in the mug 2. Pour 220ml hot water 3. Stir and enjoy How to use shampoo 1. Wet hair 2. Massage onto scalp 3. Lather(bubble) and rinse

Flowchart and Pseudocode

Flowchart

Pseudocode

Flowchart

Pseudocode

Flowchart Genevev G. Reyes CCIT Laboratory Instructor

Pseudocode

IT 31- Programming 1

Genevev G. Reyes CCIT Laboratory Instructor

You might also like