EE312 Introductions - PowerPoint PPT Presentation

1 / 16
About This Presentation
Title:

EE312 Introductions

Description:

... questions, do demonstrations and critique programs. Attendance at recitations is required. ... based on performance in recitation. Showing up is not ... – PowerPoint PPT presentation

Number of Views:49
Avg rating:3.0/5.0
Slides: 17
Provided by: craigm6
Category:

less

Transcript and Presenter's Notes

Title: EE312 Introductions


1
EE312 Introductions
2
Goal of EE312
  • Provide students to opportunity to practice
    information problem solving.
  • Information problem solving is a skill that
    cannot be taught, although it can be learned
    e.g., riding a bicycle, driving a car.
  • The program is merely a means to an end
    Computers process information, and information
    problems are what we solve when we write
    computer programs.

3
Goal of EE312
  • Assess student competence and mastery of
    information problem solving.
  • Problem solving is fundamental to being an
    engineer and information problems capture this
    skill in its purest form.
  • EE312 is prerequisite to the EE and CE degrees.
  • You must achieve basic competence to make a
    passing grade (C or better).

4
Goal of EE312
  • Have fun.
  • OK, so maybe programming isnt youre idea of a
    great way to spend Saturday night.
  • But, when the computer begins to make sense,
    programming will suck a lot less.

5
EE312 at a Glance
  • Home Page http//www.ece.utexas.edu/chase/ECE_Ho
    me/EE312_Spring_2003/index.htm
  • Texts Patt and Patel
  • Compiler Code Warrior
  • Lectures MWF 12-1, Bur 106
  • Recitations 1 hour per week.

6
EE312 Course Content
  • Information Problem Solving
  • Using variables, arrays and data structures to
    store information
  • Algorithm selection and algorithm development
  • Coding, including C syntax and style
  • Debugging and validation of programs
  • Develop a working understanding of computation
  • Understanding that the machine is not really
    possessed by a demon.

7
Course Philosophy
  • The foundation for good programming consists of
    three elements
  • A (reasonably accurate) model of how the computer
    works.
  • Problem solving skills including problem
    analysis, deductive reasoning and creativity.
  • Knowledge of the constructs of the programming
    language.

8
Who are we?
  • Instructor Craig Chase, ENS 504, 471-7457,
    chase_at_ece.utexas.edu
  • Ph.D. 1993 Cornell University
  • At UT since 1993, teaching and research in
    Parallel Computing, Software Development.
  • TAs still TBD.
  • Head TA Braxton Thomason

9
Who are you?
  • The audience for EE312 are individuals with
  • Limited programming experience (more than five
    programs, less than a hundred).
  • Basic knowledge of how a computer works (EE306).
  • You should have experience with
  • The sequential execution of program statements.
  • Variables.
  • Conditionals (if-then-else)
  • Loops.
  • Subroutines.
  • Simple Input and Output.

10
How to Pass EE312?Accept your responsibility to
learn.
  • Learn during the lectures.
  • Much of what you will be expected to learn is not
    in the book.
  • No amount of memorization or cramming will
    allow you to pass the exams.
  • Start the programming assignments early.
  • You will not receive help at the last minute.
  • Expect to be able to understand everything and
    ask questions when you do not.

11
Programming Assignments
  • We will have roughly one project each week.
  • The projects will take between 2 and 10 hours to
    complete.
  • The projects will take considerably longer if you
    do not understand the material.
  • The programs will account for 25 of your course
    grade.

12
Overnighters (aka homework)
  • In addition to the projects you will be
    assigned several short homework assignments,
    called overnighters.
  • Overnighters are practice problems, strongly
    recommended, but will not be graded. See your TA
    for the solution.
  • Overnighters are intended to reinforce lecture
    material, and will take between ½ and 2 hours to
    complete.

13
Exams
  • We will have three evening exams and a final.
  • Exam 1 February 12
  • Exam 2 March 19
  • Exam 3 April 16
  • Exams will be cumulative.
  • The evening exams will each count 15 of your
    course grade.
  • The final exam will count 20 of your course
    grade.

14
Recitation Sections
  • We will answer questions, do demonstrations and
    critique programs.
  • Attendance at recitations is required.
  • Part of your course grade is based on performance
    in recitation
  • Showing up is not performing!

15
Academic Honesty
  • Programs are individual effort.
  • Do not show your program to another student
    (whether its working or not).
  • Do not seek (from students) or give help while
    debugging.
  • Do not refer to solutions from the web, or from
    previous years.
  • You may discuss algorithms with whomever youd
    like
  • Study groups (for exams) are encouraged.

16
Professionalism
  • Please, come to class on time (exams too).
  • Indent and comment your programs
  • We need to read them!
  • Treat your fellow students, TAs and professors
    with respect.
  • And alert me immediately if there are problems
    with TAs.
Write a Comment
User Comments (0)
About PowerShow.com