2022-2023 COMP1602 Course Outline

 

COMP 1602: Computer Programming II 2020-2021 Semester 2 Course Outline COURSE INFORMATION:

Instructors:

Lecture Hours:

Mr. Nicholas Mendez

 [email protected]  Email:  [email protected]

Miss Shareeda Mohammed

Email: [email protected]

Group 1 Monday

9:00 a.m. – 10:00 a.m.

TLC LT A1

Wednesday 9:00 a.m. – 10:00 a.m.

TLC LT A2

Group 2

Labs/Tutorials:

Tutor:

Monday

2:00 p.m. – 3:00 p.m.

TLC LT A2

Thursday

12:00 p.m. – 1:00 p.m.

TLC LT A2

Tuesday

10:00 a.m. – 12:00 p.m. Mr. S. Mathurin

CSL1

Tuesday Thursday

12:00 p.m. – 2:00 p.m. 4:00 p.m. – 6:00 p.m.

Mr. S. Mathurin Mr. S. Mathurin

CSL1 CSL2

Thursday

6:00 p.m. –

Mr. S. Mathurin

CSL2

Friday

10:00 a.m. – 12:00 p.m.

Mr. S. Mathurin

CSL1

Friday

2:00 p.m. –

4:00 p.m.

Mr. S. Mathurin

CSL2

Friday

6:00 p.m. –

8:00 p.m.

Mr. S. Mathurin

CSL1

8:00 p.m.

Mr. Sergio Mathurin

[email protected] 

COURSE DESCRIPTION 

This course uses the C++ programming language as a tool to teach intermediate programming concepts. The main concepts covered are structures, one- and two-dimensional arrays, and applications involving searching, sorting and merging, random number generation, numerical methods, games, and simulation.

COURSE RATIONALE

This course introduces new programming concepts. It focuses on the use of common searching and sorting methods, and character and string manipulation. These are a re important concepts required for building most software systems. 1

 

  COURSE CONTENT 

1.  Arrays 1.1. Declaring one-dimensional arrays 1.2. Performing statistics on arrays 1.3. Passing arrays as arguments to functions 2.  Structs 2.1. Grouping related data as structs 2.2. Using a struct as a data type 2.3. Arrays of structs 2.4. Passing structs to functions 2.5.  Nested  Nested structs 3.  Character Manipulation 3.1. ASCII representation 3.2. ASCII manipulation 3.3. Character arrays 3.4. C-Strings 3.5. Strings and string functions 4.  Two-Dimensional Arrays 5.  Searching, Sorting, and Merging 5.1. Linear and binary search 5.2. Sorting arrays: selection sort, insertion sort, bubble sort 5.3. Inserting elements in place 5.4. Merging sorted arrays 6.  Random Numbers 6.1. Random and pseudo-random numbers 6.2. Random number generation and ranges 7.  Games and Simulation 7.1. Simulation of real-life problems 7.2. Game playing

2

 

  LEARNING OUTCOMES 

Upon the successful completion of this course, the student will be able to: t o: 1.  Utilize structs and nested structs to build complex data types. 2.  Perform common string manipulation operations on strings and C-strings. 3.  Design programs which utilize one- and two-dimensional arrays. 4.  Implement common searching, sorting, and merging techniques. 5.  Use random number generation in simulation and game development.

COURSE ASSESSMENT Method of Evaluation 

Percentage of Grade

Coursework     Assignment #1   Assignment #2   Assignment #3   Coursework Examination #1    Coursework Examination #2 Final Examination  One 2-hour written paper (Covers the entire course – all lectures, readings, videos and tutorials.)

6  7 7 15 15  50

TEACHING STRATEGIES 

Lectures will be used to introduce the main concepts of the course. However, discussion and b brain rain storming methods will be used throughout the course with the goal of allowing students to  participate in the problem-solving process. Labs will also be conducted to give the students an opportunity to apply what they have learnt in a hands-on manner.

RESOURCES 

  Lecture notes and videos available on myeLearning.



  Reference Textbooks



   Noel Kalicharan. C Programming - A Beginner's Course. Sept. 2005

o

Amazon/CreateSpace.

   Noel Kalicharan. C Programming - An Advanced Course. Sept. 2006

o

Amazon/CreateSpace. 3

 

  UNIVERSITY POLICIES AND EXPECTATIONS Academic Integrity

The UWI is committed to five fundamental values: honesty, trust, fairness, respect and responsibility (The (The UWI Turnitin Policy). Similarly, students are required to practice these values and are therefore required to be cognizant of and adhere to the UWI policies regarding academic

integrity

and

plagiarism

as

outlined

in

its

regulations

found

at

https://sta.uwi.edu/resources/policies/Anti-Plagiarism.pdf   Attendance Policy

All registered students are required to attend prescribed lectures and practical classes. Students with unsatisfactory class attendance   or who have failed to submit any assessments set by his/her Examiner are subject to debarment by the relevant Academic Board, on the recommendation of the relevant Faculty Board, from taking any University examination.

Course Assessment and Course Work Examinations

Late submission of assignments or missing a scheduled coursework examination without a valid medical or documented reason will not be tolerated. In cases where the medical submitted is approved by the Campus C ampus HSU for:

  a missed coursework examination, the candidate shall be granted a substitute coursework

o

examination at a date prescribed by the lecturer.

  a late assignment submission, the candidate shall be granted a later submission date

o

 prescribed by the lecturer. The medical report must reach the Campus Health Service Unit (HSU) no later than seven days after the date of the relevant examination. Medical Certificate/Report forms are available online at http://sta.uwi.edu/onlineForms.asp  http://sta.uwi.edu/onlineForms.asp 

4