# ITGS113 : Problem solving Technic

### Department

Department of Information Systems

Bachelor in Information Systems

General

03

### Overview

This course introduces the student to different heuristic techniques that aid programmers and computer scientists in solving problems. The course uses classical math and word problems for generating potential solutions to ''real-life'' problems encountered in the profession, and problem solving in teams. Topics covered include: Errors in reasoning; verbal reasoning; analogy problems; heuristics; mathematical word problems; analysis of trends; lateral thinking; deductive and hypothetical reasoning; computational problem solving; problem solving in-the-large; generating, implementing, and evaluating solutions; discrete mathematics, statistics; interpersonal problem solving.

### Knowledge &understand

• The student draws a problem using computer algorithms and flowcharts.
• Students remember how to use conditionals.
• The student enumerates the different types of rotation methods, and the student explains how to use each one of them.
• The student describes matrices and explains the difference between a one-dimensional matrix and a two-dimensional matrix.

### mental skills

• The student analyzes the problem using computer algorithms and flowcharts.
• The student distinguishes how to use conditional sentences.
• The student proposes rotation techniques and compares how each one is used.
• The student analyzes matrices and deduces the difference between a one-dimensional matrix and a two-dimensional matrix.

### Practical & professional skills

• The student diagnoses the problem using computer algorithms and flowcharts.
• The student uses conditional sentences.
• The student performs the circulation techniques and distinguishes how to use each of them.
• The student stores the entries using arrays.

### General and transferable skills

• The student is able to solve problems
• The ability to communicate and communicate
• Time management ability
• The student is able to solve problems

### Teaching and learning methods

• Lectures
• Tutorials
• Problem-based learning

### Methods of assessments

• Midterm Exam = 30
• Assignments = 10
• Mini-project = 10
• Final Exam = 50

### Course contents

• Algorithm
• Flowchar
• tracking algorithms
• exercises
• If statement
• and exercises
• Simple – Loops programes
• Loops programs Loop styles
• Exam
• sequencers
• nested loops
• One-dimensional arrays
• Two-dimensional matrices
• exercises