CS Systems Qualifying Exam 2014

Similar documents
CS Systems Qualifying Exam 2016

CS Systems Qualifying Exam 2015

CS Systems Qualifying Exam 2017

Welcome to CS 4/57101 Computer Graphics

CS 525 Advanced Database Organization - Spring 2017 Mon + Wed 1:50-3:05 PM, Room: Stuart Building 111

CS 471 Networking and Distributed Operating Systems

Computer Networks IT321

Database Management Systems CS Spring 2017

KOMAR UNIVERSITY OF SCIENCE AND TECHNOLOGY (KUST)

San José State University Science/Computer Science Database Management System I

Database Management System Implementation. Who am I? Who is the teaching assistant? TR, 10:00am-11:20am NTRP B 140 Instructor: Dr.

CS 245: Database System Principles

understanding recursive data types, recursive functions to compute over them, and structural induction to prove things about them

ce Hours: MW 12:30 PM 1:30 PM (till 12/12/18), or by appointment

CA Compiler Construction

Advanced Database Organization INF613

Compiler Construction

CSCE 441 Computer Graphics Fall 2018

COMPUTER ARCHTECTURE

Polytechnic University of Puerto Rico Department of Electrical & Computer Engineering and Computer Science (ECECS) Master in Electrical Engineering

Can you name one application that does not need any data? Can you name one application that does not need organized data?

CNT 4004: Computer Networks I. Tentative Syllabus

Introduction to Databases

CSC 111 Introduction to Computer Science (Section C)

Module title T390 Computer Networks and Network Security Level 3 Module tutor Credit value 10 Module type taught Notional learning hours

CSci 4211: Data Communications and Computer Networks. Time: Monday and Wednesday 1 pm to 2:15 pm Location: Vincent Hall 16 Spring 2016, 3 Credits

Read & Download (PDF Kindle) Modern Compiler Implementation In ML

Introduction to Database S ystems Systems CSE 444 Lecture 1 Introduction CSE Summer

ABD - Database Administration

Course and Contact Information. Course Description. Course Objectives

Lecture 0 of 41: Part A Course Organization. Introduction to Computer Graphics: Course Organization and Survey

EE6364 Advanced Data Networks

AE Computer Programming for Aerospace Engineers

Department of Accounting & Law, School of Business. State University of New York at Albany. Acc 682 Analysis & Design of Accounting Databases

CSCI 565 Compiler Design and Implementation Spring 2014

B. Subject-specific skills B1. Problem solving skills: Supply the student with the ability to solve different problems related to the topics

New Undergraduate Course Proposal Form

Course and Contact Information. Course Description. Course Objectives

Compilers for Modern Architectures Course Syllabus, Spring 2015

CPS352 - DATABASE SYSTEMS. Professor: Russell C. Bjork Spring semester, Office: KOSC 242 x4377

CS5620 Intro to Computer Graphics

SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN

EE3315 Internet Technology EE3315 Internet Technology Overview Slide 1

CMPT 354: Database System I. Lecture 1. Course Introduction

Erik Jonsson School of Engineering and Computer Science THE UNIVERSITY OF TEXAS AT DALLAS HISTORY OF EE 2310

BCS Higher Education Qualifications. Level 6 Programming Paradigms Syllabus

Informatics 1: Data & Analysis

Advanced Graphics

Part A: Course Outline

Introduction to Database S ystems Systems CSE 444 Lecture 1 Introduction CSE Summer

CPSC 5157G Computer Networks

Course Name: Computer Vision Course Code: IT444

Course Syllabus. Course Information

CS415 Compilers Overview of the Course. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University

Introduction to Database Systems

PROPOSAL TO INTRODUCE A NEW COURSE

CS Compiler Construction West Virginia fall semester 2014 August 18, 2014 syllabus 1.0

CS380: Computer Graphics Introduction. Sung-Eui Yoon ( 윤성의 ) Course URL:

CSE 504: Compiler Design

CSci 4211: Introduction to Computer Networks. Time: Monday and Wednesday 2:30 to 3:45 pm Location: Smith Hall 231 Fall 2018, 3 Credits

ECE 4450:427/527 - Computer Networks

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, Pilani Pilani Campus Instruction Division

Instructor: Anna Miller

San José State University Computer Science Department CS157A: Introduction to Database Management Systems Sections 5 and 6, Fall 2015

ECE573 Introduction to Compilers & Translators

COMP-421: Database Systems. Joseph D silva McConnel Engg. 102

CSE4305: Compilers for Algorithmic Languages CSE5317: Design and Construction of Compilers

LP - Programming Languages

CS/SE 153 Concepts of Compiler Design

COURSE DELIVERY PLAN - THEORY Page 1 of 6

BOSTON UNIVERSITY Metropolitan College MET CS342 Data Structures with Java Dr. V.Shtern (Fall 2011) Course Syllabus

Computer Networking Background

CS/SE 153 Concepts of Compiler Design

Introduction to Databases

CS 241 Data Organization using C

Academic Course Description. EM2101 Computer Architecture

COMP 3002: Compiler Construction. Pat Morin School of Computer Science

San Jose State University College of Science Department of Computer Science CS151, Object-Oriented Design, Sections 1,2 and 3, Spring 2017

Avi Silberschatz, Henry F. Korth, S. Sudarshan, Database System Concept, McGraw- Hill, ISBN , 6th edition.

BD - Databases

CS157a Fall 2018 Sec3 Home Page/Syllabus

LLparse and LRparse: Visual and Interactive Tools for Parsing

CMPE 152 Compiler Design

CMPS 182: Introduction to Database Management Systems. Instructor: David Martin TA: Avi Kaushik. Syllabus

CSE 141: Computer Architecture. Professor: Michael Taylor. UCSD Department of Computer Science & Engineering

Lecture 1 Course Introduction

Software Reliability and Reusability CS614

6.088/6.084 Robotics Project Subject Information and Syllabus

Welcome. Orientation to online CPS102 Computer Science 2 (Java 2)

Philadelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008. Course Syllabus

Textbook(s) and other required material: Raghu Ramakrishnan & Johannes Gehrke, Database Management Systems, Third edition, McGraw Hill, 2003.

CSE 167: Introduction to Computer Graphics. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016

Course: Database Management Systems. Lê Thị Bảo Thu

Rochester Institute of Technology Golisano College of Computing and Information Sciences Department of Information Sciences and Technologies

San José State University College of Science/Department of Computer Science CS152, Programming Paradigms, Sections 3 & 4, Fall Semester, 2016

Syllabus CS 430 Introduction to Computer Security Winter 2016

Faculty of Sciences and Information Technology

Compiler Design. Dr. Chengwei Lei CEECS California State University, Bakersfield

ICE3003: Computer Architecture. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

CSCI 201L Syllabus Principles of Software Development Spring 2018

Transcription:

CS Systems Qualifying Exam 2014 Important Dates April 27: Registration ends. Registration instructions are below. When you register, you must declare the three exams you plan to take. May 19: Exams. Candidates will take exams during the week starting Monday May 20. For oral exams, students are responsible for scheduling an exam with the examiner. We will schedule the written exams. May 27 Grading Complete. Faculty members to email grades for all exams to Philip Levis. May 29: Decision. Faculty meet to decide on grades. All Systems Faculty are invited. Time TBD. May 30: Announce. Decisions emailed to students and advisers. You should only take this exam if your adviser is a "Systems Faculty" member. Students without a Systems Faculty adviser may request to take the exam, but you need the permission of your adviser and Professor Philip Levis. Exams Architecture Kunle Olukotun Compilers Alex Aiken Databases Hector Garcia Molina Graphics Marc Levoy Programming Languages John Mitchell Human Computer Interaction Michael Bernstein Networking Sachin Katti Operating Systems David Mazières Security Dan Boneh Registration Send an email to Alexis Wing <alexisw@cs.stanford.edu> indicating which of the three exams you wish to take.

Architecture Qualifying Exam Examiner: Professor Kunle Olukotun This qual will cover any ideas, topics and reading covered in the following courses: EE282: Computer Systems Architecture EE382A: Advanced Processor Architecture CS315A: Parallel Computer Architecture and Programming You will be expected to be very conversant with the key ideas in computer architecture: Levels of abstraction (e.g. ISA processor RTL blocks gates), pipelining, caching, prediction, virtualization and parallelism. As someone taking the architecture qual, you will be expected to have a fairly sophisticated knowledge of these topics. Reading List Computer Architecture: A Quantitative Approach, 3rd Edition, Hennessy & Patterson. 15 20 minute oral exam Arrange with Darlene Hadding (darlene@csl.stanford.edu)

Compilers Qualifying Exam Examiner: Professor Alex Aiken Reading List Compilers: Principles, Techniques, & Tools (Second Edition), Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Addison Wesley, 2007. Chapters: 2.1. 2.5, 4 10, 12 Modern Compiler Implementation in Java, Andrew Appel with Jens Parlsberg Chapters on Advanced Topics: 13 21 Example Questions Depending on the number of students who sign up, there will either be a 20 minute oral or 1 hour written exam Email Alex (aiken@cs.stanford.edu) if you need more information.

Database Qualifying Exam SYLLABUS FOR THE DATABASE PORTION OF THE PH.D. QUALIFYING EXAMINATION IN SYSTEMS The Database portion of the Systems Qual is a one hour written exam. It is OPEN BOOK. TOPICS Data models and query languages. Database design, building database applications. File structures, indexing, and hashing methods. Query processing and optimization. Transactions, concurrency control and recovery, security and authorization, database performance. Material as covered in CS145 and CS245. READING LIST H. Garcia Molina, J.D. Ullman, and J. Widom Database Systems: The Complete Book (Second Edition) Prentice Hall, 2009 All chapters Previous Quals

Graphics Qualifying Exam Examiner: Marc Levoy Knowledge of basic representations of surfaces and solids, scan conversion algorithms, geometric transformations, viewing projections, visible surface determination, and shading models, as covered in CS 148 and 248. Understanding of basic issues in input and display hardware, graphics software, and user interface design. Some knowledge in depth of either curve, surface, and solid modeling and geometric algorithms at the level of CS 348A, or of sampling, filtering, and local and global illumination methods at the level of CS 348B. Reading List Typical references for the material in 248, 348A, and 348B, are the online course notes, where available For 148: P. Shirley,, Fundamentals of Computer Graphics, 2nd Edition, A. K. Peters, 2006 For 248: E. Angel, Interactive Computer Graphics (5th ed.) For 348A: G. Farin, Curves and Surfaces for Computer Aided Geometric Design Academic Press, (2nd edition) For 348B: M. Pharr and G. Humphreys, Physically Based Rendering. Morgan Kaufman 30 minute oral exam. Email Marc directly (levoy@cs.stanford.edu).

Programming Language Qualifying Exam Examiner: Professor John Mitchell Knowledge of the principles and central concepts in programming language, as covered in CS 242. Students taking the Systems Qual in programming languages are expected to have a professional level conversational competency in the main design and implementation topics associated with programming languages, applied to languages and situations you know and those you may not.. Some sophistication beyond the preparation provided by CS242, typically gained by practical experience and preparation for software systems research, is expected. Reading List J.C. Mitchell, Concepts in Programming Languages, Cambridge Univ Press, 2002. 20 30 min oral exam.

Human Computer Interaction Qualifying Exam Examiner: Michael Bernstein The qualifying exam will be a half hour oral with Professor Bernstein. The exam will expect: 1) a deep understanding of the human computer interaction design process, technology, and experimental design and analysis covered in CS 147 and CS 247, and 2) fluency with readings from CS376: Research Topics in Human Computer Interaction. Don't focus on memorizing paper details, but on understanding the concepts behind the papers and being able to apply them in discussing HCI examples and issues. 30 minute oral exam

Networking Qualifying Exam Examiner: Professor Sachin Katti This is the official web page for the 2013 Networking Qual (part of the CS Systems Quals). It is the only official web page describing the exam. Below are some tips on how to prepare, and a couple of example questions (taken from the CS244 Final in 2009). Before you start preparing for the Networking Qualifying Exam, make sure you are broadly familiar with the concepts taught in CS144, and the textbook: Kurose and Ross, Computer Networks: A Top down Approach. Prentice Hall, 5th edition. You won't be tested on the specifics in the textbook; so if you have taken an equivalent class at your undergraduate school with a similar textbook (e.g. Peterson and Davie) you should have the sufficient foundation to start preparing for the exam. The Networking Qualifying Exam has the same reading list as CS244 a discussion based graduate networking class offered once per year. In the Qual exam we'll be looking for signs that: (1) You understand the key concepts and principles in the papers, (2) You are able to critically review the key ideas, and (3) You are able draw meaningful conclusions from the work; for example, that you can suggest improvements and areas for further study. The exam won't be testing your ability to regurgitate details, header formats and other minutiae. You can find the Quals/CS244 reading list on or after April 2nd here: http://www.stanford.edu/class/cs244/2013/ (Note you are NOT required to read the papers marked optional in the reading list) Example Questions 1. Internet mobility Mobile IP allows users to move from one part of the network to another, while keeping the same IP address. Describe how Mobile IP works. Describe some of the shortcomings of Mobile IP, and suggest some ways to mitigate the problems. 2. If you can't beat them, join them. 3. It has been proposed that internet service providers (ISPs) could reduce costs by installing P2P? "supernodes" in their networks. These nodes would download and mirror the most popular files of P2P? networks. P2P? users of the ISPs would primarily download content from these nodes inside the ISP's network. The result for the ISP would be that most of the traffic that is generated by downloading this content would stay inside the ISP's network, and the ISP would not have to pay transfer cost to carriers or

other ISPs. 4. Assume these ISP operated P2P? nodes become widespread. How would you modify BitTorrent? to take maximum advantage of this development? 5. Is it a good idea? The exam is a 30 minute oral exam. Email Professor Katti (skatti@cs.stanford.edu) and cc his admin Crystle Palafox (palafox@stanford.edu) to schedule a time for the exam.

Operating Systems Qualifying Exam Examiner: David Mazières Reading List Contact David Mazières for details Contact David Mazières for details

Security Qualifying Exam http://seclab.stanford.edu/securityqual.html