DSA555 Course Outline

Course Code: DSA555
Course Name: Data Structures and Algorithms in C++
Offered Date: Winter - 2022 | Other versions
Print Outline
Course Description:
This is a survey course on algorithms and data structures commonly used in computer programs. Students taking this course will learn how these classical data structures and algorithms function. They will learn how to implement these data structures and apply them to real programming problems. Students will also learn how these data structures are used to implement parts of the standard language libraries. Furthermore, the course will also introduce students to computational theory. This course is meant to provide students with a fundamental background to computer science concepts.
Credit Status: 1 credit (3 units)
Professional Option for CPA - Computer Programming and Analysis (Ontario College Advanced Diploma)
Professional Option for CPD - Computer Programmer (Ontario College Diploma)
Prerequisite: OOP344 or OOP345
Mode of Instruction: Modes: In-class lecture, in-class exercises, and hands-on activity
Hours per week: 4
Room configurations: Classroom, and computer lab
Typical scheduling pattern: Varies, at least once in Fall or Winter
Learning Outcomes:
  1. Analyze algorithms and data structures for resource usage to design optimal programs
  2. Explain the relationship between resource use growth rates and observed algorithmic behavior to forecast performance
  3. Use pseudo code and diagrams to explain how data structures and algorithms are implemented
  4. Implement custom linked-list structures to extend the behavior of language specific libraries 
  5. Explain the P vs NP problem to recognize the limitations of computation
  6. Implement key-based container classes to retrieve data quickly and efficiently 
  7. Use graph data structures to store information about relationships between objects
Employability Skills:
    •  Execute mathematical operations accurately.|    •  Apply a systematic approach to solve problems.|    •  Manage the use of time and other resources to complete projects.|
Topic Outline:

  •   Introduction - 5%
  •   Analysis - Big-O, Little-o, Theta and Omega  Notation - 20%
    •         Big-O Notation
    •         Little-o Notation
    •         Theta Notation
    •         Omega Notation
  •  Linked Lists - 10%
  • Searching and Sorting 10%
    •         Linear Search
    •         Binary Search
    •         Bubble Sort
    •         Insertion Sort
    •         Selection Sort
    •         Heap Sort
    •         Merge Sort
    •         Quick Sort
  •     Hash Tables - 10%
  •     Recursion - 5%
  •     Trees - 20%
    •         binary heaps
    •         binary search trees
    •         avl trees
    •         red-black trees
    •         two-three trees
  •     Queues and Stacks - 5%
  •     Graphs - 5%
  •     Complexity Theory - 10%
Prescribed Text(s):

https://www.gitbook.com/book/cathyatseneca/data-structures-and-algorithms/details

Reference Material:
Data Structures and Algorithm Analysis in C++ (4th Edition)
By Mark Allen Weiss
ISBN: 978-0132847377
Supply:
None
Promotion Policy:
To obtain a credit in this subject, a student must:
  •     Achieve a grade of 50% or better on the final exam
  •     Satisfactorily complete all assignments
  •     Achieve a weighted average of 50% or better for the tests and final exam
  •     Achieve a grade of 50% or better on the overall course

http://www.senecacollege.ca/about/policies/student-progression-and-promotion-policy.html

Grading Policyhttp://www.senecacollege.ca/about/policies/grading-policy.html

A+ 90%  to  100%
A 80%  to  89%
B+ 75%  to  79%
B 70%  to  74%
C+ 65%  to  69%
C 60%  to  64%
D+ 55%  to  59%
D 50%  to  54%
F 0%    to  49% (Not a Pass)
OR
EXC Excellent
SAT Satisfactory
UNSAT Unsatisfactory

For further information, see a copy of the Academic Policy, available online (http://www.senecacollege.ca/about/policies/academics-and-student-services.html) or at Seneca's Registrar's Offices. (https://www.senecacollege.ca/registrar.html).


Evaluation:
Assignments 30%
Test(s) 30%
Labs 10%
Final Exam 30%

Approved By:
Mary-Lynn Manton
Cheating and Plagiarism:
Seneca upholds a learning community that values academic integrity, honesty, fairness, trust, respect, responsibility and courage. These values enhance Seneca's commitment to deliver high-quality education and teaching excellence, while supporting a positive learning environment. Ensure that you are aware of Seneca's Academic Integrity Policy which can be found at: http://www.senecacollege.ca/about/policies/academic-integrity-policy.html Review section 2 of the policy for details regarding approaches to supporting integrity. Section 2.3 and Appendix B of the policy describe various sanctions that can be applied, if there is suspected academic misconduct (e.g., contract cheating, cheating, falsification, impersonation or plagiarism).

Please visit the Academic Integrity website http://open2.senecac.on.ca/sites/academic-integrity/for-students to understand and learn more about how to prepare and submit work so that it supports academic integrity, and to avoid academic misconduct.
Discrimination and Harassment:
All students and employees have the right to study and work in an environment that is free from discrimination and/or harassment. Language or activities that defeat this objective violate the College Policy on Discrimination/Harassment and shall not be tolerated. Information and assistance are available from the Student Conduct Office at student.conduct@senecacollege.ca.
Accomodation for Students with Disabilities
The College will provide reasonable accommodation to students with disabilities in order to promote academic success. If you require accommodation, contact the Counselling and Accessibility Services Office at ext. 22900 to initiate the process for documenting, assessing and implementing your individual accommodation needs.