lehrerbibliothek.deDatenschutzerklärung
Data and Algorithms An Introductory Course 2nd edition; with CD-ROM
Data and Algorithms
An Introductory Course


2nd edition; with CD-ROM

Bernd Breutmann
Carl Hanser Verlag , Fachbuchverlag Leipzig
EAN: 9783446217959 (ISBN: 3-446-21795-9)
157 Seiten, kartoniert, 16 x 23cm, Mai, 2001, inkl. CD-ROM

EUR 14,90
alle Angaben ohne Gewähr

Umschlagtext
This is the first book on "Data and Algorithms" designed to upgrade traditional educational resources by using eLearning material as a complement to face-to-face learning.



The book is your guide to the fundamental issues of "Data and Algorithms". It addresses first year computer science students and professionals who want to gain an overview of the basic concepts of computer science.



The CD-ROM supports and upgrades the written text. It includes animations for list and tree operations, sort and search algorithms, and exercises designated to stimulate students to deal with the topics in a self standing and practice oriented manner.



Bernd Breutmann is professor at the University of Applied Sciences in Wuerzburg, Germany. His subjects are Algorithms and Data Structures, Data Bases, and XML. He has been lecturing widely in European universities and has published books and articies. His long term experiences of how to use eLearning material to improve the process of learning together with his many years of lecturing experience have led the author to write this book.


Verlagsinfo
Das Buch geht aus der Lehrveranstaltung "Algorithmen und Datenstrukturen" des Autors hervor. Die zum Grundwissen gehörenden Themen werden präzise und lebendig behandelt. Dabei wird auch der Bezug des Faches zu anderen Informatikfächern, insbesondere zur "Programmierung" und zu "Datenbanken", dargestellt.

Die interaktive CD-ROM enthält Animationen zu Such- und Sortieralgorithmen sowie einen Übungsteil, der zur selbstständigen und praktischen Auseinandersetzung mit ausgewählten Themengebieten anregt.

Buch und CD-ROM sind in englischer Sprache abgefasst, da die Inhalte im Wesentlichen einem internationalen Standard entsprechen.
Inhaltsverzeichnis
1 ORIENTATION

1.1 Data, Information, Knowledge
1.2 Data: Forms of Representing Information
1.3 Objectives
1.4 Learning targets

2 BASICS OF PHYSICAL DATA ORGANISATION

2.1 The "Von-Neumann" Machine
2.2 Secondary Storage Devices
2.2.1 MagneticTape
2.2.2 Magnetic Disk
2.3 Characteristics of Physical Data Organisation
2.4 Data Organisation on Magnetic Discs
2.4.1 Disk Architecture
2.4.2 Access Time
2.4.3 Data Transfer Rate

3 DATA STRUCTURES AND DATA ABSTRACTION

3.1 Basic Data Types and Data Structures in Programming Languages
3.2 Data Abstraction

4 EFFICIENCY MEASURES OF ALGORITHMS

4.1 The Running Time of a Program
4.2 The "Big-O" Notation

5 INTERNAL SORTING

5.1 Simple Sorting Methods
5.1.1 Insertion Sort
5.1.2 Selection Sort
5.1.3 Bubble Sort
5.1.4 Summary
5.2 Quick Sort
5.3 Tree Sort
5.3.1 Heapsort
5.3.2 Bottom-Up-Heapsort

6 THE LIST DATA TYPE

6.1 The Abstract Data Type List
6.2 List Representations
6.2.1 Contiguous List Representation
6.2.2 Linked List Representation
6.2.3 Comparison of List Representations
6.2.4 Linked Representation on Contiguous Lists
6.3 The ADT STACK
6.4 The ADT QUEUE

7 LIST SEARCHING

7.1 Elementary Searching Schemes
7.1.1 Sequential Search
7.1.2 Binary Search
7.1.3 Block search
7.2 Comparison of Elementary Searching Schemes

8 LIST STRUCTURES ON EXTERNAL STORAGE

8.1 Access Characteristics of External Storage Devices
8.2 Indexed Sequential Organisation
8.3 Hashed Files
8.3.1 Hash Transformation Techniques
8.3.2 Collision Resolution Techniques
8.3.3 Analysis of Hashing methods

9 GRAPHS AND TREES

9.1 Graphs
9.2 Trees
9.2.1 The ADT Binary Tree
9.2.2 Binary Tree Representations
9.2.3 Traversais of a Binary Tree
9.3 Binary Search Trees
9.4 AVL Trees
9.5 B-Trees

LITERATURE

INDEX