1 / 12

CSE 3358 Note Set 1

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 mfonten@lyle.smu.edu 214-768-2854

donkor
Télécharger la présentation

CSE 3358 Note Set 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSE 3358 Note Set 1 Data Structures and Algorithms

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

  3. Instructor Contact Info • Mark Fontenot • SIC 351B • mfonten@lyle.smu.edu • 214-768-2854 • Office Hours: • T 9:30 – 10:30; W 9 - 10 • Feel free to stop by any time my office door is open

  4. TA • WaelKdouh • wkdouh@smu.edu • Office Hours: • TBA

  5. Book and Materials • 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. • Various web references as needed

  6. 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 and their algorithms • Sorting Algorithms • Advanced topics (as time permits)

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

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

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

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

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

  12. ?

More Related