CSCE 2014 – Programming Foundations II Class Syllabus ...

1 CSCE 2014 Programming Foundations II. Class Syllabus Spring 2022. Instructors: S001 MWF 12:55 pm - 1:45 pm Dr. John Gauch S002 MWF 8:35 am - 9:25 am Dr. Lora Streeter Teaching Assistants: L001 Mon 2:00 pm - 3:45 pm Alan Torres L002 Wed 2:00 pm - 3:45 pm Sahibzada Qasim L003 Tues 8:00 am - 9:45 am Sailesh Sirigineedi L004 Thu 8:00 am - 9:45 am Sailesh Sirigineedi L005 Tue 2:00 pm - 3:45 pm Benjamin Thiele L006 Fri 2:00 pm - 3:45 pm Ashwin Prakash L007 Thu 4:00 pm - 5:45 pm Lukas Vaughan Office Hours: Mon 11:50 am - 12:40 pm Ashwin Prakash Mon 2:00 pm - 2:50 pm Sahibzada Qasim Mon 3:05 pm - 3:55 pm Sahibzada Qasim Tue 11:00 am - 12:00 pm John Gauch Tue 2:00 pm - 3:00 pm Lora Streeter Tue 3:30 pm 5:30 pm Lukas Vaughan Wed 11:50 am - 12:40 pm Benjamin Thiele Wed 2:00 pm - 2:50 pm Alan Torres Wed 3:05 pm - 3:55 pm Sailesh Sirigineedi Thu 11:00 am - 12:00 pm John Gauch Thu 12:30 pm - 1:45 pm Ashwin Prakash Thu 2:00 pm - 3:00 pm Lora Streeter Fri 11:50 am - 12:40 pm Benjamin Thiele Fri 2:00 pm - 2.

2 50 pm Alan Torres Fri 3:05 pm - 3:55 pm Sailesh Sirigineedi Catalog Description: This course continues developing problem solving techniques by focusing on fundamental data structures and associated algorithms. Topics include: abstract data types, introduction to object-oriented Programming , linked lists, stacks, queues, hash tables, binary trees, graphs, recursion, and searching and sorting algorithms. Using C++ in a UNIX environment. Prerequisite: CSCE 2004. Text Book: Data Structures Essentials , , 2021. To purchase this book, go to and enter zyBook code UARKCSCE2014 Spring2022. Topics Covered Introduction (1 day). o Class Objectives o Problem Solving Approaches Object Oriented Programming (4 days). o Abstract Data Types o Class Relationships o Application examples Linked Lists (6 days). o Linked list operations o Implementation examples o Application examples Recursion (6 days).

3 O Divide and conquer o Backtracking o Recursion examples Stacks (3 days). o Stack operations o Implementation examples o Application examples Queues (3 days). o Queue operations o Implementation examples o Application examples Sorting (6 days). o Algorithm analysis o Fast and slow sorting algorithms o Application examples Hash Tables (4 days). o Hash table operations o Implementation examples o Application examples Binary Trees (4 days). o Binary tree operations o Implementation examples o Application examples Heaps (4 days). o Heap operations o Implementation examples o Application examples Evaluation Methods and Grading: In this Class , final course grades will be determined as a weighted average of the following items: 5% Zybook Reading Assignments 5% Class Attendance and Participation 10% Programming Labs (14 labs). 35% Programming Projects (7 projects). 15% Midterm Exam 30% Final Exam Final grades in the Class will be assigned according to the following scale: A: 90 100%.

4 B: 80 C: 70 D: 60 F: 0 Zybook Readings: For each of the Programming topics listed above, you will be assigned corresponding sections of the Zybook to read. In each section, there are several online participation activities to keep students engaged with the material. Students are allowed to answer these online questions multiple times until you get the correct answers. Grades for Zybook readings will be based on the percentage of assigned participation activities completed. The Programming challenges in each section and the participation activities in optional sections are not required. Class Attendance Policy: This course is officially an in-person Class , so students are expected to attend in person if possible. Attendance will be taken at different times during Class , and grades for Class attendance will be based on the percentage of attendance during the semester.

5 Dr. Gauch's section: Since this classroom is very crowded (140 students and 140 seats) students in this section may attend lecture remotely via Blackboard collaborate. Students are still expected to participate in Class discussions and must respond to Blackboard polls to get attendance points. Students who are sick or on quarantine should not attend Class . Classes will be recorded and made available to students who miss Class . Dr. Streeter's section: Since this classroom is only half filled students in this section are expected to attend in person and select seats so they are socially distanced from each other. Students who are sick or on quarantine should not attend Class . Classes will be recorded and made available to students who miss Class . See the university Covid-19 guidance for more information: Programming Labs: There will be 14 weekly laboratory assignments worth 10.

6 Points each. The lab requirements will be posted on the Class website. Grades for the labs will be based on completeness, correctness, and effort. Completed labs should be uploaded into Blackboard at the end of the scheduled lab time. Late labs will be accepted up to 3 days after your scheduled lab time without any penalty. Labs that are more than 3 days late will not be accepted and will receive a grade of ZERO. Programming Projects: There will be 7 Programming projects worth 50 points each. The project requirements and due dates will be posted on the Class website. The Programming projects will be graded according to the following scale: 10 points midpoint project submission 10 points project report with testing output 30 points program design and implementation Programming projects must be uploaded to Blackboard by 11:59 pm of the due date specified in the project description.

7 Projects that are submitted after the due date lose 10% (5 points) per day for up to 3 days late. Projects more than 3 days late will not be accepted and will receive a grade of ZERO. Per university policy, no work will be accepted after the last day of Class , even if it is submitted before the final exam. Exams: This Class will have one midterm exam and a comprehensive final exam. Both exams will be closed book, but each student will be allowed to bring in a one sheet of paper (front and back) containing any information the student wishes to have access to during the exam. Academic Misconduct: As a core part of its mission, the University of Arkansas provides students with the opportunity to further their educational goals through programs of study and research in an environment that promotes freedom of inquiry and academic responsibility. Accomplishing this mission is only possible when intellectual honesty and individual integrity prevail.

8 Each University of Arkansas student is required to be familiar with and abide by the University's Academic Integrity Policy' that may be found at Students with questions about how these policies apply to a particular course or assignment should immediately contact their instructor. In addition to the university's academic integrity policies, the following policies for exams and Programming projects will apply to this Class . Exams: Photo IDs will be checked at the start of both exams. Students are NOT allowed to copy anything from another student. Students are NOT allowed to use calculators, computers or cell phones. Students are NOT allowed to get any outside assistance during the exam. o This includes collaboration through GroupMe, WhatsApp, Discord, or any other form of technology to exchange exam information. Students ARE allowed to bring an sheet of paper with any notes they want into the exam.

9 Otherwise, exams are closed book and closed notes. Programming Projects: Students are expected to submit their own work on Programming projects. Students are NOT allowed to work in groups to implement programs. Students are NOT allowed to lend or distribute code to each other. Students are NOT allowed to copy code from other individuals or websites. o These websites include, but are not limited to, Quizlet, Bartleby, Course Hero, Chegg, and Clutch Prep. Students ARE allowed to ask the instructor and/or GTAs for assistance. Students ARE allowed to borrow and adapt code from this Class website. All instances of academic misconduct will be reported to the Academic Initiatives and Integrity office, and may result in a zero on the project or exam, failure in the Class , or suspension from the university depending on the severity of the infraction and prior violations.

10 Emergency Preparedness: Many types of emergencies can occur on campus;. instructions for specific emergencies such as severe weather, active shooter, or fire can be found at The University of Arkansas has a campus-wide alert system for any hazardous conditions that may arise on campus. To learn more and to sign up: notification-system/. Inclement Weather: If the university is officially closed, Class will not be held. When the university is open, you are expected to make a reasonable effort to attend Class , but not if you do not feel that you can get to campus safely. Any changes to due dates or the Class schedule will be communicated via email to your uark email address. Academic Support: University of Arkansas Academic Policy Series requires that students with disabilities are provided reasonable accommodations to ensure their equal access to course content. If you have a documented disability and require accommodations, please contact me privately at the beginning of the semester to make arrangements for necessary classroom adjustments.