Christo Wilson Lecture 1: Logistics (a.k.a. The boring slides)

Slides:



Advertisements
Similar presentations
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Advertisements

Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Classroom Management Institute for Teaching & Learning By Dr. Amit Savkar 2.
CSS446 Spring 2014 Nan Wang. 2 Instructor Instructors: –Nan Wang Office: TEC 232 Phone: (601) Meeting time and location:
Created Revised 6/2/2010 Office of Information, Technology and Accountability 1 Gradekeeper.
CMPT 275 Software Engineering
Processes Management.
25 seconds left…...
We will resume in: 25 Minutes.
Introduction Welcome to ECE353.
CS 4700 / CS 5700 Network Fundamentals Lecture 1: Logistics (a.k.a., setting the ground rules)
CS 5600 Computer Systems (Spring 2015) Lecture 1: Logistics (a.k.a. The boring slides)
Secure Operating Systems Lesson 1: Introductions and Expectations.
CS 4700 / CS 5700 Network Fundamentals Lecture 1: Logistics (a.k.a. The boring slides)
CS150 Introduction to Computer Science 1 Professor: Chadd Williams.
Fall 2004 WWW IS112 Prof. Dwyer Intro1: Overview and Syllabus Professor Catherine Dwyer.
CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /
CS 153 Design of Operating Systems Spring 2015 Lecture 1: Course Introduction Instructor: Zhiyun Qian Slides modified from Harsha Madhyvasta and Nael Abu-Ghazaleh.
COMP 14 – 02: Introduction to Programming Andrew Leaver-Fay August 31, 2005 Monday/Wednesday 3-4:15 pm Peabody 217 Friday 3-3:50pm Peabody 217.
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
CS 4700 / CS 5700 Network Fundamentals Lecture 1: Logistics (a.k.a., setting the ground rules)
Welcome to Math 110 Online Section 001, Summer 2015.
CSE 501N Fall ‘09 00: Introduction 27 August 2009 Nick Leidenfrost.
COMP Introduction to Programming Yi Hong May 13, 2015.
Understanding the tools  Online environment  Moodle  Forums and Groups  and files  Chat and Office Hours  Dos and Don'ts.
Computer Networks Lecture 1: Logistics Based on slides from D. Choffnes Northeastern U. and P. Gill from StonyBrook University Revised Autumn 2015 by S.
CS 4700 / CS 5700 Network Fundamentals Lecture 1: Logistics (a.k.a., the most important thing that won’t be on any exam)
CS 3700 Networks and Distributed Systems Logistics (a.k.a. The boring slides) Revised 8/19/15.
Prof. Matthew Hertz WTC 207D /
1 8/29/05CS150 Introduction to Computer Science 1 Professor: Shereen Khoja
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
Course Information Sarah Diesburg Operating Systems COP 4610.
CSE390 Advanced Computer Networks Lecture 1: Logistics (a.k.a., the most important thing that won’t be on any exam) Based on slides from D. Choffnes Northeastern.
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
COP4610/CGS5765 Operating Systems Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: W M F 9:10am – 10:00am, or by appointments.
1 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
Course Overview 1 FCM 710 Architecture of Secure Operating Systems Prof. Shamik Sengupta Office 4210 N
Dr. Jeff Cummings MIS323 Business Telecommunications.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
Data Structures and Algorithms in Java AlaaEddin 2012.
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
Operating Systems CMPSC 473 Introduction and Overview August 24, Lecture 1 Instructor: Bhuvan Urgaonkar.
Dr. Ying Lu ylu at cse.unl.edu Schorr Center Aug 22, CSCE 351 Operating System Kernels.
CS 4700 / CS 5700 Network Fundamentals LECTURE 1: LOGISTICS (A.K.A., SETTING THE GROUND RULES)
CSc 120 Introduction to Computer Programing II
CMSC 621: Advanced Operating Systems Advanced Operating Systems
CS 3700 Networks and Distributed Systems
Christo Wilson Lecture 1: Logistics (a.k.a. The boring slides)
CS 3700 Networks and Distributed Systems
MIS323 Business Telecommunications
Course Information Mark Stanovich Principles of Operating Systems
Computer Science 102 Data Structures CSCI-UA
September 27 – Course introductions; Adts; Stacks and Queues
CS 4700 / CS 5700 Network Fundamentals
CS 3700 Networks and Distributed Systems
Course Overview - Database Systems
CS 3700 Networks and Distributed Systems
CGS 3763 Operating Systems Concepts Spring 2013
Welcome to College English 2!
MIS323 Business Telecommunications
First Semester 1439/1440 Welcome 
CS 3950 Introduction to Computer Science Research
CS 2550 Foundations of Cybersecurity
EECE.4810/EECE.5730 Operating Systems
Professor: Shereen Khoja
Sarah Diesburg Operating Systems CS 3430
CS201 – Course Expectations
Presentation transcript:

Christo Wilson Lecture 1: Logistics (a.k.a. The boring slides) 8/22/2012 CS 5600 Computer Systems Lecture 1: Logistics (a.k.a. The boring slides) Defense

Hello! Welcome to CS 5600 Who am I? Are you in the right classroom? Okay, good. Who am I? Professor Christo Wilson cbw@ccs.neu.edu West Village H 348 Office Hours: Wednesdays, 2-4pm

Anti-Social Media Don’t friend me on Facebook Twitter: @bowlinearl It’s nothing personal Twitter: @bowlinearl LinkedIn: if you pass the class, you can add me

Everyone say Hi to the TA Yiyun Ma yiyunma@ccs.neu.edu Office Hours TBA

Why Take This Course? Computers are everywhere In your pocket In your microwave Up in space We take hardware and OS features for granted Double click and your program loads Devices just work (most of the time…) Buggy apps can’t crash your machine … but very few people truly understand how computers really work, at a low-level

Goals Fundamental understanding about computer hardware and operating systems From the moment a PC boots up … to managing devices and memory… … up to loading complex, threaded applications Focus on software and systems Not hardware No theory Project-centric, hands on experience You will build a bare-bones OS in this class This will be a huge amount of work But you will also learn a huge amount

At the end of this course… You will be able to explain the low-level details of a computer Handling of keyboard interrupt Reading data from disk Displaying output to the screen You will be able to explain the key functions of operating systems Managing I/O devices and memory Loading programs Scheduling the CPU and isolating processes

Online Resources http://www.ccs.neu.edu/home/cbw/systems.html Class forum is on Piazza Sign up today! Install their iPhone/Android app When in doubt, post to Piazza Piazza is preferable to email Use #hashtags (#homework1, #lecture2, #project3, etc.)

Intro, C Programming, Debugging Jan. 13 Kernels, Structures, and APIs Christo Wilson 8/22/2012 Jan. 6 Intro, C Programming, Debugging Jan. 13 Kernels, Structures, and APIs Jan. 20 Holiday! Jan. 27 Processes and Threads Feb. 3 Synchronization and Deadlock Feb. 10 Scheduling Feb. 17 Feb. 24 Midterm Mar. 3 Spring Break! Mar. 10 Address Translation and Virtual Memory Mar. 17 Storage, Disks, and SSDs Mar. 24 Files and Directories Mar. 31 Reliable Storage Apr. 7 Security Apr. 14 Virtualization Apr. ?? Final Defense

Teaching Style 3 hour lectures Breaks every hour. Other suggestions? I have been working with systems for a long time Things make sense to me may not make sense to you I talk fast if nobody stops me Solution: ask questions! Seriously, ask questions Standing up here in silence is very awkward I will stand here until you answer my questions Help me learn your names Say your name before each question

Textbook Operating Systems Concepts Silberschatz, Galvin, and Gagne 9th Edition

Workload Projects (4) 15% each Homeworks (10) 10% total Midterm 10% Final 15% Participation 5%

Projects This course is project-centric 4 projects You will be building an operating system Start early! Seriously, start early! 4 projects Due at 11:59:59pm on specified date Use turn-in scripts to submit your code, documentation, etc. Working code is paramount

Project Groups Projects will be completed in groups of two Unless we have odd numbers… Partner selection Pick whoever you want You may switch partners between projects Do not complain to me about your lazy partner Hey, you picked them Can’t find a partner? Post a message on Piazza!

Late Policy for Projects Each student is given 4 slip days that they can use at any time to extend a deadline You don’t need to ask me, just turn-in stuff late All group members must have unused slip days i.e. if one member has zero slip days left, the whole group is late Assignments are due at 11:59:59, no exceptions 20% off per day late 1 second late = 1 hour late = 1 day late

Homeworks There will be 10 written assignments over the course of the semester Assigned during lecture T, due by the beginning of lecture T+1 Not difficult, meant to prepare you for the tests Homeworks are to be completed individually No homework today :)

Participation This is a masters level course I’m not taking attendance I don’t care if you skip lecture However, 5% of your grade is participation Be active on Piazza Ask questions in lecture Answer questions that I ask in lecture Ideally, I want to know everyone’s name by the end of the semester

Exams Midterm and Final All exams are: 3 hours each The final will be cumulative All exams are: Closed book, closed notes, leave the laptop at home If I see a smartphone, I will take it and sell it on Ebay

Grade Changes Each student is given 2 challenges to use as they see fit Challenges can be spent asking for regrades If you think there has been a grading error, come to my office hours If the grade is incorrect, you keep your challenge If the grade is correct, you lose your challenge When your challenges are exhausted, you cannot ask for regrades

Grade Changes (Continued) Challenges may be used for: Homeworks, projects, tests Challenges may not be used for: Late assignments, use of slip days If you want to challenge a project grade, all group members must have an available challenge Your challenge succeeds or fails as a group

Cheating Do not do it Cheating is an automatic zero Seriously, don’t make me say it again Cheating is an automatic zero Will be referred to the university for discipline and possible expulsion For homeworks: your work must be entirely your own For projects: code must be original, written by you and your groupmates only Starter code obviously doesn’t count StackOverflow/Quora/Github are not your friends If you have questions about an online resource, ask us

Final Grades At the end of the semester, all of your grades will sum to 100 points 15 + 15 + 15 + 15 + 10 + 10 + 15 + 5 = 100 Final grades are based on a simple scale: A >92, A- 90-92, B+ 87-89, B 83-86, B- 80-82, … I don’t curve grades Projects HW Exams Participation

Questions?