Schaum's outline of introduction to computer science
Author(s)
Bibliographic Information
Schaum's outline of introduction to computer science
(Schaum's outline series)
McGraw Hill, c2000
- : pbk
- Other Title
-
Schaum's outlines introduction to computer science : with examples in Visual Basic, C, C++, and Java
Available at 10 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes index
Description and Table of Contents
Description
This outline covers the required Introduction to Computer Science course for computer science majors and the Advanced Placement Computer Science examination taken by high school students. The outline presents the introductory concepts of computer science with emphasis on algorithm development and data abstraction. Although the concepts are language independent, the authors will illustrate them using graded examples, in C, C++, and Java. Whenever appropriate, examples using other languages like Pascal, BASIC, and FORTRAN will also be used.
Table of Contents
- Computers and computer organization
- programming languages
- programming activities
- problem solving, top down design and data abstraction
- flowcharting and pseudocode
- basic control structures
- sequence, selection, repetition
- algorithms, variables and constants
- simple data types
- assignments and arithmetic expressions
- operator precedence
- logical expressions
- control structures - selection, repetition
- functions
- scope of variables
- parameter passing mechanisms
- arrays - single dimensions and multi dimensions
- searching and sorting
- pointers, linked lists, stacks, queues
- file I/O concepts
- classes, inheritance and data abstraction.
by "Nielsen BookData"