📄 http:^^www.cs.bu.edu^courses^cs113^f96^sections^
字号:
Date: Tue, 14 Jan 1997 22:59:56 GMTServer: NCSA/1.5Content-type: text/html<HTML><HEAD><TITLE>BU CAS CS 113 - Discussion Sections</TITLE></HEAD><BODY><CENTER><H1><!WA0><A HREF="http://cs-www.bu.edu/courses/cs113/F96/">CS113</A>- Discussion Sections</H1></CENTER><P>Last updated on <EM>Thursday, December 12, 1996</EM>.<H2>Midterm Coding Solutions</H2>Here you'll find example solutions to problems 8-10 from themidterm.<UL><LI><!WA1><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/midterm_solutions.p8-10.html">Problems 8-10</A></UL><H2>Lecture Notes</H2>Here you will find <EM>stuff</EM> that relates to what was covered in aspecific week's discussion OR online lectures relating to thehomeworks. It is not meant as a substitute for coming to thediscussions, but contains a subset of the same material.<DL><DT>Lab 1: Week of Sept. 9<DD> <UL> <LI>Example program: <!WA2><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/ex1/">Average Program</A> </UL><DT>Lab 2: Week of Sept. 16<DD> <UL> <LI><!WA3><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/emacs_colors.html">How to make Emacs color-code C programs</A> <LI>Counting Program: <UL> <LI><!WA4><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/ex2/">Program files</A> <LI><!WA5><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab2/countdepend.html">Dealing with file dependencies</A> <LI><!WA6><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab2/countdebug.html">Debugging</A> - only started this, continued as Lab 3. </UL> </UL><DT>Lab 3: Week of Sept. 23<DD> <UL> <LI>Counting Program: <UL> <LI><!WA7><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/ex2/">Program files</A> <LI><!WA8><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab3/countdebug.html">More Debugging</A> </UL> <LI><!WA9><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab3/hw.html">Lab Homework</A> </UL><DT>Discussion 4: Week of Sept. 30<DD> <UL> <LI><!WA10><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab4/">Example pointer/array programs</A> </UL><DT>Lab 5: Week of Oct. 7<DD> <UL> <LI><!WA11><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab5/">Example Matrix programs</A> </UL><DT>Discussion 6: Week of Oct. 14<DD> <UL> <LI>This was an optional question and answer session. </UL><DT>Discussion 7: Week of Oct. 21<DD> <UL> <LI>Data structure: <B>Queue</B> (implemented as fixed-sized array) <UL> <LI><!WA12><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab7/">Program files</A> (includes a program to test the queue). <LI>Photocopies of transparencies from the lecture are available outside Rob's office. </UL> </UL><DT>Discussion 8: Week of Oct. 28<DD> <UL> <LI>Data structure: <B>Queue</B> (implemented as linked list) <UL> <LI><!WA13><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab8/ex">Program files</A> (includes a program to test the queue). <LI>Photocopies of transparencies from the lecture are available outside Rob's office. <LI><!WA14><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab8/hw.html">Lab Homework</A> <LI>Solutions: <UL> <LI><!WA15><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab8/QueueDelete.txt">QueueDelete</A> <LI><!WA16><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab8/FreeQueue.txt">FreeQueue</A> </UL> </UL> </UL><DT>Discussion 9: Week of Nov. 4<DD> <UL> <LI><B>MergeSort</B> (Recursive Version): sorting using the <I>Merge</I> operation. <UL> <LI><!WA17><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab9/mergesort.c">Merge and MergeSort code</A> (in a test program). <LI>Photocopies of transparencies from the lecture are available outside Rob's office. </UL> </UL><DT>Discussion 10: Week of Nov. 11<DD> <UL> <LI><B>Tree</B> to store Hierarchical Information and Traversing <B>Breadth-First</B> <UL> <LI><!WA18><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab10/treeinterface">Tree Interface</A>: what we need to know to use a tree. <LI><!WA19><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab10/queueinterface">Queue Interface</A>: what we need to know to use a queue. <LI><!WA20><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab10/breadth.c">Breadth-first traversal function.</A> <LI>Photocopies of transparencies from the lecture are available outside Rob's office. </UL> </UL><DT>Discussion 11: Week of Nov. 18<DD> <UL> <LI><B>Expression Trees</B>: used to store arithmetic expressions using a <EM>recursive</EM> model of an expression. <UL> <LI><!WA21><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab11/treeinterface.html">Tree Interface</A>: what we need to know to use a tree. <LI><!WA22><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab11/evalexpr.c">Depth-first traversal function that evaluates an expression.</A> <LI>Photocopies of transparencies from the lecture are available outside Rob's office. </UL> </UL><DT>Discussion 12: Week of Nov. 25<DD> <UL> <LI>Thanksgiving break. </UL><DT>Lab 13: Week of Dec. 2<DD> <UL> <LI><B>Makefiles</B> and <B>Debugging</B> (revisited). <LI><!WA23><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab13/ex/">Files for which we generated a Makefile</A> <LI><!WA24><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/lab13/hw.html">Lab Homework</A> </UL></DL><P><HR><H2>UNIX References</H2><UL><LI><!WA25><A HREF="http://www.cs.bu.edu/courses/cs113/F96/sections/emacsref.ps">Emacs - text editor - Quick Reference</A><LI><!WA26><A HREF="http://www.cs.bu.edu/courses/cs101/files/files.html">UNIX Files and File Hierarchy</A><LI><!WA27><A HREF="http://www.cs.bu.edu/courses/cs101/paths/paths.html">UNIX Pathnames and Emacs</A></UL><P><HR><H2>Meeting Times</H2><TABLE><TR><TD><TABLE BORDER=2><TR><TH>Day</TH><TH>Time</TH><TH>Room</TH><TR><TD>Tue</TD><TD ALIGN=right>5-6pm</TD><TD>MCS-B23 or UNIX lab (B24)</TD><TR><TD>Wed</TD><TD ALIGN=right>9-10am</TD><TD>MCS-B31 or UNIX lab (B24)</TD></TABLE><TD>Often discussions will be in the UNIX lab (B24). When I plan to havediscussions in the computer labs, I put a sign outside the assignedclassroom.</TABLE><P>Each of the 2 discussions will cover roughly the same materialas the other. If you cannot make the discussion thatyou are assigned to, feel free to come to the other one;however, the number of computers in the lab are limited.<P><HR><H2>Rob's Hours</H2><TABLE><TR><TD><TABLE BORDER=2><TR><TH>Day</TH><TH>Time</TH><TH>Room</TH><TR><TD>Mon</TD><TD ALIGN=right>1-2pm</TD><TD>UNIX lab (B24)</TD><TR><TD>Mon</TD><TD ALIGN=right>2-4pm</TD><TD>MCS-223</TD><TR><TD>Tue</TD><TD ALIGN=right>6-7pm</TD><TD>UNIX lab (B24)</TD><TR><TD>Wed</TD><TD ALIGN=right>10-11am</TD><TD>UNIX lab (B24)</TD></TABLE></TD><TD>When I am in the UNIX lab, I am there to assist all 100-level computerscience course students and help will be available on a first-come-first-servebasis.</TD></TABLE><P><HR><ADDRESS>BU CAS CS 113 - Discussion Sections /<!WA28><A HREF="http://www.cs.bu.edu/students/grads/rip/">Robert I. Pitts</A> /<!WA29><A HREF="mailto:rip@cs.bu.edu">rip@cs.bu.edu</A></ADDRESS></BODY></HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -