COMP METHODS IN ECE
EECS 10, Course Code: 18010
Quarter: Fall Quarter 2008

Course Description

EECS10 Computational Methods in Electrical and Computer Engineering (4)
An introduction to computers and structured programming. Binary Data Representation. Hands-on experience with a high-level structured programming language. Introduction to algorithm efficiency. Applications of structured programming in solving engineering problems.
Prerequisite or corequisite: Mathematics 2A.
Only one course from EECS10, EECS12, CEE10, ENGR10, and MAE10 may be taken for credit.
Formerly ECE10. (Design units: 0)

Course Objectives and Outcomes

• Course Objectives:

  • To be able to design, develop, compile, and debug programs in a high-level programming language.
  • To be able to develop programs that solve numerical problems applicable to engineering.

• Course Outcomes:

  • Students understand and can apply structured design methodology to write programs.
  • Students know C language syntax and semantics as well as compilation and debugging techniques.
  • Students can manipulate C structures and arrays and use recursion.
  • Students are able to use random number generators and develop programs with simple probability applications.
  • Students can use approximation and error bounds to solve numerical problems with floating point values.

Course Resources

• Text book:
  

  Harvey and Paul Deitel and Associates: C: How to Program, Fifth Edition, Prentice Hall, 2006. ISBN 0-13-240416-8

• Standard book:
  

  B. W. Kernighan, D. M. Ritchie: The C Programming Language, Second Edition, Prentice Hall, 1988. ISBN 0-13-110362-8

• Course web site
  online at http://eee.uci.edu/08f/18010/

Course Contents

Week	Topic	Reading
0	Introduction, course set up	Ch. 1 (pp. 1-31)
1	C programming: syntax, I/O, basic data types, operators	Ch. 2 (pp. 32-61)
2	Structured programming: statements, conditionals, loops	Ch. 3 (pp. 62-106)
3	Program control: selection, repetition, control flow	Ch. 4 (pp. 107-150)
4	Functions: function call and definition, scoping rules	Ch. 5 (pp. 151-207)
5	Arrays: definition, access, operations	Ch. 6 (pp. 208-266)
6	Pointers: definition, access, operations	Ch. 7 (pp. 267-324)
7	Characters and strings: operations, library functions	Ch. 8 (pp. 325-371)
8	Formatted input and output	Ch. 9 (pp. 372-400)
9	Structures, unions, and enumerators	Ch. 10 (pp. 401-437)
10	File processing, I/O	Ch. 11 (pp. 438-476)



• Note that contents are tentative and may change.
• Please see the Schedule page for up-to-date scheduling information.

Course Policies

• Add Drop Policy:

  Last day to add or drop without Deans approval is at the end of the second week.

• Attendance Policy:

  Attendance at lecture and discussion sections is required. Pop quizzes may be given. It is the student's responsibility to make prior arrangements with the instructor or the TAs if he is going to be absent. No make-up quizzes or exams will be given.

• Laboratory Policy:

  Labs assigned to this course are listed in the Schedule of Classes (see course codes 18010-18027).
  The labs are accessible to students in the class during the scheduled lab hours. Students may attend any of the scheduled lab hours, but those who are enrolled in the particular lab section have precedence in using a terminal. This is to ensure a fair allocation of available computing resources. In addition, students may also remote login to the server at any time (24/7).
  • No food or drinks are permitted in the lab at any time.
  • Keep the lab clean and neat.
  • No littering or abusing lab equipment.
  • Shoes and shirts required at all times.
  Students are required to attend the labs they have enrolled in and must show up themselves. All work is to be done individually. Copying answers or program code is strictly prohibited.
  Programs must be well documented with useful comments. Excessive, insufficient, or useless comments in the program will result in deducted points.
  Sun Solaris is the standard platform used for this course. All processes run on the EECS unix servers, malibu.eecs.uci.edu, vivian.eecs.uci.edu or newport.eecs.uci.edu (east.eecs.uci.edu may be used as backup). While other platforms may be used to develop and test the programs, all course work will be checked and graded on these servers.
  SSH is required to login to any of these servers. Please refer to the Resources page for a list of suitable SSH clients.

• Assignments:

  Assignments are listed on the Assignments course web page. They are assigned on a weekly or bi-weekly basis as indicated on the course web pages.
  Assignments are generally due on Monday at noon (12pm), unless indicated otherwise on the assignment web page. The deadline for assignments is hard. Home work turned in after the due date/time will not be graded and will receive no credit. The clock on the server shall be used as the reference clock.
  All assignments are to be submitted electronically while being logged into the account on the server. Detailed instructions on home work submission will be listed with each assignment.

• Exams:

  The course includes two midterms and one final examination, scheduled as listed on the Schedule page.
  Each exam covers all the material discussed in the course until the day of the examination.
  All exams are closed-book examinations. No books, notes, computers, calculators, cell phones, or any other devices are allowed. An official photo ID is required for inspection.
  Final examinations are administered during examination week at the time announced in the Schedule of Classes, Fall Quarter 2008.

• Grading Policy:

  The final grade for the course will be calculated as a weighted sum of the points scored in the home works, the midterms, and the final examination, as follows:
  • 40% Assignments
  • 30% Midterms
  • 30% Final examination
  Extra credit may be earned with home works if indicated in the assignment.

• Academic Honesty:

  The complete policy statement on academic honesty is published in the Schedule of Classes, Fall Quarter 2008.
  Under no circumstances are students allowed to work together on any of the examinations.
  Cheating is a dishonest representation of the course work, including but not limited to cheating on an exam, fraudulently presenting lab exercises or assignments by someone else as one's own, or getting someone else to take the course. It is a serious academic offense that will not be tolerated. Cheaters can expect to receive a failing grade and will be punished under University regulations.