8/19/2003CS 303 – Administrivia Lecture 0 1 Administrivia Labs Homework Grades Exams Quiz.

Slides:



Advertisements
Similar presentations
CSc 2310 Principles of Programming (Java)
Advertisements

CSE 5522: Survey of Artificial Intelligence II: Advanced Techniques Instructor: Alan Ritter TA: Fan Yang.
Introduction to Financial Management. Overview of Financial Management Introduction Keys to Success Stay up in class (complete assignments on time each.
Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
1-1 ICS102: Introduction To Computing King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science.
1 Intro to CIT 594 ~matuszek/cit594.html.
ICS 201 Course Overview.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
1-1 ICS201: Introduction To Computer Science King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer.
Course Material: webcourses.kfupm.edu.sa
ECE 201 Electrical Networks I Instructor: Professor (not Dr.) Richard Farmer.
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
EE 220 (Data Structures and Analysis of Algorithms) Instructor: Saswati Sarkar T.A. Prasanna Chaporkar, Programming.
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
CSCE 312 Computer Organization Lecture 0: Course Administration EJ Kim Department of Computer Science and Engineering 338B Bright
Course Introduction Computer Science Department CS141:Computer Programming 1 Fall 2014 Dr. Hamid Al-Hamadi.
CS-2852 Data Structures LECTURE 1A Andrew J. Wozniewicz Image copyright © 2010 andyjphoto.com.
Data Structures & Agorithms Lecture-1: Introduction.
Data Structures CS231 Instructor: Dr. Hammad Majeed Office: Academic Block 4 First Floor.
COMP 151: Computer Programming II Spring Course Topics Review of Java and basics of software engineering (3 classes. Chapters 1 and 2) Recursion.
1 Object Oriented Programming Computer Systems Engineering (D2) and Programming (P)
© 2004 Goodrich, Tamassia CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler.
Overview of the Course. Critical Facts Welcome to CISC 672 — Advanced Compiler Construction Instructor: Dr. John Cavazos Office.
Computer Network Fundamentals CNT4007C
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
1 CS 233 Data Structures and Algorithms 황승원 Fall 2010 CSE, POSTECH.
CSc 2310 Principles of Programming (Java) Dr. Xiaolin Hu.
CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /
Welcome to Physics 1403!!. Class Web Page! There, you can find: 1. Posted (MS Word format): Syllabus,
Introduction to Databases Computer Science 557 September 2007 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
8/20/2003CS 770 – Administrivia Lecture 0 1 Administrivia Course Description Grades Homework Programming Exams Quiz.
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
CS 445/545 Machine Learning Winter, 2012 Course overview: –Instructor Melanie Mitchell –Textbook Machine Learning: An Algorithmic Approach by Stephen Marsland.
CS-2851 Dr. Mark L. Hornick 1 CS-2852 Data Structures Dr. Mark L. Hornick Office: L341 Phone: web: people.msoe.edu/hornick/
Matter and Interactions 1 Fall 2006 Matter & Interactions I Physics Professor & Lecturer: Dr. Reinhard Schumacher Teaching Assistants: Ms. Elisa.
Welcome to: Mr. O’Neill’s AP Computer Science Class SAN MARCOS HIGH SCHOOL KNIGHT PRIDE Leading... Now Tomorrow Forever.
1 ISEC0511 Programming for Information System Security Lecture Notes #1 Introduction.
Faculty Purpose of CS 100 Prepare to live in an information world Prepare for more training in computing NOT - to learn to program (CS 142) NOT - to.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
Course overview Course title: Design and Analysis of Algorithms Instructors: Dr. Abdelouahid Derhab Credit hours:
SE-2030 Software Engineering Tools and Practices SE-2030 Dr. Mark L. Hornick 1.
Intro to CIT 594
CS 162 Introduction to Computer Science II Winter, 2014: 60 Spring, 2014: 60 Summer, 2014: 71.
King Saud University1 CSC 112 Java Programming I Introduction.
Data Structures and Algorithms in Java AlaaEddin 2012.
Computer Networks CNT5106C
CE-2810 Dr. Mark L. Hornick 1 CE-2810 Embedded Systems Software 2 Dr. Mark L. Hornick web: people.msoe.edu/~hornick webCT: webct.msoe.edu.
Data Structures By Dr. Mehedi Masud ِAssociate Professor, Computer Science Dept. College of Computers and Information Systems Taif University 1.
CMPT 238 Data Structures Instructor: Tina Tian. General Information Office: RLC 203A Office Hour: Tue and Fri 12:30 - 2:00PM.
IMS 4212: Course Introduction 1 Dr. Lawrence West, Management Dept., University of Central Florida ISM 4212 Dr. Larry West
COMP9024: Data Structures and Algorithms Course Outline Hui Wu Session 1, 2016
CS140 – Computer Programming 1 Course Overview First Semester – Fall /1438 – 2016/2017 CS140 - Computer Programming 11.
COMP9024: Data Structures and Algorithms
CSc 1302 Principles of Computer Science II
ECE4823: WIRELESS AND MOBILE NETWORKS
Object-Oriented Programming
Data Structures Algorithms: (Slides to be Adopted from Goodrich and aligned with Weiss' book) Instructor: Ganesh Ramakrishnan
Artificial Intelligence (CS 461D)
Advanced College English
Algorithm Design and Analysis
GTECH 709 Criteria for evaluation
Instructor Provided Questions
Physics 101: Lecture 29 Exam Results & Review
Computer Programming 1 introduction to JAVA Lecture 1 Instructor: Ruba A. Salamah Islamic University of Gaza.
Orientation CSC 111.
Folsom High School Class: AP Psychology Grade: 11th & 12th
CS Problem Solving and Object Oriented Programming Spring 2019
CS102 Algorithms & Programming II
Presentation transcript:

8/19/2003CS 303 – Administrivia Lecture 0 1 Administrivia Labs Homework Grades Exams Quiz

8/19/2003CS 303 – Administrivia Lecture 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 Text: Data Structures & Algorithm Analysis in Java, Weiss

8/19/2003CS 303 – Administrivia Lecture 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/2003CS 303 – Administrivia Lecture 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/2003CS 303 – Administrivia Lecture 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/2003CS 303 – Administrivia Lecture 0 6 Exams Open book – the textbook Open Notes – your notes Quizzes – in class, schedule to be announced Final – see UAB Calendar

8/19/2003CS 303 – Administrivia Lecture 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, items?