IT2201: DATA STRUCTURES AND ALGORITHMS

1
PART 2
IT2201 DATA STRUCTURES AND ALGORITHMS
E-mail dsa_at_ict.cmb.ac.lk
Preparing for BIT 19/04/2001
2
AFTER SUCCESSFULLY COMPLETING THIS MODULE
STUDENTS SHOULD BE ABLE TO

• Describe different types of data structures of
  common use in programming
• Lists, Stacks, Queues, Trees, Graphs, Tables)
• ( Array based linked representations)
• Identify important properties and uses of such
  data structures
• Usefulness of stacks, queues and trees for
  solving common problems

3
AFTER SUCCESSFULLY COMPLETING THIS MODULE
STUDENTS SHOULD BE ABLE TO

• Write pseudo code Java code to implement and
  use these data structures
• E.g. use in evaluation of Mathematical
  expressions, use for writing a simple calculator
  application etc.
• Describe some useful internal external sorting
  algorithms
• Bubble, Linear Insertion, Selection Sort, Merge,
  Shell, Heap, Quick, Straight Radix, Radix
  Exchange Sort

4
AFTER SUCCESSFULLY COMPLETING THIS MODULE
STUDENTS SHOULD BE ABLE TO

• Describe some useful searching algorithms
• Sequential Search, Binary Search, Indexed
  Sequential Search
• Write pseudo code and Java code for Sorting
  Searching Algorithms above
• Analyse the performance of Searching and Sorting
  Algorithms above

5
OUTLINE OF THE SYLLABUS

• TOPIC MIN.
  NO.OF HOURS
• INTRODUCTION TO DATA STRUCTURES 01
• STACKS 04
• QUEUES/LISTS 06
• TREES 12
• GRAPHS 12
• TABLES 03
• RUNNING TIME 05
• SORTING ALGORIHMS 14
• SEARCHING ALGORITMHS 03
• TOTAL 60

6
PRACTICALS /TUTORIALS

• Students are expected to have a total of 20
  additional hours of practical tutorials to
  further strengthen their knowledge of this module

7
PLATFORM

• Any standard PC (Pentium) with a standard java
  compiler (JDK1.2 or above)
• NOTE Students are expected to use java as the
  coding language for this module

8
REFERENCESMAIN READING

• Data structures and problem solving using Java by
  M.A. Weiss, Addision-Wesley
• Analysis of algorithms by M.A. Weiss,
  Addision-Wesley
• Introduction to data structures and algorithms
  with java by E.Rowe, Prentice-Hall Europe, 1998

9
REFERENCESSUPPLEMENTRY READING

• Data Structures using Pascal by A.M. Tanenbaum
  and M.J.Augenstein, (2nd Edition) Prantice-Hall
  of India, Eastern Economy Edition, 2000
• Data Structures and Algorithms by A.V.Aho,
  J.E.Hopcropt and T.D.Ullman, Addision -Wesley,Low
  priced Edition, 1999