COURSE MASTER SYLLABUS
A.
Academic Division: Business, Industry, and Technology
B.
Department:
Discipline:
C.
Course Number and Title: CSCI2050 Information Management
D.
Instructor Information:
 Name: Douglas Kranch
 Office Location:
 Office Hours:
 Phone Number: 419-755-4788
 E-Mail Address: dkranch@ ncstatecollege.edu
Technology
Computer Information Systems
Department Chair: Randy Storms
E.
Credit Hours: 3
F.
Prerequisites: CSCI1030 with a minimum grade of C-.
G.
Syllabus Effective Date: Fall 2012
H.
Textbook Title: Fundamentals of Database Systems




Author: Ramez Elmasri and Shamkant Navathe
Copyright Year: 2010
Edition: 6th
ISBN #: 0136086209
I.
Workbook(s) and/or Lab Manual: None
J.
Course Description: An introduction to technologies of current importance in information
management application development including database management systems, search
strategies, and hypermedia concepts.
K.
Core Learning Objectives:
Core Learning
Objectives
Communication –
Written
Assessment -- How it is met & When it is met. All
assignments are graded.
Communication –
Speech
Culture and
Community
Critical Thinking
Computer Literacy
Computation
L.
Problems posed in programming assignments given throughout
the semester. Midterm and final exam problems.
Correct application of the database principles, done throughout
the semester.
Calculation required for solving the programming assignments
completed throughout the semester, problems in the midterm
and final exams.
Course Outcomes and Assessment Methods:
Upon successful completion of this course, the student shall:
Outcomes
1. Critique/defend a small- to mediumsize information application as to its
satisfying user information needs.
2. Show uses of explicitly stored
metadata/schema associated with data
3. Describe several technical solutions
to the problems related to information
privacy, integrity, security, and
preservation.
4. Cite the basic goals, functions,
models, components, applications,
and social impact of database
systems.
5. Use a declarative query language to
elicit information from a database.
6. Describe the conceptual data model,
physical data model, and
representational data model based on
the types of concepts that they
provide to describe the database
structure.
7. Describe the modeling concepts and
notation of the entity-relationship
model and UML, including their use
in data modeling.
8. Describe the basic principles of the
relational data model.
Assessment - - How it is met & When it is met.
All assignments are graded.
Short answer item on the midterm and final
exams.
Short answer item on the midterm exam.
Short answer item on the midterm exam.
Short answer item on the midterm and final
exams.
Problems posed in five programming assignments
which must be solved correctly, given throughout
the semester.
Short answer item on the midterm exam.
Short answer item on the midterm and final
exams.
Short answer item on the midterm and final
exams.
9. Prepare a relational schema from a
conceptual model developed using
the entity- relationship model
10. Explain and demonstrate the concepts
of entity integrity constraints and
referential integrity constraints.
11. Demonstrate use of the relational
algebra operations from mathematical
set theory (union, intersection,
difference, Cartesian product) and the
relational algebra operations
developed specifically for relational
databases (select, project, join,
division).
12. Identify whether a relation is in 1NF,
2NF, 3NF, or BCNF and normalize a
1NF relation into a set of 3NF (or
BCNF) relations
13. Describe what issues are specific to
efficient information retrieval.
14. Design and implement a small to
medium size information storage and
retrieval system.
15. Design and implement web-enabled
information retrieval applications
using appropriate authoring tools.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
Problems posed in five programming assignments
which must be solved correctly, given throughout
the semester.
Problems posed in five programming assignments
which must be solved correctly, given throughout
the semester. Midterm and final exam problems
which must be solved correctly.
Problems posed in five programming assignments
which must be solved correctly, given throughout
the semester.
Short answer item on the midterm and final
exams.
Short answer item on the midterm and final
exams.
Problems posed in five programming assignments
which must be solved correctly, given throughout
the semester.
Problems posed in five programming assignments
which must be solved correctly, given throughout
the semester.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
48.
49.
50.
51.
52.
53.
54.
55.
56.
M.
Course Topical Outline:
•
•
Information storage and retrieval
Information management applications
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
Information capture and representation
Metadata/schema association with data
Analysis and indexing
Search, retrieval, linking, navigation
Declarative and navigational queries
Information privacy, integrity, security, and preservation
Scalability, efficiency, and effectiveness
Concepts of information assurance (data persistence, integrity)
History and motivation for database systems
Components of database systems
DBMS functions
Database architecture and data independence
Use of a declarative query language
Data modeling
Conceptual models (such as entity-relationship or UML)
Object-oriented model
Relational data model
Semistructured data model (expressed using DTD or XMLSchema, for example)
Mapping conceptual schema to a relational schema
Entity and referential integrity
Relational algebra and relational calculus
Overview of database languages
SQL (data definition, query formulation, update sublanguage, constraints, integrity)
QBE and 4th-generation environments
Embedding non-procedural queries in a procedural language
Introduction to Object Query Language
Stored procedures
Database design
Functional dependency
Decomposition of a schema; lossless-join and dependency-preservation properties
of a decomposition
Candidate keys, superkeys, and closure of a set of attributes
Normal forms (1NF, 2NF, 3NF, BCNF)
Multivalued dependency (4NF)
Join dependency (PJNF, 5NF)
Representation theory
Characters, strings, coding, text
Documents, electronic publishing, markup, and markup languages
Tries, inverted files, PAT trees, signature files, indexing
Morphological analysis, stemming, phrases, stop lists
Term frequency distributions, uncertainty, fuzziness, weighting
Vector space, probabilistic, logical, and advanced models
Information needs, relevance, evaluation, effectiveness
Thesauri, ontologies, classification and categorization, metadata
Bibliographic information, bibliometrics, citations
Routing and (community) filtering
Search and search strategy, information seeking behavior, user modeling, feedback
Information summarization and visualization
•
•
•
•
•
•
•
•
•
•
•
N.
Integration of citation, keyword, classification scheme, and other terms
Protocols and systems (including Z39.50, OPACs, WWW engines, research
systems)
Hypertext models (early history, web, Dexter, Amsterdam, HyTime)
Link services, engines, and (distributed) hypertext architectures
Nodes, composites, and anchors
Dimensions, units, locations, spans
Browsing, navigation, views, zooming
Automatic link generation
Presentation, transformations, synchronization
Authoring, reading, and annotation
Protocols and systems (including web, HTTP)
Course Assignment Calendar:
Assignments
Midterm Exam
Final Exam
O.
Recommended Course Grading Scale:
100-95
94-92
91-89
88-86
85-83
82-80
A
AB+
B
BC+
79-77
76-74
73-71
70-68
67-65
64-Below
C
CD+
D
DF