BTP500 Course Outline

Course Code: BTP500
Course Name: Data Structures and Algorithms
Offered Date: Fall - 2017 | 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)
Required for BSD - Bachelor of Technology (Software Development)
Prerequisite: BTP400 and BTP305
Mode of Instruction:
Modes: In-class lecture, and in-class exercises
Hours per week: 4
Room configurations: Classroom (4 hours)
Typical scheduling pattern: Fall term
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:
Communicate clearly, concisely and correctly in the written, spoken and visual form that fulfils the purpose and meets the needs of the audience.|Execute mathematical operations accurately.|Apply a systematic approach to solve problems.|Use a variety of thinking skills to anticipate and solve problems.|Manage the use of time and other resources to complete projects.|Take responsibility for one's own actions, decisions, and consequences.|
Topic Outline:
  • Analysis and Big-O Notation - 15%
  • Linked List - 10%
  • Searching and Sorting - 10%
    • Linear Search
    • Binary Search
    • Bubble Sort
    • Insertion Sort
    • Selection Sort
    • Merge Sort
    • Quick Sort
    • Heap Sort
  • Stacks and Queues - 10%
  • Hash Tables - 10%
    • Linear Probing
    • Bucketing
    • Chaining
  • Recursion - 10%
  • Trees - 15%
    • Binary Trees
    • AVL Trees
    • Red Black Trees
    • B Trees
  • Graphs - 10%
  • Computational Theory - 10%
Prescribed Text(s):
Reference Material:
Data Structures and Algorithm Analysis in C++ (4th Edition)
By Mark Allen Weiss
ISBN: 978-0132847377
Promotion Policy:
  • Satisfactorily complete all assignments
  • Pass the weighted average of all assessments
  • Pass the final exam
  • Pass the weighted average of the exam and all other assessments

Grading Policy
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)
EXC Excellent
SAT Satisfactory
UNSAT Unsatisfactory

For further information, see a copy of the Academic Policy, available online (http://www.senecacollege.ca/academic-policy) or at Seneca's Registrar's Offices.

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

Approved By:
Mary-Lynn Manton
Cheating and Plagiarism:
Each student should be aware of the College's policy regarding Cheating and Plagiarism. Seneca's Academic Policy will be strictly enforced.

To support academic honesty at Seneca College, all work submitted by students may be reviewed for authenticity and originality, utilizing software tools and third party services. Please visit the Academic Honesty site on http://library.senecacollege.ca for further information regarding cheating and plagiarism policies and procedures.
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 Disabilities Services Office at ext. 22900 to initiate the process for documenting, assessing and implementing your individual accommodation needs.