....................................................................................................................................................................................................................................... Computer Science 161 - Spring 2017

### Meetings:

MWF 1:30PM-2:20PM Bagby 111

### Instructor:

Professor Tom Valente
Bagby 123 x6210
email: tvalente

### Office Hours:

MTWR 2:30PM-4:00PM, other times by appointment and by announcement

### Course Description:

Computer Science is the study of the kinds of problems that computers can solve and how they actually, in the end, solve them. At the heart of computer science is the notion of algorithm . An algorithm is a careful and thorough step-by-step description (or "recipe") of how to solve a problem. The process of programming a computer begins with the programmer expressing (perhaps informally) an algorithm that will do so. The process continues with the programmer then encoding the algorithm in a programming language such as Java or C++. Remarkably, a computer does not understand nor can it execute instructions written in such languages. Instead, the algorithm is executed by a computer's hardware, the circuits of which understand only 0 and 1 (by detecting either high or low voltage).

The first part of the course will focus on how the computer, at its lowest levels, actually processes information. We'll learn how all information, regardless of its type (textual, numerical, audio, video) is represented in binary. We'll then learn how a computer's circuits can perform fundamental tasks such as adding two numbers or comparing two numbers.

After we've understood enough about the behavior of the computer at is lowest levels, we'll "zoom out" to think about what a person (i.e. programmer) must do in order to have the computer solve a problem. We'll study algorithms, both how to express them and how to understand whether or not an algorithm can produce answers in a reasonable amount of time. We'll do this by investigating algorithms to solve problems such as sorting a list of numbers or searching a list of names for some desired name.

Of course, an algorithm must expressed as a computer program in order for a computer to execute its instructions. Thus, later in the course, we will look at how computer programming languages have evolved to the ones that are in use today. We'll use a modern high-level programming language to learn about both procedural and object-oriented programming, the latter being particularly important in modern programming.

Finally, we'll investigate one of today's hot issues - that of secure communications. We'll study a couple of modern methods for encoding secret messages (an area known as Cryptography). In doing so, we'll understand once and for all that computers DO have limitations, and that this is not necessarily a bad thing!

 In-class Tests (3 in class - Feb 17th, Mar 31st, Apr 21st) 30% (12-12-6) Final Exam (Tuesday May 9th at 2PM) 25% Quizzes 10% Homework 35%
Tests must be taken at the date and time announced, unless you provide a legitimate excuse prior to the time of the test. Quizzes must be taken when given.

### Homework

Homework 1 Due Friday January 27th
Homework 2 Due Monday February 6th
Homework 3 Due Friday February 10th
Homework 4 (to be done in class during week of Feb 13th)
Homework 5 Due Monday February 27th at 1:30PM
Homework 6 Due Monday March 6th at 1:30PM
Homework 7 Due Friday March 10th at 1:30PM
Homework 11 Due Wednesday April 19th at 1:30PM

### List Processing Algorithms

Sequential Search
Binary Search
Selection Sort   Insertion Sort and Bubble Sort

Mar 6   Mar 8   Mar 20   Mar 29
Wed Nov 2
Play a game of craps   Simulate MANY games of craps
Some Practice Problems for Test 3