SLIIT Computing
Delivery Plan – 2017-Year 2 Semester 1
Data Structures and Algorithms (JAVA)
Higher National Diploma
Lecturer: S.G.S Fernando
Week Session Description
1 Introduction
2 Stacks
3 Queues
4 Linked Lists
5 Basic Sorting & Searching
Algorithms
6 Advance Sorting (Insertion /
Shell)
7 Advance Sorting (Merge)
8 Mid Term Examination
9 Advance Sorting (Quick) and
Workshop - Algorithms
10
Binary Trees (Part I)
11
Binary Trees (Part II)
12 Hash Tables
Tutorial Problem Lab Work Assessment
Tutorial One : Questions based on arrays Introduction to Netbeens
Tutorial Two: Questions based on stacks Array Handling
Tutorial Three : Questions based on Stacks
queues
Tutorial four : Questions based on Linked Queues Performance of the lab
Lists session would be
Tutorial Five : Questions based on Linked Lists evaluated every week -
(Bubble, selection , binary & liner) during the lab hours
Tutorial Six : Questions based on Basic Sorting & Searching
(Insertion , Shell) Algorithms
Tutorial Seven : Questions based on Advance Sorting
Merge (Insertion / Shell)
Tutorial Eight : Questions based on Quick Advance Sorting (Merge)
Tutorial Nine : Questions based on briary Advance Sorting (Quick) Performance of the lab
trees session would be
Tutorial Ten : Questions based on briary Binary Trees (Part I) evaluated every week -
trees during the lab hours
Tutorial eleven : Questions based on hash Binary Trees (Part II)
tables
13 Graphs Tutorial Twelve : Questions based on Hash Tables
graphs
14 Revision (Past Paper discussion ) Revision (Past Paper discussion ) Graphs