Scribd Logo
Upload

Welcome to Scribd!

  • 150 views

    Data Structures and Algorithms Course Syllabus

    Uploaded by

    Wilson Gayo
    This document outlines a data structures and algorithms course that aims to develop students' knowledge of data structures and associated algorithms. The course introduces concepts like abstract data types, common data structures like lists, stacks, queues, trees and graphs. It discusses sorting, searching and graph algorithms as well as algorithm complexity. Students will learn through lectures, tutorials, assignments and labs to achieve intended learning outcomes including describing data structures, explaining operations, recognizing algorithms and complexity, and designing algorithms and data structures for problems. Students will be continuously assessed and through a final exam to test their understanding and application of course concepts.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Data Structures and Algorithms Course Syllabus

    Uploaded by

    Wilson Gayo
    150 views3 pages
    This document outlines a data structures and algorithms course that aims to develop students' knowledge of data structures and associated algorithms. The course introduces concepts like abstract data types, common data structures like lists, stacks, queues, trees and graphs. It discusses sorting, searching and graph algorithms as well as algorithm complexity. Students will learn through lectures, tutorials, assignments and labs to achieve intended learning outcomes including describing data structures, explaining operations, recognizing algorithms and complexity, and designing algorithms and data structures for problems. Students will be continuously assessed and through a final exam to test their understanding and application of course concepts.

    Original Description:

    Course Syllabus for Data Structures and Algorithms

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines a data structures and algorithms course that aims to develop students' knowledge of data structures and associated algorithms. The course introduces concepts like abstract data types, common data structures like lists, stacks, queues, trees and graphs. It discusses sorting, searching and graph algorithms as well as algorithm complexity. Students will learn through lectures, tutorials, assignments and labs to achieve intended learning outcomes including describing data structures, explaining operations, recognizing algorithms and complexity, and designing algorithms and data structures for problems. Students will be continuously assessed and through a final exam to test their understanding and application of course concepts.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    150 views3 pages

    Data Structures and Algorithms Course Syllabus

    Uploaded by

    Wilson Gayo
    This document outlines a data structures and algorithms course that aims to develop students' knowledge of data structures and associated algorithms. The course introduces concepts like abstract data types, common data structures like lists, stacks, queues, trees and graphs. It discusses sorting, searching and graph algorithms as well as algorithm complexity. Students will learn through lectures, tutorials, assignments and labs to achieve intended learning outcomes including describing data structures, explaining operations, recognizing algorithms and complexity, and designing algorithms and data structures for problems. Students will be continuously assessed and through a final exam to test their understanding and application of course concepts.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Title (Units): COMP2015 Data Structures and Algorithms (3,3,2)

    Course Aims: To develop students’ knowledge in data structures and the associated algorithms.
    To introduce the concepts and techniques of structuring and operating on Abstract
    Data Types in problem solving. To discuss common sorting, searching and graph
    algorithms, and to study the complexity and comparisons among these various
    techniques

    Prerequisite: COMP 2006 Computer Organization


    COMP 2007 Object Oriented Programming or COMP 2026 Problem Solving Using
    Object Oriented Programming

    Course Intended Learning Outcomes (CILOs):


    Upon successful completion of this course, students should be able to:

    No. Course Intended Learning Outcomes (CILOs)


    Knowledge
    1 Describe the usage of various data structures
    2 Explain the operations for maintaining common data structures
    3 Recognize the associated algorithms’ operations and complexity
    Professional Skill
    4 Design and apply appropriate data structures for solving computing problems
    5 Develop computer programs to implement different data structures and related algorithms
    6 Design simple algorithms for solving computing problems

    Calendar Description: This course develops students' knowledge in data structures and the associated
    algorithms. It introduces the concepts and techniques of structuring and operating
    on Abstract Data Types in problem solving. Common sorting, searching and
    graph algorithms will be discussed, and the complexity and comparisons among
    these various techniques will be studied.

    Teaching and Learning Activities (TLAs):

    CILOs Type of TLA


    1, 2, 3, 4, 5, 6 Students will learn the fundamental principles and key concepts via lectures. Tutorials will
    be conducted to clarify concepts and to have a deeper understanding of the teaching
    materials, where problems will be given to students for in-depth discussion.
    1, 2, 3, 4, 5, 6 Students will work on assignments to consolidate and apply what they have learnt.
    1, 2, 3, 4, 5, 6 Students will acquire hands-on experience via laboratory sections.

    Assessment:

    No. Assessment Weighting CILOs to be Description of Assessment Tasks


    Methods addressed
    1 Continuous 40% 1, 2, 3, 4, 5, 6 Continuous assessments are designed to measure
    Assessment how well students have learned the basic conception
    of data structures and algorithms. The continuous
    assessments include tests/quizzes, assignments and
    laboratory work covering all learning outcomes.
    2 Examination 60% 1, 2, 3, 4, 5, 6 Final examination questions are designed to see
    how far students have achieved their intended
    learning outcomes. Questions will primarily be
    analysis and skills based to assess students’ ability
    in understanding and application of various data
    structures and algorithms.

    Assessment Rubrics:

    1
    Level of Achievement Elaboration on Course Grading Description
    Excellent (A) The student's performance is outstanding in almost all the intended course
    learning outcomes.
    Good (B) The student's performance is good in most of the intended course learning
    outcomes.
    Satisfactory (C) The student's performance is satisfactory. It largely meets the intended course
    learning outcomes.
    Marginal Pass (D) The student's performance is barely satisfactory. It marginally meets the
    intended course learning outcomes.
    Fail (F) The student's performance is inadequate. It fails to meet any of the intended
    course learning outcomes.

    Course Content and CILOs Mapping:

    Content CILO No. Hours


    I Algorithm Analysis 3 6
    II Abstract Data Types 1,2,4,5 11
    III Trees 1,2,4,5 12
    IV Hashing 2-6 9
    V Priority Queues (Heaps) 2-6 8
    VI Sorting 3, 5-6 13
    VII Graph Algorithms 3, 5-6 6

    References:
     M.A. Weiss, Data Structures and Algorithm Analysis in Java, 3rd Edition, Addison-
    Wesley, 2011.
     M.A. Weiss, Data Structures and Algorithm Analysis in C++, 4th Edition, Addison-
    Wesley, 2013.
     Thomas H. Cormen, Introduction to Algorithms, 3rd Edition, MIT Press, 2009.

    Course Content:

    Topic

    I. Algorithm Analysis
    A. Mathematical background
    B. Recursions
    C. Big-o notations
    D. Running time calculation

    II. Abstract Data Types


    A. Lists
    B. Stacks
    C. Queues

    III. Trees
    A. Tree traversals
    B. Binary trees and binary search trees
    C. AVL trees
    D. B-trees

    IV. Hashing
    A. Hash function
    B. Separate chaining
    C. Open addressing
    D. Rehashing

    2
    V. Priority Queues (Heaps)
    A. Binary heaps
    B. Applications of priority queues
    C. D-heaps

    VI. Sorting
    A. Insertion sort
    B. Shell sort
    C. Heap sort
    D. Merge sort
    E. Quick sort
    F. Bucket sort
    G. External sorting

    VII. Graph Algorithms


    A. Topological sort
    B. Shortest-path algorithms
    C. Minimum-span tree

    You might also like