BuCS 238 Computer Programming II

After Class


Welcome to Computer Information Technology at Hesston College!

This page contains reading assignments, additional assignment or exam information, and frequently asked questions organized with the latest at the top.  Check here often!


Week 11

Week of 22 Mar 21

Started Chapter 6, Lists Plus.

Discussed templates by looking at ADT QueueLL rewritten using templates.

Discussed circular linked lists and doubly linked lists with header and trailer nodes.

Discussed shallow and deep copying and started implemented deep copying as an inclass exercise. Also implemented a copy function as a friend function and overloaded the assignment operator to provide deep copy support.

Discussed Assignment 6 - Circular Linked List.

Handout: none
Reading assignment: 357-389
Review: review the associated chapter exercises
Homework: Assignment 6 - Circular Linked List


Week 10

Week of 15 Mar 21

Continued Chapter 5, ADTs Stack and Queue. Introduced queues. Discussed ADT Queue and looked at different implementation methods including dynamic array, linked, and circular. Used a queue to determine a palindrome.

Also derived ADT CountedQueue and compared the efficieny of the various queue implementations.

Handout: none
Reading assignment: 301-355
Review: review the associated chapter exercises
Homework: Chapter 5 Exercises (4-7, 24-29) in class
Homework: Assignment 5 - Files


Week 9

Week of 8 Mar 2021

Finished Chapter 4, ADT Sorted List. Discussed ADT Sorted List as a linked structure. Also compared sorted list implementations and discussed bounded and unbounded ADTs.

Started Chapter 5, ADTs Stack and Queue. Implemented Stack as an array-based structure and a linked structure. Used a stack to reverse a name and find out if an expression is well-formed. Also compared the two implementations of Stack.

Discussed Assignment 5 - Files.

Handout: none
Reading assignment: 231-300
Exercise(s): review the associated chapter exercises
Homework: Assignment 5 - Files


Week 8

Week of 1 Mar 21

Started Chapter 4, ADT Sorted List.

Discussed ADT Sorted List using an array-based implementation with binary search. Also added a dynamically allocated array.

Handout: none
Reading assignment: 213-231
Exercise(s): review the associated chapter exercises
Homework: Assignment 4 - Sudoku2


Week 7

Week of 22 Feb 21

Finished Chapter 3, ADT Unsorted List. Completed pointers.cpp.

Implemented ADT Unsorted List using a linked implementation. Compared the array-based and dynamic implementations of ADT Unsorted List.

Handout: none
Reading assignment: 165-211
Exercise(s): review the associated chapter exercises
Homework: Assignment 4 - Sudoku2


Week 6

Week of 15 Feb 21

Continued Chapter 3, ADT Unsorted List. Discussed pointer type variables and operations using pointers.

Handout: none
Reading assignment: 158-165
Exercise(s): review the associated chapter exercises
Homework: Assignment 3 - TwoNum Class


Week 5

Week of 8 Feb 21

Discussed ADT Unsorted List and implementing and tested it using an array-based implementation.

Used ADT Unsorted List in a practical application as an inclass exercise as we also learned about file input and output.

Discussed Programming Assignment 3 - TwoNum Class.

Handout: none
Reading assignment: 140-157
Exercise(s): review the associated chapter exercises
Homework: Assignment 3 - TwoNum Class


Week 4

Week of 1 Feb 21

Demonstrated inheritance, composition, static and dynamic binding, and virtual functions in object-oriented programming.

Discussed exception handling, namespaces and compared algorithms using Big-O (order of magnitude notation).

Introduced ADT Unsorted List.

Handout: none
Reading assignment: 97-140
Exercise(s): review the associated chapter exercises
Homework: Assignment 2 - Sudoku


Week 3

Week of 25 Jan 21

Started Chapter 2, Data Design and Implementation. Discussed data abstraction, data structures, abstract data types and operator categories. Reviewed built-in types from the logical, application, and implementation levels: records.

Also reviewed built-in types from the logical, application, and implementation levels: one-dimensional arrays and two-dimensional arrays. Introduced classes in C++.

Discussed Programming Assignment 2 - Sudoku.

Handout: none
Reading assignment: 65-97
Review: review the associated chapter exercises
Homework: Assignment 2 - Sudoku


Week 2

Week of 18 Jan 21

Monday is Martin Luther King Day - we have class, but we'll have some in-class presentations.

Continued Chapter 1, Software Engineering Principles. Discussed verification of software correctness, and program testing.

Continued discussing the Java to C++ transition using programming examples from the text.

Handout: none
Reading assignment: 20-64
Review: review the associated chapter exercises
Homework: Assignment 0 (completed during class)
Homework: Assignment 1 - Package


Week 1

Week of 11 Jan 21

Introduced the course outline, syllabus, and CIT computer lab.

Started discussing the Java to C++ transition. Practiced writing and compiling a simple C++ program with the Visual Studio 2019 C++ programming IDE as an inclass exercise.

Started Chapter 1, Software Engineering Principles. Discussed the software "life cycle," goals of quality software, specifications and program design methodologies. Worked on Assignment 0 as an inclass exercise.

Discussed Programming Assignment 1 - Package.

Handout: Syllabus
Handout: GasPrice Algorithm
Reading assignment: 1-20
Review: review the associated chapter exercises
Homework: Assignment 0 (will be started during class)
Homework: Assignment 1 - Package


This page maintained by bobh@hesston.edu