四川大学程序设计基础Programming Fundamentals教学大纲

College of Software EngineeringUndergraduate Course SyllabusCourse ID 311008040Course Name Programming FundamentalsCourseAttribute□Compulsory □Selective Course Language □English □Chinese Credit Hour 4 Period 80Semester □First Fall □First Spring □Second Fall □Second Spring □Third Fall □Third Spring □Fourth Fall □Fourth Spring Instructors ZHAO Hui, YANG Pin, SHU Li, RUAN ShuhuaDescription Introduces the fundamental concepts of procedural programming. Topics include data types, control structures, functions, arrays, files, and the mechanics of running, testing, and debugging. The course also offers an introduction to the historical and social context of computing and an overview of computer science as a discipline. This course also provide the basic concepts of Object-Oriented Programming and Servlet.Prerequisites Introduction to Computer SystemsTextbook JA V A: How to Program(6th ed.), H.M.Deitel, P.J.Deitel, Prentice Hall,2004 Resource Grading Assignments (10%) Projects(20%) Lab.(20%)Final exam (50%)Topics Ch1 Fundamental programming constructs (10H)•Basic syntax and semantics of a higher-level language•Variables, types, expressions, and assignment•Simple I/O•Conditional and iterative control structures•Functions and parameter passing•Structured decomposition•Case Study: Introduction to JavaLearning objectives:1.Analyze and explain the behavior of simple programs involving thefundamental programming constructs covered by this unit.2.Modify and expand short programs that use standard conditional anditerative control structures and functions.3.Design, implement, test, and debug a program that uses each of thefollowing fundamental programming constructs: basic computation, simple I/O, standard conditional and iterative structures, and the definition of functions.4.Choose appropriate conditional and iteration constructs for a givenprogramming task.5.Apply the techniques of structured (functional) decomposition tobreak a program into smaller pieces.6.Describe the mechanics of parameter passing.Ch2 Algorithms and problem-solving (10H)•Problem-solving strategies•The role of algorithms in the problem-solving process•Implementation strategies for algorithms•Debugging strategies•The concept and properties of algorithms•Case Study: Introduction to JavaLearning objectives:1.Discuss the importance of algorithms in the problem-solvingprocess.2.Identify the necessary properties of good algorithms.3.Create algorithms for solving simple problems.e pseudocode or a programming language to implement, test, anddebug algorithms for solving simple problems.5.Describe strategies that are useful in debugging.Ch3 Fundamental data structures (20H)•Primitive types•Arrays•Records•Strings and string processing•Data representation in memory•Static, stack, and heap allocation•Runtime storage management•Pointers and references•Linked structures•Implementation strategies for stacks, queues, and hash tables •Implementation strategies for graphs and trees•Strategies for choosing the right data structure•Case Study: Introduction to JavaLearning objectives:1.Discuss the representation and use of primitive data types andbuilt-in data structures.2.Describe how the data structures in the topic list are allocatedand used in memory.3.Describe common applications for each data structure in the topiclist.4.Implement the user-defined data structures in a high-levellanguage.pare alternative implementations of data structures with respectto performance.6.Write programs that use each of the following data structures:arrays, records, strings, linked lists, stacks, queues, and hash tables.pare and contrast the costs and benefits of dynamic and staticdata structure implementations.8.Choose the appropriate data structure for modeling a given problem. Ch4 Recursion (10H)•The concept of recursion•Recursive mathematical functions•Simple recursive procedures•Divide-and-conquer strategies•Recursive backtracking•Implementation of recursion•Case Study: Introduction to JavaLearning objectives:1.Describe the concept of recursion and give examples of its use.2.Identify the base case and the general case of a recursively definedproblem.pare iterative and recursive solutions for elementary problemssuch as factorial.4.Describe the divide-and-conquer approach.5.Implement, test, and debug simple recursive functions andprocedures.6.Describe how recursion can be implemented using a stack.7.Discuss problems for which backtracking is an appropriate solution.8.Determine when a recursive solution is appropriate for a problem. Ch5 Event-driven programming (10H)•Event-handling methods•Event propagation•Exception handling•Case Study: Introduction to JavaLearning objectives:1.Explain the difference between event-driven programming andcommand-line programming.2.Design, code, test, and debug simple event-driven programs thatrespond to user events.3.Develop code that responds to exception conditions raised duringexecution.Ch6 Software development methodology (10H)•Fundamental design concepts and principles•Structured design•Testing and debugging strategies•Test-case design•Programming environments•Testing and debugging tools•Case Study: Introduction to JavaCh7 Social context of computing (10H)•History of computing and computers•Evolution of ideas and machines•Social impact of computers and the Internet•Professionalism, codes of ethics, and responsible conduct•Copyrights, intellectual property, and software piracyTools &JDK 5 or 6, Eclipse 3.2EnvironmentProjects ATMVersion No： 1.0Author：Hui Zhao Date： 2008-7 -15Auditor： Mei Hong Date： 2008-7-25Signature of leader：Date： 2008-7-30。