01:198:111 Lecture Notes - Lecture 10: Call Stack, Compile Time, Pseudocode

76 views4 pages
Verified Note
9 Oct 2018
Professor

Document Summary

01:198:111 intro to computer science / professor gunadawerna. This technique divides a large problem into simpler, smaller problems to be solved in an easier way. Procedures, functions, methods these terms do refer to different forms of functions; however, there isn"t much difference and can be seen as same things . The main function should be placed underneath all other functions, in one file. Usually, people use either function or method (in one atom program file) Those bunch of sub-functions is called library all together. The main function actually doesn"t do anything special other than testing out if the other sub-functions work or not . How the functions are evaluated in run-time stack: When you call the function ( ex. calculatepayment()) by putting in local variables (as known as acutal arguments) in the parameter, the run-time stack makes a. Calling the calculatepayment function: calculatepayment( [a double], [a double], [an int] )

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