课程文献中心 更多>>

关键词： 数据结构   实践   Word黑板   算法   编程  

摘要： 主要研究"数据结构"这门课程的实践教学环节的教学过程,以利于提高学生算法设计与编程能力的培养.在实验室(计算机机房)和教室中直接用Word作为黑板进行讲解,所有的教学内容均可在Word下直接进行,并与编程工具有机地结合在一起.将数据结构课程中的所有经典算法,利用Word中的工具制作出演示过程,让学生能充分理解和掌握算法的基本思想.然后再通过VC++等编程工具直接在教师机上进行算法编程,展现在学生面前.

关键词： 慕课   混合式教学   翻转课堂  

摘要： 根据"数据结构"课程的特点和传统教学模式下存在的问题,在"数据结构"慕课开放平台下,尝试将传统教学与翻转课堂相结合,探索混合式教学方式下的教学设计、教学组织与实施过程,并进行总结和思考。

关键词： 数据结构   稀疏矩阵   三元组   十字链表   压缩存储  

摘要： 稀疏矩阵运算是"数据结构"课程中重要的教学内容,因为其涉及多种数据结构和操作技术。从稀疏矩阵的基本存储技术出发,介绍了稀疏矩阵的两种常用存储形式:三元组顺序表和十字链表,然后详细阐述了有关稀疏矩阵的运算,包括加法、减法以及乘法,并以C为工具,对各运算算法给予了实现。

关键词： 项目驱动   数据结构教学   教学模式  

摘要： 针对传统数据结构课程教学的不足,提出将项目驱动教学应用于数据结构课程教学中.实践证明,项目驱动教学模式比传统课程教学模式在数据结构课程教学中,更能激发学生的学习热情和兴趣,提高学生的实践能力.

关键词： C语言   指针教学   复杂数据  

摘要： C语言指针教学一直是一个难点,如何让学生正确理解并掌握指针的定义及作用,是摆在所有教师面前的一道难题。特别是C语言中对复杂数据结构的定义,更加抽象化且难以理解,给教学工作带来了较大的阻力。本文通过分析指针的基本概念,对指针中的变量进行详细说明,帮助学生理解各种运算符号,为定义复杂数据结构的教学提供了一些便捷。

关键词： Correctness   Data mining   Existential probability   Frequent pattern mining   Uncertain pattern  

摘要： The concept of uncertain pattern mining was recently proposed to fulfill the demand for processing databases with uncertain data, and various relevant methods have been devised. However, previous approaches have the following limitations. State-of-the-art methods based on tree structure can cause fatal problems in terms of runtime and memory usage according to the characteristics of uncertain databases and threshold settings because their own tree data structures can become excessively large and complicated in their mining processes. Various approximation approaches have been suggested in order to overcome such problems;however, they are methods that increase their own mining performance at the cost of accuracy of the mining results. In order to solve the problems, we propose an exact, efficient algorithm for mining uncertain frequent patterns based on novel data structures and mining techniques, which can also guarantee the correctness of the mining results without any false positives. The newly proposed list-based data structures and pruning techniques allow a complete set of uncertain frequent patterns to be mined more efficiently without pattern losses. We also demonstrate that the proposed algorithm outperforms previous state-of-the art approaches in both theoretical and empirical aspects. Especially, we provide analytical results of performance evaluation for various types of datasets to show efficiency of runtime, memory usage, and scalability in our method. (C) 2016 Elsevier B.V. All rights reserved.

关键词： C语言   C++语言  

ISBN: (纸本)9787111560609

关键词： Calling Context Tree   Context sensitivity   Dynamic metrics   Trace analysis   Program comprehension   Profiling  

摘要： Calling context profiling has proved out to be extremely useful in program understanding and optimization. Calling contexts can be organized in several ways, such as Dynamic Call Tree (DCT), Calling Context Tree (CCT), Hot Calling Context Tree (HCCT), Approximate Calling Context Tree (ACCT) and Calling Context Uptree (CCU). This paper conducts a comparative performance analysis on all major calling context data structures using the evaluation of a set of dynamic cohesion and coupling metrics at package, class and method levels on a set of open source java applications. The results imply that DCT, CCT and CCU are all similar in metric accuracy but vary in time and space requirements. ACCT, while incurring least time and space overhead, generates highly inaccurate and misleading results. The performance of HCCT is highly dependent on a predetermined hot-context threshold value. It was concluded that CCT outperforms others in comprehensive representation of inter-procedural control flow and collection of dynamic metrics for a program, in terms of both time-space overhead and accuracy.

关键词： C语言  

ISBN: (纸本)9787111560609

摘要： 本书共九章，围绕线性表、栈、队列、串、矩阵、广义表、树、二叉树、图等常用的数据结构，介绍了基本概念、逻辑结构、存储结构、操作运算及实现算法、案例应用；还介绍了多种常用的查找算法和排序算法，并对各种算法的性能进行分析。书中使用C语言定义各种数据结构，利用C/C++代码描述算法。

关键词： Compressed data structures   Ternary relations   RDF   Temporal graphs   K-2-tree  

摘要： The representation of binary relations has been intensively studied and many different theoretical and practical representations have been proposed to answer the usual queries in multiple domains. However, ternary relations have not received as much attention, even though many real-world applications require the processing of ternary relations. In this paper we present a new compressed and self-indexed data structure that we call Interleaved K-2-tree (IK2-tree), designed to compactly represent and efficiently query general ternary relations. The IK2-tree is an evolution of an existing data structure, the K-2-tree [6], initially designed to represent Web graphs and later applied to other domains. The IK2-tree is able to extend the K-2-tree to represent a ternary relation, based on the idea of decomposing it into a collection of binary relations but providing indexing capabilities in all the three dimensions. We present different ways to use IK2-tree to model different types of ternary relations using as reference two typical domains: RDF and Temporal Graphs. We also experimentally evaluate our representations comparing them in space usage and performance with other solutions of the state of the art. (C) 2016 Elsevier B.V. All rights reserved.