New version page

Cal Poly Pomona CS 128 - COURSE DESCRIPTION

Documents in this Course
Load more
Upgrade to remove ads

This preview shows page 1-2-3-4-5-37-38-39-40-41-42-75-76-77-78-79 out of 79 pages.

Save
View Full Document
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 79 pages.
Access to all documents
Download any document
Ad free experience

Upgrade to remove ads
Unformatted text preview:

SUPPORT COURSESCOURSE DESCRIPTIONDepartment and Course Number: CS 128 Course Coordinator: Amar Raheja, Assistant Professor of Computer ScienceCourse Title: Introduction to C++Total Credits: 4Current Catalog DescriptionBasic concepts of computer software and programming. Data types, expressions, control structures, functions, file and stream I/O. Use of pointers and dynamic storage allocation. Structured and abstract data types. Problem-solving techniques. 4 lectures. Prerequisites: MAT 105 and 106 with grade of C or better, or consent of instructor. TextbookDeitel and Deitel. C++: How to Program, Prentice Hall, 2000.ReferencesStroustrup, B. The C++ Programming Language, Second Edition, Addison-Wesley 1995.Savitch, W. Problem Solving with C++: The Object of Programming, Third edition, Addison-Wesley, 2001.GoalsAn introduction to the basic concepts of programming and its use for problem solving. Learning good programming principles and practices using the C++ language. Good knowledge of the syntax and semantics of C++ and its compilation and execution.Prerequisites by TopicNumber SystemFunctionsPolynomialsSystems of equationsTrigonometric functionsTopicsComputer Science overview (1 hour)Hardware overview (1 hours)Software overview (2 hours)Ethical and social concerns (1 hours)Problem solving and algorithms (4 hours)Simple programming examples in C++ (2 hours)Computer logon, file system, use of editor (2 hours)Primitive types in C++ (2 hours)Variables, literals, and expressions (2 hours)Control statements (4 hours)Functions (Includes Recursive functions) (5 hours)Introduction to arrays (3 hours)Strings (2 hours)Text and File input, output (4 hours)Introduction to classes and objects (2 hours)Tests (3 hours)Laboratory ProjectsSeveral in-class lab exercises to gain familiarity with Windows 2000. Use the Visual C++ editor to write and build files containing the sample programs shown in the handout. Compile and run the programs. Modify the programs. (2 weeks)Write a program that sums a sequence of integers. Assume that the first integer read specifies the number of values remaining to be entered. Your program should read only one value per input statement. A typical input sequence might look like (1 week)5 100 200 300 400 500The factorial of a positive integer n is equal to the product of integers from 1 to n. Write a program to evaluate the factorials of integers from 1 to 5. Print the result in a tabular format. (1 week)Write a program that uses a function to find if a given integer is a perfect number. Use this function in the program to display all the perfect numbers between 1 and 1000. (1 week)Write a program that uses the Sieve of Eratosthenes method to determine if a number is prime. Use a single dimensional array for this problem and display the prime numbers between 1 and 1000. (1 week)Write a program to count the vowels and letters in the text file (the file is neural.txt). Read text a character at a time until you encounter end-of-file. Print out the number of occurrences of each of the vowels a, e, i, o and u in the text, the total number of letters, and each of the vowels as an integer percentage of the letter total. Display the results in a tabular format. (2 weeks)COURSE DESCRIPTIONDepartment and Course Number: CS 130Course Coordinator: Gilbert Young, Associate Professor of Computer ScienceCourse Title: Discrete StructuresTotal Credits: 4Current Catalog DescriptionFundamental topics for Computer Science, such as logic, proof techniques, sets, basic counting rules, relations, functions and recursion, graphs and trees. Prerequisite: MAT 105 with a grade of C or better, or consent of instructor. TextbookGersting, J.L. Mathematical Structures for Computer Science. 4th Edition, Freeman, 1999.GoalsIntroduction to mathematical concepts and problem solving techniques that provide foundations for Computer Science.Prerequisites by TopicGood understanding of College AlgebraTopicsMathematical LogicProof TechniquesSets and CombinatoricsFunctions and RelationsGraphs and Graph AlgorithmsLaboratory ProjectsNoneCSAB Category Contentcore advancedTheoretical Foundations 3Algorithms 1Data StructuresSoftware DesignProgramming ConceptsComputer ArchitectureTheoretical Content90% of time devoted to theoretical materialCOURSE DESCRIPTIONDepartment and Course Number: CS 140 Course Coordinator: Barry I Soroka, Professor of Computer ScienceCourse Title: Introduction to Computer ScienceTotal Credits: 4Current Catalog Description Basic concepts of Computer Science, including overview of hardware and software. Ethical and social impacts of computing. Problem-solving methods. Programming in a high-level language. Written essay required. Prerequisite: MAT 114 with a grade of C or better, or concurrent enrollment in MAT 114, or consent of instructor.TextbookDavid M Arnow & Gerald Weiss, Introduction to Programming Using Java: An Object-Oriented Approach. Java 2 Update. Reading MA: Addison-Wesley, 2000. isbn 0-201-61272-0Computer Science Department. CS 140 Handbook. 1998.GoalsAn introduction to the field of computer science and some appreciation for the scope of its subject matter. A solid foundation in problem solving and in good programming principles and practices. Familiarity with the Java language and its compilation and execution.Prerequisites by TopicNumber systemsFunctionsPolynomialsSystems of equationsMathematical inductionTrigonometric functionsTopicsHardware overview (2 hours)Software overview (2 hours)Computer Science overview (1 hour)Ethical and social concerns (2 hours)Problem solving and algorithms (3 hours)Simple programming examples in Java (2 hours)Computer logon, file system, use of editor (3 hours)Primitive types in Java (2 hours)Variables, literals, and expressions (3 hours)Control statements in Java (5 hours)Strings (2 hours);Introduction to arrays (4 hours)Introduction to classes and objects (4 hours)Text input, output (3 hours)Tests (2 hours)Laboratory Projects1. Write a Java application which reads a filename (e.g. test) and which creates two new files, test.line1 and test.line2, containing the first and second lines of the file test, respectively.2. Write a class Person with instance variables lastName, firstName and college. Provide two constructors. Provide methods setCollege and getCollege. Provide a method cross(Person) which returns a new Person with the firstName of the message recipient and the lastName of the


View Full Document
Download COURSE DESCRIPTION
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view COURSE DESCRIPTION and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view COURSE DESCRIPTION 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?