The CS-10051 provides an overview of computer science. Many important concepts underlying computer science are covered. The algorithmic foundations of computer science and the expression of algorithms as pseudocode are investigated. A number of algorithms are examined including Sequential Search, Bubble Sort, Quick Sort, and Binary search. The time efficiency of algorithms and Big-O classifications are discussed. The basic building blocks of computer systems, e.g. binary numbers, Boolean logic, gates and simple circuits to add and compare are also studied. Using these elementary pieces the construction of a simple cpu and a Von Neumann style machine is studied. We study a typical instruction set for such a machine and it's corresponding assembly language . Basic pseudocode/programming language control structures are implemented in assembly language. We study the concept of a virtual machine environment provided by the operating system and other system software, which hides the complexity of the underlying hardware. We explore the familiar world of programming languages. We briefly introduce C++, an example of a high-level programming language. Further aspects of C++ are covered in CS 23021 and CS 33001 . Finally, as time permits, various topics from chapters 9 through 15 will be covered.