×
BE SO GOOD THEY CAN'T IGNORE YOU
--Your friends at LectureNotes
Close

Note for Problem Solving And Programming In C - PSPC by Baljinder Singh

  • Problem Solving And Programming In C - PSPC
  • Note
  • Biju Patnaik University of Technology Rourkela Odisha - BPUT
  • 14 Topics
  • 1142 Views
  • 23 Offline Downloads
  • Uploaded 1 year ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-3

problem-solving. r different people. Problem definition phase effort to come to terms with or understand the problem at hand. fully understand what it is we are trying to solve. phase. In other words, what we must do during this phase is work out what must be done rather than how to do it. we must try to extract from the problem statement (which is often quite imprecise and maybe even ambiguous) a set of precisely defined tasks. A skill that it is important to try to develop in problem-solving is the ability to view a problem from a variety of angles. out, sideways, backwards, forwards and so on. Once one has developed this skill it should be possible to get started on any problem. ComputerProblem-Solving (Using computer as a problem solving tool)

Text from page-4

Figure 6.2 The computer problemsolving process Figure 6.3: The Interactions between Problem-Solving Phases Problem-Solving Phase solution) into a programming language. the results. If you find errors, analyze the program and the algorithm to determine the source of the errors, and then make corrections.

Text from page-5

Maintenance Phase eet changing requirements or to correct any errors that show up while using it. General problem-solving strategies and-conquer strategy. its that we can handle -and-conquer approach can be applied over and over again until each subtask is manageable This way of breaking down the solution to a problem has found wide application in particular with sorting, selection, and searching algorithms. Another general problem-solving strategy that we will briefly consider is that of dynamic programming.

Text from page-6

method is used most often when we have to build up a solution to a problem via a sequence of intermediate steps. A dynamic programming algorithm remembers past results and uses them to find new results zation problems ‖ one ‖ and ―overlapping sub-problems‖ not overlap This method relies on the idea that a good solution to a large problem can sometimes be built up from good or optimal solutions to smaller problems. problems that one frequently encounters in operations research. -and-bound evaluations are all variations on the basic dynamic programming idea. Algorithm- (ăl`gərĭth'əm) or algorism (–rĭz'əm) [for Mohd. Al-Khowarizmi] problem, breaking it into manageable pieces, and developing a general solution for each piece called an algorithm.

Lecture Notes