# Notes_Part1 - Data Structures and Algorithms EE2008/IM1001...

• Notes
• 118
• 100% (2) 2 out of 2 people found this document helpful

Course Hero uses AI to attempt to automatically extract content from documents to surface to you and others so you can study better, e.g., in search results, to enrich docs, and more. This preview shows page 1 - 10 out of 118 pages.

Ver 1.0EE2008 Data Structure and AlgorithmsIntro/Page 1Data Structures and AlgorithmsEE2008/IM1001
##### We have textbook solutions for you!
The document you are viewing contains questions related to this textbook.
Chapter 1 / Exercise 12
Data Structures Using C++
Malik
Expert Verified
Ver 1.0EE2008 Data Structure and AlgorithmsIntro/Page 2CoverageAlgorithm Design TechniquesSearchingSortingData StructuresPrinciples of Algorithm AnalysisIntroductionTopicsWeeks 1-6A/P Low Chor Ping[email protected]S2-B2c-86 / 6790-6368Weeks 7-13Ast/P Tay Wee Peng
Ver 1.0EE2008 Data Structure and AlgorithmsIntro/Page 3Assessmentsâ€¢Grading will be based onâ€“2 Homework Assignments,â€“2 Lab Assignmentsâ€“1 continuous assessment,â€“Final examâ€¢1stHomework Assignmentâ€“Given out inweek 4by your tutorsduring tutorial sessionsâ€“Hand in to your tutors for grading inweek 5duringtutorialsessionsâ€¢2ndHomework Assignmentâ€“Given out inweek 11by your tutors duringtutorial sessionsâ€“Hand in to your tutors for grading inweek 12during tutorialsessions
Ver 1.0EE2008 Data Structure and AlgorithmsIntro/Page 4Late Policyâ€¢Late homework assignment submissions willbe penalized 10% each day it is late.â€¢The penalty begins at the beginning of class theday the assignment is due.â€¢The 10% penalties will continue for 3 full daysat which point no more late submissions will begraded.
Ver 1.0EE2008 Data Structure and AlgorithmsIntro/Page 5Plagiarism Policyâ€¢The actual write-up must be done entirely byyourself.â€¢You cannot directly copy or slightly changeother studentsâ€™ solutionsâ€¢If you cheat on an assignment, both you and theperson who helped you will receive a lowergrade or the fail grade F.
Ver 1.0EE2008 Data Structure and AlgorithmsIntro/Page 6Continuous Assessmentâ€¢Continuous Assessment will be held onweek 8(week after recess week)duringtutorial sessionsâ€¢Answer questions within 30 minand submit solutions to tutor for gradingâ€¢Students must take their CA in their respective tutorial groupsâ€¢Tutors will take attendance during CAâ€“Bring along student IDâ€“Students without any ID (with photo) are to sign against their namesin attendance list. Need to show ID to tutor later before marks can beacceptedâ€¢Absentees should contact tutors within one week of the CAâ€¢Absentees with valid reasons or MCs can request to take a separate CAwithin 2 weeks of CA. Tutor to decide if request can be accededâ€¢If absentees do not contact the tutor, zero marks will be awarded
Ver 1.0EE2008 Data Structure and AlgorithmsIntro/Page 7Text Book:â€¢GB Huang and JM Ng (eds), DataStructures and Algorithms,Pearson Education, 2007Reference Book:â€¢Richard Johnsonbaugh and MarcusSchaefer, Algorithms, Prentice Hall,2004. ISBN 0131228536â€¢Anany Levitin, Introduction to TheDesign and Analysis of Algorithms, 2nded., Addison Welsey, 2007.ISBN 0-321-36413-9
Ver 1.0EE2008 Data Structure and AlgorithmsIntro/Page 8Other resources:â€¢ Edventure:
Ver 1.0EE2008 Data Structure and AlgorithmsIntro/Page 9What are Algorithms & Data Structures??

Course Hero member to access this document

Course Hero member to access this document

End of preview. Want to read all 118 pages?

Course Hero member to access this document

Term
Fall
Professor
SFFER
Tags
Big O notation, Analysis of algorithms
##### We have textbook solutions for you!
The document you are viewing contains questions related to this textbook.
The document you are viewing contains questions related to this textbook.
Chapter 1 / Exercise 12
Data Structures Using C++
Malik
Expert Verified