Course File - Course Specifications
Spring 2018
Department of Computer Science
Printed as of: Friday June 7 2024 10:
1
Faculty of Computing and Information Technology
The objective of this course is to cover the fundamental concepts of procedural programming. This course introduces the Java programming language and helps students develop basic problem-solving skills. Topics include algorithms, flowchart, API, IDE, and JDK, numerical data, primitive data type, short hand operators , cast value of one type to another type , selection statements, switch statements, break and continue statements, relational operators, logical operators, logical expressions, Boolean variable, Boolean expressions, repetition statements, nested loops, methods, pass arguments to a method, method overloading, method abstraction, use of methods in the math class, arrays, common array operations, methods with array arguments and return value, search and sort operations on array.
Catalog Description
Meet 50 minutes 3 times/week or 80 minutes 2 times/week Lab/Tutorial 90 minutes 1 times/week
Class Schedule
9780132936521
Textbook
0132936526
Dr. Liang, , "Introduction to Java Programming, Comprehensive Version 9th Edition", Fonenix inc; 9 edition (2012-04-07)
ISBN-13 ISBN-10
Programming (I) CPCS-202
College Required Prerequisite: None
4 6 7 9 12 12 14 15 15 16
Homework Assignments 1 Exam 1
Homework Assignments 2 Homework Assignments 3 Exam 2
Homework Assignments 4 Homework Assignments 5 Lab Exam
Quiz
Comprehensive Final Exam Assessment
6 10
6 6 15
6 6 15
5 25
Week Grade %
Grade Distribution
Relationship to Student Outcomes
x x x
Construct algorithms for solving simple problems. (c) Write a programing code that implements algorithms for solving simple problems. (c)
Analyze and explain the behavior of simple programs involving the fundamental programming constructs. (b) Identify and describe uses of primitive data types and standard library functions/methods. (a)
Write programs that use primitive data types and standard library functions/methods. (a)
Apply appropriate conditional and iteration constructs for a given programming task. (a)
Write and/or modify short programs that use standard conditional structures. (a)
Write programs that use standard iterative control structure. (a)
Write programs that use functions/methods. (c) Manipulate one dimensional-arrays (a)
Construct and manipulate two-dimensional arrays. (a) Trace the execution of a variety of code segments and write summaries of their computations. (a)
Identify common coding errors and apply strategies for avoiding such errors. (a)
Apply a variety of strategies to the testing and debugging of simple programs. (a)
Use of an approperiate IDE (Integrated Development Environment) to create, compile and run a program develped by the selected programing language (c)
Course Learning Outcomes (CLO)
By completion of the course the students should be able to a b c d e f g h i j k l m n 3 ( Theory: 3, Lab: 0, Practical: 1)
Last Articulated
May 3, 2018
Dr. Abdullah Almenbri, Assistant Professor Dr. Maryam Altriki, Assistant Professor
Coordinator(s)
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
CPCS-202 Syllabus
Classification:
Credit:
Course File - Course Specifications
Spring 2018
Department of Computer Science
Printed as of: Friday June 7 2024 10:
2
Faculty of Computing and Information Technology
Introduction
Chapter 1: Introduction
Chapter 2: Elementary Programming Chapter 3: Selections
Chapter 4: Selections
Chapter 4: More Basics of Java Chapter 5: Loops
Chapter 6: Methods
Chapter 7: Single Dimensional Arrays Chapter 8: Multi-dimensional Arrays
1 1 2 1 1 1 3 2 2 1
CPCS-202 Syllabus
Topics Coverage Durations
Weeks Topics