Module/Course Description

Course Title: Data Structures

Course Code: UU-COM-2001

Programme: Bachelor of Science (BSc) in Computer Science - MW

Credits: 3.00

Course Description:

Objectives of the Course:

• Introduce students to Abstract Data Types (ADT).
• Provide practical experience to advanced programming techniques and data structures including tables, linked lists, queues and stacks.
• Introduce students to advance recursion such as the divide-and-conquer and backtracking.
• Obtain a foundation that will allow students to use storage media; methods of representing structured data; and techniques for operating on data structures.
• Introduce students to searching and sorting algorithms.
• Introduce students to Binary Trees and graphs.

Learning Outcomes:

• Discuss the use of primitive data types and build-in data structures.
• Describe common applications for different data structures.
• Implement user-defined data structures in a high-level language.
• Compare alternative implementations of data structures with respect to performance.
• Recognize when and how to use the following data structures: Arrays, Linked lists, Stacks, Queues and Binary trees.
• Compare and contrast the costs and benefits of dynamic and static data structure implementation.
• Choose the appropriate data structure for modeling a given problem.
• Describe the concept of recursion and give examples of its use.
• Describe the divide-and-conquer and backtracking approaches.
• Compare iterative and recursive solutions and determine when a recursive solution is appropriate for a problem.
• Apply various sorting and searching algorithms.

Prerequisites: UU-ACG-1000, UU-MKT-2000, UU-MAN-2010, UU-BBA-2000, UU-ENG-1000, UU-ENG-1001, UU-ENG-1005, UU-COM-1000, UU-MTH-1000, UU-MTH-1005, UU-MTH-2000, UU-MTH-3000, UU-COM-1100, UU-COM-2000, UU-COM-2003, UU-BA-IND100, UU-FNT-103


This site uses cookies and other tracking technologies to assist with navigation and your ability to provide feedback, analyse your use of our products and services, assist with our promotional and marketing efforts, and provide content from third partiesCookie Policy