Data Structures and AlgorithmsModule Details

Module Description

This module provides an understanding of data structures and algorithms and its significance in programming. It gives a holistic approach to design, implement and use the various data types and algorithms to solve problems.

Module Aim

This Module aims at equipping students with skills to use algorithms and data structures to solve real world problems. It also aims at providing an understanding on how to evaluate the efficiency of an algorithm.

Module Learning Outcomes

After completing of this module students should be able to:

1. Discuss the use of primitive data types and build-in data structures.
2. Program various applications using different data structure
3. Implement user-defined data structures in a high-level language.
4. Describe the concept of recursion and give examples of its use.
5. Compare iterative and recursive solutions and determine when a recursive solution is appropriate for a problem.
6. Recognize when and how to use different data structures.
7. Determine the time and space complexity of simple algorithms.
8. Discuss factors other than computational efficiency that influence the choice of algorithms, such as programming time, maintainability, and the use of application-specific patterns in the input data.
9. Describe the amount of work done by an algorithm, giving asymptotic upper, lower, and tight bounds on time and space complexity of algorithms using big O, omega, and theta notation.
10. Design algorithms for various scenarios.
11. Discuss the computational efficiency of the principal algorithms for sorting, searching, and hashing.
12. Demonstrate the following capabilities: to evaluate algorithms, to select from a range of possible options, to provide justification for that selection, and to implement the algorithm in programming context