CSC 103, Study Guide for Test #1 (Malone) Your first exam will be on Tuesday, September 23, 2008. The exam covers Chapters 1‐3 and any additional material that we covered in class during those discussions. It will contain definitions, completion (a word list will be provided), short answer, algorithm tracing (here’s an algorithm..what does it do?), and will have one design problem for which you’ll design a pseudocode algorithm and (maybe…not sure….) a flow chart. All exams for this course are closed book. The text and the instructor’s slides will be helpful in studying for the exam, but remember that the course material discussed in class exceeds what you’ll find there. That’s one reason why attendance is important! Also useful are the review questions and exercises at the end of each chapter. If you have any questions regarding the terms and topics listed below, please contact me as soon as possible via [email protected] or visit me during my office hours. Chapter 1 Terms: Computer, program, programmer, binary code, algorithm, computer programming, programming language, implementation of software, maintenance of software, systems analysis, program specifications, program design, program verification, software engineering, assembly language, interpreter, compiler, sequence control structure, selection control structure, looping control structure, divide & conquer, solutio n by analogy, trial and error, top‐down design with stepwise refinement, levels of abstraction, ASCII string, source code, syntax error, logic error, runtime error, overflow, IDE (integrated development environment) Topics: Be able to… • List the five criteria that an algorithm must meet (from a rigorous computer programming perspective) • Determine if a list of steps meets the criteria for an algorithm as defined for the above bullet. • Explain why not all problems can be solved by computers. • List the 3 main steps in software development and briefly describe what happens in each step. • Briefly describe the differences between the 1st, 2nd, & 3rd generation of programming languages. • List two advantages of 3rd generation languages over 2nd generation languages. • Describe the difference between an interpreter and a compiler. • List & describe three approaches to problem solving and the pros/cons of each. • Draw a structure chart using top‐down design with stepwise refinement for a simple problem ( one from daily life, such as “make a bed”). • How computers store strings (hint: think ASCII!). • Distinguish among a syntax error, a logic error, and a runtime error. Chapter 2 Terms: Input, processing, output, pseudocode, flow chart, debugging, source code, object code, executable code, variable, named constant, systems analysis, variable assignment using set or using Å, modulus operation, data types (integer, real, string), variable declaration, initialization of variables Topics : Be able to… • List a couple of examples of design tools • Explain why design is the foundation of good programming—ie why is design so important? • Describe (usual) naming conventions for variables. • Explain this: source code Æ object code Æ executable code. • Explain why executable code is usually much bigger than object code. • Explain why (systems) analysis is so important. (Hint: that’s what leads to the specifications document.) • Trace an algorithm written in pseudocode; displayed as a flow chart. • Perform math such as this: What is 18 mod 5? • Use the proper “order of operations” for mathematical operations. (Hint: Multiply before add?) • Translate a mathematical formula into pseudocode. • Explain why integer division can be tricky when done in a computer program. • What is the purpose of initializing a variable? • Given a chunk of pseudocode, tell what’s wrong with it—ie why doesn’t it work properly? • Advantage of using named constants in a program. • Hand trace one or more algorithms. Chapter 3 Terms: Module, local variable, argument, parameter, global variable, global constant, header of a module, body of a module, “calling” a module, hierarchy chart, scope, pass‐by‐value, pass‐by‐reference, value parameter, reference parameter, Topics: Be able to… • List and explain at least four advantages to modular (vs non‐modular) programming. • Write pseudocode (accordi ng to the text’s conventions) using modules • Describe (usual) naming conventions for modules. • Explain (or trace) the flow of control when a module is called and executed. • How to flowchart with modules. • How a hierarchy chart differs from a structure chart. • Describe the scope of a variable. • Why argument & their corresponding parameters should have the same or compatible data types.1 • Given a module that calls another module, list the values of the arguments at the time of the call and the value of the arguments after the called module has terminated. • Explain the difference between a pass‐by‐value and a pass‐by‐ reference parameter—ie under what circumstances would you choose one over the other. • Explain why you should not use global variables; why global constants are considered ok. • Explain the purpose of first designing an algorithm in English before converting it to pseudocode. • Explain the purpose first designing an algorithm in pseudocode before converting it to a programming language. 1 The text states that for our use with this textbook we’ll assume that they have the same data types, but some programming languages don’t have that strict requirement as long as the data types are “compatible”. In either case, explain why we need to pay attention to that and understand its importance.