Units: 1-4
A seminar course on topics of current interest. Students as well as the instructor will be actively involved in running the course/class. This course cannot be counted toward an elective. (1 - 4 units).
CSE 191's are not eligible for CSE elective credit unless they are offered as 4 units and taken for a letter grade. An approved petition required to use this type of CSE 191 towards CSE major requirements. No guarantee of the outcome of any of these types of petitions requests. Students are strongly encouraged to petition before completing the course to verify if the course will count towards major requirements.
Students can only enroll in CSE 191 up to 3 times or 12 units maximum (whichever comes first).
2018-2019 Courses
Summer 2019
CSE 191 A00: CPT with Mia Minnes
Description: Section restricted to CSE majors completing an internship and requiring CPT
CSE 191 B00: CPT with Justin Eldridge
Description: Section restricted to DSC majors completing an internship and requiring CPT
Spring 2019
CSE 191 A00: When is an algorithm the best possible? with Russell Impagliazzo
Description: Until recently, theory just categorized problems into those that are relatively easy (e.g., polynomial-time solvable) and those that are hard (e.g., NP-complete). Relatively recently, an approach called fine-grained complexity and algorithm design uses the methods of from complexity to give a quantitative measure of the difficulty of problems. The goal is to decide whether the standard algorithms for problems are the best possible, or whether there is room for improvement. This project has two sides: developing new "optimum'' algorithms, and giving reductions that show that improved algorithms are unlikely to exist. While this is a on-going research area, there are many questions that are accessible to undergraduates.
This seminar is intended for students who loved CSE 105 and CSE 101 and want to go further towards understanding current research. Some students might want to go on to do a related research project next year. We will start with a survey paper on fine grained complexity and algorithms, and then explore some of the cited papers. We will meet once per week for presentations and discussion Mondays 12:30pm - 1:50pm. Participants are expected to make a fair attempt to read the papers, attend every group meeting, discuss papers in the meeting, and occasionally present (with the number of presentations equal to the credits you sign up for). Time commitment: 2 hours per week every week + 5 additional hours per quarter for each credit signed up for. Credit: 1-4 units P/NP.
Prerequisites: CSE 105 and CSE 101, or permission of the instructor
To enroll: Submit Enrollment Authorization System (EASy) request
CSE 191 B00: Software Engineering for IoT applications with Ian Lerner
Description: Enroll in the course for 2-units and P/NP. This is a hands-on project-oriented course covering fundamental technical and entrepreneurial disciplines. Coursework will include project scoping, system architecture, choosing development tools, testing, and product deployment. The project will include real-time data collection from fielded hardware, data analytics, and user interface strategies. Uses C, JAVA/Python/PHP, SQL, HTML-AJAX, RTOS, and Linux.
Prerequisites: CSE 100, CSE 110
To enroll: Submit Enrollment Authorization System (EASy) request
Course website: http://cse191iot.ucsd.edu/
CSE 191 C00: Computer Operations and Production Engineering with Taner Halicioglu
Enroll in the course for 1-unit and P/NP. This 1-unit seminar will explore topics pertaining to System Administration/Operations and Network Engineering, as well as focus on aspects of troubleshooting and (black-box) debugging. It will also cover some "best practices" when it comes to architecting software and systems as they relate to robustness, scaling, and erase of debugging or troubleshooting. D. Taner (a UCSD B.S. CSE graduate in 1996) will draw from his experiences over the last 18+ years, working in operations-related roles.
Prerequisites: CSE 30 and some CSE upper-division experience even if concurrent.
To enroll: Submit Enrollment Authorization System (EASy) request
Winter 2019
CSE 191 B00: Entrepreneurship and Tech Transfer: From Research to Product with Professor Zhou: We will discuss the gap between research and product, and challenges and steps in commercializing your research.
To enroll: Submit Enrollment Authorization System (EASy) request
CSE 191 C00: Projects in Cryptography with Professor Bellare: This course provides students an opportunity to undertake projects and research, both theoretical and applied, in cryptography and security. Students sometimes have their own project ideas, but the instructor suggests projects as well. Examples of prior projects are the development of an encryption plug-in for Facebook, analysis of the security of the WhatsApp messenger, automatic breaking of substitution ciphers, image encryption and fast cryptography implementations. Students may work individually or in a group of size at most two. There are no lectures. Students/teams meet individually with the instructor once a week. Prerequisites: CSE 107 (A- or better) and permission of instructor. If you have met the prereq, please complete Course Pre-Auth form.
Fall 2018
CSE 191 A00: Computer Operations and Production Engineering with Professor Halicioglu:
Enroll in course for 1-unit and P/NP. This 1-unit seminar ("Computer Operations and Production Engineering") will explore topics pertaining to System Administration/Operations and Network Engineering, as well as focus on aspects of troubleshooting and (black-box) debugging. It will also cover some "best practices" when it comes to architecting software and systems as they relate to robustness, scaling, and erase of debugging or troubleshooting. D. Taner (a UCSD B.S. CSE graduate in 1996) will draw from his experiences over the last 18+ years, working in operations-related roles. Prerequisites: CSE 30 and some CSE upper-division experience even if concurrent. Please submit a Course Pre-Auth form.