Computer Science
Generic Course Syllabus
(For actual course syllabi please consult the schedule of classes, determine the instructor for the courses and consult his or her home page.)


 
Course #: A201
Course Title: Introduction to Programming I - Visual Basic .Net (4 cr.)
Prerequisites: M014
Credits: 4
Text Book: “Microsoft Visual Basic .NET Reloaded”, by Diane Zak
Supplemental Texts: Handouts
Course Information:  Fundamental programming constructs, including loops, arrays, classes, and files. General problem-solving techniques. Emphasis on modular programming, user-interface design, and developing good programming style. Not intended for computer science majors. (VB or Java). This course is not intended for computer science majors.
Other Information: An introductory programming course for non computer science majors, using Visual Basic .NET. Introduction to computer components and basic computer literacy along with operating systems will also be discussed. Also some basic features of navigating around the computer environment along with programming concepts and rules. The use of algorithms will be used for problem solving and program design. Fundamental programming constructs, including loops, arrays, functions, classes and files with be covered.

1. Introduction to computers.

a. Components of a computer (CPU, memory, peripherals).
b. Operating systems.
c. Files
d. Bits, bytes, words, addresses, K = 1024. How data is stored in a computer.
e. Stored program concept. Machine instructions.
f. High level languages and compilers.
g. Ethical behavior in IUSB computer science courses (handout available).


2. Programming Rules and Methodology.

a. Pseudo-code.
b. Algorithm design.
c. Top-down design. Modularity.
d. Program style: indenting, choices for identifiers, using named constants, commenting.


3. Programming Environment Topics

a. Using Windows XP and the Visual Basic .Net integrated environment.
b. Program testing.
c. Debugging techniques, including using the debugger.

4. Fundamental Programming Techniques

a. Simple loop based algorithms, including summing loops, counting loops.
b. When to use "for", "while" and "do-while" loops. Consider suggesting use a "for" loop only
if the number of repetitions is known in advance.
c. Searching: linear and binary search.
d. Sorting: cover insertion sort and possibly one other sort.
e.  Input and output.
f. Control flow statements (if, if-else, switch, break, while, do-while, for, continue).
g. Functions and parameter passing; Value and reference parameters.
h. Arrays.