Ncaaa T4 course spec cccs-224 2020 3 PDF

Preview

Summary

Quite short! This title is not great. Could you make it more descriptive?...

Description

Course Title:

Introduction to Computer Science and Programming

Course Code:

CCCS 224

Program:

Bachelor’s in Computer Science

Department:

Computer Science and Artificial Intelligence

College:

Computer Sciences and Engineering

Institution:

University of Jeddah

Table of Contents A. Course Identification....................................................................................................3 6. Mode of Instruction (mark all that apply)...............................................................................3 B. Course Objectives and Learning Outcomes...............................................................3 1. Course Description.................................................................................................................3 2. Course Main Objective............................................................................................................3 3. Course Learning Outcomes.....................................................................................................3 C. Course Content.............................................................................................................4 D. Teaching and Assessment.............................................................................................4 1. Alignment of Course Learning Outcomes with Teaching Strategies and Assessment Methods.......................................................................................................................................4 2. Assessment Tasks for Students................................................................................................4 E. Student Academic Counseling and Support...............................................................5 F. Learning Resources and Facilities...............................................................................5 1.Learning Resources..................................................................................................................5 2. Facilities Required...................................................................................................................5 G. Course Quality Evaluation..........................................................................................5 H. Specification Approval Data........................................................................................6

2

A. Course Identification 1. Credit hours: 2. Course type Department University College  a.  Elective Required b. 3. Level/year at which this course is offered: First Year 4. Pre-requisites for this course (if any): CCCS220

Others

5. Co-requisites for this course (if any): NA

6. Mode of Instruction (mark all that apply) Percentage 60%

Contact Hours 42

40%

28

Mode of Instruction Traditional classroom Blended E-learning Distance learning Other

No 1 2 3 4 5

7. Contact Hours (based on academic semester) No 1 2 3 4

Activity Lecture Laboratory/Studio Tutorial Others (specify) Total

Contact Hours 42 13

55

B. Course Objectives and Learning Outcomes 1. Course Description This course will be taught using the flipped-classroom methodology, i.e., students will be provided with reading and viewing materials ahead of class and will be expected to complete short programming tasks in every class. This course is designed as an entry level course for students to structural programming. Students will be expected to have had introductory exposure to programming languages and be familiar with at least one scripting / interpreted language.

2. Course Main Objective     

3

Understand the purpose and mathematical background of algorithm analysis and be able to apply this to determine the run time and memory usage of algorithms. Understand the abstract data types of stacks, queues and Understand various sorting algorithms, their limitations and performance. Understand the variety of ways that linearly and weakly ordered data can be stored, accessed, and manipulated. Understand the characteristics and optimal behavior of hash tables for access and

 

retrieval. Understand various sorting algorithms and the run-time analysis required to determine their efficiencies. Understand various graph algorithms.

3. Course Learning Outcomes Aligned PLOs

CLOs 1 1.1 1.2 1.3 1... 2 2.1 2.2 2.3 2... 3 3.1 3.2 3.3 3...

Knowledge and Understanding Reproduce various algorithms and data structures. Select algorithms and data structures appropriate for solving computing problems.

K1 K2

Skills : Implement various data structures and algorithms and apply them in solving computing problems

S2

Values:

ng

C. Course Content Contact Hours 3 3 3 3 3 3 3 3 3 3 3 3 3 42

4

List of Topics Introduction to C++ Data Structure Intro & Review of Arrays Linear Search vs Binary Search Sorted List Matching Problem Linked Lists: Inserting Nodes, Deleting Nodes, Circular and Doubly Linked Lists, Recursion Algorithm Analysis Stacks Queues , Binary Trees : Search & Insert, Deletion, Practice Problems ,Sorting: O(� 2 ) Algorithms, Merge-Sort, Quick Sort Graphs Introduction Hash Tables Total

No 1 2 3 4 5 6 7 8 9 10 11 12 13

D. Teaching and Assessment 1. Alignment of Course Learning Outcomes with Teaching Strategies and Assessment Methods Code 1.0

1.1

1.2

Course Learning Outcomes Knowledge and Understanding Reproduce various algorithms and data structures.

Select algorithms and data structures appropriate for solving computing problems.

Teaching Strategies

Assessment Methods

Video lectures, Lectures slides

In-class programming tasks, Midterm and final exams Midterm and final exams

Video lectures, Lectures slides

… 2.0

Skills

2.1

Implement various data structures and algorithms and apply them in solving computing problems

In-class programming tasks

In-class programming tasks, Midterm and final exams

2.2 … 3.0

Values

3.1 3.2 …

2. Assessment Tasks for Students Percentage of Total Assessment Score

Week Due

30%

Week 3-15

15% 15% 40%

Week 7 Week 11 Week 16

*Assessment task Class programming tasks, every class from Week 3 onwards Midterm 1 Midterm 2 Final exam

# 1 2 3 4 5 6 7 8

*Assessment task (i.e., written test, oral test, oral presentation, group project, essay, etc.)

E. Student Academic Counseling and Support Arrangements for availability of faculty and teaching staff for individual student consultations and academic advice : Two office hours per week and via email

F. Learning Resources and Facilities

5

1.Learning Resources Data Structures and Program Design in C++, Robert Kruse, Aexander J Ryba, CD-ROM, proposed by Paul Mailhot

Required Textbooks

Visual studio C++

Essential References Materials

https://lms.uj.edu.sa ............................................................................... ..............

Electronic Materials Other Learning Materials

2. Facilities Required Resources

Item Accommodation

Classrooms, labs

Classrooms, laboratories, demonstration) (.rooms/labs, etc

data show, Learning Management System (Blackboard)

AV, data show, Smart Board, software,) (.etc

Technology Resources Other Resources Specify, e.g. if specific laboratory) equipment is required, list requirements or (attach a list

G. Course Quality Evaluation Evaluation Areas/Issues Indirect Assessment of Course Instructor Assessment Curriculum Assessment PLO Achievement Assessment

Evaluators

Evaluation Methods

Students

Survey

Students Students, Alumni Alumni, Employer

Survey Survey Survey

Evaluation areas (e.g., Effectiveness of teaching and assessment, Extent of achievement of course learning outcomes, Quality of learning resources, etc.) Evaluators (Students, Faculty, Program Leaders, Peer Reviewer, Others (specify) Assessment Methods (Direct, Indirect)

H. Specification Approval Data i) Council / Committee

ii) iii)

Reference No. Date

6

1/6/2020

Course Developer : Dr Awias, Dr Mohamad Khan, Dr Ilyas and Dr Mohammad Alqarni Course Coordinator : Dr Mohammad Alqahtani Committee Head : Dr Mohammad Alqahtani

7...