Introduction CS 111 On-Line MS Program Operating Systems Peter Reiher

Slides:



Advertisements
Similar presentations
Today’s Agenda  Syllabus CS2336: Computer Science II.
Advertisements

Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
Intro to CIT 594
Intro to CIT 594
General information CSE 230 : Introduction to Software Engineering
Statistical Methods in Computer Science Course Introduction Ido Dagan.
Intro to CIT 594
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.
COMP Introduction to Programming Yi Hong May 13, 2015.
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
Chapter Eight Academic Survival Skills. Study Skills  For most students time is the greatest issue.  The first rule to follow is to allow two or three.
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
CS355 Advanced Computer Architecture Fatima Khan Prince Sultan University, College for Women.
Introduction to Data Structures
Course Information Sarah Diesburg Operating Systems COP 4610.
Course Information Andy Wang Operating Systems COP 4610 / CGS 5765.
TIPS FOR EFFECTIVE TEACHING IN STEM HIGHER EDUCATION Benjamin C. Flores, Ph.D. Director, Computing and Electrical and Engineering Division MIE Project.
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
Lecture 1 Page 1 CS 111 Summer 2013 Introduction CS 111 Operating System Principles Peter Reiher.
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
COP4610/CGS5765 Operating Systems Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: W M F 9:10am – 10:00am, or by appointments.
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.
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
Data Structures and Algorithms in Java AlaaEddin 2012.
Lecture 1 Page 1 CS 236 Online Introduction CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
Computer Networks CNT5106C
ICS 151 Digital Logic Design Spring 2004 Administrative Issues.
Introduction to CSCI 1311 Dr. Mark C. Lewis
CSc 120 Introduction to Computer Programing II
Computer Network Fundamentals CNT4007C
電腦圖學 Computer Graphic with Programming
Course Overview - Database Systems
Course Information EECS 2031 – Section A Fall 2017.
CS101 Computer Programming I
Course Information and Introductions
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
CS533 Concepts of Operating Systems Class 1
Data Structures Algorithms: (Slides to be Adopted from Goodrich and aligned with Weiss' book) Instructor: Ganesh Ramakrishnan
Computer Science 102 Data Structures CSCI-UA
September 27 – Course introductions; Adts; Stacks and Queues
CS 201 – Data Structures and Discrete Mathematics I
Computer Networks CNT5106C
Course Overview - Database Systems
Andy Wang Operating Systems COP 4610 / CGS 5765
Lecture 0 Course Information
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Intro to CIT 594
EE422C Software Design and Implementation II
Andy Wang Operating Systems COP 4610 / CGS 5765
CSS-304: Computer Systems Interface
Andy Wang Operating Systems COP 4610 / CGS 5765
Intro to CIT 594
Intro to CIT 594
Computer Networks CNT5106C
Andy Wang Operating Systems COP 4610 / CGS 5765
CS533 Concepts of Operating Systems Class 1
CS201 – Course Expectations
Presentation transcript:

Introduction CS 111 On-Line MS Program Operating Systems Peter Reiher

Outline Administrative materials Why study operating systems?

Administrative Issues Instructor and TA Load and prerequisites Web site, syllabus, reading, and lectures Exams, homework, projects Grading Academic honesty

Instructor: Peter Reiher UCLA Computer Science department faculty member Long history of research in operating systems Email: reiher@cs.ucla.edu Office: 3532F Boelter Hall Office hours to be announced Often available at other times

TA TBA

Instructor/TA Division of Responsibilities Instructor handles all lectures, readings, 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

Web Site What’s there: Taped lectures are on Courseweb site http://www.lasr.cs.ucla.edu/classes/cs111_online.winter17 What’s there: Schedules for reading, lectures, exams, projects Copies of lecture slides (Powerpoint) Announcements Sample exam and final problems Taped lectures are on Courseweb site

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 35 Tools for compiling, running, and debugging complex programs

Course Format Two weekly (average 40 page) reading assignments Mostly from the primary text A few supplementary articles available on web Two weekly (average 100 minute) lectures Broken into 20-45 minute segments Four (10-25 hour) team projects Exploring and exploiting OS features One design project (10-25 hours) Working off one of the team projects

Course Load Reputation: THE hardest u/g CS class Fast pace through much non-trivial material Expectations you should have lectures 4-6 hours/week reading 3-6 hours/week projects 3-20 hours/week exam study 5-15 hours (twice) Keeping up (week by week) is critical Catching up is extremely difficult

Primary Text for Course Saltzer and Kaashoek: Principles of Computer Systems Design Background reading for most lectures Perhaps supplemented with web-based materials

Course Lectures Lectures will typically not Lectures will Repeat material, well-covered in the reading Lectures will Clarify and elaborate on the text Work through non-trivial examples Explore implications, applications Present material absent from the text All slides posted on-line To save you time taking notes As a basis for exam study

An Interactive On-line Course And I’ll just ask them in class, not answer them. We may discuss answers in the on-line forum. OS is a concept-rich course Learn new concepts by interacting with them Exploring examples, implications, applications Tangential issues are often the most illuminating This is difficult in pre-recorded lectures Proposed substitutes for in-class discussion I will pose questions during every lecture Typically about motivations and implications Consider the question as a start for an interactive discussion On-line forum for interactive discussion Pose questions, discuss alternatives and implications Delayed, but better considered answers, permanent record Questions of this kind will pop up in cloud bubbles like this in lectures.

Course Grading Basis for grading: 1 midterm exam 25% Final exam 30% Projects 45% 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

Midterm Examination When: 5th week Scope: All lectures up to the exam date Approximately 60% lecture, 40% text Format: Closed book 10-15 essay questions, most with short answers Goals: Test understanding of key concepts Test ability to apply principles to practical problems

Final Exam When: Scheduled final exam period 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

Lab Projects Format: Goals: Lab and lecture are fairly distinct 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

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

Grading: Partial and Extra Credit Partial credit Will be awarded on all problems/projects, depending on: Clear understanding of problem Reasonable approach to problem Incomplete or flawed solutions Extra credit Extra credit problems on exams Likely to be more difficult than the other problems Raise possible score above 100%

Late Assignments & Make-ups Labs Due dates set by TA TA also sets policy on late assignments Exams Only possible with prior consent of the instructor

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

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