|
|
|
Lecture
meetings: MWF Prof. Euripides Montagne GTA: Hongliang Gao |
|
|
||
COT4810 Topics in Computer Science
|
Updates:
2/14/04 Homework #3 posted.
2/09/04 Correct the mistake in Prof. Montagne's email link.
Grading Criteria of HW5
50% Submit on time
10% Description / definition of
CSR & CSC
30% CSR if more space efficient
than CSC because there are more columns (distinct terms) than rows (documents)
in the experimental benchmarks.
10% The query processing time
will be proportional to the size of storage structure. This is why CSR is also more
time efficient than CSC.
Note: Actually the
statement of that CSR is better than CSC is based on the experiments. For a situation
there is more documents than distinct terms, CSC will be more efficient.
Moreover, you can see, the algorithm in the paper is not efficient at all.
Normally, the number of terms in a query will be far less than the number of
distinct terms. So, if in the algorithm we skip these columns, of which the
corresponding items in the query are 0, the CSC algorithm will be far more time
efficient. However, CSR cannot make use of this feature.
Grading Criteria of HW4
40% Submit on time
20% Basic description
5% Movable
media sled.
5% Fixed
read/write heads (probe tips).
10% First seek,
then the sled moves in the Y dimension while the probe tips access the meda.
25% Data organization
10% The sled is
divided into regions. Each region is accessible by exactly one probe tip.
5%
Description of Cylinders.
5%
Description of Tracks.
5%
Description of Sectors.
15% Positioning time (greater of
the X and Y seek times)
Note: As the
positioning time question is only asked in the class and not in the homework
description, all students get this 15 points. This is where the “+15” I put on
your homework comes fromJ
Welcome to the
course web page for COT 4810. Here you may find the syllabus as well as a list
of presentations.
Syllabus
Presentations
|
|
Posted |
Due |
|
|
|
|
|
|
|
|
|
|
|
|
|
2/28/04 |
3/5/04 |
|
|
4/2/04 |
4/9/04 |
|
|
Homework 6 |
|
|
Course Objectives
and Pre -requisites:
To study a range of topics from the field of Computer Science; application of
oral and written communication skills; social, ethical and moral issues of
computing.
Course Topics:
Analysis of Algorithms, Artificial Intelligence, Complexity Theory, Data
Structure, Logic and System Design, Theory of Computation, Automata and
Languages, Computer Graphics, Coding and Cryptography, and Applications.
Prerequisites: COP 3530 and COP 3402.
Reference Guide:
The textbook for the course is: The New Turing Omnibus, by A.K. Dewdney, A.W.H
Freeman/OWL Books, 2001.
Style of Class Meetings:
Class meetings will not consist of traditional lectures, with the instructor
doing most of the talking and the student doing most of the listening. Rather,
meetings will consist of discussions on each topic and the instructor will help
guide the discussion by asking questions.
Important Dates:
- Withdrawal Deadline is
- Holidays are:
- Martin Luther King Jr. Day January 19, 2004
- Spring Break
Grading
Policy:
(1) Participation (15%): attendance; participation in questions and
discussions; the person who initiates a question, and the people who follow up,
should write up the questions and answers and submit to the presenter, so that
the presenter can summarize a list of the questions/answers and the names of
people who ask the questions, and submit the summary to the instructor.
(2) Homework assignments (20%): weekly; one question for each presented topic;
typed up with spelling checked; turn in a hardcopy on its due date. (3) Three
presentations (10% each):
- One topic assigned by the instructor chosen from topics of the text; the
second and third topics also assigned by the instructor from the students'
submitted list of 3 preferred topics chosen from the text or other sources
related to CS
- Each presentation must be prepared in PowerPoint format, and will be
evaluated based on the contents, presentation style, answers to questions, time
management, and an abstract (around 100 words) submitted via email to the
instructor on or prior to the day of presentation
- Before the presentation, each presenter must prepare 3 homework questions
with answers for the presented topic, submitted to the instructor(via email)
along with the abstract (the instructor will make the weekly homework
assignments based on the questions submitted by the presenters)
- Each presenter must submit a summary of the questions/answers discussed
during the presentation, along with the names of the people who participated;
the summary should be typed up and submitted in a hardcopy within the next two
classes after presentation
(4) Three reports (10% each): Reports in Word or PDF format, approximately 5
double-spaced pages including abstract and at least 5 references; reports are
due ten days after the presentation via a hardcopy.
(5) Ethical and moral issues (5%): there must be (non-superficial) discussion
related to ethical, moral issues of computing in at least one presentation
and/or in one of the reports.
Letter grades: Over 89: A. Over 79: B. Over 69: C. Over 50: D. Below 50: F.
Late Penalty: First day: 20% less. Second day: 50% less.
Cheating Policy:
First Strike: The assignment gets 0 points and the final semester letter is
down graded by one
letter.
Second Strike: Letter grade F and a letter is placed in student's file.
please report
any mistake/problem here.
last modified: