B.Sc.in Management and Information Technology (Interim)

BACHELOR OF SCIENCE IN MANAGEMENT AND INFORMATION TECHNOLOGY

IMIT 12052

Data Structures and Algorithms

Status : Core Pre-requisite : G.C.E. (A/L) Co-requisite : None

 

On completion of this course, the student should be able to:

  • Illustrate the properties and implementation details of fundamental data structures and algorithms
  • Design and successfully implement correct and efficient algorithms for real-world problems

  • Algorithms: Correctness and efficiency of an algorithm. The best, worst, and average complexities of algorithms. The big O notation, growth rates, analysis of time and space complexities of algorithms. Searching and sorting algorithms. Recursion and backtracking.
  • Data structures: Fundamental data structures: Arrays, structures, linked-list, stacks, queues, dictionaries, hash tables, trees, and graphs. Introduction to classes.

 Lectures, supervised hands on practical and group work.
 End-of- semester examination and continuous assessment.

  1. Robert L. Kruse, Clovis L. Tondo, and Bruse P. Leung, “Data Structures and Program Desing in C”, 2004, Prentice-Hall of India.
  2. Steven S. Skiena, “The Algorithm Design Manual”, 1998, Springer-Verlag, Inc.
  3. H.M. Deitel and P.J. Deitel, “C: How to Program”, 1994, Prentice-Hall, Inc.

Back