COMP METHODS IN ECE
EECS 10, Course Code: 18010
Quarter: Summer Session II 2013

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, ENGR10, and MAE10 may be taken for credit.
(Design units: 0)

Course Objectives and Student Outcomes

• Related EAC Student Outcomes:

  • (a) an ability to apply knowledge of mathematics, science, and engineering
  • (b) an ability to design and conduct experiments, as well as to analyze and interpret data
  • (k) an ability to use the techniques, skills, and modern engineering tools necessary for engineering practice

• Course Learning Outcomes:

  • Develop programs using structured design methodology. (EAC a, EAC k)
  • Use C language syntax and semantics as well as compilation and debugging techniques. (EAC k)
  • Manipulate C structures and arrays and use recursion. (EAC k)
  • Develop programs with simple probability applications using random number generators. (EAC a, EAC b)
  • Solve numerical problems with floating point values using approximation and error bounds. (EAC a, EAC b)

Course Resources

• Text book:
  

  Paul Deitel, Harvey Deitel: C: How to Program, Seventh Edition, Prentice Hall, 2013. ISBN-10: 013299044X ISBN-13: 9780132990448

• Reference 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/13z/18010/

Course Contents

Week	Topic	Reading
1	Introduction, course set up	Chapter 1
	C programming: syntax, I/O, basic data types, operators	Chapter 2
2	Structured programming: statements, conditionals, loops	Chapter 3
	Program control: selection, repetition, control flow	Chapter 4
3	Functions: function call and definition, scoping rules	Chapter 5
	Arrays: definition, access, operations	Chapter 6
4	Pointers: definition, access, operations	Chapter 7
	Characters and strings: operations, library functions	Chapter 8
5	Formatted input and output	Chapter 9
	Structures, unions, and enumerators	Chapter 10
	File processing, I/O	Chapter 11



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

Course Policies

• Attendance Policy:

  Attendance at lecture and discussion sections is required. It is the student's responsibility to make prior arrangements with the instructor (or the TAs) for any absence known in advance. Make-up assignments and/or exams can only be arranged for absence due to medical (or similar) reasons. Proper documentation is required.

• Laboratory Policy:

  Labs assigned to this course are listed in the Schedule of Classes (see course codes 18014).
  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.
  Linux is the standard platform used for this course. All processes run on the EECS Linux server, zuma.eecs.uci.edu (or alternative crystalcove.eecs.uci.edu). While other platforms may be used to develop and test the programs, all course work will be checked and graded on the server.
  SSH is required to login to these server. 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 11pm, 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 provided with the assignment description.

• 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.

• 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 UCI Schedule of Classes.
  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.