网站大量收购独家精品文档,联系QQ:2885784924

《数据结构》课程简介(国外英语资料).doc

《数据结构》课程简介(国外英语资料).doc

  1. 1、本文档共5页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
《数据结构》课程简介(国外英语资料)

《数据结构》课程简介 Personal summary Tianfu College of Southwestern University of Finance and Economics Course synopsis Classroom teacher: Course Name: data structure Class: 2007 undergraduate computer professional class Lecture time: 2008-2009 Semester 1 Institute of academic affairs, Tianfu college, Southwestern University of Finance and Economics Course Name: data structure The summary of the contents of structure is a fundamental: Data course. The primary focus of this course is to introduce to students the ways elemental data could be organized into entities that facilitate more efficient programming. These organized items, called data structures, form the basis on which advanced programming techniques could be designed. In this course, we would learn various data structuring techniques (logic structures and storage structures of data and the ways efficient) also algorithms on such structures could be realized. The course material contains:Introduction (Pseudocode Abstract, data type, Algorithm efficiency analysis (Sequential), Searching search, Binary search and Hashed list searches), Linked lists (The concepts of Li Near lists and Linked list, Linked list algorithms and applications, Complex linked list structures Stacks (Basic), stack operations, Stack linked list implementation and stack applications), Queues (Queue operations, Queue linked list design and Queue applications), Recursion (How recursion works and designing recursive algorithms Introduction to trees (Basic), tree concepts, Binary trees, Binary tree traversals and expression trees Search trees (Binary), search trees, *AVL trees and Its Implementation), *Heaps (Definition, structure, Algorithms and applications *Multi-way trees (M-way), search trees, B-trees, Advanced), sorting concepts (Basic concepts, Insertion sorts, Selection sorts, Exchange sorts *Graphs (Terminology), Operations, Graph storage structures and algorithms The course would). Be language independent as much as possible. The students, h

您可能关注的文档

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档