SULTAN QABOOS UNIVERSITY COURSE OUTLINE PROGRAM: BSc. in Computer Science. Laboratory (Practical) Field or Work Placement

Transcription

1 SULTAN QABOOS UNIVERSITY COURSE OUTLINE PROGRAM: BSc. in Computer Science 1. Course Code COMP Course Title Problem Solving and Programming 3. Credits 3 4. Pre-requisite Course(s) COMP Co-requisite Course(s) none 6. Equivalent Course(s) none 7. Incompatible Course(s) none 8. Course Category University Requirement University Elective College Requirement Department Requirement Specialization Requirement Other (specify): College Elective Department Elective Specialization Elective 9. Course Owner College: Science Department: Computer Science 10. Course Type Lecture Lecture/Lab Lecture/Seminar Lecture/Tutorial Tutorial 11. Language of Instruction English Field or Work Placement Seminar Workshop Lecture/Studio Lecture/Lab/Tutorial or Seminar Laboratory (Practical) Studio Internship Project 12. Course Description This course focusses on problem solving techniques and computer programming. The course topics include problem solving using problem decomposition and modularity, composite data types, pointers, dynamic memory allocation, recursion and linked lists. 13. Teaching/Learning Strategies Theory part is delivered during the lectures and student programming skills are developed during the lab sessions. Moodle is used as an online plateform to support student 14. Assessment Components and Weight [%] Quizzes Practical 5% Other (specify): Homework assignments 10% Project In-term examination(s) 45% Final examination 40% 15. Grading Method A-F Scale Pass/Not passed 16. Textbook(s) and Supplemental Material C++ An Active Learning Approach, Randal Albert and Todd Breedlove, Jones and Bartlett s Publishers, Matching Course Objectives with Program Outcomes and SQU Graduate Attributes SQU Graduate Attributes Page 1

2 A. SQU graduates should be able to: 1. apply the knowledge and skills relevant to the specialization 2. communicate effectively and use information and communication technologies 3. critically analyze complex information and present it in simple clear manner B. SQU graduates possess 1. interpersonal communication skills and alignment with culture of international labour market to assist them in practical life and in living successfully 2. skills and motivation for independent learning and engagement in lifelong learning and research 3. work ethics and positive values, and intellectual independence and autonomy 4. teamwork skills and display potential leadership qualities C. SQU graduates should relish good citizenship qualities, be conscious of their national identity and be socially responsible, engage in community affairs and be mindful of contemporary issues. # Intended Student Learning Outcome /Course Learning Objective Relevant Program Outcome(s) Applicable Attribute(s) 1. Analyze a small size problem and identify b1 & b2 (see Appendix B) A3 computing requirements of the solution 2. Design modular programs for solving small and a1 & i1 (see Appendix B) medium size problems 3. Implement mathematically defined problems a2 & c2 (see Appendix B) 4. Use arrays, user-defined types (typedef, enumerated c2 (see Appendix B) types, structures, and unions ) and pointers 5. Design and implement simple recursive functions c1 & c2 (see Appendix B) 6. Implement basic searching and sorting array c2 (see Appendix B) techniques 7. Implement main dynamic linked list functions c2 (see Appendix B) (Add, delete, traverse) 8. Use current debugging tools when developing a i2 (see Appendix B) program 9. Design a testing plan to assess correctness of a c3 (see Appendix B) developed program Student Responsibilities It is the student s responsibility to know and comply with all University Academic Regulations relevant to participation in this course. These regulations specifically include attendance requirement and students` academic code of conduct. For attendance, it is the student s responsibility to be punctual and to attend all classes. Students are expected to perform their work with honesty and avoid any academic misconduct, which is defined as the use of any dishonest or deceitful means to gain some academic advantage or benefit. This can take many forms, including but not limited to, the following: copying, plagiarism, collusion and forging documents. For full details, please refer to the Undergraduate Academic Regulations and to the Student Academic Misconduct Policy. Additionally, this course requires that you: Page 2

3 COURSE INFORMATION Course Code COMP2102 Course Title Problem Solving and Programming Semester/ Year Fall 2017 Section(s) 10 Day, Time, and Place SUN, 10:00-11:50, CMT/A04 THU, 10:00-11:50, SCI/22S Course Coordinator Abdelhamid Abdessalem Office Location 0008 Office Hours SUN & TUE 12:00-13:00 Office Tel. Ext Tentative Schedule Week Lecture # Topic/Material to be covered Assessment 1 1 Review of Problem Solving and Program Development Process: HW1 ( , 5.5) Overview of the problem solving, Program Development Process, Program Development in MS Visual Studio and Debugging. 2 2 Functions: ( ) Functions: What are functions, Function components: function declaration, function definition, function call. Parameter passing: formal versus actual parameters, passing by value versus passing by reference HW1, Midterm1 and 3 3 Arrays and CString: ( & ) Revisiting One dimensional, Passing Arrays to functions. Special Case: CString. CString functions. Multidimensional Arrays, Parallel Arrays. HW1 (Out on Sunday 24/9/2017) 4 4 Data Manipulation Using Arrays: ( ) Searching (sequential, binary search) and Sorting (bubble sort). 5 5 Pointers, and Dynamic Memory Allocation: ( ) Pointers: declaration, the address-of operator (&), accessing arrays via pointers, indirection operator (*), Passing by Pointer, Pointer Arithmetic. HW2 (Out on Sunday 8/10/2017) 6 6 Pointers, and Dynamic Memory Allocation: ( ) Dynamic Memory Allocation: the new operator, the delete operator, Memory leak, dangling pointers, Passing pointers by reference or pointer, Pointers and strings. 7 7 Pointers, and Dynamic Memory Allocation: ( ) Ragged Arrays, Dynamic 2D Arrays & Exercises. Midterm exam(thursday 26/10/2017) HW3 (Out on Sunday 22/10/2017) HW1, Midterm1 and HW2, Midterm1 and HW2, Midterm1 and HW2, Midterm1 and MidHW3, Midterm2 and 8 8 User-Defined Types: ( ) Use of typedef, Enumerated Data Types, Structures (i.e. Records). 9 9 User-Defined Types: ( ) Nested Structures, Accessing Structure Data Member: The Dot Operator versus the Arrow Operator. Shallow Copy versus Deep Copy. Arrays of structures Recursion: 16.6 Recursive functions HW4 (Out on Sunday 12/11/2017) Linked Lists: ( ) Data Structures, Linked Lists: Node Structure, Head Pointer, Creating a new node, Appending a node, Inserting a node in an ordered list, traversing the list, Deleting Nodes, Arrays versus Linked Lists Linked Lists: ( ) Node Structure, Head Pointer, Creating a new node, adding a node. HW3, Midterm2 and HW3, Midterm2 and HW4, Midterm2, and HW4, Midterm2, and HW4, Midterm2, and Page 3

4 13 13 Linked Lists: ( ) Traversing the list, Deleting Nodes Linked Lists: ( ) Arrays versus Linked Lists and exercises. Labtest (Thursday 14/12/2017) Revision HW4 Final Page 4

5 Section Instructor APPENDIX A: INSTRUCTORS OF MULTIPLE SECTIONS Day, Time, and Place 20/21 Dr. Farha Al Kharusi Monday (12:00-01:50) 2, Wedneesday (12:00-01:50) SCI/0027S Office Location and Extension 0209 ext Office Hours Sun, Tue (10:30 11:30) Page 5

6 APPENDIX B: ADDITIONAL INFORMATION List of PIs enabled in this course a1: An ability to apply knowledge of computing appropriate to the discipline a2: An ability to apply knowledge of mathematics appropriate to the discipline b1: An ability to analyze a problem b2: An ability to identify and define computing requirements of the solution c1: An ability to design a computer-based system, process, component, or program to meet identified requirements c2: An ability to implement a designed computer-based system, process, component, or program to meet identified requirements c3: An ability to evaluate an implemented computer-based system, process, component, or program to meet identified requirements i1. An ability to use current techniques and skills necessary for computing practice i2. An ability to use current tools necessary for computing practice Page 6