Download Data Structures

COURSE SYLLABUS
Course Title：Data Structures
Credits / Hours
3/3
Course
Number
124046
□Required
■Elective
Course Description
This course presents a wide range of programming techniques and concepts that make it
possible to solve larger and more complex problems. So, how to use these techniques and
concepts to simply various problems is very important. The concepts of many subjects including
the DAT, recursion, link, algorithms efficiency, sorting, tree, graph, and so on are also
introduced in this course.
Course Topics
Topic
Content
This part summaries several fundamental principles that
serve as the basis for dealing with the complexities of large
Principles of Programming and programs. And, a brief discussion of algorithms and data
Software Engineering
abstraction and indicates how these topics relate to develop
problem-solving and programming skills are presented in
this part.
The goal of this part is to ensure that students have a basic
Recursion:The Mirrors
understanding of recursion, which is one of the most
powerful techniques available to the computer scientist.
This part elaborates on data abstraction, which was
introduced in part 1 as a technique for increasing the
Data Abstraction: The Walls
modularity of a program – for building “walls” between a
program and its data structures.
This part introduces the students to C++ points and the data
structure linked list. The students will see algorithms for
Linked Lists
fundamental linked list operations such as insertion and
deletion.
Part 2 presented the basic concepts of recursion, and now
Recursion as a Problem-Solving
this part moves on to some extremely useful and somewhat
Technique
complex applications in computer science.
Problem Solving with Abstract This part introduces two data organizations used to build the
Data Types
ADT.
Algorithm Efficiency and Sorting
This part will show the students how to analyze the
efficiency of algorithms. The basic mathematical techniques
for analyzing algorithms are central to move advanced
topics in computer science and give the studnts a way to
formulize the notion that one algorithm is significantly more
efficient than another.
Queues and Trees
This part discusses the specifications, implementation, and
relative efficiency of the ADT queues and trees.