This course is the second in the three course sequence  Introduction to Computer Science  offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course

Kakumanu, Praveen

English

CORE

Wright State University CORE Scholar Computer Science & Engineering Syllabi College of Engineering & Computer Science Fall 2004 CS 241: Introduction to Computer Science II Praveen Kakumanu Wright State University - Main Campus Follow this and additional works at: https://corescholar.libraries.wright.edu/cecs_syllabi  Part of the Computer Engineering Commons, and the Computer Sciences Commons Repository Citation Kakumanu, P. (2004). CS 241: Introduction to Computer Science II. . https://corescholar.libraries.wright.edu/cecs_syllabi/131 This Syllabus is brought to you for free and open access by the College of Engineering & Computer Science at CORE Scholar. It has been accepted for inclusion in Computer Science & Engineering Syllabi by an authorized administrator of CORE Scholar. For more information, please contact library-corescholar@wright.edu. CS 241: Introduction to Computer Science II Fall 2004 Instructor: Praveen Kakumanu Office: 358 Russ Engineering Center Office Hours: T TH 3:00 - 4:00 PM and by appointment Voice: 775-5121 Email: kpraveen@cs. wright. edu URL: http:/lwww.cs.wright.edu/-kpraveen Course Description This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course. Note: For all CS 241 students, concurrent registration into CS 241 /ab is a must Prerequisites CS 240 & MTH 229 (co-req) or equivalent. Textbook Starting out with C++, Alternate 41h edition, Tony Gaddis, Scott/Jones Inc, 2003 (required). Language Microsoft Visual C++ 6.0 (also available in WSU Dunbar Library). Grading The course grade will be the weighted sum of four grades. Grading will be straight scale (90-100 A, 80-89.9 B, 70-79.9 C, 60-69.9 D, below 60 F). These numeric thresholds may be lowered due to clustering, but will not be raised. • 	 Programming Projects There will be four programming assignments to be done individually and handed in by the due date mentioned in the class. No late submissions are accepted. Programs must be written well in a modular fashion with proper indentation, style, and documentation. Programs will be graded based on correctness, efficiency and documentation. • 	 Laboratory Exercises There is a lab section for this course, in which the students familiarize themselves with the concepts taught in the class or sometimes trying new concepts. Labs are handled by Graduate Teaching Assistants who will guide and check the student assignments. There will be eight laboratory assignments and each will include the following: • A prelab exercise due at the beginning of next lab section • An inlab assignment to be completed during the lab session CS 241 Fall 2004 Syllabus 1 • 	 Examinations There will be two midterms and one final exam. The midterms will be held during the 4th and alh weeks of the quarter. Missed exams, if any, can be made up only in case of emergency or work conflicts and require proper supporting documentation. The final exam is scheduled during the final week of classes and all students are required to take it as per the announced schedule. Workload Weight(%) 4 Programming Projects(@ 9%) 36 8 Laboratory Exercises(@ 2.5%) 20 2 Midterms (@10%) 20 1 Final Exam 24 Academic dishonesty Students are encouraged to share ideas by discussing with others. However, all the work you submit should be of your own. Submitting the code of others is regarded as cheating. All the students who are involved in such an activity will receive a grade of F. Also read and understand the WSU policy for academic honesty and integrity http:!/www.wright.edu/studentsliudicial/stu integrity.html Additional Information Information regarding the course readings, assignments, labs and exams will be posted on the course web page. Students are expected to check the web page on a regular basis for any updates. The instructor reserves the right to modify any of the course policies, schedule and due dates. Tentative Schedule Week Topic Readings 1-2 Object Oriented Programming (OOP) (classes, constructors, destructors, members) Ch. 7 3-4 Advanced Class Concepts and Constructs (friends, copy constructors and operator overloading) Ch. 11 5 Arrays, C Strings and C++ Strings (arrays of strings, structures and objects) Ch. 8 & 12 6 Basic Sorting and Searching (linear and binary search, simple sorting techniques) Ch. 9 7, 8 Pointers, Dynamic Memory Allocation and ADT List (self-referencing structures) Ch.10& 16 9, 10 Finals Week Inheritance, Polymorphism and Virtual Functions Sec 02: Tuesday, November 161h, 5:45 ­ 7:45 PM Ch. 15 Everything! CS 241 Fall 2004 Syllabus 2 

CS 241: Introduction to Computer Science II

https://corescholar.libraries.wright.edu/cgi/viewcontent.cgi?article=1126&amp;context=cecs_syllabi

CS 241: Introduction to Computer Science II

Abstract

Similar works

Full text

Available Versions

CORE