ECEN 210 Syllabus

Texas A&M University at Qatar Electrical and Computer Engineering Program ECEN 210 Computer Programming and Algorithms.
Credits 3 (31) Spring 2014
Course Description
Introduction to C language programming and common algorithms; computer systems; simple C programs; basic language constructs; le I/O; modular programming and functions; arrays and matrices; pointers and strings; simple data structures; searching, sorting, and numerical algorithms; algorithmic complexity.
Prerequisites
Sophomore standing in an engineering major.
Learning Outcomes
Upon completing this course, students will be able to: 1. Identify the main hardware components of a computer system and explain the software development process. 2. Explain the structure of a C program, and use proper language syntax and good coding practices. 3. Use C language constructs to implement arithmetic, logical, conditional, iterative, and branching operations. 4. Use appropriate system calls to read user data, display program results, and perform basic le input/output operations. 5. Partition programs into functions, and pass parameters and results between functions. 6. Declare one-and two-dimensional arrays and perform simple vector and matrix operations. 7. Declare pointers and use them to reference variables and pass parameters to functions. 8. Declare user-dened data types and operate on simple data structures.
9. Explain basic search, sort, and numerical algorithms. 10. Determine the time and space complexity of simple algorithms.
Instructor Information
Name: Telephone: E-Mail: Ofce: Ofce Hours: Mazen A. R. Saghir +974-4423-0311 (GMT+3) mazen.saghir@qatar.tamu.edu 319C Texas A&M Engineering Building Education City, Doha, Qatar Sundays, Tuesdays, and Thursdays from 12:00 noon to 1:00 pm, or by appointment.
Lectures and Recitations

Lectures: Recitations: Sundays, Tuesdays, and Thursdays from 1:00 - 1:50 pm in Room 116 Sundays from 2:002:50 pm in Room 245
Textbook
K. N. King, C Programming: A Modern Approach, 2nd Ed., W. W. Norton & Company, 2008. ISBN: 9780393979503.
Grading Policies
Programming Assignments Quiz 1 Quiz 2 Final Exam Attendance and Class Participation Course Evaluation (last day of class) 40% 16% 16% 20% 8% 2% bonus
Exam Schedule
Quiz 1 Quiz 2 Final Exam During class on February 13, 2014. During class on March 23, 2014. TBD by Ofce of Records
Course Topics
Weeks 1 2, 3 4, 5 6, 7 8, 9 10 11, 12 13 14 Topic Computer systems Simple C programs Basic language constructs and le I/O Modular programming and functions Arrays and matrices Pointers and strings Simple data structures Common algorithms Algorithmic complexity Required Reading 2.1 2.22.8; 3.1, 3.2, 4.14.5; 7.17.4 5.15.3; 6.16.4; 22.122.2 9.19.6 8.1, 8.2 11.111.5; 12.112.4 16.116.4
Detailed Course Topics

Week 1: Computer systems Hardware: CPU, memory, I/O; software: programming languages, compilers, assemblers, linkers, loaders, operating systems.
Weeks 2 and 3: Simple C programs

Constants and variables; assignment statements; standard input and output; builtin mathematical and character functions.
Weeks 4 and 5: Basic language constructs and le I/O

Conditional expressions; selection statements; loop structures; reading and writing data les.
Weeks 6 and 7: Modular programming and functions

Code modularity; functions; macros; recursion.
Weeks 8 and 9: Arrays and matrices

One-dimensional arrays; simple sorting and searching; two-dimensional arrays; matrices and vectors.
Week 10: Pointers and strings

Addresses and pointers; pointers to array elements; pointers in function references; character strings; dynamic memory allocation.
Weeks 11 and 12: Simple Data structures

Structures; user-dened data types; linked lists; stacks, queues, and tress.
Week 13: Common algorithms

Searching, sorting, and numerical algorithms.
Week 14: Algorithmic complexity

Worst-case analysis; O-notation.
Attendence Policy
Students are responsible for attending all classes and graded activities (i.e. labs and exams), and handing in graded assignments by the assigned due dates. Unless it is for a university excused absence, late assignments will receive zero credit. Missed lab sessions or exams due to non-excused absences will also receive zero credit. Unless it is for an acute (i.e. life threatening) condition requiring immediate medical attention, or if approved by the instructor in advance, doctor or hospital visits will not be considered excused absences. A student is responsible for providing a valid medical excuse within 48 hours of the absence. In the event of missing an exam as a result of an excused absence, a student may sit for a comprehensive make-up exam on the last day of the course. The make-up exam will be two hours long, and will cover the entire course material. Student rule #7: http://student-rules.tamu.edu/rule07
Americans with Disabilities Act (ADA) Policy Statement

The Americans with Disabilities Act (ADA) is a federal anti-discimination statute that provides comprehensive civil rights protection for persons with disabilities. Among other things, this legislation requires that all students with disabilities be guaranteed a learning environment that provides for reasonable accomodation of their disabilities. If you believe you have a disability requiring an accommodation, please contact Disability Services, in Cain Hall, Room B118, or call 845-1637. For additional information visit http://disability.tamu.edu.
Academic Integrity Statement and Policy

An Aggie does not lie, cheat or steal, or tolerate those who do. For additional information, please visit: http://aggiehonor.tamu.edu.

ECEN 210 Syllabus

Uploaded by

Copyright:

Available Formats

ECEN 210 Syllabus

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

ECEN 210 Syllabus

Uploaded by

Copyright:

Available Formats

Texas A&M University at Qatar Electrical and Computer Engineering Program ECEN 210 Computer Programming and Algorithms.

Credits 3 (31) Spring 2014

Lectures and Recitations

Detailed Course Topics

Weeks 2 and 3: Simple C programs

Weeks 4 and 5: Basic language constructs and le I/O

Weeks 6 and 7: Modular programming and functions

Weeks 8 and 9: Arrays and matrices

Week 10: Pointers and strings

Weeks 11 and 12: Simple Data structures

Week 13: Common algorithms

Week 14: Algorithmic complexity

Americans with Disabilities Act (ADA) Policy Statement

Academic Integrity Statement and Policy

You might also like