课程文献中心 更多>>

关键词： C语言   指针   数据结构   编程过程   操作系统   初学者   加载器   CPU  

摘要： 指针简介 指针是C语言的一个最重要的特征，它提供了一种统一的方法，使其能访问远程的数据结构。但对C语言初学者而言，在编程过程中熟练的使用指针并不能像使用int型变量一样地轻松愉快，容易上手，往往是不得其精髓。我们知道，不论什么时候，运行一个程序A，首先都是操作系统自身的加载器把A装入内存，然后CPU才能执行。所以A程序的所有要素都会驻留在内存的某个位置。

关键词： 数据结构   教学方法   教学改革  

摘要： 对于非计算机专业“数据结构”课程的教学,面临着学生的计算机基础知识薄弱、编程能力弱、学习困难多等问题,为此首先要解决的问题就是如何调动学生学习的兴趣问题,提出结合不同专业特征设计教学内容,通过专业实例加深学生对所学专业知识和数据结构理论知识之间的联系和学习,积极调动学生学习兴趣,同时提出需要建立课程网站和改进实验教学改革方案。

关键词： 数据结构   逻辑结构   物理结构   算法  

摘要： 数据结构是计算机及相关专业的基础课程,是提高计算机程序设计能力的必要条件。数据结构是介于数学、计算机软件和计算机硬件之间的一门课程,它是计算机程序设计、数据库、操作系统、编译原理及人工智能等重要基础,广泛的应用于信息学、系统工程学等各种领域。本文简述了数据结构的基本概念,基本原理,运算方法。

关键词： 命令提示符   DOSKEY   数据结构   虚拟地址   物理地址  

摘要： 近年来,随着网络犯罪日益猖獗,网络犯罪分子的技术水平也日渐提升。他们为了应对计算机取证技术,往往通过加密、隐藏或擦除等方法使敏感数据消失,更有甚者会通过避免向硬盘介质写入数据的方式,完全基于内存实现恶意行为。在这种情况下,内存就成了外存之后新的取证热点,从而吸引了越来越多的关注。作为现代操作系统的关键技术之一,内存地址转换技术在内存信息取证调查工作中发挥着十分重要的作用。所谓内存地址转换,主要指虚拟地址与物理地址转换。在电子数据取证过程中,获得内存中重要信息(如可执行文件名称及参数、被访问文件与文件夹、IP地址及域名等)的虚拟地址之后,往往需要将其转化为物理地址才能获取真正有价值的证据或线索,以揭示犯罪分子更深层次的行为细节。

关键词： Complex networks   Subgraphs   Data structures   Trees   Network motifs   Graphlets  

摘要： The ability to find and count subgraphs of a given network is an important non trivial task with multidisciplinary applicability. Discovering network motifs or computing graphlet signatures are two examples of methodologies that at their core rely precisely on the subgraph counting problem. Here we present the g-trie, a data-structure specifically designed for discovering subgraph frequencies. We produce a tree that encapsulates the structure of the entire graph set, taking advantage of common topologies in the same way a prefix tree takes advantage of common prefixes. This avoids redundancy in the representation of the graphs, thus allowing for both memory and computation time savings. We introduce a specialized canonical labeling designed to highlight common substructures and annotate the g-trie with a set of conditional rules that break symmetries, avoiding repetitions in the computation. We introduce a novel algorithm that takes as input a set of small graphs and is able to efficiently find and count them as induced subgraphs of a larger network. We perform an extensive empirical evaluation of our algorithms, focusing on efficiency and scalability on a set of diversified complex networks. Results show that g-tries are able to clearly outperform previously existing algorithms by at least one order of magnitude.

关键词： Data structure   On-lattice simulation   Metropolis sampling   Cluster cluster aggregation   Computational complexity  

摘要： A compounded data structure is developed to optimize the simulation of colloidal aggregation using the on-lattice Cluster-Cluster Aggregation (CCA) model. Brownian motion, collision detection and aggregation as the basic operations in the CCA simulation are illustrated and evaluated based on the compounded data structure, respectively. The critical improvement of our algorithm is in distinguishing any selected clusters consisting particles and ascertaining their neighboring positions efficiently in simulation, which was traditionally performed by the exhaustive search in the whole system. Analytical results show that the new algorithm achieves linear computational complexity in each of the main operations, which is very appealing in performance optimization in using on-lattice CCA simulations. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Algorithms   Human Factors   Experimentation   Sketch-based input   data structures   visualization   animation  

摘要： We present CSTutor, a sketch-based interface designed to help students understand data structures, specifically Linked Lists, Binary Search Trees, AVL Trees, and Heaps. CSTutor creates an environment that seamlessly combines a user's sketched diagram and code. In each of these data structure modes, the user can naturally sketch a data structure on the canvas just as they would on a white board. CSTutor analyzes the user's diagrams in real time, and automatically generates code in a separate code view to reflect any changes the user has made. Additionally, the code can also be edited and any new code changes will animate the data structure drawn on the canvas. The connection between the data structure drawn on the canvas and the code implementation is intended to bridge the gap between the conceptual diagram of a data structure and the actual implementation. We also present the results of two semester-long studies using CSTutor in a CS1 course. The results indicate that students preferred CSTutor and were more engaged using it than a standard whiteboard lecture;however, results were mixed in quiz and exam performance.

关键词： 数据结构   逻辑结构   程序设计  

摘要： 在计算机科学中,数据的逻辑结构通常是指程序设计问题中(可以是数值计算,也可以是非数值计算)计算机的操作对象(又叫数据元素)之间的抽象的逻辑上的关系和基于这种逻辑关系的运算。本文介绍了几类常用的逻辑结构。

关键词： 数据结构   问题   教学改革  

摘要： 数据结构是计算机科学与技术专业的核心课程,由于课程理论性较强,同时对学生上机实践能力的要求也比较高等种种原因造成本课程学习难度较高。文章对数据结构教学中的常见问题进行分析,并提出经过自身实践总结出的一些教学改革措施。