Lecture 1 Page 1 CS 111 Summer 2013 Introduction CS 111 Operating System Principles Peter Reiher.

Slides:



Advertisements
Similar presentations
John Hurley Cal State LA
Advertisements

CSEE W4140 Networking Laboratory Opening Lecture Jong Yul Kim
Today’s Agenda  Syllabus CS2336: Computer Science II.
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:
Computers in Principle & Practice I - V Deena Engel Computers in Principle and Practice I V , Sections 1 & 2 Fall, 2009 Deena Engel .
Intro to CIT 594
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
Introduction To Online Learning Prince George’s Community College.
Syllabus Please print off and read through syllabus completely. It can be found on my website which is :
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
Computer Network Fundamentals CNT4007C
Lecture 1 Page 1 CS 111 Online Introduction CS 111 On-Line MS Program Operating Systems Peter Reiher.
1 HCC Brandon Independent Study Orientation Power Point Instructor: Tiffany Cantrell.
Introduction to Programming Summer 2010 Akil M. Merchant.
Welcome to CS 3260 Dennis A. Fairclough. Overview Course Canvas Web Site Course Materials Lab Assignments Homework Grading Exams Withdrawing from Class.
COMP Introduction to Programming Yi Hong May 13, 2015.
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
MGS 351 Introduction to Management Information Systems
How to be an online student. How does it work? An online course follows a schedule and syllabus with due dates for assignments (just like an on-campus.
Course Introduction Software Engineering
ECEN 301Discussion #1 – Syllabus1 All Sections MWF 1:00 – 1:50 PM 256 CB Lecture: MW Recitation: F Labs: M or Th Instructor: Prof. David Long Office: CB.
Welcome to Physics 1403!!. Class Web Page! There, you can find: 1. Posted (MS Word format): Syllabus,
CS355 Advanced Computer Architecture Fatima Khan Prince Sultan University, College for Women.
1 8/29/05CS150 Introduction to Computer Science 1 Professor: Shereen Khoja
Introduction to Databases Computer Science 557 September 2007 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
Class Introduction Surface Mining ©2007 revised 2011 Dr. Bradley C Paul.
Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.
Course Information Sarah Diesburg Operating Systems COP 4610.
Course Information Andy Wang Operating Systems COP 4610 / CGS 5765.
Lecture Section 001 Spring 2008 Mike O’Dell CSE 1301 Computer Literacy.
CPSC 121: Models of Computation Unit 0 Introduction George Tsiknis Based on slides by Patrice Belleville and Steve Wolfman.
CSE 1105 Week 1 CSE 1105 Course Title: Introduction to Computer Science & Engineering Classroom Lecture Times: Section 001 W 4:00 – 4:50, 202 NH Section.
Evaluation & Assessment 10/31/06 10/31/06. Typical Point Breakdown COURSE GRADES: Grades will be assigned on the basis of 450 points, distributed as follows:
January 16, 2007 COMS 4118 (Operating Systems I) Henning Schulzrinne Dept. of Computer Science Columbia University
CSE 1105 Week 1 CSE 1105 Introduction to Computer Science & Engineering Time: Wed 4:00 – 4:50 Thurs 9:30 – 10:20 Thurs 4:00 – 4:50 Place: 100 Nedderman.
 Course Overview Distributed Systems IT332. Course Description  The course introduces the main principles underlying distributed systems: processes,
Physics 1B3-summer Lecture 11 Welcome to Physics 1B03 !
COP4610/CGS5765 Operating Systems Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: W M F 9:10am – 10:00am, or by appointments.
CS 139 – Algorithm Development MS. NANCY HARRIS LECTURER, DEPARTMENT OF COMPUTER SCIENCE.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections Ms. Susan Mitchell.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2001 Sections Ms. Susan Mitchell.
Data Structures and Algorithms in Java AlaaEddin 2012.
Introduction to Financial Management. Overview of Financial Management Introduction Keys to Success Recitations Class Structure - Syllabus Text – Financial.
Lecture 1 Page 1 CS 236 Online Introduction CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
Computer Networks CNT5106C
Operating Systems CMPSC 473 Introduction and Overview August 24, Lecture 1 Instructor: Bhuvan Urgaonkar.
ICS 151 Digital Logic Design Spring 2004 Administrative Issues.
Welcome to Physics 1403!!. Class Web Page! There, you can find: 1. Posted (Word format): Syllabus,
Networking CS 3470, Section 1 Sarah Diesburg
Computer Network Fundamentals CNT4007C
Course Overview - Database Systems
Networking CS 3470, Section 1 Sarah Diesburg
Computer Networks CNT5106C
Purpose of Class To prepare students for research and advanced work in security topics To familiarize students working in other networking areas with important.
Introduction CS 111 On-Line MS Program Operating Systems Peter Reiher
E 96 Introduction to Engineering Design Peter Reiher UCLA
It’s called “wifi”! Source: Somewhere on the Internet!
Course Information Mark Stanovich Principles of Operating Systems
Introduction CS 111 On-Line MS Program Operating Systems Peter Reiher
Computer Science 102 Data Structures CSCI-UA
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Presentation transcript:

Lecture 1 Page 1 CS 111 Summer 2013 Introduction CS 111 Operating System Principles Peter Reiher

Lecture 1 Page 2 CS 111 Summer 2013 Outline Administrative materials Why study operating systems?

Lecture 1 Page 3 CS 111 Summer 2013 Administrative Issues Instructor and TA Load and prerequisites Web site, syllabus, reading, and lectures Quizzes, exams, homework, projects Grading Academic honesty

Lecture 1 Page 4 CS 111 Summer 2013 Instructor: Peter Reiher UCLA Computer Science department faculty member Long history of research in operating systems Office: 3532F Boelter Hall – Office hours: TTh 1-2 – Often available at other times

Lecture 1 Page 5 CS 111 Summer 2013 TA Vahab Pournagshband – Lab sessions Fridays from 2-4 PM, in 5420 BH Office hours to be announced

Lecture 1 Page 6 CS 111 Summer 2013 Instructor/TA Division of Responsibilities Instructor handles all lectures, readings, quizzes, and tests – Ask me about issues related to these TA handles projects – Ask him about issues related to these Generally, instructor won’t be involved with project issues – So direct those questions to the TA

Lecture 1 Page 7 CS 111 Summer 2013 Web Site What’s there: – Schedules for reading, lectures, quizzes, exams, projects – Copies of lecture slides (Powerpoint) – Announcements – Sample quiz, exam and final problems

Lecture 1 Page 8 CS 111 Summer 2013 Prerequisite Subject Knowledge CS 32 programming – Objects, data structures, queues, stacks, tables, trees CS 33 systems programming – Assembly language, registers, memory – Linkage conventions, stack frames, register saving CS 118 networking – Packets, addressing, routing, protocols, – Protocol layering I will complement CS 151 coverage of – Traps, interrupts, DMA

Lecture 1 Page 9 CS 111 Summer 2013 Course Format Two weekly (average 20 page) reading assignments – Mostly from the primary text – A few supplementary articles available on web Two weekly lectures – Each preceded by a quiz on the reading – First quiz before lecture 2 Four (10-25 hour) team projects – Exploring and exploiting OS features One design project (10-25 hours) – Working off one of the team projects

Lecture 1 Page 10 CS 111 Summer 2013 Course Load Reputation: THE hardest undergrad CS class – Fast pace through much non-trivial material – Summer schedule only increases the pace Expectations you should have – lectures4-6 hours/week – reading3-6 hours/week – projects3-20 hours/week – exam study5-15 hours (twice) Keeping up (week by week) is critical – Catching up is extremely difficult

Lecture 1 Page 11 CS 111 Summer 2013 Primary Text for Course Saltzer and Kaashoek: Principles of Computer Systems Design – Background reading for most lectures Supplemented with web-based materials

Lecture 1 Page 12 CS 111 Summer 2013 Course Grading Basis for grading: – 14 daily quizzes10% (total) – 1 midterm exam20% – Final exam25% – Projects45% I do look at distribution for final grades – But don’t use a formal curve All scores available on MyUCLA – Please check them for accuracy

Lecture 1 Page 13 CS 111 Summer 2013 Quizzes When? Before each lecture, in class Scope:Reading assigned for that lecture Format: – 4 simple questions (definitions, examples,...) – Should require at most one sentence answer Closed book – You should have read it already Goals: – To test your familiarity with major concepts – To persuade you to do reading prior to lecture

Lecture 1 Page 14 CS 111 Summer 2013 Midterm Examination When: end of the 4th week (in recitation section) Scope: All lectures up to the exam date – Approximately 60% lecture, 40% text Format: – Closed book – essay questions, most with short answers Goals: – Test understanding of key concepts – Test ability to apply principles to practical problems

Lecture 1 Page 15 CS 111 Summer 2013 Final Exam When: Last day of 8 th week (recitation section) Scope: Entire course Format: – 6-8 hard multi-part essay questions – You get to pick a subset of them to answer Goals: – Test mastery of key concepts – Test ability to apply key concepts to real problems – Use key concepts to gain insight into new problems

Lecture 1 Page 16 CS 111 Summer 2013 Lab Projects Format: – 4 regular projects – 2 mini-projects – May be done solo or in teams Goals: – Develop ability to exploit OS features – Develop programming/problem solving ability – Practice software project skills Lab and lecture are fairly distinct – Instructor cannot help you with projects – TA can’t help with lectures, exams

Lecture 1 Page 17 CS 111 Summer 2013 Design Problems Each lab project contains suggestions for extensions Each student is assigned one design project from among the labs – Individual or two person team Requires more creativity than labs – Usually requires some coding Handled by the TA

Lecture 1 Page 18 CS 111 Summer 2013 Late Assignments & Make-ups Quizzes – There are no make-ups – This would defeat their purpose Labs – Due dates set by TA – TA also sets policy on late assignments Exams – Only possible with prior consent of the instructor

Lecture 1 Page 19 CS 111 Summer 2013 Academic Honesty It is OK to study with friends – Discussing problems helps you to understand them It is OK to do independent research on a subject – There are many excellent treatments out there But all work you submit must be your own – Do not write your lab answers with a friend – Do not copy another student's work – Do not turn in solutions from off the web – If you do research on a problem, cite your sources I decide when two assignments are too similar – And I forward them immediately to the Dean If you need help, ask the instructor

Lecture 1 Page 20 CS 111 Summer 2013 Academic Honesty – Projects Do your own projects – Work only with your team-mate – If you need additional help, ask the TA You must design and write all your own code – Other than cooperative work with your team-mate – Do not ask others how they solved the problem – Do not copy solutions from the web, files or listings – Cite any research sources you use Protect yourself – Do not show other people your solutions – Be careful with old listings

Lecture 1 Page 21 CS 111 Summer 2013 Academic Honesty and the Internet You might be able to find existing answers to some of the assignments on line Remember, if you can find it, so can we It IS NOT OK to copy the answers from other people’s old assignments – People who tried that have been caught and referred to the Office of the Dean of Students ANYTHING you get off the Internet must be treated as reference material – If you use it, quote it and reference it