Você está na página 1de 6
 
Course Syllabus
 
 Page 1
EE 2310 Course Syllabus – University of Texas at Dallas
Course Information: EE 2310 – Introduction to Digital Systems; Fall, 2009 Class Schedules: Section 001 10:00-11:15 PM, TR, ECSS 2.415 Section 501 7:00-8:15 PM, TR, ECSS 2.415 Instructor: Dr. Nathan Dodge Tel: (972) 883-2951 email: dodge@utdallas.edu Office: ECSN 4.916 Office Hours: TR, 3:30-5:30 PM and by appointment Instructors Website: http://www.utd.edu/~dodge/  
NOTE: I DO NOT USE WEBCT! NOT AT ALL! NOT EVER! TO GET INFORMATION ABOUT EE 2310 YOU MUST GO TO THE WEBSITE LISTED ABOVE.
Course Pre-requisite: None. The only required prior knowledge or skill is a working ability in basic algebra and knowledge of some of the fundamentals of programming. Course Description: This course covers principles of digital systems, assembly language programming, and an overview of computer architecture. It provides a background in basic technology areas that are required to understand computer architecture and design. Student Learning Objectives/Outcomes: By the end of EE 2310, the student should have a firm basic knowledge of: a.
 
Binary and hexadecimal numbers b.
 
Fundamentals of Boolean Algebra and digital logic gates c.
 
Basic combinational logic circuits d.
 
Sequential logic circuits e.
 
Assembly language programming The student should also have good overview knowledge of modern computer organization. Required Textbooks and Materials:
 
Computer Organization and Design
, Fourth Edition, David Patterson and John Hennessy (Morgan Kaufmann, 2009).
 
Schaum's Outline of Theory and Problems of Digital Principles
, Third Edition, Roger L. Tokheim, (McGraw-Hill).
 
A Programmer’s Guide to Assembler, William Pervin, (McGraw-Hill, 2004), ISBN 007-3111678. Suggested Course Materials:
 
LogicWorks 5
, Capilano Computing Systems, Inc. (Addison-Wesley, 1996).
There are no other required or reference materials. Homework is available on-line at the instructor’s website. In addition, supplementary work (“worksheets”) is also available on-line and will usually be worked in class.
 
Course Syllabus
 
 Page 2
EE 2310 Session Schedule, Fall, 2009, Sections 001 and 501 Week of Session # Lecture # Text Chapter/Sect. References Class Date Topic 8/17 1 1 --- Aug. 20
Overview, history of computing, numbers.
8/24 2 2 P 0, T 1-2, PH 1 Aug. 25
Binary numbers, Boolean algebra.
3 3 P 1-1.5, App. A, T 1-2, PH 3.1-3.3 Aug. 27
Combinational Logic.
8/31 WS #1 – 9/1 4 4 T 3, 4.1-4.3, PH B.1-B.2 Sept. 1
Complex combinational logic.
5 5 T 4.4-5.6, 8, PH B.3 Sept. 3
Karnaugh maps; logic simplification.
9/7 6 6 T 5.7-5.10 Sept. 8
Fundamentals of sequential logic circuits, flip-flops.
7 7 T 9.1-9.4 Sept. 10
Complex latch or flip-flop circuits.
9/14 8 8 T 9.5-9.8, 10.1-10.2 Sept. 15
Registers, counters, latch-based circuits.
9 --- T 10, 11.1-11.3 Sept. 17
Video on innovation; logic design exercise
9/21 WS #2 on 9/22 10 --- --- Sept. 22
 Review for Test #1.
11 --- --- Sept. 24
 
Test #1. 9/28 WS #3 on 10/1 12 9 Class notes Sept. 29
 Test #1 recap; designing sequential logic.
13 10 P 3, PH 2.1-2.2 Oct. 1
 Assembly language programming; introduction to SPIM.
10/5 WS #4 on 10/8 14 11 P 2-2.2, App. B & D, 6.4, PH 2.4, 2.5 Oct. 6
 MIPS instruction set; register-register instructions and system calls.
15 12 P 3, class notes Oct. 8
 Writing and executing MIPS programs.
10/12 16 13 P 2.3, 4, PH 2.4, 2.9 Oct. 13
 Memory reference instructions.
17 14 P 1.6, PH 2.4, 2.5, 2.6 Oct. 15
 MIPS shift and logical instructions; branch instructions.
10/19 18 15 P 4-4.3, PH 2.6 Oct. 20
 Loops in SPIM.
19 16 Class notes Oct. 22
 SPIM Programming review/exercise.
10/26 WS #5 on 10/27 20 --- --- Oct. 27
 Test #2 review.
21 --- --- Oct. 29
 
Test #2. 11/2 22 17 P 5, 6, 7, PH 2.7 Nov. 3
Test #2 recap; procedures (recursion); use of the stack.
23 18 P 12-12.3, App. C, PH 2.10 (to mid-p.114), class notes Nov. 5
 Computer operation, processes, final  programming lesson.
11/9 WS #6 on 11/10 24 --- --- Nov. 10
 Programming exercise (WS #6)/video
25 19 PH 5.1-5.3 Nov. 12
 Computer architecture: ALU design.
11/16 26 20 PH 5.4-5.5 Nov. 17
 ALU review; design of CPU control unit. Multicycle implementation.
27 21 P 11-11.2, PH 6-6.6 Nov. 19
 Pipelined processors.
11/23 28 22 P 11.3, PH 7-7.4 Nov. 24
 Modern memory architecture.
--- --- --- Nov. 26
 Thanksgiving Holiday!!!
11/30 WS #7 on 12/1 29 --- Class notes Dec. 1
 Test #3 review.
30 --- --- Dec. 3 Test #3. 12/7-12/14 --- --- --- --- Classes end; no final exam
 
Abbreviations: P Pervin, A Programmer’s Guide to Assembler T – Tokheim, Schaum's Outline of Theory and Problems of Digital Principles PH – Patterson and Hennessy, Computer Organization and Design Note: Pop quiz and worksheet dates shown in column 1 are approximate and may change.
 
Course Syllabus
 
 Page 3
Grading Policy:
Grading will be on the following basis: Homeworks -- 10 % Worksheets plus in-class exercises -- 5 % Semester examinations -- 90 % #1 -- 25 % #2 -- 30 % #3 -- 35 % Total -- 105 % Grade ranges for EE 2310 are: A+: 97-100; A: 93-96; A-: 90-92; B+: 87-89; B: 83-86; B-: 80-82; C+: 77-79; C: 73-76; C-: 70-72; D+: 67-69; D: 63-66; D-: 60-62; F: below 60.
Course & Instructor Policies:
Course notes, homework, and a copy of this syllabus are available on-line at the instructor’s faculty home page (address shown above):. Course note files are labeled by lecture. All on-line material is in Adobe Acrobat® (.pdf) format. You will need Adobe Acrobat Reader 6.0 or 7.0 to read pdf files. It may be downloaded from the UTD software web site (whose web address is: http://www.utdallas.edu/ir/local/index.html ), or from the Adobe website (http://www.adobe.com/products/acrobat/readstep2.html).
Exams:
 Three exams will be given during the semester.
No make-up exams will be given, except under dire circumstances, such as (serious) illness.
. Although 2310 sections 001 and 501 are taught on identical schedules, there will be no switching of class periods for test-taking purposes.
You must take each test at the time of the class session that you attend
. (You may, however, attend the other class lecture if you have a conflict on a particular day with your usual lecture period.)
Homework:
 Homework is due on the date shown on the homework schedule. Homework answers will  be posted on-line after the due date. Homework is worth 10% of your final grade. As noted above, a secondary set of homework, “worksheets,” will be worked in class (they are also posted on-line). These are due at the beginning of the class period, as shown on the worksheet. Worksheet answers are NOT  posted on-line. The six worksheets plus selected in-class exercises sheets count 5% of the final grade. Worksheets must be shown to the instructor at the beginning of class, to receive a “check.” The six worksheets are worth 3% of the final grade; the selected in-class exercise sheets to be turned in are worth the remaining 2%.
Notes on Semester Project (Homework #7):
 1.
 
Homework #7 is a logic design project. 2.
 
It must be designed using a computer layout tool. LogicWorks ™ (see list of texts above) can do this very well. 3.
 
Although you do not have to purchase LogicWorks, #2 still applies. You may use another tool (such as Pspice) if you have access to it. Some students have even used Word Draw, although this can be very tedious. If you choose not to purchase LogicWorks, some free layout software tools are listed on the 2310 website. 4.
 
You may consult with classmates about the project, but your final design must be done by you alone and turned in independently.
Late semester projects are not accepted.
Class attendance:
Class attendance is not often taken. You are expected to attend class to be sure that you can master all the (considerable) course material by the end of the semester. Although points are not usually deducted for lack of attendance, it CAN be done in particularly abusive circumstances.
More importantly, if you do not attend EE 2310 classes regularly, you will fail.

Recompense a sua curiosidade

Tudo o que você quer ler.
A qualquer hora. Em qualquer lugar. Em qualquer dispositivo.
Sem compromisso. Cancele quando quiser.
576648e32a3d8b82ca71961b7a986505