Data Structure and Algorithm

Course Objectives

The aims of this course:

  • To introduce various techniques for representation of the data in the real world .
  • To design and implement various data structures and algorithms.
  • To develop application by applying data structures and algorithms.  
  • To understand space and time complexity of various algorithms.
  • To understand data structure with algorithms and its analysis procedure.

Learning Objectives

The successful completion of this course, Student will be able:

  • To select appropriate data structures as applied to specified problem definition.
  • To implement operations like searching, insertion, and deletion, traversing mechanism etc. on various data structures
  • To calculate the time complexity which is a key concept for evaluating the performance of algorithms
  • To determine and analyze the complexity of given algorithms

Reference Materials

Reference Book's Photo Reference Book's Materials
“Data Structures and Algorithms: Annotated Reference with Examples”, (First Edition) by Granville Barnett and Luca Del Tongo
“Theory and Problems of Data Structures”, (International Editions) by Seymour Lipschutz
“Data Structures and Algorithms in Java”, (Fourth Edition) by T.Goodrich and Roberto Tamassia
“Lecture Notes for Data Structures and Algorithms”, Revised each year by John Bullinaria, Version of 27 March 2019

Assessment Plan

Assessment Plan for the Course
Paper Exam 60%
Tutorial 10%
Assignment 10%
Class Participation 5%
Quizzes/ Moodle 15%