0% found this document useful (0 votes)
12 views

Algorithm and DataStructure

Unity University P.L.C. aims to enhance higher education in Ethiopia by providing quality education and addressing the skills gap in the ICT sector through its Computer Science program. The program focuses on producing graduates equipped for the dynamic IT industry, emphasizing software development and problem-solving skills. The university's mission includes promoting research, intellectual freedom, and compliance with government regulations while maintaining high educational standards.

Uploaded by

Ziyad Mohammed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views

Algorithm and DataStructure

Unity University P.L.C. aims to enhance higher education in Ethiopia by providing quality education and addressing the skills gap in the ICT sector through its Computer Science program. The program focuses on producing graduates equipped for the dynamic IT industry, emphasizing software development and problem-solving skills. The university's mission includes promoting research, intellectual freedom, and compliance with government regulations while maintaining high educational standards.

Uploaded by

Ziyad Mohammed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 116

1.

INTRODUCTION
Education, particularly higher education, is recognized as a key factor in producing competent and
skilled human capital for the country. At present, efforts are being made by the government to
expand and strengthen higher education programs (undergraduate and postgraduate) as a basic
intervention mechanism in the human resource capacity building of the country.
One of the strategies of the Federal Government of Ethiopia in achieving the expansion and
improvement of higher education in the country is to encourage the expansion of good quality
private and non-governmental higher education institutions. The recent booming of private higher
educational institutions (colleges) in the Country is regarded as a form of sharing the burden of the
government in disseminating and expanding higher learning to societal members at large. The
private sector is, therefore, duty bound to actively contribute its share in the provision of higher
education in the Country. The sector shall participate in the “production” of educated human capital
in the Country.
Unity University P.L.C. is established to supplement the efforts of the Government in its capacity
building in higher education. In line with the education and training policy of the country, Unity
University has a mission and objective to develop the physical and mental potential and the problem
solving capacity of individuals by providing a secular higher education to citizens of the country.
1.1. Rationale
Nowadays, the creed of free market philosophy and the trend of globalization require dealing with
various issues. Our economy as emerging market type; the increasing number of private business
organizations and foreign companies are in need of highly qualified and experienced citizens in the
area of management. Unity as Higher Education Institution with its program of technology stream
wants to contribute in rectifying the gap of the need of the country.
Computer Science as a discipline is designed to enable graduates to actively participate in the ICT
stream of an organization and to solve problems. One of the most important resource in an
organization is its ICT infrastructures. As such, Computer Science is designed to be compatible with
the current trends of ICT to facilitate the productive capacity. The implementation of the program
will have great role in achieving the objectives of the country.
1.2. Justification
The qualified people in Ethiopia as compared to the total population are very low. So participating in
this area will help the country to balance such gaps that exists between the qualified and the non-
qualified people. Thus, by increasing the proportion of the trained and capable people, Unity
University is trying to implement the development objectives of the nation.

1
2. VISION, MISSION, AND VALUES

2.1. Vision
To create the best possible private University that can provide quality education and research for
better use by citizens, who are engaged with the University (with full energy and enthusiasm) to
acquire education and achieve their dream for a better life and a well developed country.

2.2. Mission
A multi-sector organization with second-to-none leadership positions in each of our educational and
research products and services thereby exceeding the expectations of our customers, employees,
shareholders and the community.

2.3. Values

 Customer Satisfaction
 Employees Empowerment
 Corporate Identity and Image
 Integrity and Ethics
 Balanced Life and Performance
 Raising the Capital of Shareholders and Owners
 Strength and Stability
 Social Responsibility and Corporate Citizenship
 Profit and Growth
 Respect and Trust
 Quality and Excellence
 Teamwork and Cooperation

2.4. Objectives

The main objective of the University is to meet its goals


 By using efficient and effective leadership that can properly manage the resources of the
University
 By using a well-defined roadmap to jump start and expand the activities of the University.
 By using technology based tools to help modernize the products and services provided by the
University.
 By constructively engaging with the relevant Government agencies and complying with all
the requirements set by the law of the land.

2.5. Goals

The stated goals of the University shall include the following:


 Be the very best in delivering Quality Education and research and graduate students who are
well armed with the necessary tools to excel in life.

2
 Promote the sprit of intellectual freedom, research and development expected of the
University.
 Maintain the best possible and modern resources needed to conduct the teaching-learning
process at the University.
 Run a well managed and lead organization which is structured to promote employee-focused,
student –centered, quality-based and growth-oriented University that is capable of serving the
nation and the community by meeting its legal and social responsibilities, respectively.

3. Objective(s) of the Program

The ultimate goal of this program is to produce graduates who can cope up with the dynamic nature
of the Information Technology industry and a wide range of careers by being able to focus on
software development and capitalize on high growth markets.

3.1 General Objectives

 To provide competent software development personnel who can design, develop and
implement innovative applications by using leading –edge technologies.
 To provide in-depth and breadth training for quality business solutions.

3.2 Specific objectives

The specific objectives of the Computer Science program are:

 To provide manpower trained in new technologies, techniques and methodologies for


development of high-quality software products.
 Enabling students to develop prototypes and assist the commercialization of product ideas.
 Providing a flexible approach for continuous education.
 Developing the physical, mental potential and the problem-solving capacity of students
 Developing important lifetime talents such as communication skills and team-oriented work
culture.

4. Graduate Profile

Graduates of the Computing Science program are expected to:

 Analyze, design, write, test and debug business-oriented, Network-based application


programs using the latest digital technologies
 Mange software project activities
 Administer different network topologies
 Manage heterogeneous computing technologies across different kinds of network
environments

3
Successful graduates of the Computer Science program of Unity University will be able to perform
the following tasks in their future career:

 Software Development/ Programming


 Analyzing and Designing Information Systems
 Managing IT projects
 Network Administration
 Troubleshoot IT Systems
 Designing and developing web-based applications

5. Admission Requirement

To be eligible for admission applicants must satisfy the basic University entrance requirements set
by the Ministry of Education of Ethiopia.

6. Duration of the Study

The total duration of the study for BSC in Computer Science is four years. For regular program
students, the duration of the study is four years and for extension program, the duration of the study
is five years.

7. Graduation requirement

Any Computing Science Graduate is expected to successfully complete all the courses indicated in
the curriculum with minimum cumulative GPA and Major GPA of 2.00.

Graduates students will be awarded the “Bachelor of Science Degree in Computer Science” if they
fulfill the following requirements:

 A minimum credit hour of 143/144


 A minimum Cumulative Grade point Average of 2.00
 A minimum Cumulative Grade point Average of 2.00 in MAJOR courses.
 No F, NG,I, in any course and
 Compliance with the regulation of the University

8. Degree Nomenclature

English

Bachelor of Science Degree in Computer Science

Amharic

በሳይንስ ባችለር ዲግሪ በኮምፒውተር ሳይንስ

4
9. Curriculum

Curriculum for Computer Science Degree Program

Course Pre- Co. Lab


Course Description Cr.Hr.
S.No. No. requisite Hr. Req

Major Courses – Compulsory

1 COSC 111 Introduction to Computer Science NA 4 4 Yes

2 COSC 112 Fundamental of Programming I COSC 111 4 4 Yes

3 COSC 221 Fundamental of Programming II COSC 112 4 4 Yes

COSC 221, Yes


COSC 222 Data Structure & Algorithms
4 COSC 241 4 4

COSC 222, Yes


COSC 351 Operating System
5 COSC 241 4 5

6 COSC 241 Computer organization & Architecture COSC 112 3 4 Yes

7 COSC 152 Object Oriented System Analysis & Design NA 4 4 No

Fundamentals of Database Management Yes


COSC 223
8 system COSC 152 4 4

9 COSC 224 Advanced Database Management System COSC 223 4 4 Yes

Data Communication & computer COSC 111, Yes


COSC 353
10 Networking COSC 241 4 5

11 COSC 226 Object Oriented Programming COSC 221 4 4 Yes

12 COSC 230 Web Design and Implementation I COSC 221 4 4 Yes

13 COSC 331 Web Design and Implementation II COSC 230 4 4 Yes

14 COSC 361 Algorithms COSC 222 3 4 Yes

COSC 223, No
COSC 352 Software Project Management
15 COSC 331 4 4

16 COSC 312 Principles of compiler Design COSC 222 4 4 Yes

5
17 COSC 322 Windows programming COSC 226 4 4 Yes

COSC 351, Yes


COSC 481 Networking Administration
18 COSC 353 4 4

19 COSC 313 Introduction to Artificial Intelligence COSC 361 4 4 Yes

20 COSC 461 Computer Graphics COSC 221 4 4 Yes

21 COSC 491 Project I COSC 352 3 3 No

COSC 322 , No

COSC 492 Project II COSC 491,

22 COSC 224 3 3

Total 84 88

Major courses – Elective

6
Course Pre- Cr. Cont. Lab
S.No. No. Course Description requisite Hr. Hours Req

1 COSC 465 Wireless Networking / communication COSC 481 4 4 YES

2 COSC 462 Computer System Security NA 3 3 YES

3 COSC 423 Structural System Analysis & Design NA 4 4 NO

4 COSC 431 E- Commerce COSC 230 3 3 YES

5 COSC 453 Expert System COSC 313 3 3 YES

6 COSC 441 Assembly language programming COSC 241 3 3 YES

7 COSC 463 Information storage and Retrieval COSC 222 4 4 NO

COSC 221,
COSC 452 Simulation & Modeling 3 3 YES
8 STAT 192

9 COSC 467 Multimedia systems COSC 461 3 3 YES

10 COSC 455 UNIX/LINUX operating System COSC 351 3 3 YES

11 COSC 469 Formal Language Theory COSC 222 3 3 NO

Total 36 36

GENERAL COURSES

COURSE PRE- CREDIT CONT


NO. NO. COURSE DESCRIPTION REQUISITE HOUR HOURS

1 ENLA 100 Communication Skills - 3 3

2 PHIL 103 Civics and Ethics Education - 3 3

3 ENLA 201 Sophomore English - 3 4

4 STAT 192 Introduction to Statistics - 3 4

5 PHIL 101 Introduction to logic ( Philo) - 3 3

Total 15 17

7
SUPPORTIVE COURSES

NO COURSE PRE- CREDIT CONT LAB


. NO. COURSE DESCRIPTION REQUISITE HOUR HOURS REQ

1 MATH 122 Linear Algebra NA 4 4 NO

2 MATH 161 Calculus I NA 4 5 NO

MATH 162 MATH122 NO

3 Calculus II MATH161 4 5

4 MGMT 212 Introduction to Management NA 3 3 NO

5 COSC141 Basic Electricity & Electronics NA 4 4 YES

6 COSC 261 Discrete Mathematics& Combinatory STAT 192 3 3 NO

7 MGMT 412 Entrepreneurship &Small Business NA 3 3 NO

8 MGMT 332 Research Methods NA 3 3 NO

Total 28 30

SUMMARY CR. HR CONT. HR

Major Courses – Compulsory 84 88

Major courses – Elective 16 / 17 16 /17

Supportive Courses 28 30

General Courses 15 17

Total 143/144 151/152

10. PREREQUISITE CHART

Tabular Representation of prerequisite sequence of Courses Offered to computer Science students

8
S.NO COURSE TITLE PREREQUISITE TO REMARK

Introduction to Fundamental of Programming I Data Communication &


1 Computer Science computer Network

Fundamental of Programming II
Fundamental of
2 Programming I Computer organization & Architecture

Data Structure & Algorithms

Object Oriented Programming

Foundation of Internet Tec.( Internet programming I)


Fundamental of
3 Programming II Computer Graphics

Operating System

Algorithms

Principles of compiler Design


Data Structure &
4 Algorithms Formal Language Theory

5 Operating System Network Administration

Data Structure & Algorithms

Operating System
Computer organization
6 & Architecture Data Communication & computer Network

Object Oriented system


7 analysis & Design Fundamentals of Database Management system

Fundamentals of
Database Management
8 system Advanced data base management system

Advanced data base


9 management system -

Data Communication &


10 computer Network Network Administration

Object Oriented
11 Programming Windows programming

9
Foundation of Internet
Tec.( Internet
12 programming I) Internet programming II

Internet programming
13 II Software Project Management

14 Algorithms Introduction to Artificial Intelligence

Software Project
15 Management Project I

Principles of compiler
16 Design -

17 Windows programming Project II

Network
18 Administration -

Introduction to
19 Artificial Intelligence Expert System

20 Computer Graphics Multimedia

21 Project I Project II

22 Project II -

11. COURSE BREAK DOWN

11.1 REGULAR PROGRAM

YEAR I

SEMESTER I

S.NO. COURSE TITLE COURSE NO. CR.HR CONT.HR.

1 Introduction to Computer Science COSC 111 4 4

2 Introduction to Statistics STAT 192 3 4

10
3 Calculus I MATH 161 4 5

4 Communication Skills ENLA 100 3 3

5 Introduction to Management MGMT 212 3 3

17 19

SEMESTER II

1 Fundamental of programming I COSC112 4 4

2 Basic Electricity and Electronics COSC 141 4 4

3 Object Oriented System Analysis and COSC 152 4 4


Design

4 Linear Algebra MATH 122 4 4

16 16

SEMESTER III

1 Civic and Ethical Education PHIL 103 3 3

2 Calculus II MATH162 4 5

7 8

YEAR II

SEMESTER I

1 Fundamental of Programming II COSC 221 4 4

2 Computer Organization & COSC 241 3 4


Architecture

3 Fundamental of Database Management COSC 223 4 4


Systems

4 Sophomore English ENLA 201 3 4

14 16

SEMESTER II

1 Data Structure and Algorithms COSC 222 4 4

11
2 Advanced Database Management COSC 224 4 4
system

3 Object Oriented programming COSC 226 4 4

4 Discrete Mathematics and COSC 261 3 3


Combinatory

15 15

SEMESTER III

1 Web Design & Implementation I COSC230 4 4

2 Introduction to Logic PHIL 101 3 3

3 Elective 3 3

10 10

YEAR III

SEMESTER I

1 Operating Systems COSC351 4 5

2 Data Communication & Computer COSC353 4 5


Networking

3 Web Design & Implementation II COSC331 4 4

4 Algorithms COSC 361 3 4

15 18

SEMESTER II

1 Software Project Management COSC 352 4 4

2 Principle of Compiler Design COSC 312 4 4

3 Window Programming COSC 322 4 4

4 Introduction to Artificial Intelligence COSC 313 4 4

16 16

SEMESTER III

12
1 Research Methods MGMT 332 3 3

2 Entrepreneurship & Small Businesses MGMT 412 3 3

6 6

YEAR IV

SEMESTER I

1 Project I COSC 491 3 3

2 Network Administration COSC 481 4 4

3 Computer Graphics COSC 461 4 4

4 Elective 3 3

14 14

SEMESTER II

1 Project II COSC 492 3 3

2 Elective 3 3

3 Elective 3 3

4 Elective 4 4

13 13

12.2 EXTENSION PROGRAM

13
YEAR I

SEMESTER I

S.NO. COURSE TITLE COURSE NO. CR.HR CONT.HR


.

1 Introduction to Computer Science COSC 111 4 4

2 Introduction to Statistics STAT 192 3 4

3 Calculus I MATH 161 4 5

11 13

SEMESTER II

1 Fundamental of programming I COSC112 4 4

2 Object Oriented Analysis and Design COSC 152 4 4

3 Linear Algebra MATH 122 4 4

12 12

SEMESTER III

1 Introduction to Management MGMT 212 3 3

2 Civic and Ethical Education PHIL 103 3 3

6 6

YEAR II

SEMESTER I

1 Fundamental of Programming II COSC 221 4 4

2 Calculus II MATH 162 4 5

3 Discrete Mathematics and COSC 261 3 3


Combinatory

11 12

SEMESTER II

1 Basic Electricity and Electronics COSC 141 4 4

14
2 Computer Organization & COSC 241 3 4
Architecture

3 Fundamental of Database COSC 223 4 4


Management Systems

11 12

SEMESTER III

1 Communication Skills ENLA 100 3 3

2 Introduction to Logic PHIL 101 3 3

6 6

YEAR III

SEMESTER I

1 Data Structure and Algorithms COSC 222 4 4

2 Advanced Database Management COSC 224 4 4


system

3 Object Oriented programming COSC 226 4 4

12 12

SEMESTER II

1 Web Design & Implementation I COSC 230 4 4

2 Operating Systems COSC 351 4 5

3 Sophomore English ENLA 201 3 4

4 Elective 3 3

14 16

SEMESTER III

15
1 Elective 3 3

2 Research Methods MGMT 332 3 3

6 6

YEAR IV

SEMESTER I

1 Web design & implementation II COSC 331 4 4

2 Data Communication & Computer COSC 353 4 5


Networking

3 Elective 4 4

12 13

SEMESTER II

1 Software Project Management COSC 352 4 4

2 Algorithms COSC 361 3 4

3 Window Programming COSC 322 4 4

11 12

SEMESTER III

1 Elective 3 3

2 Entrepreneurship & Small Businesses MGMT 412 3 3

6 6

YEAR V

SEMESTER I

1 Project I COSC 491 3 3

2 Network Administration COSC 481 4 4

3 Principle of Compiler Design COSC 312 4 4

11 11

16
SEMESTER II

1 Introduction to Artificial Intelligence COSC 312 4 4

2 Elective 3 3

3 Project II COSC 492 3 3

4 Computer Graphics COSC 461 4 4

14 14

17
13. TEACHING AND LEARNING METHODS

The program uses various types of teaching and learning methods appropriate to each course.
The method may use one or more of the following as deemed appropriate.

 Lectures
 Presentation
 Debates and Discussions
 Industry Visit/ Community based program
 Problem based learning
 Case studies
 Literature Review
 Simulations
 Role playing
 Computer Lab work

14. ASSESSMENT POLICIES AND TECHNIQUES

Student work is assessed continuously throughout the semester through examinations,


quizzes, research and writing assignments, projects and participation in class discussions.
Final exams and / or projects typically comprise about 50 percent of the final grade for a
course. According to the policy of the University attendance will have 5% value in any
course.

15. GRADING SYSTEM


The grading system is a four scale grading system comprising of A to F and respective
grade points as follows.

Grade A+ A B+ B C+ C D F

Value 4.00 4.00 3.50 3.00 2.50 2.00 1.00 0.00

18
MAJOR COMPULSORY

COURSE DESCRIPTION

Course Title : Introduction to Computer Science

Course No: COSC 111

Credit Hours: 4

Contact Hours: 4 ( 2 lecture hrs and 2 lab hrs)

Laboratory: Required

Prerequisite: NA

Course Description

This course focuses on the basic information technology elements such as hardware, Software,
data storage and networking concepts and explores the major features of operating systems and
applications software. A practical orientation towards applications software such as word
processors, Spreadsheets and database is also covered. No previous computer experience is
required.

Course Objectives

After a successful completion of this course students will be able to:

 Develop a basic understanding of the information technology terminologies and concepts


 Apply and use different integrated software packages
 Analyze, discuss, and evaluate IT developments trends
 Understand what computer hard ware ,software, and networks are
 Identify and use different types of applications such as word processing, spreadsheets.
Course Outline

1. Introduction
2. Digital Technology
3. Introduction to Computer Hardware
4. Introduction to Software
5. Introduction to Programming Languages
6. Introduction to Telecommunications and Computer Networks
7. Future Trends in Information Technology
8. Operating system Software
Text Book

ITL Education Solutions Ltd, Introduction to Computer Science, Pearson Education, 2004.

19
Reference

Dida Midekso , Introduction to Computer Science , Ethiopia, AAU, 1994

Computer Science: An Overview: International Edition, (10 th ed), Pearson Higher Education,
2007.

Englander.ivar(1996). The Architecture of Computer Hardware and system software: An


Information Technology Approach. Totronto, John wiley and Sons

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Practical Tests (15%), Assignments (15%) and
Final Exam (50%)

Course Title: Fundamentals of Programming I

20
Course No: COSC 112

Credit Hours: 4

Contact Hours: 4 ( 2 hrs Lecture & 2 hrs Lab

Laboratory : Required

Prerequisite : Cosc 111

Course Description

This course is and introductory course to computer programming and problem solving. Emphasis
will be on the general concepts of programming such as flowcharting, Algorithms and pseudo-
coding as well as related computer program documentation techniques. Preferably C++ will be
used as a tool to internalize the concepts.

Course Objectives

After a successful Completion this course, students will be able to:

 Use the C++ programming tools to write computer programs


 Use variables and the basic input and output functions of the C++ language
 Find and debug programming errors
 Construct and evaluate arithmetic expressions
 Use repeated operations in the construction of programs

Course Outline

1. Introduction to programming
2. The Integrated Development Environment(IDE)
3. Input and Output Using c in and c out
4. Repetition control structure
5. Selection control structure
6. Arrays and strings
Textbook

Lafore, Robert, Object Oriented Programming in C++ (4th ed),2001

References

Walter Savitch, Problem Solving with C++ (6th ed), USA, Addison Wesley,2006
Dromey, R.G., How to solve it by computer, UK, Prentice Hall Inc., 1982
GaddisTony, Starting out with C++, USA , Scott/Jones Inc. Publishers, 2005

Schildt Herbert, C++ - The Complete Reference(4th ed), USA, McGraw Hill Inc. 2001

21
Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Practical Tests (15%), Assignments (15%) and
Final Exam (50%)

Course Title: Fundamentals of Programming II

22
Course No: COSC 221

Credit Hours: 4

Contact Hours: 4( 2 hrs Lecture & 2 hrs Lab)

Laboratory: Required

Prerequisite: COSC 112

Course Description

This course is continuation of the course fundamentals of programming I. Emphasis will be on


the advanced topics of structural programming that covers functions, pointers, recursion methods
and file concepts. Similar to the first programming course C++ can be used as a tool to teach the
concept.

Course Objectives

After a successful Completion this course, students will be able to:

 Scrutinize fundamental concepts in programming


 Use repeated operations in the construction of programs
 Create function calls and use the more common Library functions
 Understand and use data structures for data storage
 Use pointers for indirection
 Manipulate file operations
 Use recursion Methods

Course Outline

1. Repetition control structure


2. Selection control structure
3. Arrays and strings
4. Structures
5. Functions
6. Pointers
7. Files
8. Recursion

Textbook

Lafore, Robert, Object Oriented Programming in C++ (4th ed),2001

References

23
Walter Savitch, Problem Solving with C++ (6th ed), USA, Addison Wesley,2006
Dromey, R.G., How to solve it by computer, UK, Prentice Hall Inc., 1982
GaddisTony, Starting out with C++, USA , Scott/Jones Inc. Publishers, 2005

Schildt Herbert, C++ - The Complete Reference(4th ed), USA, McGraw Hill Inc. 2001

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Practical Tests (15%), Assignments (15%) and
Final Exam (50%)

Course Title : Data Structures and Algorithms

24
Course No: COSC 222

Credit Hours: 4

Contact Hours: 4( 2 hrs Lecture & 2 hrs Lab)

Laboratory: Required

Prerequisite: COSC 221, COSC 241

Course Description

The course is designed to enable students to identify way in which data can be structured and
stored in memory. The ideas of various structures can be implement in the field of computer –
based information systems like in database management systems, networks, operating systems
and global information systems.

Course Objectives

After a successful completion of this course, students will be able to :

 Organize and manipulate data in a computer storage


 Apply the fundamental concept in the design and analysis of algorithms
 Understand linear and non-linear data structures
 Get familiarized with searching and sorting techniques
 Implement various data structures using a programming language

Course Outline

1. Introduction to data structures


2. String processing
3. Linear Array
4. Linked List
5. Dynamic memory Allocation
6. Stacks, queues ,Recursion
7. Trees
8. Sorting and searching
Textbook

Mark Allen Weiss, Data Structures and Problem Solving Using C++ (2 nd ed), USA, Addison-
Wesley, 1999

References

25
Adam Drozdek, Data Structures and Algorithms in C++(2 nd ed), USA, Thomson Brooks/Cole
, 2001

William J. Collins, Data Structures and the Standard Template Library, McGraw-Hill
Science/Engineering/Math, 2002

Yadidyah. Langsam, Augenstein. Moshe J.,TEnenbaum. AronM.,Data Structures Using C


and C++, Pearson Education Inc., New Jersey , USA.1996

Teaching Methods: Lecture and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Practical Tests (15%), Assignments (15%) and
Final Exam (50%)

Course Title: Operating Systems

26
Course No: COSC 351

Credit Hours: 4

Contact Hours: 5 (3 lectures hrs and 2 lab hrs)

Laboratory : Required

Prerequisite: COSC 222, COSC241

Course Description

The course provides a component based treatment of operating systems, Students will be
Introduce to the development of operating systems, components of an operating system, and
different algorithms for handling computer system resources. This course explores the view of
layers of the operating system

Course Objectives

 After a successful completion of this course, students will able to


 Understand the major functions of modern operating systems
 Appreciate functionality of each component of the system
 Organize and schedule recourses effectively
 Write programs for sequential and concurrent processing
 Generalize the working models of software on hardware
 Understand the internal details of computer systems

Course Outline

1. Components of an operating system


2. Models of Operating systems
3. Computer hardware review
4. Processes , and threads
5. Process management and Scheduling
6. Inter –Process communication
7. Dead blocks
8. Dynamic Memory management
9. Disks and file ,management
10. Input/output management
11. Networking
12. Security

Textbook

27
Andrew S. Tanenbaum, Modern Operating Systems (2nd ed), USA, Prentice-Hall, 2001.

References

William Stallings, Operating Systems: Internals and Design Principles (5 th ed), Prentice
Hall, 2005.

Abraham Silberschatz, P. B. Galvin and G. Gagne: Operating System Concepts (6 th ed),


John Wiley & Sons, 2001.

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Practical Tests (15%), Assignments (15%) and
Final Exam (50%)

Course Title: Computer Organization and Architecture

28
Course No: COSC 241

Credit Hours: 3

Contact Hours: 4 (3 lecture hr and 1 lab hr)

Laboratory: Required

Prerequisite: COSC 112

Course Description

This course introduces the internal working of the computer hard ware. It reviews the
fundamentals of digital systems and the sequential building blocks. It also introduces the
standard format for specification of hard ware level programs. That is, the registrar transfers
language (RTL). It extensively covers the topics of CPU, peripheral interfacing, memory
management. Furthermore, the students will be introduced to the concepts of organizing the
hardware components.

Course Objectives

After a successful completion of this course, students will be able to:

 Describe, explain and use register transfer language and notation.


 Understand the organization of the CPU and the other hard ware components
 Understand the instruction execution cycle
 Compare and contrast different addressing modes
 Describe computer peripherals and memory system

Course Outline

1. Evolution of computer architecture


2. Register transfer and micro –operations
3. Basic computer organization and design of central processing unit
4. Control Unit
5. Introduction to reduced instruction set computer (RISC)
6. Input/output (I/O) organization
7. Memory organization
8. Instruction Set
9. Introduction to Assembly language programming

Textbooks

29
Andrew S. Tannenbaum, Structured Computer Organization,(4th ed), Prentice Hall,
1999.
References
Mano, M. and Kime, C., Logic and Computer Design Fundamentals, (3 rd ed), Pearson
Prentice Hall, 2004.
Stallings, W.: Computer Organization and Architecture: Designing for Performance, (5 th
ed), Prentice Hall, 1996.
John Hennessey and David Patterson: Computer Architecture: A Quantitative
Approach, (4th ed), Morgan Kauffman Publishers, 2003.

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Practical Tests (15%), Assignments (15%) and
Final Exam (50%)

Course Title: Object Oriented Analysis and Design

30
Course No: COSC 152

Credit Hours: 4

Contact Hours: 4

Laboratory: Not Required

Prerequisite: NA

Course Description

This is an advanced system analysis and design course for future computer programmers,
systems analysts .system designers and IT project managers. The course presents a detailed
overview of the approaches used by today’s information system developers to discover and
model the requirements to implement a successful system solution. The course focuses on tools
and techniques that system analysts use to develop component based information systems.
Object-Oriented tools and the Unified Modeling Language (UML) will b e used for describing
objects, use cases, actors, structured scenarios, hierarchies, dependencies, message flows, state
transitions, and user interfaces.

Course Objectives

After a successful completion of this course, students will be able to:

 Design and develop software applications using object oriented principles


 Develop object oriented software specification using UML
 Implement use cases diagrams, scenarios ,and sequence diagrams using UML
 Specify state diagrams, activity diagrams, component diagrams and deployment diagrams
with object identification and modeling

Course Outline

1. Introduction to OOAD
2. Project Initiation
3. Requirement Analysis
4. Requirement Specification
5. Class diagram
6. Class diagram
7. Modeling the use cases
8. Modeling dynamic characteristics
9. Elaboration models
10. Component diagrams
11. Deployment diagrams

31
Textbook

Ambler, Scott W., the Object Primer, Second Edition, the Application Developers Guide
to Object Orientation and UML, Cambridge University Press, UK, 2001.

References:

Pankaj Jalote , An Integrated Approach to Software Engineering (3rd ed) , Springer, 2005

Bruegge Bernd, Object oriented Software engineering:Using UML,Patterns and Java(2nd


edition), USA, Pearson Education, 2004
Kendall K.E. & Kendall J.E, Systems Analysis and Design( 5th ed), USA, Prentice Hall,
2001

Grady Booch ,Object-Oriented Analysis and Design with Applications (2nd ed ), USA,
Addison-Wesley Professional; 1994

Booch,G., Rumbaugh, J., Jackobson,I., the Unified Modeling Languae: User Guide ,
Addision Weley, Longman Inc., USA, 1999

Rumbaugh , James, Michael Blaha, William Premerlani, Frederick Eddy, William


Lorenson, Object Oriented Modeling and Design , Schenctady, New York, USA, 1991

Teaching Methods: Lecture, Discussion and case studies, and Demonstration

Evaluation Methods: Theoretical Tests (15%), Assignment (5%), Project Work (25%) and
Final Exams (50%)

Course Title: Fundamentals of Database Management Systems

32
Course No: COSC 223

Credit Hours: 4

Contact Hours: 4(2 Lecture hrs and 2 lab hrs)

Laboratory: Required

Prerequisite: COSC 152

Course Description

The development of efficient database applications requires an understanding of the


fundamentals of database management systems techniques for the design of database and
principles of database administration. All major database management systems, including
hierarchical, network, relational and object-oriented will be covered, though relational Database
management systems is the main focus topics to be discussed include conceptual models, query
languages, and architecture such as centralized, distributed and client/ server special emphasis is
given to the design of database and development of database applications( client/server and web
based applications) using modern software tools.

Course Objectives

 After a successful completion of this course , students will be able to :


 Develop conceptual models using the Entity-Relationship models
 Design relational databases with high quality
 Develop a database of a given enterprise
 Be familiarized with the management of database systems including security. Error –
recovery and concurrency control

Course Outline

1. An overview of database management systems (DBMS)

2. Levels of architecture of DBMS

3. Database design

4. Relational algebra

5. Relational calculus

6. Normalization

7. Structural Query Languages (SQL)

8. Concurrency and Transaction Processing

33
Textbook

Ramez Elmasri, Shamkant B. Navathe , Fundamentals of Database Systems( 4 th ed ) ,


USA, Addison-Wesley, 2004

References

Abraham Silberschatz, Henry F. Korth, S. Sudarshan , Database System Concepts(4th


ed), USA, McGraw Hill Inc. , 2002.

Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom , Database Systems :The


Complete Book, USA, Prentice Hall, 2002.

C.J.DATE , Introduction to Database systems(8th ed), USA, Addison Wesley, 2003

Ramakrishnan R. and Gehrke J., Database Management Systems( 3rd ed), USA,
McGraw Hill,2003

Connoly,T.M.,V.E.Begg.& A, Strachen. Darabase System: A practical Approach to


Design , Implementations and management. 2nd ed… Harlow , England: Addison
wisely,1999

Teaching Methods: Lecture, Discussion and case studies and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Assignment (5%), Project Work (25%) and
Final Exams (50%)

Course Title: Advanced Database Management Systems

Course No: COSC 224

34
Credit Hours: 4

Contact Hours: 4(2 Lecture hrs and 2 lab hrs)

Laboratory: Required

Prerequisite: COSC 223

Course Description

This course is a continuation of the course Fundamentals of Database systems. It extends the
knowledge in the previous course by adding concepts of advanced issued in database
management systems and advanced database systems. Topics to be covered are : basics of query
optimization, transaction management, database security and overview of advanced database
systems like Object-Oriented and Object-Relational databases, active databases, deductive
databases, multimedia and spatial databases, distributed databases, and current trends in DBMS.

Course Objectives

After a successful completion of this course, students will be able to:

 Equipped with different query optimization techniques


 Be familiar with transaction management concept and techniques
 Current trends and developments in the area of database management system

Course Outline

1. Basics of query optimization


2. Transaction management
3. Database security and
4. Overview of advanced database systems like
 Object-Oriented and Object-Relational databases,
 Active databases,
 Deductive databases,
 Multimedia and spatial databases,
 Distributed databases
5. Current trends in DBMS.

Textbook

Ramez Elmasri, Shamkant B. Navathe , Fundamentals of Database Systems( 4 th ed ) ,


USA, Addison-Wesley, 2004

35
References

Abraham Silberschatz, Henry F. Korth, S. Sudarshan , Database System Concepts(4th


ed), USA, McGraw Hill Inc. , 2002.

Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom , Database Systems :The


Complete Book, USA, Prentice Hall, 2002.

C.J.DATE , Introduction to Database systems(8th ed), USA, Addison Wesley, 2003

Ramakrishnan R. and Gehrke J., Database Management Systems( 3rd ed), USA,
McGraw Hill,2003

Connoly,T.M.,V.E.Begg.& A, Strachen. Darabase System: A practical Approach to


Design , Implementations and management. 2nd ed… Harlow , England: Addison
wisely,1999

Teaching Methods: Lecture, Discussion and case studies and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Assignment (5%), Project Work (25%) and
Final Exams (50%)

Course Title: Data Communication and Computer Networks

Course No: COSC 353

36
Credit Hours: 4

Contact Hours: 5 (3 Lecture hrs and 2lab hrs)

Laboratory: Required

Prerequisite: COSC 111, COSC 241

Course Description

The aim of this course is to provide a wide-ranging introduction to modern computer networks
and their applications. The emphasis is on the protocols involved and how they inter- work. The
course introduces concepts from data communication perspective up to the network level. The
students will be equipped with necessary knowledge in theoretical as well as practical aspects on
networking. The course considers and deals with computer networks concentrating on the three
critical OSI layers. Ample examples will be provided in order to illustrate the paradigm of
computer networks.

Course Objectives

After a successful completion of this course, students will be able to:

 Understand and explain the different models of computer networks


 Understand the OSI reference model
 Differentiate between LAN,WAN,MAN. And Intranet
 Setup and configure computers for networking , to establish LANs
 Understand the principles of communication in computer networks
 Understand and use the applications of computer networks like network servers, directory
services ,cable televisions, and multimedia communication

Course Outline

1. Introduction to Networking
2. Digital Transmission
3. the Telephone system
4. Networking Protocols and Architectures
5. Local Area Networks
6. the network layer
7. Broadband Networks
8. Network security
Textbook
Forouzan, B. A. Data Communications and Networking ( 3rd ed), 2003.

37
References
Tannenbaum, A. S. Computer Networks( 4th ed), Prentice Hall, 2003.
Stallings, W. Data and Computer Communications (7th ed), Prentice Hall, , 2004.
Comer, D. E. and R. E. Droms: Computer Networks and Internets, with Internet
Applications(4th Ed), Prentice Hall, 2003.
Kurose, J. F. and K. W. Ross: Computer Networking: A Top-Down Approach to the
Internet (3rd ed), Pearson Education, Inc., 2005.
Miller, Michael A., Data and Network Communications, Delmar Learning- A Division of
Thomson Learning, USA, 2001

Teaching Methods: Lecture, Laboratory practical work and demonstration

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project Work (15%) and
Final Exams (50%)

Course Title: Object Oriented Programming

Course No: COSC 226

38
Credit Hours:4

Contact Hours: 4 ( 2 hrs Lecture & 2 hrs Lab)

Laboratory: Required

Prerequisite: COSC 221

Course Description

This course introduces students to the most widely applied modern and scalable programming
paradigm. in this course , the students will enhance there knowledge on the modular program
development using objects. The course extensively covers the principles of object modeling,
operator overloading, inheritance, and polymorphism and exceptions. The students are expected
to develop programming language skills.

Course Objective

After a successful completion of this course, students will be able to

 Understand and employ object Oriented programming tools


 Build multiple file programs
 Perform Object modeling and programming decomposition
 Apply object oriented principles like operator overloading, inheritance. Polymorphism,
message passing etc
 Write test and debug applications using object oriented principles

Course Outline

1. Introduction to Object Oriented Programming


2. Building a program
3. Class and Objects
4. Operator Overloading
5. Inheritance.
6. Exception Handling
7. Polymorphism
8. Object serialization
9. Graphics- A demonstration for importance of OOP
10. Packages – Organization of a large and complex programs

Textbooks

Deitel, H. M. & P. J. Deitel, Java: How to Program ( 6th ed) , USA , Prentice Hall, 2004

39
References

Shildt, Herbert, Java 2: the Complete Reference(5th ed), USA , McGraw-Hill Companies, Inc,
2002

Quentin Charatan & Aaron Kans, Java In Two Semesters( 2 nd Ed), McGraw-Hill Publishing
Co., 2002

Cay S. Horstmann and Gary Cornell, Core Java 2 Volume I – Fundamentals (7 th ed), USA,
Prentice Hall PTR, 2004

Cay S. Horstmann and Gary Cornell, Core Java 2 Volume II - Advanced Features (7 th ed),
USA, Prentice Hall PTR, 2004

Smith, Michael. Java an Object Oriented Language. McGRaw-Hill International, UK, 2000

Teaching Methods: Lecture and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project Work (15%) and
Final Exams (50%)

Course Title: Web Design and Implementation I

Course No: COSC 230

40
Credit Hours: 4

Contact Hours: 4 (2 hrs Lecture & 2 hrs Lab)

Laboratory: Required

Prerequisite: COSC 221

Course Description

This course explores the history, architecture and development of the world wide web. Current
tagging and scripting languages are covered in a tool independent environment. Topics also
address authoring tools, design of web pages, graphics and multimedia formats as well as
implementation and security issues.

Course Objectives

After a successful completion of this course, students will be able to:

 Get familiarized with internet technologies


 Understand the interaction between the web servers and web browsers
 Get experience on developing web pages using various scripting languages
 Have working knowledge of client and server side programming
 Have knowledge web publishing

Course Outline

1. Introduction to Internet
2. web Browsers and web servers
3. Introduction to web Applications
4. HTML
5. XHTML
6. Java script
7. XML
8. Graphics and Multimedia
9. Introduction Scripting languages
10. Introduction to server side programming
11. web publishing

Text Book:

41
Harvey & Paul, Internet & World Wide Web: How to Program (4th Edition) (How to
Program (Deitel)), Deitel & Associates Inc., 2007.

References:

Craig D. Knuckles, David S. Yuen, Web Applications: Concepts & Real World Design, John
Wiley & Sons,

Thomas A. Powell, HTML & XHTML: The Complete Reference, McGraw-Hill

Goodman, Java script bible (3rd Edition), (Gage Publishing)

Teaching Methods: Lecture and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project Work (15%) and
Final Exams (50%)

Course Title: Web Design and Implementation II

42
Course No: COSC 331

Credit Hours: 4

Contact Hours: 4 (2 hrs Lecture & 2hrs Lab)

Laboratory: Required

Prerequisite: COSC 230

Course Description

This course introduces programming techniques use to develop dynamic internet and intranet
applications. Topics include server-side scripting and their appropriate use. The students will
gain practical experience using contemporary scripting technologies in laboratories in laboratory-
based assignments.

Course Objectives

After a successful completion of this course, Students will be able to:

 Understand the client server interaction between the web server and web client ( browser)
in more detail
 Develop a severe side scripts using Active server pages
 Integrate a website with a database
 Design ,Develop and implement a model for web application

Course Outline

1. Client side scripting


2. Active server pages
3. ASP Objects
4. ASP and Active X Objects
5. ASP Data base development –ADO
6. Error Handling in ASP
7. Component Based web Application
8. Introduction to, NET Frame work

Text Book

Buczek, Greg, Instant ASP Components, McGraw Hill Companies , Inc., New York,
2000

Reference

43
Wyke, R.Allen, JavaScript Unleashed. Third Edition, Sams Publishing, USA, 2000

Utley, Craig, SQL Server 2000 Web Application Developers Guide. Osborne /Mc Graw
Hill Companies, Inc., Berkeley, USA,2001

Teaching Methods: Lecture and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project Work (15%) and
Final Exams (50%)

Course Title: Algorithms

44
Course No: COSC 361

Credit Hours: 3

Contact Hours: 4 (2 hrs lecture and 2 hrs lab)

Laboratory: Required

Prerequisite: COSC 222

Course Description

Algorithms are recipes for solving computational problems. In this course, students will study
fundamental algorithms. More importantly, we will focus on general Analysis and Design
techniques that underlie algorithms principles. Students will be familiarized with divide-and-
conquer, dynamic programming, greediness and probabilistic algorithmic approaches.

Course Objectives

After a successful completion of this course, Students will be able to:

 Analyze the algorithms for space and time complexity.


 Get familiarized with various algorithmic notations.
 Develop the Knowledge of various algorithmic design strategies.
 Demonstrate problems like traveling salesman , knapsack, and eight-queen
 Implement various probabilistic approaches to solve dynamic problems.

Course Outline

1. Time and space complexities


2. Divide-and –conquer,
3. Dynamic programming
4. Greediness,
5. Branch and Bound
6. Backtracking
7. Probabilistic approaches

Textbook

Cormen, T. H., C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to algorithms (2 nd


ed) , MIT Press / McGraw-Hill, 2001.

References

45
Ammeraal, Leendert Programs and Data Structures in C (2nd ed.): John Wiley &
Sons,1988.

Reingold, Edward M and Wilfred J. Hansen (1983) Data Structures: CBS Publishers &
Distributors.

Sahni, Sartaj (1999) Data Structures, Algorithms and Applications in C++: McGraw-Hill.

Horowitz, Ellis, Sartaj Sahni and Dinesh Mehta (1995). Fundamentals of Data Structures
in C++: Computer Science Press.

Teaching Methods: Lecture and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Practical test (15%) and
Final Exams (50%)

Course Title: Software Project Management

46
Course No: COSC 352

Credit Hours: 4

Contact Hours: 4

Laboratory: Not Required

Prerequisite: COSC 223, COSC331

Course Description:

This course deals with the key concept required in the planning, monitoring, evaluation, and
control of software development projects. It explores the essence of software processes, methods
tools and related techniques that are important in software project management activities. This
course also focuses on the principles and standards related to software project metrics, risk
analysis and management, project scheduling and tracking, and software quality assurance
activities.

Course Objectives:

After a successful completion of this course, students will able to:

 Distinguish between software and other types of development projects


 Understand problems of software project management
 Describe the need for careful planning and controlling
 Approach project planning in an organized step-by –step manner
 Carry out evaluation and selection of projects against strategic, technical and
economical measures
 Identify, analyze and evaluate common risks encountered in software projects
 Understand techniques of project analysis and project planning
 Identify the techniques of software estimation
 Outline the methods of measuring important project parameters
 Monitor the quality of the methodologies used in software development project

Course Outline:

1. The product and the process


2. Software project management concept
3. Software process and project Metrics
4. Software project planning
5. Risk Analysis and Management
6. Project scheduling and Tracking
7. Software Quality Assurance

47
8. Software Configuration Management
Textbook

Pressman, Roger S., Software Engineering, 5th ed., 2002

References

Bob Hughes, & Mike Cotterell.. Software project Management, 2nd ed., 1999

Hoffer J. A, et.al, Modern System Analysis and Design, Prentice Hall, USA,2002

Teaching Methods: Lecture, Discussion and case studies.

Evaluation Methods: Theoretical Tests (15%), Assignment (10%), Project work (20%) and
Final Exams (50%)

Course Title: Principles of Compiler Design

48
Course No: COSC 312

Credit Hours: 4

Contact Hours: 4 (2 Lecture hrs and 2lab hrs)

Laboratory: Required

Prerequisite: COSC 222

Course Description

The course covers the design and implementation of programming language translators. the
theoretical aspects of language design and translation of high level language programs are
discussed and practically demonstrated by developing a working compiler.

Course Objectives

After a successful completion of this course, Students will be able to:

 Understand the phases of the compilation process and be able to describe the purpose
and implementation of each phase.
 Explore the theoretical computer science concepts including languages, grammars, and
machines
 Exercise and reinforce prior programming knowledge with a non-trivial programming
project to construct a compiler.
 Demonstrate lexical analysis, parsing , and intermediate code-generation

Course Outline

1. Lexical analysis
2. symbol tables
3. Regular expressions
4. Finite state automata
5. Grammars
6. Parsing: top down parsing , bottom up
7. Intermediate code generation
8. Code optimization
9. Assembly code generation

Textbook

49
Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman, Compilers: Principles, techniques and
tools, USA, Addison Wesley Publishing , 1986

References

Gries, David , Compiler construction for digital computers, USA, John Wiley, 1971.

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Practical test (15%) and
Final Exams (50%)

Course Title: Windows Programming

50
Course No: COSC 322

Credit Hours: 4

Contact Hours: 4 (2 Lecture hrs and 2 lab hrs)

Laboratory: Required

Prerequisite: COSC 226

Course Description

This course introduces the syntax and semantics of visual programming paradigm. The
fundamental concepts necessary for accessing the database like ODBC will be covered.

Students will be able to manipulate and appreciate the data access features of visual basic like
ADO’S, RDO’S data reports.

Course Objectives

After a successful completion of this course, students will be able to

 Understand and develop components for Graphical User Interface(GUI) for developing
windows application
 Understand the component based on the COM,DCOM and NET architecture
 Develop client/server applications with separate client and server components
 Integrate applications with software tools like database servers
 Understand and develop Active X servers and controls

Course Outline

Introduction to application development using Visual Basic

1. Visual Basic fundamentals

2. Working with codes and forms

3. Variables and procedures

4. Controlling program execution

5. Debugging

6. Working with Controls

7. Data Access using the ADO data Control

8. Input validation

51
9. Error Trapping

10. Drag and Drop

Text Book

Cornell, Gary , (1998)Visual Basic 6.0: From the Ground Up, The Mc Graw Hill
Companies, Inc., New York

References Books:

Sheriff, Paul D., Paul Sheriff (1999), Teaches Visual Basic 6.0 . Que publishing, Indiana,
USA,
Bradley, Julia Case, Millspaugh, Antita C., (1998), Programming in Visual Basic 5.0,
McGraw Hill Companies, Inc., USA,

Teaching Methods: Lecture and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Assignment (5%), Practical test (10%), Project
work (15%) and Final Exams (50%)

Course Title: Network Administration

52
Course No: COSC 481

Credit Hours: 4

Contact Hours: 4 (2 lecture hrs and 2 lab hrs)

Laboratory: Required

Prerequisite COSC 351, COSC 353

Course Description

This course introduces students to the concept of system support. It provides architecture based
platform independent discussion of administrative tasks with practical architecture examples
from the different platforms. The course covers a wide range of supporting tasks from personal
computer management to network administration. The course is intended to provide a scalable
and concrete background on system administration activities. It mainly concentrates on practical
sessions to demonstrate network tasks.

Course Objective

After a successful completion of this course, students will be able to:

 Support any system administrative tasks independent of platforms


 Troubleshoot and maintain system problems
 Create and administrative architecture for a network
 Install and monitor important services for large systems
 Understand and implement secured systems

Course Outline

1. Troubleshooting fundamentals
2. Building a fault tolerant system
3. Pc/Workstation support
4. Server Hard ware
5. Network operating systems
6. Network resources and services
7. Internetworking management
8. Addressing and Naming
9. DNS services
10. DHCP services
11. IP Routing configuration
12. Network security
Text Books

53
Limoncelli, Thomas A., Christina J. Hogan and Strata R. Chalup (2007). The Practice of
System and Network Administration, Second Edition, Addison-Wesley Professional

References

Nemeth, Evi, Garth Snyder, Scott Seebass and Trent Hein (2000) UNIX System
Administration Handbook (3rd Edition), Prentice Hall

Burgess, Mark (2004) Principles of Network and System Administration, Wiley

Morimoto, Rand, Michael Noel, Omar Droubi and Ross Mistry (2010). Windows Server
2008 R2 Unleashed, Sams

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project work (15%) and
Final Exam (50%)

Course Title: Introduction to Artificial Intelligence

54
Course No: COSC 313

Credit Hours: 4

Contact Hours: 4

Laboratory: Required

Prerequisite: COSC 361

Course Description

An overview of main concepts in artificial intelligence starting with the historical symbolic-
Logic-based approaches to knowledge representation, planning, reasoning and learning will be
covered. The course also touches on more recent developments in natural language processing,
visual processing, robotics, machine learning, and philosophical foundations.

Course Objectives

After a successful completion of this course, Students will be able to:

 Understand and represent the external constraints to think creatively.


 Program the knowledge based representation
 Perform various heuristic search techniques
 Solve probabilistic reasoning techniques

Course Outline

1. Introduction
2. Problem solving /searching
3. Breadth first. depth first search methods
4. Heuristic search techniques
5. AND,OR AND/OR graphs
6. Certain /Uncertain Knowledge and reasoning
7. Learning
8. Communicating and perceiving
9. Philosophical foundations.
Textbook

Stuart J. Russell and Peter Norvig, Artificial Intelligence: Modern Approach (2 nd edition),
USA, Prentice Hall, 2003

References

55
Philip C. Jackson, Introduction to Artificial Intelligence (2 nd edition), USA, Dover
Publications, 1985

Zurade M.Jack, Introduction to Artificial Neural Systems, India, Jaico Publishing House,
1994

Teaching Methods: Lecture, Discussion and case studies, Laboratory practical work and
Simulation

Evaluation Methods: Theoretical Tests (20%), Assignments (25%) and Final Exam (50%)

Course Title: Computer Graphics

56
Course No: COSC 461

Credit Hours: 4

Contact Hours: 4 (2 Lecture hrs and 2 lab hrs)

Laboratory: Required

Prerequisite: COSC 221

Course Description

This course will give students in-depth understanding of computer graphics fundamentals and
provide a thorough introduction to multimedia. Computer graphics takes a strong computational
view of graphics. Students will investigate a spectrum of algorithms, beginning with those
underlying primitive graphical functions in computer graphics packages and advancing to
algorithms that create objects with sophisticated appearance.

Course Objectives

After s Successful completion of this course, students will be able to:

 Understand the concepts of computer graphics and its applications


 Differentiate graphics input and output dev9ices
 Write algorithms for different drawing objects
 Implement the graphics algorithms using high level languages
 Animate graphics objects
 Perform vector drawing in two-dimensional (2D) plane and three-dimensional (3D) space
animation

Course Outline

1. Introduction to graphics applications


2. Line drawing algorithms-DDA, Bresenham’s
3. Circle drawing algorithms-Midpoint. Bresenham’s
4. Polygon drawing algorithms
5. 2D- Transformations
6. 2D- Viewing and Clipping
7. 3D-Transormation
8. 3D-Viewing and Clipping
9. Parallel and perspective projections
10. Introduction to parametric Curves and Surfaces.
11. Animation- Techniques

Textbooks

57
Shirely, Peter. Fundamentals of Computer Graphics. 2009..

References

V.K. Pachghare, Comprehensive Computer Graphics, New Delhi,

S. Harrington, Computer Graphics A programming Approach, McGraw – Hill

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project work (15%) and
Final Exam (50%)

Course Title: Project I

Course No: COSC 491

58
Credit Hours: 3

Contact Hours: 3

Laboratory: Not Required

Prerequisite: COSC 352

Course Description

This is final year course where students apply the concepts they learn in different courses. The
first phase of student’s project will be handled. This covers project proposal document
preparation, project management concepts and requirement analysis concepts.

At the end of this course students should submit their final phase one document of their project
which will be taken as input for the second phase that focus on the design and programming part.

Course Title: Project II

Course No: COSC 492

59
Credit Hours: 3

Contact Hours: 3

Laboratory: Not Required

Prerequisite: COSC 322, COSC 491, COSC 224

Course Description

This course is extension of the course project I. The final out puts of the course project I will be
taken as input for this course. The second phase of students project work will focus on the
design, implementation and testing phases of software development life cycle. At the end of the
course students should demonstrate the software or Information System they develop and defend
their project work.

ELECTIVE COURSE

COURSE DESCRIPTION

60
Course Title: Wireless Networking and Communication

Course No.: COSC 465

Credit hour: 4

Contact hour: 4 (2 hrs Lecture and 2 hrs Lab)

Prerequisite: COSC 481

Laboratory: Required

Course Description

This course provides an overview on wireless networking fundamentals and principles. The
course teaches different protocols and generations of wireless communication. It enables the
students to appreciate the difference between wired and wireless technologies.

Course Objectives

After s Successful completion of this course, students will be able to:

 Understand basic concepts and principles about wireless network and communication.
 Be familiar with the generation of wireless network
 Understand mobile telecommunication

Course Outline

1. Fundamentals of wireless Networking


2. Difference between wireless and fixed telephone network
3. Generation of wireless network
4. Multiple access schemes: FDMA, TDMA, CDMA
5. Protocols for network access
6. Universal mobile telecommunication systems
7. Introduction to wireless security

Text book

Christopher Anderson, GPRS and 3GWireless Applications: Professional Developer's


Guide, April 2001

Reference

JahanzebKhan, , Building Secure Wireless Networks with 802.11, January 2003

61
T. S. Rappaport, Wireless Communications: Principles & Practice (2nd ed), USA,
Prentice-Hall: Upper Saddle River, 2002,

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project work (15%) and
Final Exam (50%)

Course Title: Computer System Security

Course No.: COSC 462

62
Credit hour: 3

Contact hour: 3 (2 lecture Hr + 1 Lab Hr)

Prerequisite: NA

Laboratory: Required

Course Description

This course will cover conceptual and technological aspects of network security for voice and
data networks. The course provides an overview of cryptography, authentication systems,
authentication of people, Standards (Kerberos V4, V5), electronic mail security, firewalls,
operating system security and Web security.

Course Objective

After completing this course, the student will be able to:

 Explain major components of network security for voice and data networks;
 Understand the hardware and software technology required to implement effective
network security;
 Understand the underlying protocols with security policy implementation on both
Windows and UNIX;
 Describe the important elements of firewall construction and implementation;
 Understand how to develop and implement an effective virus protection.

Course Outline

1. Importance of security for computer system


2. Network security concepts and mechanisms
3. Encryption technique
4. Over view of cryptography
5. Web security
6. Security: current issues & trends

Text book:

William Stallings, Cryptography and Network Security principles and practices 3 rd


edition,

Reference books:

63
Rick Lehtinen and G.T. Gangemi, Computer Security Basics ( 2nd ed), USA, O'Reilly
Media, Inc.; 2006

David Salomon, Foundations of Computer Security, Springer, 2005

William Stallings and Lawrie Brown Computer Security: Principles and Practice, USA,
Prentice Hall Inc., 2007

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (20%), Assignment (25%) and Final Exam (50%)

Course Title: Structural Systems Analysis and Design

64
Course No: Cosc 423

Credit Hours: 4

Contact Hours: 4

Laboratory: Not Required

Prerequisite: NA

Course Description

This course introduces the students to development of a compressive system specification. The
students are expected to go through a mini-project that will enable them how to plan, analyze,
Organize, Design and develop a solution for a given system problem. They will also get
acquainted with the investigation techniques, analysis models and specification tools.

Course Objectives

After a successful completion of this course, student will be able to

 Understand the system development life cycle paradigm


 Apply the activities and processes of system development strategies
 Be competent in using traditional analysis and design techniques , such as logical and
physical data –flows and data models
 Internalize the fundamentals conventional analysis and design concepts
 Develop and demonstrate system prototypes of real-world business problems

Course Outline

1. Introduction- System and system Development


2. Role of the system Analyst and /designer
3. Information system projects
4. problem Analysis
5. System Requirement Specification
6. System Modeling d
7. System Design Specification
8. System Implementation

Text Books

Bentley, Lonnie & Whitten Jeffery, (2002), System Analysis and Design Methods,
McGraw Hill Companies, Inc., USA, 2002

Reference

65
Hoffer J. A, et.al,Modern System Analysis and Design, Prentice Hall, USA, 2002

Fertuck,Len, System Analysis and Design with Modern Methods,WM.C.Brown


Communication inc., USA

Teaching Methods: Lecture, Discussion and case studies

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project work (15%) and
Final Exam (50%)

Course Title: E-Commerce

66
Course No: COSC 431

Credit Hours: 3

Contact Hours: 3 (2 Lecture hrs and 1 lab hrs)

Laboratory: Required

Prerequisite: COSC 230

Course Description

This course covers the principles of E-Commerce combined with the basics of how to set up and
conduct E- Business, Company website design and implementation, Application of Internet
service provider (ISP) for different service like encryption, security, credit card transaction
capabilities will be covered.

Course Objectives

After a successful completion of this course, students will be able to:

 Understand the terminology and principles of E-Commerce


 Distinguish between global Vs, local reach of E- Business
 Internalize the different types of E-business
 Identify current and emerging E-business technologies and principles
 Exercise security and credit card processing principles
 Develop and implement E-Business services

Course Outline

1. The basics of Ecommerce


2. Ecommerce Business Models and Concepts
3. The Internet and world wide web: E-commerce infrastructure
4. Building An E-commerce website
5. Security and Encryption
6. E-commerce payment systems
7. E-commerce Marketing Concepts
8. Ethical ,Social and Political issues in E-commerce

Text book

Kenneth C.Laudon & Carol G.Traver..E-commerce: Business, Technology and Society,


2002

Reference:

67
Robert C.Elsenpeter & Toby J. Velte. E-business: Beginner’s Guide, 2001

Gary Schneider, Electrionic Cokmmerce( 3rd Ed)

Teaching Methods: Lecture, and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Assignment (10%), Project work (20%) and
Final Exam (50%)

Course Title: Expert Systems


Course No: COSC 453

68
Credit Hour: 3
Contact Hour: 3
Laboratory: Required
Prerequisite: COSC 313

Course Description:
The course teaches one of the information systems that uses artificial intelligence as its main
foundation. It builds the students knowledge in the area of intelligent systems and how these
systems created.

Course Objective:
After a successful completion of this course, students will be able to:

 Understand the main concept about expert systems.


 Understand the need for using expert systems.
 Understand the difference between knowledge base systems and other types of systems
 Use expert system development tools

Course Outline

1. Brief history of expert systems;


2. Why expert systems? Economic reasons, time, space, consistency and quality in
decision-making,
3. Intellectual reasons, human cognitive shortcomings.
4. Pure reasoning systems versus knowledge-rich systems.
5. Knowledge acquisition: meaning, purpose, and techniques.
6. Knowledge representation: frames, rules, classes and procedures.
7. An introduction to expert system development tools and shells.
8. Inference methods: foreword and backward chaining, depth/ breadth approaches,
rule selection strategies.
9. Explanation: how/ why, symbolic and non-symbolic systems,
probability/certainty factor, statistical systems, neural nets, case based
reasoning.

Text Book

69
Joseph C. Giarratano and Gary D. Riley, Expert Systems: Principles and
Programming (4th edition), USA, Course Technology, 2004

References:
Peter Jackson, Introduction to Expert Systems (3rd Edition), USA, Addison Wesley,
1998

John Durkin, Expert Systems: Design and Development, USA, Prentice Hall, 1994.

Sholom M. Weiss and Casimir A. Kulikowski , A Practical Guide to Designing


Expert Systems USA, Rowman & Littlefield Pub Inc , March 1984

Teaching Methods: Lecture and Laboratory practical work

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project work (15%) and
Final Exam (50%)

Course Title: Assembly Language Programming

70
Course No: COSC 441

Credit Hours: 3

Contact Hours: 3

Laboratory: Required

Prerequisite: COSC 241

Course Description

This course provides students with the necessary skills for programming in Assembly language.

Course Objective
After successful completion of the course the students will be able to:
 Understand structure of assembly programming
 Understand and effectively use assembly instruction

Course Outline
1. Overview of registers and memory organization
2. Assembly program structure
3. Variable declaration and memory allocation
4. data movement, arithmetic, comparison, flow control;
5. Stack operation and interrupts;
6. Memory referencing techniques;
7. Modular programming;
8. File processing;

Textbook

Richard Trooper, Assembly Language Programming the IBM PC, McGraw Hill, 1994.

References

Kip Irvine, Assembly Language for Intel-Based Computers (5th ed), Prentice Hall, 2006

Teaching Methods: Lecture and Laboratory practical work

Evaluation Methods: Theoretical Tests (25%), Assignment (20%) and Final Exam (50%)

Course Title: Information Storage & Retrieval

71
Course No: COSC 463

Credit Hours: 4

Contact Hours: 4 (2 lecture hr and 2 lab hr)

Laboratory: Required

Prerequisite: COSC 222

Course Description:

Introduction to Information Storage and Retrieval (Definition, components, kinds of Information


Retrieval Systems, the retrieval process etc.); automatic text operation and automatic indexing
(term selection, term weighting, etc); data and file structure for information retrieval ( flat files,
inverted files, signature files, PAT trees, and graphs), Retrieval Model (Boolean Model, Vector
Based Retrieval Model, Probabilistic Retrieval Model); Evaluation of Information retrieval
systems (Precision Recall, fallout, generality, E-measure, harmonic mean, User based evaluation
etc.), Techniques for enhancing retrieval effectiveness(including relevance feedback, query
reformulation, thesauri etc), query languages, query operations, string manipulation and search
algorithms, document classification and clustering; Current Issues in IR etc.

Course Objectives:

At the end of the course the students will be able to:

 To familiarize students with the basic theories and principles of information storage and
retrieval (ISR);
 To familiarize students with common problems and approaches to their solutions in
setting up, operating, using, and maintaining information storage and retrieval (ISR)
systems; and
 To introduce modern concepts to information retrieval systems.

Course Outline
1. Information storage and retrieval (evolution, functions, structure)
2. Classification and cataloguing (concepts, methods, standards)
3. Data structures and file structures
4. IR. Models (Boolean, vector space, probabilistic, AI Models)
5. Retrieval evaluation & measurement (relevance judgment, effectiveness, recall &
precision, test collection, TREC…)
6. Query Languages and query processing

72
7. Retrieval Enhancement (recall and precision enhancing devices, thesaurus, feedback,
etc)
8. Automatic Indexing and Conflation techniques
9. Current trends and developments (Hypertext & Hypermedia, Multimedia IR, Digital
Libraries, Intelligent Retrieval systems,)

Text Book
Slaton G. and Michael J. McGill, Introduction to Modern information Retrieval,
USA, McGraw Hill Inc. 1983

References
Robert Korfhage, Information Storage and Retrieval. John Wiley & Sons, Inc.,1997

David A. Grossman and Ophir Frieder, Information Retrieval: Algorithms and Heuristics(
2nd ed), 2004

Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze, Introduction to


Information Retrieval , USA, Cambridge University Press, 2008

G.G. Chowdhury , Introduction to Modern Information Retrieval, London., Library


Association Publication, 1990

Charles T. Meadow), Text Information Retrieval Systems.2nd ed. USA, Academic Press.,
(2000)

Software Requirements: High level language compiler, Text retrieval software: WIN-
ISIS

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project work (15%) and
Final Exam (50%)

73
Course Title: Simulation & Modeling

Course No: COSC 452

Credit Hours: 3

Contact Hours: 3 (2 lecture hr and 1 lab hr)

Laboratory: Required

Prerequisite: COSC 221, Stat 192

Description:
The course presents general idea of modeling and simulation. It gives basic introduction to
Modeling and Simulation and introduce concepts like Model Syntax and Semantics, System
Specification Hierarchy, Model Classification, State Automata and Petri Nets, Higraphs and
State charts, Pseudo-random generators, input/output analysis, Discrete Event World Views,
Process Interaction, Discrete Event System Specification(DEVS),Animation of simulation
results, Continuous-time models, solvers, sorting, Population Dynamics, System Dynamics,
Object-oriented Modeling of Physical Systems

Course Content

1. Introduction to Modeling and simulation


2. Generation of Random Variables
3. Uniform Random Generators,
4. Testing of Uniform Random Generators,
5. Methods of Generating Non-Uniform Variables:
6. Generation of Multivariate
7. Queuing Systems
8. Markov Chains
9. Analysis of simulation Output
10. Simulation Languages
11. Object-oriented Modeling of Physical Systems

Textbook

Banks J, Carson S. Johnson and Nelson L Barry, Discrete event System Simulation,
India, Prentice Hall of India , 1996

Reference

Bernard P. Zeigler, Herbert Praehofer, and Tag Gon Kim, Theory of Modeling and
Simulation ( 2nd edition ),USA, Academic Press, 2000.

74
Paul A. Fishwick, Simulation Model Design and Execution, USA, Prentice Hall, 1995

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Assignment (15%), Project work (15%) and
Final Exam (50%)

75
Course Title: Multimedia Systems

Course No: COSC 467

Credit Hours: 3

Contact Hours: 3 (1 lecture hr and 2 lab hr)

Laboratory: Required

Prerequisite: COSC 461

Description:
This course teaches principles and current technologies of multimedia system. The course
contains basic concepts like: multimedia technologies, multimedia storage models and structures,
data models and interfaces, multimedia information systems, etc

Course Objectives:

After successful completion of the course the students are able to:
 Understand the basic concepts of multimedia
 Understand where and how to use multimedia systems
 Design different kinds of multimedia systems
 Write different kinds of code that are used in Multimedia Applications
 Perform multimedia functions

Course Outline

1. Introduction to multimedia and multimedia systems


2. Multimedia Authoring and Tools
3. Graphics/Image Data Representation
4. Basics of Digital Audio
5. Lossless Compression Algorithms
6. Compression Standards and Algorithms
7. Basic Video Compression Techniques
8. Multimedia information retrieval

Text book

Ze Nian Li and M. S. Drew, Fundamentals of Multimedia, Prentice Hall, 2004.

Reference

K.R. Rao, Zoran S. Bojkovic, Dragorad A. Milovanovic; Multimedia Communication


Systems; Prentice Hall, 2002.

76
Issac V. Kerlow, The Art of 3D Computer Animation and Effects(3rd ed). Wiley, 2004.

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (10%), Assignment (10%), Project work (25%) and
Final Exam (50%)

77
Course Title: UNIX Operating System

Course No: COSC455

Credit Hours: 3

Contact Hours: 3

Laboratory: Required

Prerequisite: COSC 351

Course Description

The UNIX operating system for control of multi-user computer networks is studied. Students
learn to use UNIX commands to control automated office hardware functions. Students will
learn to apply the UNIX system to tie mixed brands and types of computers together. They learn
to use UNIX data communications group commands for user communications.

Course Objective

At the end of this course the students will be:

 Familiar with the concepts, design, and structure of the UNIX operating system.
 Able to use the basic UNIX Utilities.
 Able to understand the principles of UNIX shell programming.
 Able to understand the file system and security features in UNIX

Course Outline

1. Overview, History, and UNIX Shells


2. Utilities and Electronic Mail

3. Files and File Systems

4. File Security

5. File Processing

6. Redirection and Piping

7. Processes and Networks

8. Bourne Shell Programming

78
9. Advanced Bourne Shell Programming

10. C Shell Programming

Textbook

Sarwar, Koretsky and Sarwar, UNIX: The Textbook , Second Edition, Addison-Wesley,
2004.

References:

Bach, http://www.amazon.com/Design-Operating-System-Prentice-Hall-Software/dp/
0132017997/ref=sr_1_1?s=books&ie=UTF8&qid=1317024990&sr=1-1 Maurice J., The
Design of the UNIX Operating System, 1st edition, Prentice Hall, 1986

Kerrisk, Michael, The Linux Programming Interface: A Linux and UNIX System
Programming Handbook, 1st ed, No Starch Press, 2010

Kochan, Stephen G. http://www.amazon.com/Unix-Shell-Programming-Stephen-


Kochan/dp/0672324903/ref=sr_1_7?s=books&ie=UTF8&qid=1317025306&sr=1-7and
Patrick Wood, Unix Shell Programming , 3rd Edition, Sams, 2003

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Practical Tests (15%), Assignments (15%) and
Final Exam (50%)

79
Course Title: Formal Language Theory

Course No: COSC 469

Credit Hours: 3

Contact Hours: 3

Laboratory: Not Required

Prerequisite: COSC 222

Course Description

The course is primarily theoretical and is based heavily on mathematical notational systems.
Formal languages and the relation between certain classes of languages and classes of automata
is one of the essential theoretical foundations of computer science. This has direct application,
not only to programming languages, but to the art of programming itself. The central theme is the
discussion of four classes of language models and generative and analytical mechanisms for
those classes.

Course Objectives

 Understand The Difference Between Natural And Formal Language


 Understand Regular Expressions ,Grammar, And Language
 Understand Finite State Automata
 Identify Dfsa And Nfsa
 Understand Context Free Grammar
 Know How To Parse Arithmetic Expression

Course Outline

1. Basic concepts about formal language


2. Introduction to Grammar
3. Regular language
4. Types and characteristics of automata

80
5. Context free languages
6. Push dawn automat

Textbook

Peter Linz, An Introduction to Formal language Automata, D.C. Heath, 1990.

References:

K.L.P Mishra, Theory of Computer Science, PHI, 2003.

John C.Martin, Introduction to Languages and the Theory of Computation, Tata McGraw
Hill, 2004

Teaching Methods: Lecture and Discussion

Evaluation Methods: Theoretical Tests (25%), Assignments (20%) and Final Exam (50%)

81
SUPPORTIVE COURSES DESCRIPTION

Course Title: Linear Algebra

Course No: MaEd161

Credit Hours: 4

Contact Hours: 4

Laboratory: Not Required

Prerequisite: NA

Course Description

This course is one of mathematics courses that should be given to computer science majoring
students in order to help them have better understanding of concepts where linear algebra is
applied. Topics include systems of linear equations and their solutions, matrices and matrix
algebra, inverse matrices; the algebra of matrices, different types of matrices, square, identity,
triangular, symmetric and skew symmetric matrices, elementary row (column) operations,
inverse of a matrix using row operations, definition of point in n-space, lines and planes, cross
product, vector space axioms, linear dependence and independence of vectors, bases and
dimension of a vector space, sum and direct sum, definition of Linear transformation, the rank-
nullity theorem, the algebra of Linear transformation, matrix representation of linear
transformation, Cramer’s rule, inverse of matrix, the rank of a matrix, determinants as area and
volume, polynomial of matrices and linear Maps, Eigen values and Eigenvectors and the
Characteristic Polynomial.

Course Objectives

At the end of the course, the student will be able to:

 Describe matrices, vector and vector space.


 Differentiate linearly dependent and linearly independent vectors.
 Define linear transformation.

82
 Develop techniques of solving system of linear equation.
 Compute matrix representation of a linear transformation and vice versa.
 Compute the magnitude of a square matrix.
 Identify the magnitude of a square matrix.

Course Outline

1. Matrices
2. Vectors
3. Vector Spaces
4. Linear Transformations
5. Determinants
6. Eigen Values and Eigenvectors

Text Book

Kolman, Bernard and David R. Hill, Introductory Linear Algebra, an Applied First
Course, 8th edition, Prentice-Hall, 2005.

Reference

Carter, Tamara Anthony, Richard A. Tapia, and Anne Papakonstantinou, Linear Algebra:
An Introduction to Linear Algebra for Pre-Calculus Students, Rice University.

Teaching Methods: Lecture and tutorial

Evaluation Methods: Theoretical Tests (25%), Assignments (20%) and Final Exam (50%)

83
Course Title: Calculus I

Course No: Math161

Credit Hours: 4

Contact Hours: 5

Laboratory: Not Required

Prerequisite: NA

Course Description

This course teach students basic concepts related to general second degree equations, real
number system, functions, basic limit thermos, one side and infinite limits, definition of
continuity, intermediate value theorem and its application, definition and property of derivatives,
derivatives function, the chain rule, higher derivatives, application of derivatives and integral.

Course Objectives

At the end of the course student will be able to:

 Identify different types of conic sections.


 Express conics using equations.
 Transform from the standard position to any position.
 Understand the concept of limit both intuitively and formally
 Acquire basic concepts to limit and continuity
 Define derivatives
 Differentiate and integrate different types of functions.
 Apply to find maxima and minima and solve some optimization problems.

Course Outline

1. Analytic Geometry
2. The real number system and Function
3. Limits and Continuity

84
4. Derivatives
5. Application of derivatives
6. Integrals

Text Book

Abera Abay, An introduction to Analytic Geometry, AAU, 1998

Reference

Robert Ellis and Denny Gulick, Calculus with analytic geometry, 6th ed, Harcourt Brace
Jovanovich, Publishers, 5th ed, 1993.
Leithold, The calculus with analytic geometry, 3rd Edition, Herper & Row, publishers.

R. T. Smith and R. B. Minton, Calculus concepts and connections, McGram-Hill Book


Company, 2006

Teaching Methods: Lecture and tutorial

Evaluation Methods: Theoretical Tests (25%), Assignments (20%) and Final Exam (50%)

85
Course Title: Calculus II

Course No: Math162

Credit Hours: 4

Contact Hours: 5

Laboratory: Not Required

Prerequisite: Math122 & Math 161

Course Description

This course is the continuation of the course calculus I. It teaches to the students concepts related
to inverse function, techniques of integration, in determinates form, improper integrals and some
applications of integrals, and also sequence and series. The course focus on sequence and series
discussing topics sequences, convergence and divergence of sequence, bounded and monotonic
sequence, infinite series and power series.

Course Objectives

At the end of the course the student will be able to:

 Solve application problems of integration such as area, volume, arc length


 Identify different techniques of interaction.
 Find derivative of inverse function.
 Define sequence and series and determine whether a sequence is convergent or divergent.

Course Outline

1. Inverse function
2. Techniques of Integrations
3. Sequences
4. Convergence and Divergence of sequence
5. Infinite series
6. Power series

86
Text Book

Abera Abay, An introduction to Analytic Geometry, AAU, 1998

Reference

Robert Ellis and Denny Gulick, Calculus with analytic geometry, 6th ed, Harcourt Brace
Jovanovich, Publishers, 5th ed, 1993.
Leithold, The calculus with analytic geometry, 3rd Edition, Herper & Row, publishers.

R. T. Smith and R. B. Minton, Calculus concepts and connections, McGram-Hill Book


Company, 2006

Teaching Methods: Lecture and tutorial

Evaluation Methods: Theoretical Tests (25%), Assignments (20%) and Final Exam (50%)

87
Course Title: Introduction to Management

Course No: Mgmt 212

Credit Hours: 3

Contact Hours: 3

Laboratory: Not Required

Prerequisite: NA

Course Description

This course focuses on the basic concepts and principles of management, the functions of
planning, organizing, staffing, directing and controlling, and their relationships to key issues in
management practices, such as leadership and motivation. Decision making and effective
communication are also discussed.

Course Objectives

This course enables the students to:

 Define the term management, basic concepts and principles of management.


 Explain the general overview of management in relation to its importance, roles, skills
and universality
 Acquire sound understanding of the nature and practice of management.
 Develop a comprehensive understanding of basic concepts of management functions.

Course Outline

1. Fundamentals of Management
2. The Planning function
3. The Organizing function
4. Staffing an Organization
5. The Leading function
6. The Organizing function

88
Text Book

George R. Terry and Stephen G. Franklin, “Principles of management”, All India


Traveller book Sellen New Dethi, 1991.

Reference

Harold Koonz, Cyril o’Donnel and Heinz Weihrich, “Management”, McGraw Hill
International New york, 1980.

C.B Gubta, “Business Organization and Management”, Sultan chand & sons, new Delhi.

David R.Hampton, “contemporary management”, McGraw Hill Inc., New York, 1981.

Ernest Dale. “Management. Theory and Practices.” McGraw Hill Inc. New York, 1981.

Fred Luthans, “Introduction to Management, A Contingency Approach”, McGraw Hill


Book Company New york, 1973.

Henry sisik, “Management and Organization”, South Western publishing Co., Chicago,
1982.

Teaching Methods: Lecture, case study and discussion

Evaluation Methods: Theoretical Tests (25%), Assignments (20%) and Final Exam (50%)

Course Title: Basic Electricity and Electronics

89
Course No: COSC 141

Credit Hours: 3

Contact Hours: 4 ( 2 hrs Lecture & 2 hrs Lab)

Laboratory: Required

Prerequisite: NA

Course Description

This course provides a comprehensive introduction to Electricity and Electronics. It mainly


concentrates on circuit analysis techniques and simple passive networks. Further, it deals with
diodes and transistors as active devices. This comprehensive introduction serves to provide the
students with the requirements for the computer hard ware courses to follow. The course will be
supported by practical demonstrations with software simulations.

Course Objectives

After a successful completion of this course .Students will be able to:

 Understand the basic if voltage, current power and reference directions


 Write and solve equations to analyze resistor circuits
 Implement circuit applications of semiconductor diodes
 Understand the characteristics and operations of FETS and BJTs

Course Outline

1. Current , Voltage , reference , directions and power relations


2. Linear resistors and DC sources
3. Kirchoff’s voltage and current laws
4. Analysis of series , parallel and series- parallel resistor circuits
5. Mesh analysis
6. Putting linear circuit equations in matrix form.
7. Equivalent resistance. Thevenin , Norton, superposition and maximum power transfer
theorems
8. P-N Junction Diodes
9. Bipolar junction Transistors (BJTs )
10. Field effect transistors(FETs) Structure

90
11. Integrated Circuit chips

Textbook

Hughes, Edward, Hughes, Electrical and electronic Technology, 8 th Edition, Pearson


Education Limited, New Jersey, USA.2003

References:

Grob Bernard, Shultz, Mitchel E, Basic Electronics,9 th Edition, McGraw Hill


Companies, Inc., New York USA, 2003

Teaching Methods: Lecture, Laboratory practical work and Simulation

Evaluation Methods: Theoretical Tests (15%), Assignments (20%), and Final Exam (50%)

91
Course Title: Discrete Mathematics and Combinatory

Course No: COSC261

Credit Hours: 3

Contact Hours: 3

Laboratory: Not Required

Prerequisite: Stat192

Course Description

This course surveys diverse topics as the logical foundations of mathematics, number theory, and
combinatory and graph theory. This survey advances three goals. First, by introducing students
to a range of concepts, we begin the gradual, subconscious process of developing intuition about
these concepts. Second, these areas provide a setting in which students can learn to give rigorous
proofs. And third, these particular areas naturally lend themselves to the aesthetic qualities of
mathematics, and to the creative aspects of the mathematical process. Lectures will be centered
on number theoretic and combinatorial problems. These problems will motivate our exploration
of the techniques used in the class techniques such as modular arithmetic, mathematical
induction and combinatorial proofs. In addition to attending lectures, students will have the
opportunity to work in groups to solve problems in class.

Course Objectives

At the end of the course the student will be able to:

 Describe relationship b/n two or more sets


 Describe property and types of functions.
 Use the different rules of induction to proof advanced problems or identities.
 Calculate the shortest distance b/n two points and relate with real applications
 Count the number of possible outcomes of events

Course Outline

1. Rule of inference, proof and proof technique


2. Sets, relation and function
3. Number Theory

92
4. Induction and recursion
5. Counting
6. Probability
7. Graph Theory

Text Book

Rosen, Kenneth, Discrete Mathematics and Its Applications, 6th ed., McGraw-Hill
Science/Engineering/Math, 2006

Reference

Epp, Susanna S. , Discrete Mathematics with Applications; 4th ed, Brooks Cole, 2010
Rosen, Kenneth, Discrete Mathematics and Its Applications, 7 th edition, McGraw-Hill
Science/Engineering/Math, 2011

Teaching Methods: Lecture and tutorial

Evaluation Methods: Theoretical Tests (25%), Assignments (20%) and Final Exam (50%)

93
Course Title: Entrepreneurship and Small business

Course No: Mgmt 412

Credit Hours: 3

Contact Hours: 3

Laboratory: Not Required

Prerequisite: NA

Course Description

This interdisciplinary course is designed to introduce students to the concept of sustainable


entrepreneurship, a manageable process that can be applied across careers and work settings. It
focuses on building entrepreneurial attitudes and behaviors that will lead to creative solution
within community and organizational environments. Course topics include the history of
entrepreneurship, the role of entrepreneurs in the 21st century global economy, and the
identification of entrepreneurial opportunities. The elements of creative problem solving, the
development of a business concept/model, the examination of feasibility studies and the
social /moral/ethical implication of entrepreneurship will be incorporated. Issues related to
starting and financing new venture are included.

Course Objectives

At the end of this course students will be able to:

 Define entrepreneurship within the context of society; organizations and individuals.


 Understand more about the specific management issues involved in setting up and
running a small enterprise.
 Demonstrate an understanding of the impact of entrepreneurship on the economy.
 Distinguish between an entrepreneurial and a conventional approach to management.
 Recognize and overcome obstacles to creative problem-solving.
 Describe the element of an effective business model/plan.
 Develop a concept for an innovative product or service in his or her own area of interest.
 Recognize that entrepreneurial success in the 21st century depends on teamwork and
diversity.

94
 Develop a personal framework for managing the ethical dilemmas and social
responsibilities facing entrepreneurs.
 Describe the leadership studies of entrepreneurs who have been successful in different
sectors (e.g., start-ups, corporations. Community, public sector, etc.).
 Equipped with the basic knowledge and skills of starting and operating a business for
they will be the future managers (or even Owner-managers) of these firms.
 Identify traits/characteristics of an entrepreneur/ entrepreneurs as exhibited in behavior.

Course Outline

1. Entrepreneurship – Historical Background


2. The Entrepreneur’s Tasks, Roles, Skills and Characteristics
3. The Entrepreneurial Decision
4. The Entrepreneurial Process
5. Identifying Opportunities
6. Developing Business Plan
7. Product and Service Concept
8. Marketing and new venture development
9. Organizing and financing the new venture
10. Managing Growth and Transaction
11. Organizational Resources
12. Legal Issues, Risk and Insurance Management
13. Development of Entrepreneurship in Ethiopia

Text Book

Hodgetts, Richard M. Kurakto, Donald F. “Entrepreneurship: A contemporary approach


“. Fourth Edition, the Dryden Press, 1998.

Reference

Hirsh Robert D. and D. and Peters Michael P. “Entrepreneurship” Fifth Edition, Tata
McGraw Hill Edition, 2002.

Holt David H. “Entrepreneurship – New venture Creation “Eastern Economy Edition,


2000.

Donald F. Kutatko and Richard M. Hodgetts, “Entrepreneurship: A Cotemporary


Approach” Fourth Edition.

Teaching Methods: Lecture, case study and discussion

Evaluation Methods: Theoretical Tests (25%), Assignments (20%) and Final Exam (50%)

95
Course Title: Research Methods

Course No: Mgmt 332

Credit Hours: 3

Contact Hours: 3

Laboratory: Not Required

Prerequisite: NA

Course Description

This course is a survey course intended to develop the students’ ability in scientific analysis and
to provide opportunity for application of concepts and tools in the study of economic and social
problems. It also gives students a preliminary knowledge with the art of using different research
methods, techniques in solving research problems. Specifically, it covers scientific inquiry;
experimentation; survey; fact finding, design of questionnaire and interpretation of data; and
formulation of management research project by students.

Course Objectives

At the end of this course, students should be able to

 Understand the role of business research


 Differentiate the different types of research
 Identify and define research problem
 Design appropriate research design
 Know sampling design
 Differentiate types of data and instrument of data gathering methods
 Analyze and interpret data
 Prepare standard research project

Course Outline

1. Research Methods: An introduction


2. Defining Research Problem and Hypothesis Formulation

96
3. Research Proposal
4. Interpretation & reporting the research result
5. Sources and Methods of data collection
6. Sample Design and Procedure
7. Data analysis (an overview)
8. Research Design (planning of research project)

Text Book

Joseph Gibaldi (1995). MLA Handbook for Writers of Research Papers, forth edition. The
Modern Language Association of America, USA.

Reference

Babbie (1973). Survey Research Method. Wadsworth Publishing Company, Inc, USA.

Green E. D. S. Tull & Gerald Albaum (1998). Research for Marketing Decisions. Prentice -
Hall of India, Private Limited, New Delhi.

Hussey J & Hussey R (1997). Business Research, a practical guide for undergraduate and
postgraduate students Macmillan Press LTD, Great Britain.

Kenneth R. Hoover (1988). The Elements of Social Science Thinking (Fourth Edition). St.
Martin’s Press, New-York, USA

C.R. Kothari. (1990). Research Methodology, Methods & Techniques.

Lawrence F. Locke, Waneen Wyrick Spirduso & Stephen J. Silverman (1993). Proposal That
Work, A guide for Planning Dissertation and Grant, Sage Publications, Inc. Newbury Park,
California

Evaluation Methods: Theoretical Tests (25%), Assignments (20%) and Final Exam (50%)

Teaching Methods: Lecture, case study and discussion

97
GENERAL COURSES DESCRIPTION
Course Title: COMMUNICATION SKILLS

Course Number: ENLA 100

Credit Hours: 3

Contact Hours: 3

COURSE OBJECTIVES

This course is designed to help learners achieve the objectives below

 Understand the basic core of topics and communication functions in English


 Express themselves orally in various communication contexts
 Develop basic or functional writing skills
 Develop extensive and intensive reading skills
 Develop a variety of interesting learning strategies or experiences relevant to upper-
intermediate level

COURSE CONTENTS/COURSE OUTLINE

CHAPTER 1: ENGLISH AS A WORLD LANGUAGE

1.1. Reading

1.2. Vocabulary(parts of the body)

1.3. Listening(description of capital cities; artificial language)

1.4. Speaking (how do you learn languages?)

1.5. Writing exercise(correcting mistakes in writing)

1.6. Grammar review(tense)

CHAPTER 2: THE SEVEN AGES OF MAN

2.1. Reading

2.2. Vocabulary (guessing word meaning in context)

2.3. Listening (The audition)

98
2.4. Speaking (who should get the part)

2.4. Writing (word order)

2.5. Grammar review

CHAPTER 3: THE RIGHT JOB FOR YOU

3.1 Vocabulary (categorizing words)

3.2. Speaking (you have been made redundant)

3.3. Listening (an unusual job)

3.4. Writing (style of formal letters)

3.5. Grammar (gerunds)

CHAPTER 4: REINCARNATION

4.1. Reading

4.2. Vocabulary (guessing meaning; irregularities of English spelling)

4.3. Writing (text comparison)

4.4. Grammar review (question forms)

4.5. Listening (note-taking)

4.5. Speaking (females and phobias)

CHAPTER 5: THE NIGHTMARE SIDE OF INTERNATIONAL TRAVEL

5.1. Reading (reading for information)

5.2. Vocabulary (homonyms and homophones)

5.3. Speaking (discussion)

5.4. Listening (the adventures of a lorry driver)

5.5. Writing (conjunctions and prepositions of time)

5.6. Language review

CHAPTER 6: THE HEALTH HAZARDS OF A MODERN DAY LIFE

6.1. Reading

99
6.2. Vocabulary (the language of statistics)

6.3. Listening (holistic medicine)

6.4. Speaking (planning a menu)

6.5. Writing (formal and informal letters)

6.6. Controlled practice(expressing quantity)

MODES OF DELIVERY

The following modes of delivery are used in dealing with this course

 Brief lectures on essential items


 Individual assignments
 Group assignments/works
 Presentations by students
 Brainstorming
 Question and answer sessions, etc

EVALUATION MODALITIES

Student progress is evaluated continuously. To this end, the following modalities will be
employed:

 Quizzes
 Tests
 Assignments(classroom and home-take assignments)
 Presentations/public speaking
 Classroom active participation and attendance
 Final exam

REFERENCES

John,L Headway Upper-Intermediate (Text)

College English I(AAU, DEPARTMENT OF FOREIGN LANGUAGES AND


LITERATURE)

College English II(AAU, DEPARTMENT OF FOREIGN LANGUGES AND


LITERATURE)

Lary J.D.(1992) College 101: A Freshman Reader. New York

Helen , N and Stuart, H(1992) Paths to Proficiency. Longman

100
Werner, P.K.(1993) Compact Mosaic: A Communication-based Grammar. New York

Course Title: SOPHOMORE ENGLISH

Course Number: ENLA 201

Credit Hours: 3

Contact Hours: 4

COURSE OBJECTIVES

This course is designed to help learners achieve the objectives below

 Use mechanics(capitalization and punctuation marks correctly in writing


 Revise sentences for faulty writing
 Join sentences to achieve coherence
 Understand writing as a process
 Compose appropriate topic, supporting and concluding sentences
 Plan and write various kinds of paragraphs
 Plan and write various kinds of essays

COURSE CONTENTS/COURSE OUTLINE

CHAPTER 1: MECHANICS

1.1. Capitalization

1.2. Punctuation marks

CHAPTER 2: REVISNG AND JOINING SENTENCES

2.1. Revising sentences for faulty writing

2.2. Joining sentences

CHAPTER 3: THE PROCESS OF WRITING

3.1 The pre-writing stage

3.2. Writing the rough draft

3.3. Revising

CHAPTER 4: BASICS OF PARAGRAPH WRITING

101
4.1. What is a paragraph?

4.2. Paragraph structure

4.3. Writing topic sentences

4.4. Writing the body of your paragraph (supporting sentences)

4.5. Writing concluding sentences

CHAPTER 5: TYPES OF PARAGRAPHS

5.1. Descriptive paragraph

5.2. Narrative paragraph

5.3. Explanatory paragraph

5.4. Persuasive paragraph

CHAPTER 6: ESSAY WRITING

6.1. What is an essay?

6.2. Essay structure

6.3. Planning an essay

6.4. Types of essays (description, narration, exposition, persuasion)

MODES OF DELIVERY

The following modes of delivery are used in dealing with this course

 Brief lectures on essential items


 Individual assignments
 Group assignments/works
 Presentations by students
 Brainstorming
 Question and answer sessions, etc

EVALUATION MODALITIES

Student progress is evaluated continuously. To this end, the following modalities will be
employed:

 Quizzes
 Tests

102
 Assignments(classroom and home-take assignments)
 Presentations
 Classroom active participation and attendance
 Final exam

REFERENCES

McDougal Little.(1985) Building English Skills(Orange Level) (Text)

Heath Grammar and Composition (2nd Course)

Grammar and Composition (2nd Course)

Raghukui T.(1997) New Pattern English Grammar and Composition. New Delhi

Jordan, A.(1995) Academic Writing Course

Frank, S.(1994) Writing and Writer

Alamirew K(2010) Basic Writing Skills.(a compilation) Unity University

103
Course Title: Introduction to Statistics

Course Code: Stat 192

Credit Hours: 3

Contact Hours: 4

Pre-requisite: None

Course Description

Meaning of statistics; Methods of data collection; Methods of data presentation; Measures of


location; Measures of variation; Moments, skewness and kurtosis; Counting Techniques;
Concepts of Probability (classical approach); Probability distributions: Binomial, Poisson,
Normal, t and Chi-square; Sampling and Sampling Distribution of the mean and proportion;
Elementary description of the tools of statistical inference: Basic concepts; Estimation: (Point
and Interval) for the population mean and proportion; Hypothesis testing on the population mean
and proportion; Chi-square test of association. Each topic should begin with motivating
examples.

Course Objectives

 To introduce students the basic statistical knowledge on data collection and presentation
methods, Measures of Central Tendency and Variation, probability and probability
distributions, one sample inference, regression and correlation;
 Introduces the basic concepts of statistical thinking and reasoning;
 To enable students apply the methods of statistics in scientific research, decision making
and future career;
 To demonstrate the importance and practical usefulness of probability in real life;
 To show how probability is a necessary foundation for understanding statistics;
 To demonstrate the importance and usefulness of statistics in real life and on real data;
 To show how to present data informatively and clearly;
 To equip students to apply probability and statistical methods to solve standard problems
from a wide range of disciplines;
 To give students an appreciation of the limitations of these standard techniques;
 To enable students to communicate the results of their analyses in clear non-technical
language;

Learning Outcomes

104
At the end of the course students are expected to:

 Have a broad knowledge of the basic understanding of statistical techniques


demonstrated through principles of data collection, descriptive statistics, probability,
probability and sampling distributions, statistical inference and linear regression.
 Understand the methods of data collection, organization, presentation, analysis and
interpretation;
 Know what is meant by sample space, event, relative frequency, probability, conditional
probability, independence, random variable, probability distribution, probability density
function, expected value and variance;
 Be familiar with some standard discrete and continuous probability distributions;
 Be able to use standard statistical tables for the normal t, chi-square distributions;
 Be able to differentiate between common types of data, and display them appropriately;
 Learn some desirable properties of point estimators;
 Recognize the additional benefits of calculating interval estimates for unknown
parameters;
 Understand the framework of hypothesis testing for carrying out statistical inference;
 Be able to produce and interpret interval estimates and tests of hypotheses correctly in
some simple cases;
 Be able to present their results correctly and in non-technical language;
 Have basic skills in exploratory data analysis.

Course Outline

1. Introduction (3 lecture hours)


1.1 Definition and classification of Statistics
1.2 Stages in statistical investigation
1.3 Definition of Some Basic terms
1.4 Applications, uses and limitations of Statistics
1.5 Types of variables and measurement scales
2. Methods of Data Collection and Presentation (4 lecture hours)
2.1 Methods of data collection

2.1.1 Sources of data

2.1.2 Methods of collection

2.2 Methods of Data Presentation

2.2.1 Motivating examples

105
2.2.2 Frequency Distributions: qualitative, quantitative: absolute, relative and
Percentage.

2.2.3 Tabular presentation of data

2.2.4 Diagrammatic presentation of data: Bar charts, Pie-chart, Cartograms

2.2.5 Graphical presentation of data: Histogram, and Frequency Polygon

3. Measures of Central Tendency (5 lecture hours)


3.1 Motivating example
3.2 Objectives of measures of central tendency
3.3 Summation notation
3.4 Important Characteristics of a good average
3.5 Mean

3.4.1 Arithmetic Mean


3.4.2 Geometric Mean
3.4.3 Harmonic Mean
3.6 Median

3.7 Mode

4. Measures of variation (Dispersion), Skewness and Kurtosis (5 lecture hours)


4.1 Motivating examples
4.2 Objectives of measures of central tendency
4.3 Measures of Dispersion (Variation)
4.3.1 Range
4.3.2 Variance, Standard Deviation and coefficient of variation
4.3.3 Standard scores
4.4 Moments
4.5 Skewness
4.6 Kurtosis
5. Elementary Probability (5 lecture hours)
5.1 Introduction

106
5.2 Definition & some concepts (Experiment, sample, event, equally likely outcomes,
mutually exclusive events, independent events)
5.3 Random experiments
5.4 Counting rules: addition, multiplication rules, permutation and combination
5.5 Definitions of probability (probability of an event)
5.6 Some rules of probability
6. Probability Distributions (7 lecture hours)
6.1 Definition of random variables (discrete and continuous) and probability distributions
6.2 Introduction to expectation: mean and variance of random variable
6.3 Common discrete distributions: binomial and Poisson
6.4 Common continuous distributions: Normal, t, and chi-square distribution
7. Sampling and Sampling Distributions of the Mean (3 lecture hours)
7.1 Basic concepts (population, sample, parameter, statistic, sampling frame, Sampling
unit, sampling error, sample size)

7.2 Reasons for Sampling

7.3 Different types of Sampling (Probability vs Non probability Sampling

Techniques)

7.4 Simple random sampling (lottery method, table or computer generated random
numbers)
7.5 Sampling distribution of the sample mean and proportion
7.6 Central limit theorem
8. Estimation and Hypothesis Testing (10 lecture hours)
8.1 Estimation

8.1.1 Motivating examples

8.1.2 Point estimation: mean and proportion

8.1.3 Interval estimation: mean and proportion

8.2 Hypothesis Testing

8.2.1 Motivating examples

8.2.2 Important concepts in testing a statistical hypothesis

107
8.2.3 Steps in testing a hypothesis

8.2.4 Hypothesis testing about the population mean

8.2.5 Hypothesis testing about the population proportion

8.2.6 Chi-square test of association

9. Simple Linear Regression and Correlation (6 lecture hours)


9.1 Motivating examples

9.1 Introduction: regression and correlation

9.2 Simple Linear Regression

9.3 Correlation Coefficient

Textbook

Bluman, A.G. (1995). Elementary Statistics: A Step by Step Approach (2 nd edition). Wm.
C. Brown Communications, Inc.

References

1. Coolidge, F.L.(2006). Statistics: A Gentle Introduction (2nd edition).


2. David, S.M., McCabe, P. and Craig, B. (2008). Introduction to the Practice of Statistics
(6th edition). W.H. Freeman.
3. Eshetu Wencheko (2000). Introduction to Statistics. Addis Ababa University Press.
4. Freund, J.E and Simon, G.A. (1998). Modern Elementary Statistics (9th Edition).
5. Gupta, C.P.(). Introduction to Statistical Methods (9th Revised Edition).
6. Snedecor, G.W and Cochran, W.G. (1980). Statistical Methods (7th edition).
7. Spiegel, M.R. and Stephens, L.J. (2007). Schaum's Outline of Statistics, Schaum's
Outline Series (4th edition). McGraw-Hill.
8. Woodbury, G. (2001). Introduction to Statistics. Duxbury press.

Course Title: Civic and Ethical Education

108
Course Code: Phil. 103

Credit Hours: 3

Contact Hours: 3

Program: To all degree students

Course Description

This course is designed to be offered as a common course to all trainees in the degree program in
order to produce responsible, well-informed and competent citizens. The course encompasses
the basic concepts of civic and ethical education, state and government, the values and principles
of democracy, issues related to citizenship and patriotism, concepts of constitution and
constitutionalism, fundamental human rights and major issue of development, basic ideas of
international relations and contemporary issues.

Course Objective

At the end of the course the students will be able to:

 Explain the subject matter of civic and ethical education


 Develop professional ethics
 Appreciate the difference between state and government
 Practice the principles and values of democracy
 Understand the concept of citizen and citizenship
 Know the concept of constitution and constitutionalism
 Understand the principles of the Ethiopian constitution
 Explain the basic concepts and features of human rights
 Understand and analyze the concept of development, the theories of development
 Realize development policies and strategies of Ethiopia
 Know the concept of international relations
 Discuss the national interest and foreign policies of Ethiopia

Evaluation Modalities:
1. – Continuous Assessment ……………………………….. 50%
– Attendance …………………………………………….. 5%
– Reading Assignment ………………………………….. 5%
– Weekly Assignments …………………………………. 15%
– Monthly Tests ………………………………………… 15%
– Team Assignment …………………………………….. 5%
– Individual Assignment ………………………………... 5%
2. Final Examination ………………………………………… 50%

109
- Total …………………………………………………… 100%
Part One: Ethics Course Outline

Chapter One: Introduction to Ethics

1.1. Definition and subject matter of ethics


1.2. Classification of ethics
1.3. purpose of studying ethics
Chapter Two: Greek Classical Ethical Theory

2.1. Sophism (Thrasymachus and Protagaras)


2.2. Platonism (Socrates and Plato)
2.3. Aristotle (Doctrine of Mean)

Chapter Three: Teleological Ethical Theories

3.1. Hedonism

3.2. Egoistic Hedonism

3.3. Utilitarian Hedonism

Chapter Four: Deontological Ethical Theories

4.1. Divine Command theory

4.2. Categorical imperative

Chapter Five: Non-Normative Ethics

5.1. Scientific ethics

5.2. Meta-ethics

5.3. Ethical Naturalism

Part Two: Civics

Chapter Six: Introduction to Civics:

6.1. Definition and nature of civic education

6.2. Source of civic education

6.3. Purposes and goals of civic education

Chapter Seven: State, Government & Citizenship Definition & the concepts of state

110
7.1. Theories on the origin of stare

7.2. Structures and the state

7.3. Essential elements of the state

7.4. Essential organs of the government

7.5. Structures and functions of the government

7.6. Types and theories of the government

7.7. Origin and development of citizenship

Chapter Eight: Constitution

8.1. Meaning and essence of constitution

8.2. Origin and development of constitution

8.3. Function and classification of constitution

Chapter Nine: Democracy

9.1. Meaning and essence of democracy

9.2. Origin and development of democracy

9.3. Fundamental principles of modern democracy

Chapter Ten: Human Rights

10.1. Meaning and essence of human rights

10.2. Theories, origin and development of human rights

10.3. Basic features of human rights

Major References:

AAU (2005). Civic and Ethical Education, Compendium Part one. Addis Ababa: College
of Social Sciences.
AAU (2005). Civic and Ethical Education, Compendium (2005), Part two. Addis Ababa:
Collage of Social Sciences.
Miller, E.D.I (1984). Question that matter: an invitation to Philosophy.
FDRE (1995). The constitution of the Federal Democratic Republic of Ethiopia Addis
Ababa.

111
Vincent, B. (1980) Philosophy: a text with readings, chapter three ethics & chapter four,
Social Philosophy.

For Further Readings

George, D and Kalaer, H. (1993) an Introduction to Business Ethics.


Matt, C. etal. (1991). Challenges of Citizenship.
Palmer, D. (1996). Does the center hold? An introduction to Western Philosophy. (chapter
7, Ethics, chapter 8, Critique of Traditional Ethical Theories: chapter 9 Political and Social
Philosophy).
Boss, A. (1998), Boss (1998). Perspective on ethics. London: Mayfield Publishing.
Kassaye Amare (2001), Fundamentals of Civic and Ethical Education. Aurum, S. and
Popkin, H. (1961) introduction to philosophy (chapter 4 & chapter 5)

Course Title: Logic

112
Course Number: Phil. 101

Credit Hours: 3

Contact Hours: 3

Prerequisite: No

Program: Degree

Course Description

Logic as one of the disciplines of philosophy is concerned with the formulation of principles of
correct thinking. Since the times of Aristotle Logic has been recognized as fundamental
importance to all intellectual activity which aims at what is called truth. It is the arbiter of all
human reasoning. The dictum “Logic is the dispenser of hazy and confused thinking” indicates
the importance of a course in logic.

The course attempts to familiarize students with the topics: Basic concepts of logic, “Three laws
of thought” arguments and argument form, recognizing argument in passages, deductive and
inductive arguments, definition and the criteria for correct definition, formal and informal
fallacies, immediate and mediate inferences, the different types of syllogisms, etc.

Course Objectives

At the end of the course the students will be able to:

 Develop the skills needed to construct sound arguments of one’s and evaluate the
argument of others.
 Instill a sensitivity for the formal component in language, a through command of which is
indisputable to clear, effective and meaningful communication.
 Process the cultivation on the habits of correct reason /critical/ thinking.
 Make distinction between good and bad arguments and avoid fallacious reasoning; and
also expose students to different types of fallacy in such a way that they develop the habit
of thinking self-independently.

Evaluation Modalities

Evaluation Method

1. Attendance …………………………….. 5%
2. Class Participation …………………….. 5%
3. Tests …………………………………… 30%
4. Group Assignment …………………….. 10%
50%

113
Final Examination 50%

Total 100%

Chapter 1: Introduction

1.1. What is Logic and it’s subject matter and purposes


1.2. Fundamental laws of logic

Chapter 2: Basic Concepts of Logic

2.1 Meaning and elements of argument


2.2. Passages lacking inferential claim
2.3. Recognize arguments
2.4. Deductive and inductive argument
2.5. Recognize deductive and inductive argument
2.6. Validity and soundness
2.7. Strength and cogency
2.8. Test

Chapter 3: Language meaning and definition

3.1. Cognitive and emotive meanings


3.2. Intention terms
3.3. Extension of terms
3.4. Definition and their purpose
3.5. Definition techniques
3.6. Criteria for lexical definition
3.7. Test

Chapter 4: Informal Fallacies

4.1. What is fallacy: formal and informal

4.2. Fallacies of presumption

4.3. Begging the question and other fallacies

4.4. Fallacies of relevance

4.5. Red hearing and other

4.6. Grammatic analog fallacy of false dicotmy

4.7. Composition and division

114
4.8. Fallacies of ambiguity
4.9. Test

Chapter 5: Syllogism (Categorical /Aristotelian Logic)

5.1. Categorical proposition


5.2. Immediate inference
5.3. Attribution of categorical proposition
5.4. Terms and distribution Venn diagramme
5.5. Categorical syllogism
5.6. Mood, figure and forms
5.7. Syllogistic rules and fallacies
5.8. Test

Chapter 6: Propositional Logic

6.1. What is prepositional logic?


6.2. Prepositional connective
6.3. Truth function
6.4. Truth tables
6.5. Prepositional arguments
6.6. Rules of implication
6.7. Rules of equivalence
6.8. Test
6.9. Summary
Text(s)

1.Patrick J. Hurley: A concise introduction to logic

Reference /supporting materials

1. N.D Simico and G.G. James: Elementary Logic, 1983


2. Stephan: The Power of Logic, USA
 Categorical position
 Immediate inference
 Attribution of categorical proposition
 Terms and distribution Venn diagramme
 Categorical syllogism
 Mood, figure and forms
 Syllogistic rules and fallacies
 Test
Chapter 7

115
 What is prepositional logic?
 Prepositional connective
 Truth function
 Truth tables
 Prepositional arguments
 Rules of implication
 Rules of equivalence
 Test
 Summary
Text(S)

Patrick J. Hurley: A concise introduction to logic

Reference /supporting materials

N.D Simico and G.G. James: Elementary Logic, 1983

116

You might also like