1, 2 and 3. Name and briefly describe 3 file types
Simplest file structure contains records in no particular order. As file grows and
shrinks, disk pages are allocated and de-allocated.
To support record
1. What is a candidate key?
A candidate key is a set of fields that uniquely identifies a tuple according to a
key constraint is called a candidate key for a relation. A candidate key should
satisfy two unique prop
1. What happens during the Query Optimization step of query processing?
During the query optimization step of query processing, the query optimizer
devises a strategy for executing query, it chooses among alternativ
1. The Age
1. The Age
Many of us have enough money in our pockets right now to buy all
the storage we will be able to fill for the next 5 years.
So having the storage capacity is no lon
1. There's so much volume in most data sets today that any usefulness of much of it will
never be discovered. A solution to this problem is to reduce the volume and raise the
information density. Name at least 6 way
1. Describe the data mining method of Association Rule Mining?
Association Rule mining is the process of trying to finding frequent patterns,
associations, correlations or casual structures between the entities. In
1. What is the difference between main memory storage and disks storage?
According to (http:/www.ehow.com/list_5890761_advantages-over-magneticdisk-storage.html), Main memory is far faster than disk storage. When th
1. What is a primary index?
The index that controls the current processing order of a file. It maintains an
index on the primary key. An index on a set of fields that includes the primary key
is called the primary i
1. Define each of the following:
Kilobyte is a unit of storage capacity that is equal to 1024 bytes
Megabyte is a unit of information equal to 1024 kilobytes
Gigabyte is a unit of information equal to 1000 megabyte
1. What is a transaction (in a database management context)?
A transaction is an atomic unit of database work specified by a DBMS. The
transaction can either be executed to completion or not executed at all. A
1. Why did C. J. Date recommend using a DBMS over a file system back in 1980 and what
failure caused Immon to recommend a Data Warehouse in addition to a DBMS?
DBMS unifies data resources, has centralize control, th
1. Define the term, Commit, as it is used in the context of database recovery.
Commit is the successful end-of-transaction operation. Changes to data items are
not made permanent until the Commit is issued by the T
CS 765: Introduction to Database Management Systems
Fall Semester 2010
[email protected], instructor
Please email all questions.
Text Database Management Systems Ramakrishnan/Gehrke, 3rd Edition.
All assignment descriptions are available a
1. Name and describe the three schema levels in the ANSI Schema Model?
The External Level schema (Views layer)
Represents the collection of views available to different end-users
Conceptual schema defines
Levels of Abstraction in data defined by various schema
View 1 View 2 View 3
(each with a view schema),
Conceptual (logical) schema
Views describe how users see d
2. Horizontal Data
Let's take a look at some issues and problems regarding data in general
CENTRALITY OF DATA
Data are central to every computer program.
If a program has no data, there is no input, no output, no constants, no variables.
It is hard to ima
One new idea introduced in this course is the emerging idea of structuring
data into vertical structures and processing across those vertical structures.
This is in contrast to the traditional method of structuring d
branch of CS ie concerned with the automation of intelligent behavior. several database, operations and control modules interacting in a complex fashion to produce desired results. TM: group of humans are asked to
blindly compare the performance of a C an
100 points total. 20 points for each question.
(a) Perform specific-to-general search on the following set of training examples.
Four questions from Chapter 4 and 5 (25 points each, 100 points total). Due on March 11
11:59pm to bb.
Write short answers if possible. Check the Course Information page for updated
Submit to bb.
If you dont ha
HW2: Due on Feb. 21 before class. Submit to bb.
Note: Write short answers if possible. Check the Course Information page for updated
Lisp programming hw1 (the same as posted as hw1 on Class Notes from Dr.
Slators lecture) (35 points)
chapter 1: P33: 1, 4, 11
chapter 2: P78: 3, 6, 10, 12
- Write a few sentences to explain, don't write long paragraphs
- You can discuss the questions with fellow students but you must finish yourself.
- Submit homework written or print on pap
5. Hand run the backtrack algorithm on the graph in Figure 3.29. Begin
from state A.
Keep track of the successive values of NSL, SL, CS, etc.
We assume there is no goal state in the search space. Initialize:
SL = [A]; NSL = [A]; DE = [ ]; CS = A;
Homework 4 100 points total. 20 points for each question.
Question 1: <!-[if !supportLists]->(a) <!-[endif]->Perform specific-to-general search on the following set of
training examples. In each step, list all the candidate cocnepts and explain why you el
Assignment # 3
Kanwal Gagneja W0771878
Q5. (a) Analyze the state space with respect to complexity and
This puzzle consists of a 7x1 frame holding 7 - 1 distinct movable tiles, and a blank space.
Branching Factor b is calculated as : cal
Q1: Find the solutions of LISP assignment as an attachment named
homework.txt, and the solutions of the same has been attached as
Q2: Hand run the backtrack algorithm on the graph in Figure 3.29.
Begin from state A.
Keep track of the su
Dr. Yan Gu
Answer 1: AI can be comprised of several database, operations and control modules
interacting in a complex fashion to produce desired results