University of Information Technology, Yangon

Second Year (2023-2024 Lecture Plan)

CST-22104 Data Structure and Algorithms with Java
Textbook:
1. Introduction to the Design and Analysis of Algorithms, 3rd Edition by Anany Levitin, 2012.
References:
1. Learning Java, Fourth Edition by Patrick Niemeyer and Daniel Leuck, June 2013.
2. Data Structures & Algorithms in Java, Second Edition by Robert Lafore, 2003.
3. Data Structures and Algorithms in Java™, Sixth Edition by Michael T. Goodrich, Roberto
Tamassia and Michael H. Goldwasser, 2014.
Periods : 4 periods per week (60 periods, 15 weeks)
(2 periods – lecture, 2 periods – Assessment (Class Participation + Class Performance)
Semester: Second Semester

No Lectures Page Period Lecture Plan Details

1. Lecture 1: Introduction to Data T(1 ~ 18), 4
Structures and Algorithms R1(25~35)
 What Is an Algorithm? 2 Explain with
 Fundamentals of Algorithmic examples
 Problem Solving
 Fundamental Data Structures
Introduction to Java and Java program 2 Lab
practical
2. Lecture 2: T(41 ~55) 4
Analysis of Algorithm Efficiency
 The Analysis Framework 2
 Asymptotic Notations and Basic
Efficiency Calsses (O-notaion,
omega-notation, theta notation)
Java program practical and reading 2 Lab
assignment
3. Lecture 3: T(61 ~79) 4
Analysis of Algorithm Efficiency
 Mathematical Analysis of 2 Explain Analysis of
Nonrecursive Algorithms algorithm efficiency
 Mathematical Analysis of with example
Recursive Algorithms algorithms
A1. Assignment 2
4. Lecture 4: Brute Force Sorting and T(97~104), 4
Searching R2(122~130)
 Selection Sort and Bubble Sort 2 Explain sorting and
 Sequential Search searching algorithms
1
 University of Information Technology, Yangon
Second Year (2023-2024 Lecture Plan)
with examples
A2. Tutorial and Discussion 2
5. Lecture 5: Brute Force Sorting and T(122~130) 4
Searching
 Dept-First Search 2
 Breadth First Search
Doing exercises and related problems 1
Reading Assignment for Java codes 1 References book 2
6. Lecture 6: Brute Force String T(105~107), 4
Matching and Exhaustive Search T(115~120)
 Brute-Force String Matching 2
 Exhaustive Search
 Traveling Salesman Problem
 Knapsack Problem
 Assignment Problem
Doing practical exercises and related 2
problems
7. Lecture 7: Decrease-and-Conquer T(131~142), 4
R1(157~161)
 Introduction to Decrease-and- 2 Detail explains with
Conquer algorithms
 Insertion Sort
 Topological
 Variable-Size-Decrease
Algorithms
A3. Assignment 2
8. Lecture 8: Divide-and-Conquer T(169~181) 4
 Introduction to Divide-and- 2 Explain algorithms
Conquer with example
 Mergesort and Merge Algorithms problems
 Quicksort and Hoare Partition
Algorithms
A4. Tutorial and Discussion 2
9. Lecture 9: Transform-and-Conquer T(201~205), 4
T(226~233)
 Introduction to Transform-and- 2 Explain algorithms
Conquer with examples in
 Presorting detail.
 Heaps and Heapsort
A5. Presentation for group project 2

2
 University of Information Technology, Yangon
Second Year (2023-2024 Lecture Plan)
preparation
10. Lecture 10: Balanced Search Trees T(218~225)
 AVL Trees 2
 2-3 Trees
Doing exercises and related problems 2
Reading assignments
11. Lecture 11: Balanced Search Trees T (463~470) 4
 2-3-4 Trees Reference book 2
A6. Assignment
12 Lecture 12: Space and Time Trade- T(253~257), 4
Offs T(269~274)
 Sorting by Counting 2 Explain in detail
 Hashing
 Opening Hashing (Separate
Chaining)
 Closed Hashing (Open
Addressing)
A7. Tutorial and Discussion 2
13. Lecture 13: Dynamic Programming T(283~287), 4
T(292~297)
 Introduction to Dynamic 2 Explain algorithms
Programming with examples in
 Coin-Row Problem detail.
 The Knapsack Problem and
Memory Functions
Doing exercises and related problems 2
14. Lecture 14: Dynamic Programming T(287~289), 4
T(304~312)
 Change-Making Problem 2 Explain algorithms
 Warshall’s Algorithm with examples in
 Floyd’s Algorithm for the All- detail.
Pairs Shortest-Paths Problem
A8. Group Project Presentation 2
15. Lecture 15: Greedy Technique T(315~322),
T(333~343)
 Prim’s Algorithm 2 Explain it with
 Dijkstra’s Algorithm examples
 Huffman Trees and Codes
Doing exercises and 2
related problems

3
 University of Information Technology, Yangon
Second Year (2023-2024 Lecture Plan)
Review and Revision