📄 http:^^www.cs.bu.edu^faculty^kfoury^cs111-fall96^schedule.html
字号:
Date: Tue, 14 Jan 1997 23:00:47 GMTServer: NCSA/1.5Content-type: text/html <HTML> <HEAD><TITLE>BU CLA CS 111: Introduction to Computer Science I ---Home Page </TITLE></HEAD> <BODY> <H2> <!WA0><A href="http://web.bu.edu/pagetwo.html">BU</A>CLA <!WA1><A href="http://math.bu.edu/">CS</A> 111: <!WA2><A href="http://www.cs.bu.edu/faculty/kfoury/CS111-Fall96/home.html">Introduction to Computer Science I</A> <P> Fall 1996 </H2> <H2>Schedule </H2><HR> All section references are to the textbook,<EM>A Book on C</EM>, by Kelley and Pohl, Third Edition. <HR> <DL> <DT>96.09.03 <DD> Goals, methods, overview of entire course, relation to other courses. Structure of a computer: Memory unit, central processing unit, input/output unit. <DT>96.09.05 <DD> More on course organization. Assignment 1 accessible through the home page, due Friday Sept 13. Analysis of the program in Section 1.2, pages 5-8. <DT>96.09.10 <DD> Statements for control flow: <EM>if</EM> statement, <EM>else</EM> statement, <EM>while</EM> statement. Section 1.6, pages 19-23. Use of flowcharts to design programs. <DT>96.09.12 <DD> Statements for control flow: More on <EM>while</EM> statement, introduce <EM>for</EM> statement. Nesting of <EM>while</EM> loops and <EM>for</EM> loops. Example of a program with nested <EM>for</EM> loops to print the multiplication table. <DT>96.09.17 <DD> Comments, keywords, constants, variables. Sections 2.1 to 2.6. <DT>96.09.19 <DD> Program examples: "powers-of-2" program, page 83, and "print-random-numbers" program, page 86. <DT>96.09.24 <DD> Precedence and associativity of operators: Sections 2.8 to 2.11. Program examples from Chapter 3, on pages 114, 116 and 117. <DT>96.09.26 <DD> Statements for control flow: More on <EM>if</EM> statement and <EM>else</EM> statement (Section 4.7), more on <EM>while</EM> statement (Section 4.8), more on <EM>for</EM> statement (Section 4.9). Program example from Chapter 4, page 149. <DT>96.10.01 <DD> Statements for control flow: More on <EM>for</EM> statement (Section 4.11), introduce <EM>do</EM>, <EM>goto</EM>, <EM>break</EM>, <EM>continue</EM>, and <EM>switch</EM> statements (Section 4.12, Sections 4.14-4.16). <DT>96.10.03 <DD> Function definitions (Sections 5.1, 5.2), function prototypes (Section 5.3), program example from the book (Section 5.4). <DT>96.10.08 <DD> Function definitions. Local and global variables. Formal and actual parameters. Function invocation (Section 5.7). Scoping rules (Section 5.10). <DT>96.10.10 <DD> Function definitions, again. Local and global variables, again. Recursion (Section 5.14). <DT> <DT>96.10.15 <DD> No class (Monday Schedule). <DT>96.10.17 <DD> Mid-term test. <DT>96.10.22 <DD> One-dimensional arrays, integer arrays, char arrays (Section 6.1). <DT>96.10.24 <DD> Two and three-dimensional arrays (Section 6.12). Pointers (Section 6.2). <DT>96.10.29 <DD> Call-by-reference (Setion 6.3), relationship between arrays and pointers (Section 6.4), bubble sort (Section 6.7). <DT>96.10.31 <DD> Pointer airthmetic (Setion 6.5), arrays as function arguments (Section 6.6), strings (Section 6.10). <DT>96.11.05 <DD> The use of <EM>#include</EM> and <EM>#define</EM> (Sections 8.1, 8.2). Macro definitions (Section 8.3), type defiitions (Section 8.4), the operators <EM>#</EM> and <EM>##</EM> (Section 8.10), the <EM>assert</EM> macro (Section 8.11). <DT>96.11.07 <DD> Strings and string handling functions in the standard library (Sections 6.10 and 6.11). <DT>96.11.12 <DD> More examples of functions handling arrays and pointers: linear search and binary search. <DT>96.11.14 <DD> More examples using the type qualifier <EM>const</EM> (Section 6.19). Functions as arguments (Section 6.16). <DT>96.11.19 <DD> Functions as arguments again (Section 6.16). Structures, accessing members of a structure, initialization of structures (Section 9.1-9.5). <DT>96.11.21 <DD> Enumeration types (Section 7.5). More on structures (Section 9.1-9.5). Unions (Section 9.7). <DT>96.11.26 <DD> More on structures and unions (Section 9.1-9.7). Bit fields (Section 9.8). <DT>96.12.03 <DD> An application for structure, union, and enumeration types: Stacks (Section 9.10). <DT>96.12.08 <DD> Structures and list processing (Section 10.1, 10.2, 10.3). <DT>96.12.10 <DD> More on structures and list processing (Section 10.1, 10.2, 10.3). </DL> <PRE><HR><EM><!WA3><A href="http://cs-www.bu.edu:80/faculty/kfoury/Home.html">Assaf Kfoury</A><BR>Created: 96.09.03<BR>Modified: 96.12.10 </EM></PRE> </BODY> </HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -