Course Descriptions

(1)

Course Descriptions

Second Semester Academic year 1442

College name Department Course Name Class No

College of Science Computer department

Basic of computer programming & Algorithms

Virtual class Lecturer Name Time of the lecture Means of communication Dr.Mobarak Abaker Sunday: 8-10 AM Tel : 0556717762

Email: [email protected]

Course Name Basic of computer programming & Algorithms

Course Code ^{202 CS}

Credit Hours Lecture practical Exercise

2 2 0

Lecture times

day 8-9 9-10 10-11 11-12 12-1 1-2 2-3 3-4 4-5

Sunday Lecture

Monday practical

Tuesday Wednesday Thursday

Hours of academic guidance

day 8-9 9-10 10-11 11-12 12-1 1-2 2-3 3-4 4-5

Sunday Monday Tuesday Wednesday

Thursday Academic guidance Academic guidance

Course Descriptions

This course gives an introduction about algorithms and programming.

The course gives an overview about what an Algorithm is, how it can be designed, approaches for solving computational problem and finally a first interaction of student with computer programming to solve the problems using JAVA.

Course Objective

(2)

1. To understand the basics of computer Algorithms.

2. Be competent with writing computer design simple algorithms.

3. To make students familiar with computer based problems.

4. To make the students check the importance of algorithm designing and programming.

5. To make them capable of reading and understanding small-sized programs written by another author.

6. Become acquainted with the Java programming language and development environment.

Course Learning Outcomes

 Knowledge and Understanding

 Understanding foundation concepts of information and information processing in computer systems: a matter of information, data representation, coding systems.

 Describe of an algorithm and its definition.

 Recognize of a programming language syntax and its definition by example of java language.

 Knowledge of basic principles of imperative and structural programming.

 Skills:

 Demonstrate to write simple programs in java language by using basic control structures (conditional statements, loops, switches, branching, etc.).

 Demonstrate to create a programmable model for a problem given.

 Analyze a function concept and how to deal with function arguments and parameters.

 Values

 Able to implement the algorithms and draw flowcharts for solving Mathematical and Engineering problems.

 Demonstrate an understanding of computer programming language concepts.

References Required:

Fundamentals of Computer Algorithms Author(s): Ellis Horowitz, SartajSahni, Publisher: Computer Sci.P.

2. John C. Mitchell, Foundations for Programming Languages, MIT Press.

3. Benjamin C. Pierce, Types and Programming Languages, MIT Press.

4. Ravi Sethi, Programming Languages: Concepts and Constructs, Addison-Wesley

(3)

5. The Complete Reference, Java 2, Herbert Scheldt, Fifth Edition, Mc-Graw Hills/Osbourne.

6. Algorithm Design, Sartaj Sahni, Prentice Hall.

Prerequisite: Computer Skill (130 CS ) Evaluation Method

Final exam 40 Marks

Mid Term-1 20 Marks

Mid Term-2 20 Marks

Class Work( Attendance / Lab Work / Quiz) 20 Marks The pass degree (60) at less to (100) marks Course content

Weeks Topic Name Sub Topics

1 Introductions

 Introduction

 Computer organization

 Computer Languages

 Generation of programing language

 Stages in software development

2,3

Algorithms and flowcharts and PSEUDOCODE

 Definition of Algorithm

 Role of Algorithm in Computing

 problems solving using algorithm

 Flowcharting Symbols

 General Rules for flowcharting

 Limitations of Flowcharts

 Advantages of Flowcharts

 Flowcharting Tips

 How to write pseudocode

 Keywords used to write pseudocode

 Advantages of Pseudocodes

 Limitations of Pseudocodes

 Practice and example using algorithms, Flowcharts and Pseudocodes

4 Variable and Data types

 Data types

 Data item (Constant, Variables)

 Variable names

 Assignment and expression

 Practice and example using algorithms, Flowcharts and pseudocodes

5,6 Structural  The sequence structure

(4)

programing (logical structures)

 Decisions structure: (Selection)

 If Statement (Single Selection)

 If – else Statement (double Selection)

 Nested if Statement (multiple Selection)

 Switch Statement (The case statement)

 Practice and example using algorithms, Flowcharts and Pseudocodes

MID TERM – I

7,8 Loops structure (Repetition)

 The For Loop

 The While Loop

 do – while

 Practice and example using algorithms, flowcharts and Pseudocodes

9,10,1

1 java

 Introduction to Java environment

 Development Environments

 Java Program Structure

 Comments

 Identifiers

 Reserved Words

 Practice and example using java

 Variables and Data Types and

 Variables Types in Java

 Declaring Variables in Java

 Assigning Values to Variables

 Arithmetic expressions

 Assignment operators

 If statements

 if...else

 Practice and Example using Java

12 MID TERM -2

13,14 Java

 Nested if … else

 Switch Statement

 for loop

 while loops

 do while loops

 Practice and Example using Java

15 Revision & Final Exam

Examination time

First Mid-Term After week ( 6 )

(5)

Second Mid-Term After Week (12)

: ةمهم تاميلعت

1 . نع لقي ل ام روضح بلاطلا ىلع بجي 75

نمو ، ررقملل تارضاحملا نم %

كلذل نوكيو (ًارفص) هتجرد نوكتو ررقملا نم مرحي كلذ نع هروضح ةبسن لقت .بلاطلا لدعم ىلع ريثأت

2 . نوكت ررقملا ذاتسأ ىدل لوبقم رذع نود لصفلا فصتنم رابتخا نع بيغتلا

.(ًارفص) رابتخلا ةجرد 3 . ةجرد نوكت ررقملا ذاتسأ ىدل لوبقم رذع نود لصفلا ةياهن رابتخا نع بيغتلا

.(ًارفص) رابتخلا