KẾ HOẠCH TRIỂN KHAI HỌC PHẦN

PLAN OF COURSE IMPLEMENTATION

DANANG CAMPUS

Tên học phần/Course name: Truyền thông Marketing tích hợp

Intergrated Marketing Communication

1. Thời gian triển khai: Học kỳ: Fall 2022 từ 05/09/2022 đến 14/11/2022
Duration: Semester Fall 2022 from 05/09/2022 to 14/11/2022

2. Số lớp triển khai/Number of classes: 02

3. Đề cương triển khai: <nêu tên, link syllabus triển khai trên CMS>
Implement in accordance with Syllabus: <name of syllabus and link to CMS>

4. Danh sách Giảng viên triển khai học phần/ List of Classes and Lecturers:
STT Tên giảng viên STT Tên giảng viên
No. Lecturer No. Lecturer
1 BA17A01 – Trịnh Lê Tân
2 BA17A03 – Trịnh Lê Tân

5. Danh sách giảng viên hỗ trợ, trợ giảng, khách mời (nếu có),
Supporting Lecturers, assistants, guest speakers (if any)
Họ và tên Số lớp
STT Vai trò Nội dung Thời lượng Thời gian Kinh phí
Full No of
No. Role Content Duration Time Budget
name Class

6. Các hoạt động phát sinh: Addtional Activities:

Họ và tên Số lớp
STT Mục tiêu Thời lượng Thời gian Kinh phí
Full No of
No. Target Duration Time Budget
name Class

7. Tài liệu tham khảo bổ sung/Additional References:

Data-Structures-and-Algorithms-in-Java-6th-Edition
Course slide

8. Môi trường, công cụ triển khai bổ sung/ Update Environments and Tools (if any):
a) Thực hiện giảng dạy hoặc sử dụng trên những website nào:
Websites for Teaching or Using: https://lmsdn.fpt.edu.vn

b) Yêu cầu về công cụ, kỹ thuật đặc thù gì (cái gì, ở đâu, như thế nào…)
Specific Tools and technical required (What? Where? How?, etc.)

c) Kênh trao đổi thông tin giữa thầy và trò (kể cả việc nộp bài, cho điểm, nhận xét…)
Communication channels among lecturers and students (including submitting assignments,
marking, and giving comment): https://lmsdn.fpt.edu.vn

10. Lịch triển khai môn học

Assignment
Slot Week Chapter -Topic -Content Assessment Note
Homework
Course Introduction
1 1.1. Using Arrays    
1.2. Singly Linked Lists
05/09/2022 1.3. Circularly Linked Lists
2   Assignment 1.1  
1.4. Doubly Linked Lists
3 Review Exercises    
4 Guiding    
03.02-BM/ĐH/HDCV/FPTU 1/0 1/4
 Exercises/Assignment
5 2.1 Stacks    
Guiding
6    
Exercises/Assignment
2.2 Queues
7 2.3 Double-Ended Queues    
(Deque
12/09/2022
8 2.4 The Priority Queue   Assignment 1.2  
9 Review Exercises    
Guiding
10    
Exercises/Assignment
3.1 Illustrative Examples
3.1.1 The Factorial Function
11    
3.1.2 Binary Search
3.1.3 File Systems
3.2 Analyzing Recursive
Algorithms
3.3 Further Examples of
Recursion
3.3.1 Linear Recursion
12   Assignment 1.3  
3.3.2 Binary Recursion
3.3.3 Multiple Recursion
3.4 Designing Recursive
Algorithms
3.5 Eliminating Tail Recursion
13 Review Exercises    
Guiding
14    
Exercises/Assignment
19/09/2022 4.1 General Trees
4.1.1 Tree Definitions and
15 Properties    
4.1.2 The Tree Abstract Data
Type
4.2 Binary Trees
4.2.1 The Binary Tree Abstract
Data Type
16   Assignment 1.4  
4.2.2 Properties of Binary Trees
4.3 Implementing Trees
4.4 Tree Traversal Algorithms
Review Exercises
17    
Assignment evaluation
18 Guiding Exercises/Assignment    
4.5 Binary Search Trees
19 4.5.1 Searching Within a Binary    
Search Tree
26/09/2022
20 4.5.2 Insertions and Deletions   Assignment 1.4  
21 Review Exercises    
Guiding
22    
Exercises/Assignment
4.6 Balanced Search Trees
23    
4.7 AVL Trees
24 4.8 Heaps    
25 Review Exercises    
Guiding
26 03/10/2022    
Exercises/Assignment
27 Progress test 1 and review    
 Practical Exam: Part A
28 Review    
5.1 Graphs
5.2 Data Structures for Graphs
5.2.1 Edge List Structure
29    
5.2.2 Adjacency List Structure
5.2.3 Adjacency Matrix
Structure
 5.3 Graph Traversals
30 5.3.1 Depth-First Search   Assignment 2.1  
5.3.3 Breadth-First Search
31 Review Exercises
Guiding
32 10/10/2022 Exercises/Assignment
5.4 Shortest Paths
33
5.4.1 Weighted Graphs
34 5.4.2 Dijkstra’s Algorithm Assignment 2.1
35 Review Exercises
Guiding
36
Exercises/Assignment
5.5 Minimum Spanning Trees
37
5.5.1 Prim-Jarn´ık Algorithm
5.5.2 Kruskal’s Algorithm
38 17/10/2022 5.6. Euler's tour and Euler's Assignment 2.1
cycle
39 Review Exercises
Guiding
40
Exercises/Assignment
6.1 Selection-Sort
41 Assignment 2.2
6.2 Insertion-Sort
6.3 Bubble-sort
42
6.4 Quick-Sort
43 Review Exercises
Guiding
44 24/10/2022 Exercises/Assignment
6.5 Merge-Sort
45
6.6 Heap-Sort
6.7 Linear-Time Sorting:
Bucket-Sort and Radix-Sort
46 Assignment 2.2
6.8 Comparing Sorting
Algorithms
47 Review Exercises
Guiding
48
Exercises/Assignment
7.1 Hash Tables
49 7.2 Hash Functions
7.3 Collision-Handling
7.4 Load Factors, Rehashing,
31/10/2022 and Efficiency
50 Assignment 2.3
7.5 Java Hash Table
Implementation
51 Review Exercises
Guiding
52
Exercises/Assignment
53 8.1 Abundance of Digitized
Text
8.2 Pattern-Matching
 Algorithms
8.2.1 Brute Force
8.2.2 The Knuth-Morris-Pratt
Algorithm
8.3 Text Compression
8.3.1 The Huffman Coding
Algorithm
54 Assignment 2.4
8.3.2 The LZW Algorithm
8.3.3 The Run-length Encoding
Algorithm
55 Review Exercises
56 07/11/2022 Review Exercises
57 Assignment evaluation

58 Assignment evaluation

59 Progress test 2 and review

60 Practical Exam: Part B

14/07/2022

Người phê duyệt/Approver Người kiểm tra/Reviewer Người lập/Creator

GĐCS/Campus’s Director TBĐT/Head of Academic Affairs Board) CNBM/Head of department

Họ tên/Name: Họ tên/Name: Họ tên/Name: Nguyễn Thị Bảo Trang

Ngày/Date: Ngày/Date: Ngày/Date: 28/08/2022