Scribd
Upload
2 views

Data Structures

The document outlines a course on Data Structures for Financial Engineering students at Zhejiang Gongshang University, focusing on the theoretical study and implementation of data structures. It includes course objectives, weekly topics, assessment criteria, and prescribed texts, aiming to enhance students' problem-solving and software development skills. The course consists of 3 hours per week over 16 weeks, with homework assignments and a final project contributing to the overall grade.

Uploaded by

qq1812016515
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Data Structures

The document outlines a course on Data Structures for Financial Engineering students at Zhejiang Gongshang University, focusing on the theoretical study and implementation of data structures. It includes course objectives, weekly topics, assessment criteria, and prescribed texts, aiming to enhance students' problem-solving and software development skills. The course consists of 3 hours per week over 16 weeks, with homework assignments and a final project contributing to the overall grade.

Uploaded by

qq1812016515
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Name: Jiahao Li Major: Financial Engineering

Course: Bachelor of Economics University: Zhejiang Gongshang University


Subject
Data Structures Semester: 1 Year: 2020
Title:
Total hours:

3 hours per week


16 weeks per semester

Overview:
This course is designed for financial engineering students, focusing on the theoretical study and simple
implementation of data structures. By studying data structures, students will understand the various
methods and structures used by computers to organize and store non-numerical information when solving
a range of problems. The course aims to inspire students to think about selecting more suitable data
structures and writing higher-quality programs when solving problems in their studies and work.

Objectives:
On completion of this subject the student is expected to:
1. Fundamental Concepts: To introduce the basic concepts of data structures and the importance
of data and abstract data types in computer science.
2. Algorithmic Thinking: To develop students' ability to analyze algorithms and understand the
principles of algorithm design.
3. Data Organization: To train students in organizing data effectively using various data
structures.
4. Problem-Solving Skills: To enhance students' skills in selecting and implementing appropriate
data structures to solve complex problems.
5. Software Development: To prepare students for software development by emphasizing the role
of data structures in writing efficient and maintainable code.

Weekly topic schedules:

Week 1: Basic concepts of data structures; Representation and implementation of


data, abstract data types; Algorithms and algorithm analysis
Week 2: Definition and related concepts of linear lists
Week 3: Implementation of sequential storage structure for linear lists
Week 4: Implementation of linked storage structure for linear lists; Definition of
abstract data type for sparse polynomials
Week 5: Structural characteristics and abstract data type definition of stacks;
Implementation of sequential storage structure for stacks; Linked storage
representation and implementation
Week 6: Structural characteristics and abstract data type definition of queues;
Implementation of sequential storage structure for queues; Linked storage
representation and implementation
Week 7: Application of stacks and queues in program design
Week 8: Structural characteristics and abstract data type definition of strings;
Fixed-length data storage structure and heap allocation storage structure
Week 9: Structural characteristics and abstract data type definition of arrays;
Compressed storage of special matrices and sparse matrices
Week 10: Definition of abstract data type for trees and basic terminology;
Definition of abstract data type for binary trees; Properties and storage structure
Week 11: Traversal of binary trees; Definition of threaded binary trees; Traversal
and threading of binary trees
Week 12: Storage structure of trees; Traversal of trees and forests and conversion
of binary trees
Week 13: Various applications of trees; Huffman tree
Week 14: Definition and terminology of graphs; Four storage structures for graphs
Week 15: Graph traversal strategies; Connectivity and minimum spanning tree of
graphs
Week 16: Assessment class

Assessment:
Homework Assignments: 40% of the total grade, which reflects the importance of regular coursework
and consistent learning throughout the semester.
Final Project: 60% of the total grade, indicating the significance of the comprehensive work submitted
at the end of the term in determining the final academic outcome

Prescribed Texts:
"Data Structures" by Wang Qin, published by Tsinghua University Press

Web ：https://jwxt.zjgsu.edu.cn/jwglxt/jsjxrl/jsjxrl_cxJsjxrlCx.html?
gnmkdm=N155002&layout=default

You might also like