GE3151 Chapter Notes - Chapter unit 1: Pseudocode, Problem Solving, Procedural Programming

9 views38 pages
23 Apr 2023
Department
Course
Professor

Document Summary

Fundamentals of computing identification of computational problems-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: problem solving. Problem solving is the systematic approach to define the problem and creating number of solutions. The problem solving process starts with the problem specifications and ends with a. Problem solving technique is a set of techniques that helps in providing logic for solving a problem. Problem solving can be expressed in the form of: algorithms, flowcharts, pseudo codes, programs. It is defined as a sequence of instructions that describe a method for solving a problem. In other words it is a step by step procedure for solving a problem. Each and every instruction should be precise and unambiguous.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions