CSE 3358 NOTE SET 1 Data Structures and Algorithms

CSE 3358  Data Structures  Lectures:  TTh 8:00 – 9:20am., SIC 362  Labs:  N11: Tu 3:30 – 4:50, Junkins 102  N12: F 1:00 – 2:20, Junkins 102

Instructor Contact Info  Mark Fontenot  SIC 351B    Office Hours:  MW 11 – 12  Feel free to stop by any time my office door is open  Contact Debra McDowell to make an

TA  Wael Kdouh   Office Hours:  SIC 317  Wed 1 - 4

Book  Required:  Mark Allen Weiss. Data Structures and Algorithm Analysis in C++, Third Ed. Addison Wesley  Supplemental:  Adam Drozdek. Data Structures and Algorithms in C++, Third Ed. Thompson/Course Technology.

Overview of Course Material  Introduction to classic data structures  Complexity Analysis  Review of elementary data structures (lists, stacks, queues)  Trees  Hashing  Heaps/Priority Queues  Graphs  Sorting Algorithms  Advanced topics (as time permits)

Evaluation ToolQuantityPercentage of Final Grade Tests Implementation Projects6+35 Homework Assignments4+25 Attendance/Participationn/a5 Two Additional Caveats: An average of less than 60% on exams will result in maximum grade of D in the course An average of less than 60% on programming projects/assignments will result in maximum grade of D in the course

Attendance  Vitally Important  Attendance will be occasionally/randomly collected  Bottom Line: Come to class!

Academic Honesty  Talking about concepts with friends is OK  Solving homework problems together is NOT OK!  Form Study Groups to study for test, review concepts.  Don’t do your homework assignments together.

Lab  Lab is Mandatory  Lab time will be used in various ways  Help with implementation projects  Problem solving sessions  Introduction to different technologies as appropriate

Assignment Submission  For each homework assignment  Submit written solutions at the beginning of class or on Blackboard on due date indicated on assignment  For each implementation project  Submit source code to BlackBoard buy due date  Submit lab report at beginning of class immediately following due date  Late assignments will not be accepted without approval from Prof. Fontenot

Announcement  Next Thursday – No Class  Follows a Monday schedule.

?