Introduction To Programming Logic – Coursework Example
Introduction to logic programming Introduction Programming requires an effective understanding of the various generic methods usedin generating the program codes. Before undertaking any programming task, a programmer must understand the layout of a computer. This requires them to understand both the applied side and the theoretical side to computer science (Ehud, 1989). The applied side involves such essential functions as software design and the actual programing while theoretical side refers to facets that enhance the functionality of the programs. Such functions as optimizing algorithms, sorting and path finding are vital in enhancing the functionality of an actual program. As such, a programmer must understand the relationship between the two sides of the science in order to develop a functional computer program.
Programmers use various generic methods in programming, which include divide-and-conquer, brute force and backtracking. Brute force considers every element in the programming as an array regardless of their importance (Bagranoff, Simkin & Strand, 2008). Greedy on the other hand just as the name suggests provides priority to the largest portion of the problem before considering the remaining portions. Backtracking is unique method that begins with the determination and analysis of the solution before trailing the source of the problem. This way it provides sequential flow of programs without instances of error. As such, programmers are designers and must therefore observe specific design principles in order to ensure that they design functional programs (Chitta & Michael, 1994). The design concepts include problem solving. Programmers must determine and work towards solving a problem. This safeguards the functionality of the programs in solving identifiable problems. Other concepts include negation as a failure and knowledge representation.
Bagranoff, N. A.,, Simkin, M. & Strand, M. G. (2008). Core concepts of accounting information system (10th Edition). Hoboken: Wiley.
Chitta, B. & Michael, G. (1994). Logic programming and knowledge representation Journal of Logic Programming. Vol. 19, 73-148.
Ehud, S. (1989). The family of concurrent logic programming languages. New York: ACM Computing Surveys.
Foster, J. M & Elcock, E.W. (1968). An Incremental Compiler for Assertions: an Introduction, Machine Intelligence 4. Edinburgh: U Press.
Joshua, H. & Dale, M. (1994). Logic Programming in a Fragment of Intuitionistic Linear Logic, Information and Computation,110(2), 327-365.
Lloyd, J. W. (1987). Foundations of Logic Programming (2nd edition). New York: Springer Verlag.
Sprankle, M. (2006). Problem solving and programming concepts (7th Edition). Upper Saddle River: Prentice Hall.