Lab Sections: 021 Mon, 6:10pm9:00pm, ENGR2 226 022 Wed, 2:10pm5pm, ENGR2 226 TAs: Petko Bakalov pbak - PowerPoint PPT Presentation

1 / 9
About This Presentation
Title:

Lab Sections: 021 Mon, 6:10pm9:00pm, ENGR2 226 022 Wed, 2:10pm5pm, ENGR2 226 TAs: Petko Bakalov pbak

Description:

CS 166 DATABASE MANAGEMENT SYSTEMS. Some administration trivia... There is a class webpage! ... CS 166 Database Management Systems. Bertie Wooster Instructor: V. ... – PowerPoint PPT presentation

Number of Views:58
Avg rating:3.0/5.0
Slides: 10
Provided by: Informatio349
Category:
Tags: 00pm | 10pm5pm | 10pm9 | bakalov | engr2 | lab | mon | pbak | petko | sections | tas | wed

less

Transcript and Presenter's Notes

Title: Lab Sections: 021 Mon, 6:10pm9:00pm, ENGR2 226 022 Wed, 2:10pm5pm, ENGR2 226 TAs: Petko Bakalov pbak


1
Lab Sections021 Mon, 610pm-900pm, ENGR2
226022 Wed, 210pm-5pm, ENGR2 226TAs Petko
Bakalov ltpbakalov_at_cs.ucr.edugt
CS 166 DATABASE MANAGEMENT SYSTEMS 
Instructor Prof. Vassilis Tsotrasemail
tsotras_at_cs.ucr.eduhttp//www.cs.ucr.edu/tsotras/
Office Engineering Building II 335Office
Hours 200pm-315pm Tuesday/Thursday
2
Some administration trivia
  • There is a class webpage!
  • http//www.cs.ucr.edu/cs166
  • The overheads are online.
  • I recommend that you print out the slides (six to
    a page) before attending lecture.
  • You are obliged to visit the webpage twice a week
    to check for announcements, you are 100
    responsible for any announcements made.

3
Textbook
www.cs.wisc.edu/dbbook
2nd Edition
3rd Edition
4
Grading
  •  Midterm Exam 25
  •  Final Exam 35
  •  Homework Assignments 10
  •  Project 25
  • Lab attendance / pop quizzes 5

I may give pop quizzes during a class. If you are
late, you will not be allowed to take the quiz.
You cannot make up missed quizzes.   Homework
is due on my desk in the beginning of the class
on the date in question. After the class the
homework is considered late.
5
Course Goals
  • architecture of DBMS
  • ER-design
  • Relational model
  • Relational query languages
  • implementation issues (indexing, hashing)
  • Query optimization
  • advanced topics

6
Cheating Policy
Students must read and understand UCR policy on
academic honesty. http//www.cs.ucr.edu/index.php/
current/academic_dishonesty Anyone caught
cheating will given a final grade of F and may
have a letter placed in his or her permanent
record. Students are expected to take care that
others cannot cheat off them. For example, if
your homework is left on a shared hard drive or
an abandoned floppy and someone else hands it in,
you are liable and will have your grade adjusted
downward.
7
Classroom Attendance
Attendance is optional, you will not be penalized
for not showing up for class. However, it is hard
for me to imagine someone doing well in this
class without regular attendance. In addition,
if you are regularly absent you should expect the
lowest priority for office hours/ TA help and
email replies. Finally, I may make announcements
and or changes in class, you are responsible for
knowing what you missed. On the other hand, lab
attendance is mandatory.
8
Email/Phones
  • I strongly prefer that you only email me from
    your official UCR email. If you must email me
    from another account (i.e. a hotmail or yahoo
    account) you must state your full name, the last
    4 digits of your student ID, and your official
    UCR email address.
  • You must check your UCR email account at least
    twice week until one week after the finals.
  • DO sign up for the class mailing list.

9
Homework and projects must be carefully stapled
and contain a coversheet in the format shown on
the handouts. Any text, URL, or person consulted
must be referenced.
  • Homework 2 CS 166 Database
    Management Systems
  • Bertie Wooster Instructor
    V.Tsotras
  • ID 860-01-1234 Section 23
  • bertie_at_cs.ucr.edu TA Ragu Knoll
  • January 24, 2005
  •   
  • In completing this homework I consulted
  • Nilsson,N.J. Principles of Artificial
    Intelligence. Tioga Publishing Co. 1980 Pages
    72-84 (for clarification on the A algorithm).
  • Fellow student Bingo Little, who is my study
    partner. He showed me how to test for infinite
    sets in Matlab.
  • http//yoda.cis.temple.edu8080/UGAIWWW/lectures9
    5/search/alpha-beta.html (for a more detailed
    explanation of the Alpha Beta Pruning algorithm).
  • All the important code is original. Unimportant
    subroutines that are not completely original are
  • The isort function which is available at
    www.mathworks.com
  • The plotme function written with Bingo Little.
Write a Comment
User Comments (0)
About PowerShow.com