8 23 10 OVERVIEW Introductions Administrative Material Syllabus Outline What we re going to cover in this class CSE 2341 HONORS Professor Mark Fontenot Southern Methodist University CONTACT INFO Instructor Prof Mark Fontenot mfonten lyle smu edu Caruth 441 OFFICE HOURS Official Open door policy TA Maya El Dayeh meldayeh smu edu MW 9 10 The hours above won t work for everyone If my door is open feel free to stop in Electronic Send me an email any time I always try to respond within 24 hours GETTING ASSISTANCE Ask questions in class Office Hours Help Desk WHO ARE YOU Located in CSE Suite on 4th Floor of Caruth Staffed by most TAs throughout the day Schedule forthcoming Email Instructor or TA 1 8 23 10 COURSE EVALUATION Exams 30 Programming Projects 50 Homework and Quizzes 10 Attendance and Active Participation 10 ATTENDANCE You ve got to come to class Participating is required and essential Additional Grade Constraints Your grade will reflect your attendance Don t surf the net do Sudoku puzzles or txt at inappropriate times Act like an adult Must maintain at least a 60 on exams Must maintain at least a 60 on programming projects ACADEMIC ETHICS Pillar of higher education the work you produce should be your own SMU Honor Code applies to all classes If an assignment is to be done individually i e exams it is expected that they will be completed in that manner If an assignment is collaborative then you may work with your team members as much as you want INAPPROPRIATE COLLABORATION Penalties 1st Occurrence Zero on Assignment 2nd Occurrence F in course Honor Council We reserve the right to modify these penalties on a case by case basis WHAT SHOULD YOU KNOW Comfortable with Basic Intermediate C data types variables expressions methods control structures classes pointers arrays etc Debugging code Understanding of the concepts of OOP Problem solving Inheritance Polymorphism Encapsulation THIS CLASS 2 8 23 10 WHAT WE LL COVER As much as possible Topics WHAT YOU NEED Computer Laptop is nice but not required Object Oriented C STL Generic Programming Templates Basic Data Structures linked list stack queue Trees Binary Trees Binary Search Trees B Trees Sets Hashing Priority Queues It will be hard to take some notes in this class on laptop because of pictures You can try if you d like Mac PC Linux Textbook is required 3 ring binder for notes and handouts 3
View Full Document
Unlocking...