|
Copyright © – Paul L. Schumacher and Winona State University 2017 CS-250 Algorithms and Problem Solving II Sprintg 2017 M W: 9:30 - 10:50 am; F: 9:30 - 10:20 pm WA 105
|
|||||||||||||||||||||||||||||||
|
Prerequisites: CS 234 with a C or better Objectives: Upon entering CS 250, students should have • knowledge of control structures (if-then, switch), iteration (while, for), objects, object-oriented design and arrays; • knowledge of objects, methods, and object-oriented design; • basic skills in the design and implementation of computer programs using an object-oriented language, packages, and modules; Upon completing CS 250, student should •be able to use files • have knowledge of inheritance, polymorphism• be able to design and create GUI and event driven programs• be able to design and implement java program using data abstraction and polymorphism• have knowledge of simple data structures, i.e. lists, stacks and queues• be able to analyze a searching/sorting algorithm;• be able to verify and test a java program.Text:
Office Hrs: Click here Topics: Arrays and Collections Searching and Sorting Files for input and output Inheritance and Polymorphism GUI and event driven programming Recursion Linked structures List ADT’s Stack ADT’s Queue ADT’s Policy: A Departmental policy sheet will be handed out in class. Pre-requisite for this course is C or better grade in CS 234 - or equivalent. You must satisfy this pre-requisite to attend this class. Projects and Homework should be done on an individual basis. Co-operative learning is encouraged. Collaboration in generating the submitted work will be construed as plagiarism and will be reported to the department. For details - follow the link below to get details on specific policies. Other policy details will be handed out in class. |
Grading:
Grading Scale
|
||||||||||||||||||||||||||||||