cpit 240 database systems - homepage · pdf filefaculty of computing and information...

Faculty of Computing and Information Technology Department of Information Technology

King Abdul Aziz University Jeddah, Saudi Arabia

1

ABET

COURSE BINDER

CPIT 240

Database Systems

Prepared by

Dr. Mohammed J. Alhaddad

2010 (March)



2

TABLE OF CONTENT

Item Page Cover Page 1 Table of Content 2

DIVIDER 1: Course Design Data 5

Course Syllabus: 6 Course name and Description Course Learning outcomes Course Topics and their Duration & Class Schedule Course Contribution to Professionals Components Course Contribution to professional Component Course Relation to Program Outcomes

Course Calendar: 9 Teaching Schedule & Lab

Course Instructional Methods & Assessment Tools: 13 Lecture Homework Attendance Direct Assessment Method

Course Design: 15 Goals-Learning Objectives-Passing Criteria and

CLO-PO Mapping Matrix Course Learning Objectives –Program outcomes Matrix 17

Performance Targets Passing Criteria): Course Articulation Matrix for CPIT 240

Summary of direct & indirect assessment tools 23 Mapping of course learning objectives

into program outcomes Mapping of Direct Assessment Tools

into course Learning Objectives

DIVIDER 2: Course Assessment Data 30

Indirect Course Assessment Tools 31 Course Evaluation Survey CLOs Survey

Direct Assessment Tools 39 Quezz-1 Quezz-2 Mapping Quizzes questions to CLOs Mapping Exams questions to CLOs Exam Rubric



3

Mid-Exam Final-Exam

Result of Class Direct Assessment Tools. 71 Class Assessment of Course Learning Objective Class Assessment of Program Outcomes

Results of Class Indirect Assessment of Programs Outcomes 79 End of Semester CO Assessments Report 82 End of Semester Outcome Assessments Report 85

DIVIDER 3: Supported Program Outcomes "a" 87

Outcome Definition and Outcome Indicator. 88 Course Learning Objectives Addressing the Outcome 89 Outcome Survey 92 Outcome Assessment and Improvement Report 93 Student work Samples 95

DIVIDER 4: Supported Program Outcomes "b” 124


DIVIDER 5: Supported Program Outcomes "c” 132


DIVIDER 6: Supported Program Outcomes "i” 165


DIVIDER 7: Supported Program Outcomes "j” 208

Outcome Definition and Outcome Indicator. 209 Course Learning Objectives Addressing the Outcome 210 Outcome Survey 213 Outcome Assessment and Improvement Report 214



4

Student work Samples 216

DIVIDER 8: Supported Program Outcomes "k” 258


DIVIDER 9: Supported Program Outcomes "l” 297


DIVIDER 10: Supported Program Outcomes "m” 334


DIVIDER 11: Supported Program Outcomes "n” 348




5

DIVIDER 1

Course Design Data



6

1.1 Course Syllabus

Course: CPIT 240 Database Systems (3: 3, 1) – Required Core Course

Catalog Description: Data, Information, File System, Database and Database Users, Database System Concepts and Architecture, Data Modeling using the Entity Relationship (ER) Model, The Relational Data Model and Relational Database Constraints, Functional Dependencies and Normalization for Relational Databases, The Relational Algebra and Relational Calculus, Relational Database Design by ER and EER to Relational Mapping, Disk Storage, Basic File Structure and Hashing, SQL-99 Schema Definition, Constraints, Queries and Views (DDL and DML)

Course Prerequisites CPIT 204 Data Structures

Textbook: Fundamentals of Database Systems 5th Edition by Elmasri & Navathe.

References: 1- Database Systems a Practical Approach 4th Edition by Thomas M Connolly 2- An Introduction to Database Systems by C. J. Date

Course learning outcomes, By the completion of the course, the students should be able to:

1 Define a Database, characteristics and functions of Database Management System and types of Database Users

2 Distinguish between a Traditional File System and a Database System 3 Compare the advantages and disadvantages of Database System with traditional File

system 4 Describe Data Models, Schemas, Instances, Three Schema Architecture and DBMS

Component Modules 5 Describe the Entity–Relationship (ER) modeling tool using Unified Modeling Language

(UML). 6 Model the real world database systems using Entity Relationship Diagrams (ERD) from

the requirements specification. 7 Define the Relational Data Model, its Constraints and the Relational Database Schemas 8 State the Informal Design Guidelines for Relational Databases

9 Illustrate the Definition of Functional Dependencies , Inference Rules, Equivalence of Sets of Functional Dependencies FDs, Minimal Sets of FDs

10 List the three Normal Forms Based on Partial and Transitive Dependencies

11 Apply normalization techniques to normalize a database.



7

12 Identify the data integrity and security requirements of the database

13 Define the concept of Relational Algebra and the Relational Operations from Set Theory 14 Apply Binary Relational Operations and Additional Relational Operations on database 15 Design queries in Relational Algebra and Relational Calculus 16 Convert a conceptual data model such as ER diagram into a relational logical schema

using various mapping algorithms. 17 Define disk storage devices, files of records, unordered files, ordered files and hashed

files. 18 Apply various operations on Files such as hashing 19 List advantages of standardized SQL 20 Demonstrate the use of SQL for database creation and maintenance 21 Use SQL queries for data aggregation, calculations, views, sub-queries, embedded queries,

manipulation, and report generation. 22 Design and implement a full real size database system

Course Topics and their Duration:

Course Topics Duration in Weeks

1 Data, Information, File System, Database and Database Users

1

2 Database System Concepts and Architecture 1

3 Data Modeling using the Entity Relationship (ER) Model

1

4 The Relational Data Model and Relational Database Constraints

2

5 Functional Dependencies and Normalization for Relational Databases

3

6 The Relational Algebra and Relational Calculus 1

7 Relational Database Design by ER and EER to Relational Mapping

1

8 Disk Storage, Basic File Structure and Hashing (13.1 & 13.2)

1

9 SQL-99 Schema Definition, Constraints, Queries and Views (DDL and DML)

1

Class Schedule: Lecture: Three 50 minutes sessions per week



8

Labs: One 80 minutes session per week

Course Contribution to professional Component:

Database System: 2.5 Credit hours or 83.3% Database Design: 0.5 Credit hour or 16.7%

Course Relationship to Program Outcomes:

Program Outcomes

ABET Outcomes Program Criteria

a b c d e f g h i j k l m n

Highest Attainable Level of Learning

2 3 2 2 2 2 1

Prepared by: Dr. Mohammed J. Alhaddad Last Update: March 2011



9

1.2 Course Calendar Course: CPIT 240 Database Systems Fall 2010 Teaching Schedule & Lab:

Weeks Chapters

Week 1

Lectures: Chapter # 1 Data, Information, File System, Database and Database Users Lab 1 (Project): Classical Database Development Methodology (Page 1-6) Lab SQL: Objectives: At the end of this chapter students will be able to: Define Database, Database Management System, Discuss different types of Database Users, Compare the Advantages and Disadvantages of Database Approach, Differentiate between Traditional File System and Database Approach

Week 2 & 3

Lectures: Chapter # 2 Database System Concepts and Architecture Lab 2 (Project): Analysis (Page 7-14) Information Flow Diagram, Example, Specification Lab SQL: Installation of Oracle 10 g (Assignment 1 Marks 10) Objectives: At the end of this chapter students will be able to: Recognize Data Models, Schemas and Instances, Identify Three Schema Architecture, Identify DBMS Component Modules

Lectures: Chapter # 3 Data Modeling using the Entity Relationship (ER) Model Lab 3 (Project): Page (15-23) Entity Relationship Diagram, Example Lab SQL: Introduction to Oracle 10g Objectives: At the end of this chapter students will be able to: Use of Entity–Relationship (ER) modeling in database design. Basic concepts associated with ER model. Use if diagrammatic technique for displaying ER model using Unified

Modeling Language (UML). Can identify and resolve problems with ER models called connection

traps. Can build an ER model from a requirements specification.

Week 4 & 5

Lectures: Chapter # 5 The Relational Data Model and Relational Database Constraints Lab 4 (Project): Page (24-29) Designing of ER Diagram, Primary Key Constraint Lab 5 (Project): Conceptual Schema, Composite Key Constraint



10

(Assignment 2 Marks 05) Lab SQL: (Quiz 1 Marks 10) Objectives: At the end of this chapter students will be able to: Define Relational Model Concepts Describe Relational Model Constraints and Relational Database

Schemas Indicate Update Operations and Dealing with Constraint Violations

Week 6, 7 & 8

Week 7

Lectures: Chapter # 10 Functional Dependencies and Normalization for Relational Databases Lab 6 (Project): Page (30-32) Create Database Physically, Physical Schema, (Conceptual Schema Implementation) Lab 7 (Project): Page (33-36) Put Constraints Physically on Database Tables Lab 8 (Project): Page (37-39)Data Types, Specifying Constraints and Default Values Lab SQL: Introduction to SQL-PLUS

DROP Commands ALTER TABLE Command INSERT Command DELETE Command UPDATE Command (Assignment 3 Marks 05)

Objectives: At the end of this chapter students will be able to: State Informal Design Guidelines for Relational Databases Identify Functional Dependencies (FDs) Illustrate Definition, Inference Rules, Equivalence of Sets of FDs,

Minimal Sets of FDs Describe 3 Normal Forms Based on Partial and Transitive

Dependencies

Mid Exam

Week 9 & 10

Lectures: Chapter # 6 The Relational Algebra and Relational Calculus Lab 9 (Project): Page (40-43) Select statement, Aggregation Functions and Internal Schema Implantation Lab SQL: Objectives: At the end of this chapter students will be able to: Understand the concept of Relational Algebra: Define Unary Relational Operations Describe Relational Algebra Operations From Set Theory Describe the Binary Relational Operations and Additional Relational

Operations Examples of Queries in Relational Algebra and Relational Calculus

Lectures: Chapter # 7 Relational Database Design by ER and EER to



11

Relational Mapping Lab 10 (Project:) Page (44) Joining of Tables, Conditional Statements Lab SQL: The SELECT-FROM-WHERE Structure of SQL Queries Unspecified WHERE-Clause and Use of Asterisk (*) Tables as Sets in SQL Substring Comparisons, Arithmetic Operators, and Ordering (Assignment 4 Marks 05) (Quiz 2 Marks 10) Objectives: At the end of this chapter students will be able to: How to covert ER Diagram in to relational schema. What are the mapping algorithms for:

Step 1: Mapping of Regular Entity Types Step 2: Mapping of Weak Entity Types Step 3: Mapping of Binary 1:1 Relation Types Step 4: Mapping of Binary 1:N Relationship Types. Step 5: Mapping of Binary M:N Relationship Types. Step 6: Mapping of Multivalued attributes. Step 7: Mapping of N-ary Relationship Types.

Week 11

Lectures: Chapter # 13 Disk Storage, Basic File Structure and Hashing (13.1 & 13.2) Chapter # 14 Indexing Structures for Files (14.1, 14.2 & 14.3) Lab 11 (Project:) Page (45) Indexing in Oracle Lab SQL: Objectives: At the end of this chapter students will be able to:

Can Define Disk Storage Devices Can Describe the Files of Records, Operations on Files, Unordered

Files, Ordered Files, Hashed Files.

Week 12

Lectures: Chapter # 8 SQL-99 Schema Definition, Constraints, Queries and Views (DDL and DML) Lab 12 (Project:) Page (46) Performance function in Oracle Lab SQL: Objectives: At the end of this chapter students will be able to:

Discuss advantages of standardized SQL, Define a database using SQL data definition language Write single table queries using SQL Establish referential integrity using SQL Work with Views

Week 13 Lab 13 (Project:)



12

Lab SQL: Nested Queries and Set Comparisons Explicit Sets and NULLS in SQL Aggregate Functions and Grouping (Quiz 3 Marks 10) Final Exam



13

1.3 Course Instructional Methods and Assessment Tools

Course: CPIT 240 Database Systems Fall 2010

Course Instructional Methods: Instructional methods of the course include the following activities: a) Lecture (L):

Instructor will teach the topics of the course emphasizing on related course learning objectives (CLOs), while student will take notes and read in the text book.

Student learning outcomes will be measured by homework assignments, Midterm Exam, Lab exercises, lab project, and final exam

At the end of each chapter, students will have a quiz related to the topics of each chapter. These quizzes will fulfill some of the CLOs.

Student will be informed by the correct answers of taken exams to insure that the learning objectives are fulfilled.

Students will be divided into teams (3 to 4 students per team), each team will be asked to submit a report for lab project at a pre-announced time.

Students will take a mid-term exam at a pre-announced time. The exam will be discussed in class to high light on the common mistakes that have been appeared in the answer sheets

At the end of the semester there will be one major final exam that would cover all the main topics of the course

b) Labs (LA): During the Lab session, some difficult problems will be selected and solved by the

instructor. Students will be divided into teams. Each team will present the solution of some

homework problem. Instructor will guide the students during the lab session. c) Homework (HW):

Homework problems will be assigned at the end of each chapter. The model answer for each of the homework will be presented in lab session for the

students to check their answers with and to ensure that the learning objectives are fulfilled.

There are four homework distributed along the semester d) Attendance:

Regular attendance of the students will enhance their final grades. When the absence exceeds the 25 % limit (~ 10 sessions), a report will be send to the

Academic Affairs to take the necessary action. As a result, the student may get DN or AF in the course.



14

Direct Assessment Methods Student learning outcomes will be measured through the following direct assessment tools:

Quizzes: students will have two Quizzes in Lab during the semester. One Lab project: in the lab project, student will submit 3 phase of developing a

project. Exam: students will attend mid semester exam and at the end of the semester a final

exam. In the Lab, student will have at end of the project a final lab exam.

COURSE GRADED ASSESSMENT TOOLS

Name of the graded assessment tool

Contribution to course grade (out of 100)

(e.g. Quize, Lab,Project, Mid Term, Final Exam, etc)

Tool 1 Quizzes 1 5

Tool 2 Quizzes 2 5

Tool 3 Lab Exam 5

Tool 4 LAB Project 25

Tool 5 Mid Exam 20

Tool 6 Final Exam 40

Total 100



15

1.4 Course Design

Goals-Learning Objectives-Passing Criteria and CLO-PO Mapping Matrix Course: CPIT 240 Fall-2010 Course goals The course is intended to:

Expose the students to the introductory concepts of data modelling and database design principles. It focuses on the methods of building models and the entities relationships. It also focuses on understanding the databases decision models and data matching. The course covers the basic rules of Structured Query Language (SQL).

Course learning objectives Topic #1: Data, Information, File System, Database and Database Users


2 Distinguish between a Traditional File System and a Database System 3 Compare the advantages and disadvantages of Database System with traditional File

system Topic #2: Database System Concepts and Architecture

4 Describe Data Models, Schemas, Instances, Three Schema Architecture and DBMS Component Modules

Topic #3: Data modeling using the Entity Relationship (ER) Model

5 Describe the Entity–Relationship (ER) modeling tool using Unified Modeling Language (UML).

6 Model the real world database systems using Entity Relationship Diagrams (ERD) from the requirements specification.

Topic #4: The Relational Data Model and Relational Database Constraints

7 Define the Relational Data Model, its Constraints and the Relational Database Schemas

Topic #5: Functional Dependencies and Normalization for Relational Databases

8 State the Informal Design Guidelines for Relational Databases 9 Illustrate the Definition of Functional Dependencies , Inference Rules, Equivalence

of Sets of Functional Dependencies FDs, Minimal Sets of FDs 10 List the three Normal Forms Based on Partial and Transitive Dependencies 11 Apply normalization techniques to normalize a database.



16

12 Identify the data integrity and security requirements of the database Topic #6: The Relational Algebra and Relational Calculus

13 Define the concept of Relational Algebra and the Relational Operations from Set Theory

14 Apply Binary Relational Operations and Additional Relational Operations on database 15 Design queries in Relational Algebra and Relational Calculus

Topic #7: Relational Database Design by ER and EER to Relational Mapping

16 Convert a conceptual data model such as ER diagram into a relational logical schema using various mapping algorithms.

Topic #8: Disk Storage, Basic File Structure and Hashing (13.1 & 13.2)

17 Define disk storage devices, files of records, unordered files, ordered files and hashed files.

18 Apply various operations on Files such as hashing Topic #9: SQL-99 Schema Definition, Constraints, Queries and Views (DDL and DML)

19 List advantages of standardized SQL 20 Demonstrate the use of SQL for database creation and maintenance 21 Use SQL queries for data aggregation, calculations, views, sub-queries, embedded

queries, manipulation, and report generation. 22 Design and implement a full real size database system



17

1.5 Course Learning Objectives –Program outcomes Matrix

Mapping of course learning objectives into program outcomes

Course Learning Objectives CLO

Cover hours

Program Outcomes CLO Pass

Criteria


2 1 3 2 2 2 2 1 1


2 2 2 1 0.6

2 Distinguish between a Traditional File System and a Database System

2 2 1 0.6

3 Compare the advantages and disadvantages of Database System with traditional File system

1 2 0.6


4 2 0.6


2 1 2 0.6


2 2 2 2 1 0.6


7 2 2 1 0.6

8 State the Informal Design Guidelines for Relational Databases

2 2 1 1 1 0.6


3 2 0.6


3 1 0.6



18

11 Apply normalization techniques to normalize a database. 3 1 1 2 0.6


3 1 2 2 0.6


1 1 0.6

14 Apply Binary Relational Operations and Additional Relational Operations on dataase

2 1 1 0.6

15 Design queries in Relational Algebra and Relational Calculus

1 2 3 2 0.6


5 1 2 2 2 0.6


2 2 0.6

18 Apply various operations on Files such as hashing 3 1 2 0.6

19 List advantages of standardized SQL 3 1 1 0.6

20 Demonstrate the use of SQL for database creation and maintenance

3 1 2 2 0.6

21 Use SQL queries for data aggregation, calculations, views, sub-queries, embedded queries, manipulation, and report generation.

3 1 2 2 2 1 0.6

22 Design and implement a full real size database system

3 1 2 1 0.6



19

Performance Targets Passing Criteria):

Direct performance

Targets

1. 100 %of the class students score over 60% in each course learning objective and each supported program outcome

2. The class average is at least 60% in each course learning objective and each supported program outcome



20

Course Articulation Matrix for CPIT 240 Course Articulation Matrix

Course Number and Title Student Outcomes

In C

lass

A

ctiv

itie

s

Ou

t of

C

lass

A

ctiv

itie

s

Ass

essm

ent

Too

ls

CPIT 240 Database Systems

appl

y kn

owle

dge

of c

omp

uti

ng &

mat

hem

atic

s

anal

yze

a p

robl

em, i

den

tify

& d

efin

e c

ompu

ting

req

uire

men

ts

des

ign

, im

ple

men

t, &

eva

luat

e sy

stem

, pro

cess

, com

pon

ent,

or

pro

gram

func

tion

eff

ecti

vely

in t

eam

s

un

ders

tan

ding

of

pro

fess

iona

l, et

hic

al, l

egal

, sec

uri

ty a

nd

soc

ial i

ssue

s

com

mun

icat

e ef

fect

ivel

y w

ith

a r

ange

of

aud

ienc

es

loca

l & g

loba

l im

pact

of

com

puti

ng

on in

divi

dua

ls, o

rgan

izat

ions

, & s

ocie

ty

con

tin

uin

g p

rofe

ssio

nal

dev

elop

men

t

curr

ent

tech

niq

ues

, sk

ills

, an

d t

ools

nec

essa

ry f

or c

ompu

tin

g pr

acti

ce.

curr

ent

tech

nic

al c

once

pts

& p

ract

ices

in t

he c

ore

info

rmat

ion

tec

hno

logi

es

iden

tify

and

ana

lyze

use

r ne

eds

in t

he s

elec

tion

, cre

atio

n, e

valu

atio

n &

ad

min

istr

atio

n o

f co

mpu

ter‐

base

d s

yste

ms

effe

ctiv

ely

inte

grat

e IT‐b

ased

sol

utio

ns in

to t

he u

ser

envi

ron

men

t

un

ders

tand

ing

of b

est

prac

tice

s an

d s

tan

dard

s &

th

eir

app

licat

ion

assi

st in

the

cre

atio

n o

f an

eff

ecti

ve p

roje

ct p

lan

Lis

ten

to

brie

f le

ctu

res

qu

izze

s be

fore

cla

ss

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k o

n L

ab p

roje

cts

Su

mm

ariz

e te

xtbo

oks

Lab

Pro

ject

s

Hom

ewor

k a

ssig

nm

ents

Qu

izze

s

Mid

Ter

m E

xam

Hom

ewor

k A

ssig

nm

ents

Fin

al E

xam

.

Lab

Pro

ject

Lab

Exe

rcis

e re

port

s



21

By the completion of this course, the student should be able to:

Cov

er H

.



2 2 2 1 X X X X X X


2 2 1 X X X X X X


1 2 X X X X X X X


4 2 X X X X X X


2 1 2 X X X X X X X


2 2 2 2 1 X X X X X X


7 2 2 1 X X X X X X


2 2 1 1 1 X X X X X X

9

Illustrate the Definition of Functional Dependencies , Inference Rules, Equivalence of Sets of Functional Dependencies FDs, Minimal Sets of FDs

3 2 X X X X X X


3 1 X X X X X X X


3 1 1 2 X X X X X X X


3 1 2 2 X X X X X X


1 1 X X X X X X X



22

14 Apply Binary Relational Operations and Additional Relational Operations on database

2 1 1 X X X X X X


1 2 3 2 X X X X X X


5 1 2 2 2 X X X X X X X


2 2 X X X X X X X

18 Apply various operations on Files such as hashing

3 1 2 X X X X X X

19 List advantages of standardized SQL

3 1 1 X X X X X


3 1 2 2 X X X X X


3 1 2 2 2 1 X X X X X X


3 1 2 1 X X X X X

Maximum attainable level of learning: 1: low level (knowledge & Comprehension. 2: Medium (Application & Analysis) 3: High (Synthesis & Evaluation)



23

1.6 Summary of Direct & Indirect assessment tools:

PROGRAM OUTCOMES a b c d e f g h i j k l m n

HIGHEST LEVEL OF LEARNING ADDRESSED IN EACH OUTCOME 2 1 3 0 0 0 0 0 2 2 2 2 1 1

PASSING CRITERIA FOR EACH PROGRAM OUTCOME 0.6 0.6 0.6 0.6 0.6 0.6 0.6 0.6 0.6 0.6 0.6 0.6 0.6 0.6

PASSING CRITERIA FOR EACH OUTCOME ADDRESSED BY THE COURSE 0.6 0.6 0.6 NA NA NA NA NA 0.6 0.6 0.6 0.6 0.6 0.6

CLASS EXPOSURE 416 39 481 0 0 0 0 0 533 624 455 468 39 117

CHECK!

AD

DR

ES

SE

D

AD

DR

ES

SE

D

AD

DR

ES

SE

D

NA

NA

NA

NA

NA

AD

DR

ES

SE

D

AD

DR

ES

SE

D

AD

DR

ES

SE

D

AD

DR

ES

SE

D

AD

DR

ES

SE

D

AD

DR

ES

SE

D

COURSE GRADED ASSESSMENT TOOLS

Name of the graded assessment tool Contribution to course

grade (out of 100)

Tool #1 Quizzes 1 5

Tool #2 Quizzes 2 5

Tool #3 Lab Exam 5

Tool #4 LAB Project 25

Tool #5 Mid Exam 20

Tool #6 Final Exam 40

Check; sum of all graded tools must sum up to 100 100



24

COURSE INDIRECT ASSESSMENT TOOLS

Mod

ifie

d P

.C.

Name of the tool Passing Criteria (out of 5)

COURSE EVALUATION SURVEY 3

COURSE LEARNING OBJECTIVES SURVEY 3

COURSE OUTCOMES SURVEYS: a 3 3

b 3 3

c 3 3

d 3 0

e 3 0

f 3 0

g 3 0

h 3 0 i 3 3

j 3 3

k 3 3 l 3 3

m 3 3

n 3 3



25

Mapping of course learning objectives into program outcomes

Course Learning Objectives

CLO Program Outcomes C.L.O. Ins. Learning Tools

Cover a b c d e f g h i j k l m n

Passing

Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Hours 2 1 3 2 2 2 2 1 1 Criteria


2 2 2 1 0.6 1 0 0 0


2 2 1 0.6 1 0 0 0


1 2 0.6 1 1 0 0


4 2 0.6 1 0 0 0


2 1 2 0.6 1 0 1 0


2 2 2 2 1 0.6 1 0 0 0


7 2 2 1 0.6 1 1 0 0


2 2 1 1 1 0.6 1 0 0 0



26

9


3 2 0.6 1 0 0 0


3 1 0.6 1 0 1 0


3 1 1 2 0.6 1 0 1 0


3 1 2 2 0.6 1 0 0 0


1 1 0.6 1 0 1 0

14

Apply Binary Relational Operations and Additional Relational Operations on database

2 1 1 0.6 1 0 0 1


1 2 3 2 0.6 1 0 0 1


5 1 2 2 2 0.6 1 1 0 1


2 2 0.6 1 1 0 1


3 1 2 0.6 1 0 0 1

19 List advantages of standardized SQL 3 1 1 0.6 1 0 0 1



27


3 1 2 2 0.6 1 0 0 1


3 1 2 2 2 1 0.6 1 0 0 1


3 1 2 1 0.6 1 0 0 1

Mapping of Direct Assessment Tools into course Learning Objectives

Course Learning Objectives Coverage

Hours

Qu

izze

s 1

Qu

izze

s 2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam

1 Define a Database, characteristics and functions of Database Management System and types of Database Users 2 0.06

2 Distinguish between a Traditional File System and a Database System 2 0.02 0.06

3 Compare the advantages and disadvantages of Database System with traditional File system 1 0.02 0.13

4 Describe Data Models, Schemas, Instances, Three Schema Architecture and DBMS Component Modules 4 0.08 0.19

5 Describe the Entity–Relationship (ER) modeling tool using Unified Modeling Language (UML). 2 0.50 0.08 0.13

6 Model the real world database systems using Entity Relationship Diagrams (ERD) from the requirements specification. 2 0.20 0.08 0.14

7 Define the Relational Data Model, its Constraints and the Relational Database Schemas 7 0.30 0.08 0.22



28

8 State the Informal Design Guidelines for Relational Databases 2 0.08 0.03

9 Illustrate the Definition of Functional Dependencies , Inference Rules, Equivalence of Sets of Functional Dependencies FDs, Minimal Sets of FDs 3 0.09

10 List the three Normal Forms Based on Partial and Transitive Dependencies 3 0.14 0.13

11 Apply normalization techniques to normalize a database. 3 0.14 0.19

12 Identify the data integrity and security requirements of the database 3

13 Define the concept of Relational Algebra and the Relational Operations from Set Theory 1 0.05

14 Apply Binary Relational Operations and Additional Relational Operations on database 2

15 Design queries in Relational Algebra and Relational Calculus 1 0.05

16 Convert a conceptual data model such as ER diagram into a relational logical schema using various mapping algorithms. 5 0.50 0.03

17 Define disk storage devices, files of records, unordered files, ordered files and hashed files. 2 0.15

18 Apply various operations on Files such as hashing 3

19 List advantages of standardized SQL 3 0.03

20 Demonstrate the use of SQL for database creation and maintenance 3 0.50 0.50 0.14 0.06



29

21 Use SQL queries for data aggregation, calculations, views, sub-queries, embedded queries, manipulation, and report generation. 3 0.50 0.18 0.09

22 Design and implement a full real size database system 3 0.04 0.13



30

DIVIDER 2

Course Assessment Data



31

2.1 Indirect Assessment tools (Surveys not conducted yet, the following how it should be)

Outcome (A): Apply knowledge of computing & mathematics.

N.B. Attributes marked NA by the instructor, in the second column, are not addressed in the course 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY

How do you rate the contribution of this course to increase your ability to do the following?: P

oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

a.1

a.2

a.3

No. of Indicators

3

Outcome (B): Analyze a problem, identify & define computing requirements. N.B. Attributes marked NA by the instructor, in the second column, are not addressed in the course 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

b.1

b.2

b.3

No. of Indicators

3



32

Outcome (C): Design, implement, & evaluate system, process, component, or program. N.B. Attributes marked NA by the instructor, in the second column, are not addressed in the course 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

c.1

c.2

c.3

No. of Indicators

3

Outcome (i): Current techniques, skills, and tools necessary for computing practice. N.B. Attributes marked NA by the instructor, in the second column, are not addressed in the course 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

i.1

i.2

i.3

No. of Indicators

3



33

Outcome (J): Current technical concepts & practices in the core information technologies. N.B. Attributes marked NA by the instructor, in the second column, are not addressed in the course 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

j.1

j.2

j.3

No. of Indicators

3

Outcome (K): identify and analyze user needs in the selection, creation, evaluation & administration of computer‐based systems. N.B. Attributes marked NA by the instructor, in the second column, are not addressed in the course 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

k.1

k.2

k.3

No. of Indicators

3



34

Outcome (L): Effectively integrate IT‐based solutions into the user environment. N.B. Attributes marked NA by the instructor, in the second column, are not addressed in the course 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

l.1

l.2

l.3

No. of Indicators

3

Outcome (M): Understanding of best practices and standards & their application N.B. Attributes marked NA by the instructor, in the second column, are not addressed in the course 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

m.1

m.2

m.3

No. of Indicators

3



35

Outcome (N): Assist in the creation of an effective project plan

N.B. Attributes marked NA by the instructor, in the second column, are not addressed in the course 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

n.1

n.2

n.3

No. of Indicators

3



36

2.1.1 Course Evaluation Survey

DEPARTMENT OF INFORMATION TECHNOLOGY

Indirect Assessment of Program Outcomes Course Evaluation Survey

COURSE( CPIT 240 ) - SECTION ( IA ) - SEMESTER ( 2 ) - YEAR ( 2010 )

0 1 2 3 4 5

Please complete this questionnaire and tick the box that is most appropriate to your answer. This will help us to improve the service we provide to you and other students. Your answers and comments are confidential. N

ot a

t al

l

Som

ewha

t

Mod

erat

ely

Rea

sona

bly

Hig

hly

d

Ext

. hig

hly

1 Course Objectives were clear to me

2 The Course was beneficial

3 Resources/facilities (equipment, classroom, lab,etc) were satisfactory

4 The textbook was beneficial

5 Lectures were well planned and well executed

6 The assessment of the course work was reasonable

7 Timing to submit the course work was suitable

8 Overall, I recommend other students to take this course

The most interesting subject was:

Please list some positive aspects of this course:

1:

2

3

4

5

Please list items that could be improved in the following course offering

1

2

3



37

4

5 2.1.2 CLOs Survey


Course Level Indirect Assessment Students' Survey for Course Learning Objectives and Instructional Tools


0 1 2 3 4 5

Upon the completion of this course how do you rank your ability to do the following: P

oor

Fai

r

Ad

equ

ate

Goo

d

V. G

ood

Exc

elle

nt














38














39

2.2 Direct Assessment Tools Quiz 1

Lab Quiz ER-diagram

The database of a for a library which can store the information of members, borrow, and books. The database schema of the library is shown as follows:

Member (member_no, name, address, phone, email) Borrow (ISBN, checkout_date, member_no, borrow_period) Book (ISBN, book title, authors) publisher (pub_id , Publisher_name ,book_isbn) Borrow_report(ISBN, member_no, Total_book) The member may have more than one phone number (1..3) Total book show number of borrow book for each member

Please draw the ER diagram and the relational schema diagram and indicate the primary keys and the referential constraints. Answer



40

Quiz 2

Create Table for the following data schema; determine the primary key and the foreign key, change the name of column miles to kilometers Insert at least one record in each table. ANSWER Create table AIRPORT (airportcode number(10) constraint PK_airportcode primary key ,name varchar2(30)); Create table flt_schedule (flt# number (10) constraint PK_FLT# primary key ,airline varchar2 (30) not null , from_airportcode number(10) constraint FK_Fromairprotcode

references airport(airportcode) ,to_airportcode



41

number(10) constraint FK_toairprotcode references airport(airportcode) ,miles number (5),

price number(5)); Create table flt_weekday (flt# number(10) constraint FK_FL# references flt_schedule(flt#),Weekday date ,constraint CK_FLT_WK primary key(flt#,weekday)); Alter table flt_schedule rename column miles to kilometers; Insert into airport values (10 , ‘Jeddah’); Insert into airport values (20 , ‘Riyadh’); Insert into flt_schedule values (1020, ‘Saudi Airline ‘, 10,20,1000,’’); Insert into flt_weekday values (1020, ’10-10-2009’);



42

Mapping Quiz question to CLO:

S#

CLO’S(Introduction to Database)

Quiz (1)

Quiz (2) Final Exam Project

Qu

esti

on 1

Qu

esti

on (

1)

Qu

esti

on (

2)

Qu

esti

on (

3)

Qu

esti

on (

4)

Qu

esti

on (

1)

Qu

esti

on (

2)

Qu

esti

on (

3)

Qu

esti

on (

4)

Qu

esti

on (

5)

Qu

esti

on (

6)

Qu

esti

on (

7)

Qu

esti

on (

8)

Qu

esti

on (

9)

Qu

esti

on (

10)

Qu

esti

on (

11)

Qu

esti

on (

12)

Ph

ase

(1)

Ph

ase

(2)

Ph

ase

(3)

Ph

ase

(4)

Ph

ase

(5)



1


1

4 Describe Data Models, Schemas, Instances, Three Schema

1



43

Architecture and DBMS Component Modules


1

1


1

1


1

1




1


1

12 Identify the data integrity and



44

security requirements of the database





1 1 1 1





1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

21 Use SQL queries for data aggregation, calculations, views,

1 1 1 1 1 1 1 1 1 1 1 1 1 1



45

sub-queries, embedded queries, manipulation, and report generation.


1



46

Mapping Exams questions to CLOs

CLO’S(Introduction to Database)

Mid Exam Final exam

Qu

esti

on (

1)

Qu

esti

on (

2)

Qu

esti

on (

3)

Qu

esti

on (

4)

Qu

esti

on (

5)

Qu

esti

on (

6)

Qu

esti

on (

7)

Qu

esti

on (

1)

Qu

esti

on (

2)

Qu

esti

on (

3)

Qu

esti

on (

4)

Qu

esti

on (

5)


X


X


X


X X

27 Describe the Entity–Relationship (ER) modeling - Keys X X 28 Model the real world database systems using Entity

Relationship Diagrams (ERD) from the requirements specification.

X X


X X X


X


X X


X X

33 Apply normalization techniques to normalize a database. X X 34 Identify the data integrity and security requirements of the

database


X



X

38 Convert a conceptual data model such as ER diagram into a relational logical schema using various mapping

X



47

algorithms. 39 Define disk storage devices, files of records, unordered

files, ordered files and hashed files. X X

40 Apply various operations on Files such as hashing 41 List advantages of standardized SQL X42 Demonstrate the use of SQL for database creation and

maintenance X


X X

44 Design and implement a full real size database system X



48

Exam Ruberic

Rubric Quiz #1 Project Details: Work Type: Individual quiz. Quiz Goals: a) An ability to draw ER-diagram. b) An ability to draw relational schema diagram.

Description Of the Assignment: Draw the ER diagram and the relational schema diagram and indicate the primary keys and the referential constraints. The quiz will be evaluated based on the following Rubrics. PROJECT RUBRICS:

Quality Criteria

Exceeds Standard 4

Meets Standard 3

Below Standard 2

Not Acceptable

0

Points Earned

Draw the ER-Diagram

Draw the ER-Diagram and the relational schema diagram and indicate the primary keys and the referential constraints.

Draw the ER-diagram and the relational schema diagram, without indicate the primary keys and the referential constraints.

Draw the ER-diagram without the relational schema diagram and without indicate the primary keys and the referential constraints.

No drawing for the ER-Diagram 5X

------------



49

Rubric Quiz # 2

Project Title: Database Quiz #2 Project Details: Work Type: Individual quiz. Quiz Goals: a) An ability to create table with the Constraints. b) An ability to alter the table. c) An ability to insert data in the table.

Description Of the Assignment: Create Table and determine the primary key and the foreign key, change the name of column. Insert at least one record the tables. The quiz will be evaluated based on the following Rubrics. PROJECT RUBRICS:

Quality Criteria

Exceeds Standard 4

Meets Standard 3

Below Standard 2

Not Acceptable

0

Points Earned

Create the table Create the table , determine the primary key ,and the references key

Create the table , determine the primary key ,without determine the references key

Create the table , without determine the primary key and the references key

No create for the table

3X ------------

Alter the table Alter the table, determine the changing column, and determine new value.

Alter the table ,determine the changing column ,without determine new value

Alter the table ,without determine the changing column ,and without determine new value

No alter

1X ------------

Insert into table Insert value into table ,checking the primary key and the reference key

Insert value into table ,checking the primary key and ,without check the reference key

Insert value into table ,without checking the primary key and the reference key

No insert

1X ------------



50

Rubric Project # 3 Project Details: Work Type: Group Assignment. Group Members: Max 4 in each Group Strict Deadline: January 8, 2011. Assignment Goals: a) An ability to function effectively on teams to accomplish a common goal b) An ability to analyze the local and global impact of computing on individuals, Organizations and society

Description Of the Assignment: Design a database and implement this design using Oracle Database, based on the guidelines that the Instructor gave you in the Lecture. The report will be evaluated based on the following Rubrics. PROJECT RUBRICS:

Quality Criteria

Exceeds Standard 4

Meets Standard 3

Below Standard 2

Not Acceptable

0

Points Earned

Identification of “real-world scenario”

A description of the database application for the project. A brief explanation of why chosen this real-world situation to model. An analysis of the data requirements of the business

A description of the database application for the project. A brief explanation of why chosen this real-world situation to model. No analysis of the data requirements of the business

A description of the database application for the project. No explanation of why chosen this real-world situation to model. No analysis of the data requirements of the business

No description of the database application for the project.

1 X ------------

Conceptual design(ER-Diagram)

Database schema should have at least 4 entity types and four different relationships. Weak entity type, a superclass/subclass relationship.

Database schema less than 4 entity types and less than four different relationships. Weak entity type, a superclass/subclass relationship.

Database schema less than 4 entity types and less than four different relationships. No weak entity type, a superclass/subclass relationship.

No database schema.

8 X -----------

Logical Design First normalization, Second normalization and Third normalization .

First normalization, Second normalization, and Without Third normalization

First normalization, without Second normalization, and without Third normalization

No normalization 7 X

-----------

Implementation using Oracle

Creating database (Create Table), Populating your database (Insert), and Operations on the database (Retrieve).

Creating database (Create Table), Populating database (Insert), and No Operations on the database (Retrieve).

Creating database (Create Table), No Populating database (Insert), and No Operations on the database (Retrieve).

No create database

7 X -----------

Demonstrations and Final report

Describing the details for the project, and demonstrate the all above criteria.

Describing the details for the project, not all above criteria demonstrate.

Describing the details of the project, without demonstrate any of the above criteria.

No desorption for the Project.

2 X ---------



51

Project Rubric

Quality Criteria

Exceeds Standard 4

Meets Standard 3

Below Standard 2

Not Acceptable 0

Points Earned

Identification of “real-world scenario”

A description of the database application for the project. A brief explanation of why chosen this real-world situation to model. An analysis of the data requirements of the business

A description of the database application for the project. A brief explanation of why chosen this real-world situation to model. No analysis of the data requirements of the business

A description of the database application for the project. No explanation of why chosen this real-world situation to model. No analysis of the data requirements of the business

No description of the database application for the project. 1 X

-------------

Conceptual design(ER-Diagram)

Database schema should have at least 4 entity types and four different relationships. Weak entity type, a superclass/subclass relationship.

Database schema less than 4 entity types and less than four different relationships. Weak entity type, a superclass/subclass relationship.

Database schema less than 4 entity types and less than four different relationships. No weak entity type, a superclass/subclass relationship.

No database schema.

8 X -------------



52

Logical Design

First normalization, Second normalization and Third normalization .

First normalization, Second normalization, and Without Third normalization

First normalization, without Second normalization, and without Third normalization

No normalization

7 X -------------

Implementation using Oracle

Creating database (Create Table), Populating your database (Insert), and Operations on the database (Retrieve).

Creating database (Create Table), Populating database (Insert), and No Operations on the database (Retrieve).

Creating database (Create Table), No Populating database (Insert), and No Operations on the database (Retrieve).

No create database

7 X -------------

Demonstrations and Final report

Describing the details for the project, and demonstrate the all above criteria.

Describing the details for the project, not all above criteria demonstrate.

Describing the details of the project, without demonstrate any of the above criteria.

No desorption for the Project. 2 X

-------------



53

Mid Term Exam

Course Title: Database Systems – CPIT240 Total Marks: 80 (20+60) Program: BS (IT) : (IA, JA) Mid Term (Nov. 2010) Resource Person: mu'tasem JARRAH Total Time allowed: 120

min

Name: Roll No:

PART I (OBJECTIVE) Instructions:

o Write your Name, Student Id and Section on subjective question. o Cutting and overwriting is not allowed otherwise negative marks will be

calculated for such objective answers. o Do not write anything on Objective Question papers except your Name, Roll

Number & Section. o Both Objective and Subjective question papers and objective answer sheet have

to be returned to the invigilation staff before living the examination hall.

Question (1) Marks (20) Encircle True or False on answer sheet provided to you for objective questions 1 to 10: 1. A database application is a system program that is used to perform a series of

activities on behalf of database users. (True) 2. Enterprise data model does not describe the high-level entities in an organization and

the relationship between these entities.(False)

3. A database is a self-describing collection of integrated records. (True) 4. Data that describes the properties and context of user data is known as Metadata.

(True)

5. Entity type that is not existence-dependent on some other entity type is called a weak entity. (False)



54

6. The most common degree for relationships is binary. (True) 7. Where a model represents a relationship between entity types, but pathway between

certain entity occurrences is ambiguous is called chasm trap. (True)

8. A user of a database system can be an entity. (False)

9. A relationship which also has attributes is called an associative entity. (True)

10. In DBMS architecture the conceptual level does not present a logical view of the entire database. (False)

PART I (OBJECTIVE)

For following question 11 to 20 encircle only one correct answer on the answer sheet provided to you. 11. The hierarchical data model organizes data in a ___________structure. a) Tree b) Object Relational c) Object Oriented d) Relational 12. The first stage in the design of a database is to define the ________view. a) External b) Conceptual c) Internal d) Physical 13. A software system that enables users to define, create, maintain, and control access to the database is called___________. a) File System b) Operating System c) DBMS d) Application Program 14. Primary key attribute should contain____________values.

a) Duplicate b) Unique c) Single d) Null

15. Associative entity is a combination of relationship and__________________. a) Attributes b) Cardinality c) Foreign Key d) Candidate Key 16. Degree of a relationship is represented by the number of _____________. a) Relationship b) Users c) Entities d) Keys 17. Recursive relationship is of degree ______________.



55

a) Quaternary b) Binary c) Trenary d) Unary 18. Entity type that is existence – dependent on some other entity type is called ______________. a)Strong Entity b) Weak Entity c) Parent Entity d) Zero Entity 19. A row in a relation is also called ______________. a) Record b) Tuple c) Instance d) All of the above 20. Oracle is a ________________________. a) DBMS b) Database c) Tuple d) Relation

PART 2 (SUBJECTIVE)

Marks(60)

Instructions: - For following Questions 2 to 7 write your answers in the space provided to you

on question paper. - Question 7 – Optional. - Both Objective and Subjective question paper sheet have to be returned to the

invigilation staff before leaving the examination hall.

Question (2) Marks(10) Differentiate between the followings: 1. Two tire and Three tire architecture

Two tire: The two-tier architecture is like client server application. The direct communication takes place between client and server. There is no intermediate between client and server.

Three tire : Three tier architecture having three layers. They are

1. Client layer 2. Business layer



56

3. Data layer

Client layer: Here we design the form using textbox, label etc.

Business layer: It is the intermediate layer which has the functions for client layer and it is used to make communication faster between client and data layer. It provides the business processes logic and the data access.

Data layer: it has the database.

2. Attribute and Tuple

TUPLE: Is the "ROW" in a table and ATTRIBUTE: Is the "COLUMN" and it can also be called as "ATTRIBUTE".

3. Stored (Simple) Attribute versus Derived Attributes

Stored Attribute: An attribute that supplies a value to the related attribute. Derived Attribute: An attribute that’s value is derived from a stored attribute.

4. Data and Information Data: is raw material & unorganized facts that need to be processed Information: When data are processed, organized, structured or presented in a given context so as to make them useful, they are called Information. 5. Metadata and database Metadata: that describes the fields and formats of databases and data

Database: is a collection of information that is organized so that it can easily be accessed, managed, and updated. In one view, databases can be classified according to types of content: bibliographic, full-text, numeric, and images.



57

Question (3) Marks (14) (i) Make the relationships between the given tables (relations) on the following diagram based on the referential integrity constraints for company database schema and identify the primary and foreign keys on the diagram also. (ii) Also write the referential integrity constraint (Equations) for the following company database schema.

Employee FNAME MINIT LNAME SSN BDATE ADDRESS SEX SALARY SUPER_SSN DNO

DEPARTMENT

DEPT_LOCATIONA DNUMBER DLOCATION

PROJECT

PNAME PNUMBER PLOCATION DNUM

WORKS_ON

ESSN PNO HOURS

DEPENDENT

DNAME DNUMBER MGR_SSN MGR_START_DATE

ESSN DEPENDENT_NAME SEX BDATE RELATIONSHIP



58

Equations: FK(employee.super_ssn) = PK (employee.ssn) FK(Department.Mgr_ssn)= PK (employee.ssn) FK(employee.dno) = PK (Department.Dnumber) FK(Dept_Location.Dnumber) = PK (Department.Dnumber) FK(Works_On.Essn) = PK (employee.ssn) FK(Dependent.Essn) = PK (employee.ssn) FK(Project.Dnum) = PK (Department.Dnumber) FK(Works_On.Pno) = PK(Project.Pnumber)



59

Question (4) Marks (8)

Based on the constraints that have been studied, Arranged the fields below by selecting any of the following should be entered first, and then the next, and so on?

EMPNO ENAME JOB MGR HIREDATE SAL COMM DEPTNO 5- 7369 SMITH CLERK 7788 17-DEC-80 800 20 6- 7499 ALLEN SALESMAN 7369 20-FEB-81 1600 300 30 7- 7521 WARD SALESMAN 7499 22-FEB-81 1250 500 30 2- 7566 JONES MANAGER 7782 02-APR-81 2975 20

4-8- 7654 MARTIN SALESMAN 7698 28-SEP-81 1250 1400 30 3- 7698 BLAKE MANAGER 7566 01-MAY-81 2850 30 1- 7782 KING PRESIDENT 09-JUN-81 2450 10 4- 7788 SCOTT ANALYST 7698 19-APR-87 3000 20


Fill a diagram for the Component modules of a DBMS and properly write the names of the components on this diagram.



60

Solution:


A library is planning to develop system, Draw the Entity Relationship Diagram (ERD) for a library information system. 1. This library will serve only registered students. 2. Each book has title, author, publisher, date-of-publication, ISBN number. 3. Each student has SSN, first name, last name, address, and telephone number. 4. You have to specify the Entities, Attributes, Primary Keys, Relationships, Degree of the Relationship between different Entities. Note: A student can borrow a book for up to two weeks, so it is necessary to keep track of the date-of-borrow. He can then renew the book for another two weeks. Two renewals are allowed. After two renews, the student must return a borrowed book. If a book is overdue, the student must pay a fine of S.R 0.5 a day.



61

Question (7) - Optional Marks(6)

Consider the following Entity Relationship (ER) diagram.

Assume that an employee may work in up to two departments or may not be assigned to any department.

Assume that each department must contain one and may contain up to three phone numbers.

Assume that each department can have anywhere between 5 to 25 employees. Assume that each phone is used by one, and only one, department. Assume that each phone is assigned to at least one, and may be assigned to up

to 10 employees. Assume that each employee is assigned at least one, but no more than 6 phones.



62

Write the (min, max) constrains for both sides of each relationship on the following ER diagram. (1, 1) ( 1, 3) (1, 10) ( 5, 25) (1,6) ( 0 ,2 )

Phone

Employee

Department Contains

Works-In

Has-Phone



63

Final Exam

Course Title: Database Systems – CPIT240 Total Marks: 80 (20 + 60) Program: BS (IT) Section: (IA, JA). Final Exam (15 Jan. 2011) Coordinator course: Dr.Muhammad Alhaddad Total Time allowed: 120 Minutes Resource Person: mu'tasem JARRAH Name: Roll No:

PART I (OBJECTIVE) Marks (20) Instructions:

o Write your Name, Student Id and Section on subjective question. o Cutting and overwriting is not allowed otherwise negative marks will be

calculated for such objective answers. o Do not write anything on Objective Question papers except your Name, Roll

Number & Section. o Both Objective and Subjective question papers and objective answer sheet have

to be returned to the invigilation staff before living the examination hall.

Question (1) Marks (20) Encircle True or False on answer sheet provided to you for objective questions 1 to 20: 11. Join is the most frequently used relation operation, which brings together data from

two or more related tables into one result table. (True)

12. Linear search does not require reading and searching half the file blocks on the average, and is hence not quite expensive. (False)

13. All of the non-key attributes of a relation are functionally dependent on the primary

key of that relation. (True)



64

14. Cardinality constraint does not specify the number of instances of one entity that can (or must) be associated with each instance of another entity. (False)

15. An instance of a subtype is not an instance of the super type. (False)

16. Keys usually are used as indexes to speed up the response to user queries. (True)

17. Relational integrity is not enforced via the primary – key to foreign – key match.

(False)

18. ALTER TABLE statement allows you to change column specifications. (True)

19. CREATE VIEW defines a logical table from one or more views. (False)

20. Commands that define a database, including creating, altering, and dropping tables and establishing constraints are called data manipulation language. (False)

21. Unordered files are also called a heap or a pile file. (True)

22. A relation is a named, two dimensional table of data. (True)

23. Reading or writing a disk block is not a time consuming process because of the seek

time (s) and rotational delay (latency) (rd). (False)

24. A file can have fixed-length records or variable-length records. (True)

25. Blocking factor (bfr) refers to the number of records per block. (True)

26. A secondary index does not provide a secondary means of accessing a file for which some primary access already exists. (False)

27. The relational tables used in the union operation must not be union compatible.

(False)

28. The project operator retrieves a subset of columns from a table, removing duplicate rows from the result. (True)

29. Functional dependency describes relationship between attributes. (True)

30. There is no difference between equal join and outer join. (True)



65

PART 2 (SUBJECTIVE) Name: Roll No:

Marks(60) Instructions:

- For following Questions 2 to 5 write your answers in the space provided to you on question paper.

- Both Objective and Subjective question paper sheet have to be returned to the invigilation staff before leaving the examination hall.


One type of index (Secondary Index), please fill out the form following, with appropriate value in the data file (Dept_number).



66

Solution:

Question (3) Marks(20) A sample table showing functional dependency design diagram for the Pine Valley Furniture Company Database is given to you. You have to apply the techniques of first three normal forms to normalize this design. The final resultant tables should be in 3 rd Normal Forms and with the identification of Primary keys and show the relationships between these tables based upon Referential Integrity Constraints.



67

Solution: 1NF --- OK 2NF

- 3NF (Removing transitive dependencies)

All Tables (Normal forms)

Question (4) Marks(10) You have been given the following EMPLOYEE file EMPLOYEE (NAME, SSN, ADDRESS, JOB, SAL, ….)



68

In the above employee file the record size is R=120 bytes stored on the disk, block size is B=4.5KB and total records in the file are r = 45000 fixed length records For an index on the SSN field in the employee file, assume the field size Vssn = 12

bytes, assume the record pointer size PR = 8 bytes. You have to calculate the Blocking Factor (Bfr) for the data file as well as for the index file. Also calculate the number of blocks required to store data file and index file entries on the hard disk. Also calculate and compare the number of block accesses for these files by using binary search and the linear search algorithms and compare the results of both the searching algorithms.

Solution:

Then, we get:

Block size B=4.5 KB (4.5*1024=4608 bytes) blocking factor Bfr = block size / record size (B div R) blocking factor Bfr = 4608 div 120 = 38 records/block number of file blocks b= no. of fixed length records /

blocking factor number of file blocks b = r / Bfr = 45000/38 = 1184 blocks

For an index on the SSN field, assume the field size VSSN=12 bytes, assume the record pointer size PR = 8 bytes. Then: index entry size Ri=(VSSN+ PR) = (12+8) = 20 bytes index blocking factor Bfri= B div Ri= 4608 div 20 = 230

entries/block number of index blocks b = (r/ BfrI)= (45000/230) = 196

blocks binary search needs log2bi = log196 = 8 block accesses This is compared to an average linear search cost of: (b/2)= 45000/2= 22500 block accesses If the file records are ordered, the binary search cost would

be: log2bi= log2(45000)= 7 block accesses



69

Question (5) Marks (20) (i) Write complete clause / syntax of the SELECT SQL Statement. Marks(5) Solution: SELECT <attribute list> FROM <table list> WHERE <condition> Group by <attribute> Having <condition> Order by <attribute> (ii) Answer the following questions by writing the queries in SQL and Relational

Algebra. Marks(15)

Employee (ssn , Fname , lname , Bdate , Address , sex , salary , Super_ssn , Dno) Department (Dnumber , Dname , Mgr_ssn , Mgr_start_date) Dept_Locations (Dnumber , Dlocation) Project (Pnumber , Pname , Plocation , Dnum) Works_on (Essn , Pno , Hours) Dependent (Essn , Dependent_name , Sex , Bdate , Relationship)

1. Write an aggregate and group function operation to show the count of the

employees and maximum salary from the EMPLOYEE table for each department by department number wise. (in SQL and Relational Algebra)

Select max(salary),count(*) from employee group by dno;

DNO ℱCOUNT SSN, AVERAGE Salary (EMPLOYEE)

2. Write down the Unary Relational Operation to show each employee's first

and last name and salary which you can project from the EMPLOYEE table. (in SQL and Relation Algebra)

Select fname, lname, salary from employee;



70

π fname, lname, salary (employee)

3. Write a function to get the attributes (LName, FName and Salary) of the Employees who are working in DNo. 5 from the EMPLOYEE table. (in SQL and Relation Algebra)

Select lname, fname, salary from employee where dno=5;

FNAME, LNAME, SALARY( DNO=5(EMPLOYEE)) 4. For every project located in "Stafford" list the project number, the controlling

department number, and the department manager's last name address, and birth date. (in SQL and Relation Algebra)

SELECT PNUMBER, DNUM, LNAME, BDATE, ADDRESS

FROM PROJECT, DEPARTMENT, EMPLOYEE WHERE DNUM=DNUMBER AND MGRSSN=SSN AND PLOCATION='Stafford'

5. Find the Maximum, Minimum and Average of the salary that is given that is

given to the employees. (in SQL and Relation Algebra)

Select max(salary), min(salary), avg(salary) from employee;

ℱ Max salary, Min salary, Average salary (EMPLOYEE)



71

2.3 Result of Class Direct Assessment Tools

RESULTS OF ALL GRADED ASSESSMENTS TOOLS

COURSE( CPIT 240 ) - SECTION ( IA ) - SEMESTER ( 2 ) - YEAR ( 2010 ) #1 #2 #3 #4 #5 #6 Total

GR

AD

E

5 5 5 25 20 40 100

3.9 5 5 عبدالعزيز فاضل المالكي 0714671 1 24 18 30 86 B+0.3 0 4 فھد حسين ھشالن 0858364 2 24 8 29 65 D+1.9 0 5 عادل حمد الخميسي 0858395 3 24 16 31 78 C+

B 82 29 16 24 3 5 5 عبد الرحمن أحمد الحدادي 0858887 4

4.5 5 فارس بدر جمال 0859729 5 2.3 23 11 29 75 C+

+A 100 40 20 25 5 5 5 اسحاق سيداكرام عبدهللا 0862526 6

4.5 5 5 النمر محسن عبدالخالق 0862531 7 25 19 37 95 A+4.5 5 احمد عبدالھادي العبدلي 0862533 8 4.1 25 20 40 98 A++A 100 40 20 25 5 5 5 يعقوب سيد عبدهللا 0862534 9

4.5 5 حامد عبدالعليم وردك 0862540 10 3.1 25 19 39 95 A+

4.4 5 5 محمد احمد القواسمي 0911642 11 25 16 35 90 A

0.8 3 5 احمد سراج حريري 0919921 12 23 14 26 72 C

4.5 5 محمد مجاھد القماسي 0948066 13 3.9 25 16 28 82 B



72


Course Level Indirect Assessment Students' Survey for Course Learning Objectives and Instructional Tools


Class Assessment of Course Learning Objectives

0%10%20%30%40%50%60%70%80%90%

100%

CLO

1

CLO

4

CLO

7

CLO

10

CLO

13

CLO

16

CLO

19

CLO

22

CLO

25

CLO

28

CLO

31

CLO

34

CLO

37

CLO

40

% O

F S

EL

F-C

ON

FID

EN

T S

TU

DE

NT

S

COURSE LEARNING OBJECTIVES

EVALUATION OF COURSE LEARNING OBJECTIVES

0

1

2

3

4

5

CLO

1

CLO

4

CLO

7

CLO

10

CLO

13

CLO

16

CLO

19

CLO

22

CLO

25

CLO

28

CLO

31

CLO

34

CLO

37

CLO

40AV

ER

AG

E C

ON

FID

EN

CE

LE

VE

L

COURSE LEARNING OBJECTIVES

EVALUATION OF COURSE LEARNING OBJECTIVES



73


LO

_1

LO

_2

LO

_3

LO

_4

LO

_5

LO

_6

LO

_7

LO

_8

LO

_9

LO

_10

LO

_11

LO

_12

LO

_13

LO

_14

LO

_15

LO

_16

LO

_17

LO

_18

LO

_19

LO

_20

LO

_21

LO

_22

NO. OF STUDENTS

EXCEEDING CRITERIA

13

13

13

12

13

13

13

11

10

13

13

NA

s

9

NA

s

9 12

13

NA

s

9 11

13

12

% STUDENTS EXCEEDING

CRITERIA 100%

100%

100%

92%

100%

100%

100%

85%

77%

100%

100%

0%

69%

0%

69%

92%

100%

0%

69%

85%

100%

92%

CLASS AVERAGE

84%

93%

93%

92%

90%

90%

92%

81%

82%

89%

88%

0%

74%

0%

74%

83%

97%

0%

74%

80%

83%

91%

ON EACH CLO & PO

WEIGHT IN COURSE GRADE

(%)

1%

2%

3%

6%

7%

6%

8%

3%

4%

9%

11%

0%

2%

0%

2%

4%

6%

0%

1%

11%

11%

6%



74

LO

_30

LO

_31

LO

_32

LO

_33

LO

_34

LO

_35

LO

_36

LO

_37

LO

_38

LO

_39

LO

_40

a b c d e f g h i J k l m N

NO. OF STUDENTS

EXCEEDING CRITERIA

NA

s

NA

s

NA

s

NA

s

NA

s

NA

s

NA

s

NA

s

NA

s

NA

s

NA

s

13

NA

s

13

NA

s

NA

s

NA

s

NA

s

NA

s

13

13

13

13

9 13


CRITERIA

0%

0%

0%

0%

0%

0%

0%

0%

0%

0%

0%

100%

0%

100%

0%

0%

0%

0%

0%

100%

100%

100%

100%

69%

100%

CLASS AVERAGE

ON EACH CLO & PO

0%

0%

0%

0%

0%

0%

0%

0%

0%

0%

0%

84%

0%

83%

0%

0%

0%

0%

0%

86%

90%

85%

84%

74%

88%

WEIGHT IN COURSE

GRADE (%)

0%

0%

0%

0%

0%

0%

0%

0%

0%

0%

0%

11%

0%

14%

0%

0%

0%

0%

0%

19%

30%

9%

15%

1%

2%

CLASS EXPOSURE TO PROGRAM OUTCOMES (students*learning heights*coverage hours) 416 39 481 0 0 0 0 0 533 624 455 468 39 117



75

Class Assessment of Program Outcomes (Because the indirect in not conducted the figure is not completed)

0%

20%

40%

60%

80%

100%


% O

F S

TU

DE

NT

S E

XC

EE

DIN

G

CR

ITE

RIA

PROGRAM OUTCOMES

CLASS ACHIEVEMENT OF PROGRAM OUTCOMES

DIRECT INDIRECT

0%

20%

40%

60%

80%

100%


CL

AS

S A

VE

RA

GE

PROGRAM OUTCOMES

CLASS ACHIEVEMENT OF PROGRAM OUTCOMESDIRECT INDIRECT



76

0%

20%

40%

60%

80%

100%

a b c d e f g h i j k l m n%O

F P

AS

SIN

G S

TU

DE

NT

S

EX

CE

ED

ING

CR

ITE

RIA

PROGRAM OUTCOMES

ACHIEVEMENT OF PROGRAM OUTCOMES BY THE STUDENTS WHO PASSED THE COURSE

0%

20%

40%

60%

80%

100%


PA

SS

ING

ST

UD

EN

TS

' AV

ER

AG

E

PROGRAM OUTCOMES

ACHIEVEMENT OF PROGRAM OUTCOMES BY THE STUDENTS WHO PASSED THE COURSE



77

PROGRAM OUTCOMES (P.O.) a b c d e f g h i j k l m n

PASSING CRITERION FOR EACH P.O. (%) 0.6 0.6 0.6 NA NA NA NA NA 0.6 0.6 0.6 0.6 0.6 0.6

No. OF STUDENTS SATISFYING EACH ITERION

13 NAs 13 NAs NAs NAs NAs NAs 13 13 13 13 9 13

PERCENTAGE OF CLASS STUDENTS SATISFYING CRITERION FOR EACH

P.O.

100% 100% 100% 100% 100% 100% 69% 100%

PERCENTAGE OF COURSE PASSING STUDENTS SATISFYING CRITERION

FOR EACH P.O.

100% 100% 100% 100% 100% 100% 69% 100%

AVERAGE CLASS ACHIEVEMENT ON EACH PROGRAM OUTCOME

84% 83% 86% 90% 85% 84% 74% 88%

AVERAGE ACHIEVEMENT OF PASSING STUDENTSON EACH

PROGRAM OUTCOME

84% 83% 86% 90% 85% 84% 74% 88%

No. OF STUDENTS PASSING THE COURSE WITHOUT SATISFYING AN

OUTCOME

0 0 0 0 0 0 4 0

CLASS EXPOSURE TO PROGRAM OUTCOMES (students*learning

heights*coverage hours)

416 39 481 0 0 0 0 0 533 624 455 468 39 117

ALLOCATED WEIGHT IN OVERALL COURSE GRADE (%)

11% 0% 14% 0% 0% 0% 0% 0% 19% 30% 9% 15% 1% 2%



78

LIST OF THE STUDENTS WHO PASSED THE COURSE WITHOUT SATISFYING SOME OF THE PROGRAM OUTCOMES ADDRESSED BY THE

COURSE

The Number of Students Who Passed the Course is 13

Out of 13


Crit. 60% 60% 60% NA NA NA NA NA 60% 60% 60% 60% 60% 60%

#Fail 0 0 0 0 0 0 0 4 0

1 0919921 2 0858887 3 0858395 4 0858364



79

2.4 Results of Class Indirect Assessment of Programs Outcomes

0%

20%

40%

60%

80%

100%


% O

F S

TU

DE

NT

S E

XC

EE

DIN

G

CR

ITE

RIA

PROGRAM OUTCOMES


0%

20%

40%

60%

80%

100%


CL

AS

S A

VE

RA

GE

PROGRAM OUTCOMES




80

PROGRAM OUTCOMES (P.O.) a b c d e f g h i j k l m n

PASSING CRITERION FOR EACH P.O. (%) 0.6 0.6 0.6 NA NA NA NA NA 0.6 0.6 0.6 0.6 0.6 0.6

No. OF STUDENTS SATISFYING EACH ITERION

13 NAs 13 NAs NAs NAs NAs NAs 13 13 13 13 9 13

PERCENTAGE OF CLASS STUDENTS SATISFYING CRITERION FOR EACH

P.O.

100% 100% 100% 100% 100% 100% 69% 100%

PERCENTAGE OF COURSE PASSING STUDENTS SATISFYING CRITERION

FOR EACH P.O.

100% 100% 100% 100% 100% 100% 69% 100%

AVERAGE CLASS ACHIEVEMENT ON EACH PROGRAM OUTCOME

84% 83% 86% 90% 85% 84% 74% 88%

AVERAGE ACHIEVEMENT OF PASSING STUDENTSON EACH

PROGRAM OUTCOME

84% 83% 86% 90% 85% 84% 74% 88%

No. OF STUDENTS PASSING THE COURSE WITHOUT SATISFYING AN

OUTCOME

0 0 0 0 0 0 4 0

CLASS EXPOSURE TO PROGRAM OUTCOMES (students*learning

heights*coverage hours)

416 39 481 0 0 0 0 0 533 624 455 468 39 117

ALLOCATED WEIGHT IN OVERALL COURSE GRADE (%)

11% 0% 14% 0% 0% 0% 0% 0% 19% 30% 9% 15% 1% 2%



81

INDIRECT ASSESSMENT

a b c d e f g h i j k

PERCENTAGE OF STUDENTS SATISFYING CRITERION

0% 0% 0% NA NA NA NA NA 0% 0% 0%

AVERAGE CONFIDENCE LEVEL (out of 5) 0.0 0.0 0.0 NA NA NA NA NA 0.0 0.0 0.0

AVERAGE CONFIDENCE LEVEL (%) 0% 0% 0% NA NA NA NA NA 0% 0% 0%



82

2.5 End of Semester CO Assessments Report


END OF SEMESTER ASSESSMENT REPORT OF COURSE LEARNING OBJECTIVES

Prepared by:

Dr. Mohammed J. Alhaddad

LO

_1

LO

_2

LO

_3

LO

_4

LO

_5

LO

_6

LO

_7

LO

_8

LO

_9

LO

_10

LO

_11

LO

_12

LO

_13

LO

_14

LO

_15

LO

_16

LO

_17

LO

_18

LO

_19

LO

_20

% STUDENTS EXCEEDING CRITERIA 10

0%

100%

100%

92%

100%

100%

100%

85%

77%

100%

100%

0%

69%

0%

69%

92%

100%

0%

69%

85%

CLASS AVERAGE ON EACH CLO 84 %

93 %

93 %

92 %

90 %

90 %

92 %

81 %

82 %

89 %

88 %

0 %

74 %

0 %

74 %

83 %

97 %

0 %

74 %

80 %

Passing Criteria 0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

Perceived Problems P P P



83

LO

_21

LO

_22

LO

_23

LO

_24

LO

_25

LO

_26

LO

_27

LO

_28

LO

_29


CRITERIA 100%

92%

0%

0%

0%

0%

0%

0%

0%

CLASS AVERAGE ON EACH CLO 83

%

91%

0%

0%

0%

0%

0%

0%

0%

Passing Criteria 0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

0.6

Perceived Problems P

P

P

P

P

P

P



84

INSTRUCTOR'S COMMENTS ON ALL RED CELLS (Perceived Problems) ABOVE

Learning Objective Perceived Problems Comments Action to be taken



85

2.6 End of Semester Outcome Assessments Report


END OF SEMESTER ASSESSMENT REPORT OF COURSE - ADDRESSED PROGRAM OUTCOMES

Prepared by: Dr. Mohammed J. Alhaddad

The Number of Students Who

Passed the Course is 13 Out of 13

DIRECT ASSESSMENT a b c d e f g h i j k l m n Outcome Passing Criteria 0.6 0.6 0.6 NA NA NA NA NA 0.6 0.6 0.6 0.6 0.6 0.6

% Students Exceeding Criteria 100% 0% 100% 0% 0% 0% 0% 0% 100% 100% 100% 100% 69% 100% Class Average(%) - All Students 84% 0% 83% 0% 0% 0% 0% 0% 86% 90% 85% 84% 74% 88%

Class Average(%) - Passing Students 84% 83% 0% 0% 0% 0% 0% 86% 90% 85% 84% 74% 88% Class Exposure 416 39 481 0 0 0 0 0 533 624 455 468 39 117

Perceived Problems P



86

INSTRUCTOR'S COMMENTS ON ALL RED CELLS (Perceived Problems) ABOVE

Program outcome

Previous Offering Present Offering % st.

Exceeding Clas Av. All St. Clas Av. Pass St. Exposure Perceived Problems Comments Actions to be taken

INDIRECT ASSESSMENT a b c d e f g h i j k Outcome Passing Criteria (out of 5) 3 3 3 NA NA NA NA NA 3 3 3

% Students Exceeding Criteria 0% 0% 0% 0% 0% 0% 0% 0% 0% 0% 0% Class Average (out of 5) 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0

Perceived Problems P P P P P P



87

Divider 3

Supported Program Outcomes (a)



88

3.1 Outcome Definition and Outcome Indicator.

Outcome (A): An ability to apply knowledge of computing and mathematics appropriate to the discipline .

OUTCOME ATTRIBUTES

How do you rate the contribution of this course to increase your ability to do the following?:

a.1

a.2

a.3



89

3.2 Course Learning Objectives Addressing the Outcome

Outcome (a): An ability to apply knowledge of computing and mathematics appropriate to the discipline

INST. & LEARNING TOOLS DIRECT ASSESSMENT TOOLS

CLO LOL COURSE LEARNING OBJECTIVES

USED TO ADDRESS THE OUTCOME

Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam

6 2 Model the real world database systems using

Entity Relationship Diagrams (ERD) from the requirements specification.

1

x

x x

8 2 State the Informal Design Guidelines for

Relational Databases 1

x x

11 1 Apply normalization techniques to normalize a

database. 1

1

x

x

14 1

Apply Binary Relational Operations and Additional Relational Operations on database

1

1

15 2 Design queries in Relational Algebra and

Relational Calculus 1

1

x



90

16 1 Convert a conceptual data model such as ER

diagram into a relational logical schema using various mapping algorithms.

1 1

1

x

x

18 1 Apply various operations on Files such as

hashing 1

1

20 1 Demonstrate the use of SQL for database

creation and maintenance 1

1

x x x

x

21 1 Use SQL queries for data aggregation,

calculations, views, sub-queries, embedded queries, manipulation, and report generation.

1

1

x x

x

22 1 Design and implement a full real size database

system 1

1

x

x



91

No. of CLOs Addressing the Outcome 10 No. of Course Learning Objectives Addressed

by Each Instructional Tool & Each Direct Assessment Tool

0 0 0 0 0 0 1 2 2 5 2 7 0 0

INST. & LEARNING TOOLS ASSESSMENT TOOLS

Instructional, Learning and Assessment Tools Used to Address the Outcome

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam

Maximum Attainable Level of Learning 2

Outcome Passing Criteria 60%

% Students Exceeding Criteria 100%

Class Average(%) - All Students 84%

Class Exposure 416



92

3.3 Outcome Survey

Students' Confidence Level in Achieving the Course-Addressed Program Outcomes 0 1 2 3 4 5

OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

a.1

a.2 a.3 a.4

No. of Attributes

4



93

3.4 Outcome Assessment and Improvement Report

Students' Confidence Level in Achieving the Course-Addressed Program Outcomes

Attr

ibut

e A

vera

ge

# s

tude

nts

Exc

eedi

ng C

riter

ia

% o

f stu

dent

s E

xcee

ding

Crit

eria

0 1 2 3 4 5

OU

TC

OM

E

AT

TR

IBU

TE

S

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

a.1

0.0 0 0%

a.2 0.0 0 0%

a.3 0.0 0 0%

a.4 0.0 0 0%

No.

of

Attr

ibut

es

4



94

0.0 0.0 0.00.00.51.01.52.02.53.03.54.04.55.0

a.1 a.2 a.3

CL

AS

S A

VE

RA

GE

OUTCOME ATTRIBUTES

ACHIEVEMENT OF THE OUTCOME'S ATTRIBUTES

0% 0% 0%0%

10%

20%

30%40%

50%60%

70%

80%90%

100%

a.1 a.2 a.3

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES




95

3.5 Student work Samples



124

Divider 4

Supported Program Outcomes (b)



125

4.1 Outcome Definition and Outcome Indicator. Outcome (b): An ability to analyze a problem, and identify and define the computing requirements appropriate to its solution

OUTCOME ATTRIBUTES


b.1

b.2

b.3



126


Outcome (b): An ability to analyze a problem, and identify and define the computing requirements appropriate to its solution


CLO LOL COURSE LEARNING

OBJECTIVES USED TO ADDRESS THE OUTCOME

Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam

1 12 Identify the data integrity and

security requirements of the database 1



127



0 0 0 0 0 0 0 0 0 0 0 0 0 0







Class Exposure 39



128

4.3 Outcome Survey


OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

b.1

b.2 b.3

No. of Attributes

3



129



Attr

ibut

e A

vera

ge

# s

tude

nts

Exc

eedi

ng C

riter

ia

% o

f stu

dent

s E

xcee

ding

Crit

eria

0 1 2 3 4 5

OU

TC

OM

E

AT

TR

IBU

TE

S

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

b.1

0.0 0 0%

b.2 0.0 0 0%

b.3 0.0 0 0%

No.

of

Attr

ibut

es

3



130

0% 0% 0%0%

10%

20%

30%

40%

50%

60%

70%

80%

90%

100%

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES


0.0 0.0 0.00.0

0.5

1.0

1.5

2.0

2.5

3.0

3.5

4.0

4.5

5.0

CL

AS

S A

VE

RA

GE

OUTCOME ATTRIBUTES




131




132

Divider 5

Supported Program Outcomes (c)



133

5.1 Outcome Definition and Outcome Indicator. Outcome (c): An ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs

OUTCOME ATTRIBUTES


c.1

c.2

c.3



134


Outcome (c): An ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs




Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam

6 2

Model the real world database systems using Entity Relationship Diagrams (ERD) from the requirements specification.

1

x

x x

8 1 State the Informal Design Guidelines for Relational Databases

1

x x

15 3 Design queries in Relational Algebra and Relational Calculus

1

1

x

16 2

Convert a conceptual data model such as ER diagram into a relational logical schema using various mapping algorithms.

1 1

1

x

x

20 2 Demonstrate the use of SQL for database creation and maintenance

1

1

x x x

x



135

21 2

Use SQL queries for data aggregation, calculations, views, sub-queries, embedded queries, manipulation, and report generation.

1

1

x x

x

22 2 Design and implement a full real size database system

1

1

x

x



0 0 0 0 0 0 0 0 0 0 0 0 0 0



Qui

zes

1

Qui

zes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam





Class Exposure 481



136

5.3 Outcome Survey


OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

c.1

c.2 c.3

No. of Attributes

3



137



Attr

ibut

e A

vera

ge

# s

tude

nts

Exc

eedi

ng C

riter

ia

% o

f stu

dent

s E

xcee

ding

Crit

eria

0 1 2 3 4 5

OU

TC

OM

E

AT

TR

IBU

TE

S

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

c.1

0.0 0 0%

c.2 0.0 0 0%

c.3 0.0 0 0%

No.

of

Attr

ibut

es

3



138

0% 0% 0%0%

10%20%30%40%50%60%70%80%90%

100%

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES


0.0 0.0 0.00.0

0.5

1.0

1.5

2.0

2.5

3.0

3.5

4.0

4.5

5.0

CL

AS

S A

VE

RA

GE

OUTCOME ATTRIBUTES




139




165

Divider 6

Supported Program Outcomes (i)



166

6.1 Outcome Definition and Outcome Indicator. Outcome (i): An ability to use current techniques, skills, and tools necessary for computing practice..

OUTCOME ATTRIBUTES


i.1

i.2

i.3



167


Outcome (c): An ability to use current techniques, skills, and tools necessary for computing practice.




Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam

1 2

Define a Database, characteristics and functions of Database Management System and types of Database Users

1

x

2 2 Distinguish between a Traditional File System and a Database System

1

x x

5 1 Describe the Entity–Relationship (ER) modeling tool using Unified Modeling Language (UML).

1

1

x

x x

7 2 Define the Relational Data Model, its Constraints and the Relational Database Schemas

1 1

x

x x



168

10 1 List the three Normal Forms Based on Partial and Transitive Dependencies

1

1 1

x

x

15 2 Design queries in Relational Algebra and Relational Calculus

1

1

x

18 2 List advantages of standardized SQL 1

1

21 2


1

1

x x

x



169



0 0 0 0 0 0 2 0 1 5 4 3 0 0



Qu

izes

1

Lab

Exa

m

Lab

Pro

ject

Mid

Exa

m

Fin

al E

xam





Class Exposure 533



170

6.3 Outcome Survey


OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

i.1

i.2 i.3

No. of Attributes

3



171



Attr

ibut

e A

vera

ge

# s

tude

nts

Exc

eedi

ng C

riter

ia

% o

f stu

dent

s E

xcee

ding

Crit

eria

0 1 2 3 4 5

OU

TC

OM

E

AT

TR

IBU

TE

S

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

i.1

0.0 0 0%

i.2 0.0 0 0%

i.3 0.0 0 0%

No.

of

Attr

ibut

es

3



172

0% 0% 0%0%

10%20%30%40%50%60%70%80%90%

100%

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES


0% 0% 0%0%

10%20%30%40%50%60%70%80%90%

100%

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES


0.0 0.0 0.00.0

0.5

1.0

1.5

2.0

2.5

3.0

3.5

4.0

4.5

5.0

CL

AS

S A

VE

RA

GE

OUTCOME ATTRIBUTES




173




208

Divider 7

Supported Program Outcomes (j)



209

7.1 Outcome Definition and Outcome Indicator. Outcome (j): An ability to use and apply current technical concepts and practices in the core information technologies

OUTCOME ATTRIBUTES


j.1

j.2

j.3



210


Outcome (j): An ability to use and apply current technical concepts and practices in the core information technologies




Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam

1 2

Define a Database, characteristics and functions of Database Management System and types of Database Users

1

x

3 2 Compare the advantages and disadvantages of Database System with traditional File system

1 1

x x

4 2 Describe Data Models, Schemas, Instances, Three Schema Architecture and DBMS Component Modules

1

x x

5 2 Describe the Entity–Relationship (ER) modeling tool using Unified Modeling Language (UML).

1

1

x

x x



211

7 2 Define the Relational Data Model, its Constraints and the Relational Database Schemas

1 1

x

x x

8 1 State the Informal Design Guidelines for Relational Databases

1

x x

9 2


1

x

13 1 Define the concept of Relational Algebra and the Relational Operations from Set Theory

1

1

x

17 2 Define disk storage devices, files of records, unordered files, ordered files and hashed files.

1 1

1

x

19 1 List advantages of standardized SQL 1

1

x



212



0 0 0 0 0 0 2 0 0 4 6 5 0 0



Qu

izes

1

Lab

pro

ject

Mid

Exa

m

Fin

al E

xam





Class Exposure 624



213

7.3 Outcome Survey


OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

j.1

j.2 j.3

No. of Attributes

3



214



Attr

ibut

e A

vera

ge

# s

tude

nts

Exc

eedi

ng C

riter

ia

% o

f stu

dent

s E

xcee

ding

Crit

eria

0 1 2 3 4 5

OU

TC

OM

E

AT

TR

IBU

TE

S

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

j.1

0.0 0 0%

j.2 0.0 0 0%

j.3 0.0 0 0%

No.

of

Attr

ibut

es

3



215

0% 0% 0%0%

10%20%30%40%50%60%70%80%90%

100%

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES


0.0 0.0 0.00.0

0.5

1.0

1.5

2.0

2.5

3.0

3.5

4.0

4.5

5.0

CL

AS

S A

VE

RA

GE

OUTCOME ATTRIBUTES




216




258

Divider 8

Supported Program Outcomes (k)



259

8.1 Outcome Definition and Outcome Indicator. Outcome (k): An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems

OUTCOME ATTRIBUTES


k.1

k.2

k.3



260


Outcome (k): An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems




Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam

1 1 Define a Database, characteristics and functions of Database Management System and types of Database Users

1

x

2 1 Distinguish between a Traditional File System and a Database System 1

x x

6 2


1

x

x x

11 21 Apply normalization techniques to normalize a database. 1

1

x

x



261

12 2 Identify the data integrity and security requirements of the database 1

14 1 Apply Binary Relational Operations and Additional Relational Operations on database

1

1

16 2


1 1

1

x x

x

21 2


1

1

x

x



262



0 0 0 0 0 0 0 0 0 0 0 0 0 0



Qui

zes

1

Qui

zes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam





Class Exposure 455



263

8.3 Outcome Survey


OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

k.1

k.2 k.3

No. of Attributes

3



264



Attr

ibut

e A

vera

ge

# s

tude

nts

Exc

eedi

ng C

riter

ia

% o

f stu

dent

s E

xcee

ding

Crit

eria

0 1 2 3 4 5

OU

TC

OM

E

AT

TR

IBU

TE

S

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

k.1

0.0 0 0%

k.2 0.0 0 0%

k.3 0.0 0 0%

No.

of

Attr

ibut

es

3



265

0% 0% 0%0%

10%20%30%40%50%60%70%80%90%

100%

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES


0.0 0.0 0.00.0

0.5

1.0

1.5

2.0

2.5

3.0

3.5

4.0

4.5

5.0

CL

AS

S A

VE

RA

GE

OUTCOME ATTRIBUTES




266




297

Divider 9

Supported Program Outcomes (L)



298

9.1 Outcome Definition and Outcome Indicator. Outcome (l): An ability to effectively integrate IT-based solutions into the user environment

OUTCOME ATTRIBUTES


l.1

l.2

l.3



299


Outcome (l): An ability to effectively integrate IT-

based solutions into the user environment INST. & LEARNING TOOLS DIRECT ASSESSMENT TOOLS



Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam

6 1


1

x

x x

11 2 Apply normalization techniques to normalize a database.

1

1

x

x

12 2 Identify the data integrity and security requirements of the database

1

16 2


1 1

1

x

x



300

20 2 Demonstrate the use of SQL for database creation and maintenance

1

1

x x x

x

21 1


1

1

x x

x

22 1 Design and implement a full real size database system

1

1

x

x



301



0 0 0 0 0 0 0 0 0 0 0 0 0 0



Qui

zes

1

Qui

zes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam





Class Exposure 468



302

9.3 Outcome Survey


OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

l.1

l.2 l.3

No. of Attributes

3



303



Attr

ibut

e A

vera

ge

# s

tude

nts

Exc

eedi

ng C

riter

ia

% o

f stu

dent

s E

xcee

ding

Crit

eria

0 1 2 3 4 5

OU

TC

OM

E

AT

TR

IBU

TE

S

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

l.1

0.0 0 0%

l.2 0.0 0 0%

l.3 0.0 0 0%

No.

of

Attr

ibut

es

3



304

0% 0% 0%0%

10%20%30%40%50%60%70%80%90%

100%

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES


0.0 0.0 0.00.0

0.5

1.0

1.5

2.0

2.5

3.0

3.5

4.0

4.5

5.0

CL

AS

S A

VE

RA

GE

OUTCOME ATTRIBUTES




305




334

Divider 10

Supported Program Outcomes (M)



335

10.1 Outcome Definition and Outcome Indicator.

Outcome (m): An understanding of best practices and standards and their application.

OUTCOME ATTRIBUTES


m.1

m.2

m.3



336

10.2 Course Learning Objectives Addressing the Outcome (The High-Class tool that we have been received was not include outcomes M, N therefore we left it empty till they fix it

Outcome (m): An understanding of best practices and

standards and their application. INST. & LEARNING TOOLS DIRECT ASSESSMENT TOOLS



Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam



337



0 0 0 0 0 0 0 0 0 0 0 0 0 0







Class Exposure 0



338

10.3 Outcome Survey


OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

m.1

m.2 m.3

No. of Attributes

3



339



Attr

ibut

e A

vera

ge

# s

tude

nts

Exc

eedi

ng C

riter

ia

% o

f stu

dent

s E

xcee

ding

Crit

eria

0 1 2 3 4 5

OU

TC

OM

E

AT

TR

IBU

TE

S

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

m.1

0.0 0 0%

m.2 0.0 0 0%

m.3 0.0 0 0%

No.

of

Attr

ibut

es

3



340

0% 0% 0%0%

10%20%30%40%50%60%70%80%90%

100%

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES


0.0 0.0 0.00.0

0.5

1.0

1.5

2.0

2.5

3.0

3.5

4.0

4.5

5.0

CL

AS

S A

VE

RA

GE

OUTCOME ATTRIBUTES




341




348

Divider 11

Supported Program Outcomes (N)



349

11.1 Outcome Definition and Outcome Indicator. Outcome (n): An ability to assist in the creation of an effective project plan.

OUTCOME ATTRIBUTES


n.1

n.2

n.3



350


Outcome (n): An ability to assist in the creation of an effective project plan.




Lis

ten

to

bri

ef

lect

ure

s

qu

izze

s b

efor

e cl

ass

acti

ve le

arn

ing

Lab

exe

rcis

es

Wor

k on

Lab

p

roje

cts

Qu

izes

1

Qu

izes

2

Lab

Exa

m

LA

B P

roje

ct

Mid

Exa

m

Fin

al E

xam



351



0 0 0 0 0 0 0 0 0 0 0 0 0 0







Class Exposure 0



352

11.3 Outcome Survey


OUTCOME ATTRIBUTES

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

n.1

n.2 n.3

No. of Attributes

3



353



Attr

ibut

e A

vera

ge

# s

tude

nts

Exc

eedi

ng C

riter

ia

% o

f stu

dent

s E

xcee

ding

Crit

eria

0 1 2 3 4 5

OU

TC

OM

E

AT

TR

IBU

TE

S

AP

PLI

CA

BIL

ITY


oo

r

Fai

r

Ad

equ

ate

Go

od

V. G

oo

d

Exc

elle

nt

n.1

0.0 0 0%

n.2 0.0 0 0%

n.3 0.0 0 0%

No.

of

Attr

ibut

es

3



354

0% 0% 0%0%

10%20%30%40%50%60%70%80%90%

100%

% S

TU

DE

NT

S A

CH

IEV

ING

CR

ITE

RIO

N

OUTCOME ATTRIBUTES


0.0 0.0 0.00.0

0.5

1.0

1.5

2.0

2.5

3.0

3.5

4.0

4.5

5.0

CL

AS

S A

VE

RA

GE

OUTCOME ATTRIBUTES




355




356

cpit 240 database systems - homepage · pdf filefaculty of computing and information...

Documents