CS 10051 Introduction to Computer Science Guidelines

CS 10051 is broad introduction to computer science. Many important concepts underlying computer science are covered.

The course includes a weekly 2 hour lab that provides experience with the concepts covered in the lectures.

Detailed Contents

The material covered in CS 10051 is broken into 3 groups of approximately 5 weeks each.

Weeks 1 - 5

Algorithm related concepts are covered including:

• The Gibbs and Tucker definition of computer science
• Algorithm, definition of algorithm
• The algorithmic foundations of computer science
• Computing agent
• The expression of algorithms as pseudocode, including
  • Variables
  • Looping
  • Conditionals
• A number of algorithms are examined including:
  • Sequential Search
  • Find Greatest Value
  • Selection Sort
  • Bubble Sort
  • Quick Sort
  • Binary Search
  • "Data clean-up" algorithms from the text
• The time efficiency and Big-O classification of algorithms are discussed along with algorithms illustrating the concepts

Weeks 6 - 10

Computer hardware concepts are studied including:

• Binary numbers
• Boolean logic
• Bits
• Bytes
• Gates
• Sum-of-produts circuit construction algorithm
• Circuits such as compare for equality and addition circuits
• The Von Neumann Architecture in detail
• Caching
• The construction of a CPU from basic circuits
• Machine language
• Assembly language
• The basic pseudocode/programming language control structures in assembly language
• System software
• Operating system concepts

Weeks 11 - 15

A variety of higher-level concepts are looked at:

• Computer networks
• The Internet
• Introduction to high-level language programming using C++
• The relationship between programs, pseudocode, and hardware
• Compilers and language translation
• Software development overview
• Time permitting a selection from:
  • Programming languages overview
  • Simulation and modeling
  • Electronic commerce and information security
  • Artificial intelligence
• Social issues in computing