8/19/2003cs 303 – administrivia lecture 0 1 administrivia labs homework grades exams quiz
TRANSCRIPT
8/19/2003 CS 303 – AdministriviaLecture 0
1
Administrivia
Labs
Homework
Grades
Exams
Quiz
8/19/2003 CS 303 – AdministriviaLecture 0
2
CS 303 – Algorithms and Data Structures
Efficient design of data structures, recursive algorithms, algorithms for sorting and searching, complexity analysis of algorithms, parallel and distributed algorithms, applications of algorithms and data structures in problems, state spaces and search strategies in artificial intelligence, and the relational data model.
Pre-Requisite: CS 302 and CS 250 (C or better in each)
Instructor: Kenneth Sloan [email protected]
Text: Data Structures & Algorithm Analysis in Java, Weiss
8/19/2003 CS 303 – AdministriviaLecture 0
3
Laboratory Work
Everyone is expected to be able to program (in Java)
This is not a course in Java, but you will do a lot of it!
Details of lab will be presented…in lab!
8/19/2003 CS 303 – AdministriviaLecture 0
4
Grades
30% Homework – in Laboratory
30% Programs – in Laboratory
40% Exams – in Class
Quiz 1 – approximately week 5
Quiz 2 – approximately week 10
Final Exam – as scheduled by UAB (Exercise: look it up!)
8/19/2003 CS 303 – AdministriviaLecture 0
5
Homework
Many exercises in the text – do what you need!
Written assignments due approximately every 2 weeks
Programming assignments due approximately every 2 weeks
Individual work
Consultation and discussion are encouraged
Copying is forbidden and stupid
Computing environment
Shared, open facility
“Anti-social behavior will not be tolerated”
8/19/2003 CS 303 – AdministriviaLecture 0
6
Exams
Open book – the textbook
Open Notes – your notes
Quizzes – in class, schedule to be announced
Final – see UAB Calendar
8/19/2003 CS 303 – AdministriviaLecture 0
7
Quiz
Given:
SmallInteger[0..99]
SmallVector Array [0..999] of SmallInteger
Write a Subroutine to sort a SmallVector, in place
Sort(V)
You may use any language
Do not attempt to write a full program – just a small subroutine, please
First cut – nothing fancy; no bells and whistles
Analyze:
assume that your routine takes 1 unit of time to sort 1 item.
How long will it take on 10, 100, 1000, 10000 items?